default search action
Jian Song 0005
Person information
- affiliation: Durham University, School of Engineering and Computing Sciences, UK
Other persons with the same name
- Jian Song — disambiguation page
- Jian Song 0001 — University of Paris-Saclay, France
- Jian Song 0002
— People's Liberation Army, Force 61660, Beijing, China (and 1 more)
- Jian Song 0003
- Jian Song 0004
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j7]Petr A. Golovach
A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs. J. Graph Theory 84(4): 331-363 (2017) - 2014
- [j6]Petr A. Golovach
Coloring graphs without short cycles and long induced paths. Discret. Appl. Math. 167: 107-120 (2014) - [j5]Petr A. Golovach
Closing complexity gaps for coloring problems on H-free graphs. Inf. Comput. 237: 204-214 (2014) - [i1]Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song:
A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs. CoRR abs/1407.1482 (2014) - 2013
- [j4]Petr A. Golovach
4-coloring H-free graphs when H is small. Discret. Appl. Math. 161(1-2): 140-150 (2013) - 2012
- [j3]Hajo Broersma
Updating the complexity status of coloring graphs without a fixed induced linear forest. Theor. Comput. Sci. 414(1): 9-19 (2012) - [j2]Hajo Broersma
Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time. Theor. Comput. Sci. 423: 1-10 (2012) - [j1]Petr A. Golovach
Computing vertex-surjective homomorphisms to partially reflexive trees. Theor. Comput. Sci. 457: 86-100 (2012) - [c6]Petr A. Golovach, Daniël Paulusma
Closing Complexity Gaps for Coloring Problems on H-Free Graphs. ISAAC 2012: 14-23 - [c5]Petr A. Golovach
4-Coloring H-Free Graphs When H Is Small. SOFSEM 2012: 289-300 - 2011
- [c4]Petr A. Golovach
Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees. CSR 2011: 261-274 - [c3]Petr A. Golovach
Coloring Graphs without Short Cycles and Long Induced Paths. FCT 2011: 193-204 - 2010
- [c2]Hajo Broersma
On Coloring Graphs without Induced Forests. ISAAC (2) 2010: 156-167 - [c1]Hajo Broersma
Narrowing Down the Gap on the Complexity of Coloring Pk-Free Graphs. WG 2010: 63-74
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-15 20:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: