We stand with Ukraine  

Jian Song

Affiliations:
  • Durham University, School of Engineering and Computing Sciences, UK


According to our database1, Jian Song authored at least 10 papers between 2010 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs.
[BibTeX]
[DOI]
Petr A. Golovach
,
Matthew Johnson
,
Daniël Paulusma
,
Jian Song
J. Graph Theory, 2017

2014
A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs.
[BibTeX]
[DOI]
Petr A. Golovach
,
Matthew Johnson
,
Daniël Paulusma
,
Jian Song
CoRR, 2014

2012
Determining the chromatic number of triangle-free 2P<sub>3</sub>-free graphs in polynomial time.
[BibTeX]
[DOI]
Hajo Broersma
,
Petr A. Golovach
,
Daniël Paulusma
,
Jian Song
Theor. Comput. Sci., 2012

Updating the complexity status of coloring graphs without a fixed induced linear forest.
[BibTeX]
[DOI]
Hajo Broersma
,
Petr A. Golovach
,
Daniël Paulusma
,
Jian Song
Theor. Comput. Sci., 2012

4-Coloring H-Free Graphs When H Is Small.
[BibTeX]
[DOI]
Petr A. Golovach
,
Daniël Paulusma
,
Jian Song
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Closing Complexity Gaps for Coloring Problems on H-Free Graphs.
[BibTeX]
[DOI]
Petr A. Golovach
,
Daniël Paulusma
,
Jian Song
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011
Coloring Graphs without Short Cycles and Long Induced Paths.
[BibTeX]
[DOI]
Petr A. Golovach
,
Daniël Paulusma
,
Jian Song
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees.
[BibTeX]
[DOI]
Petr A. Golovach
,
Daniël Paulusma
,
Jian Song
Proceedings of the Computer Science - Theory and Applications, 2011

2010
Narrowing Down the Gap on the Complexity of Coloring <i>P</i><sub><i>k</i></sub>-Free Graphs.
[BibTeX]
[DOI]
Hajo Broersma
,
Petr A. Golovach
,
Daniël Paulusma
,
Jian Song
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

On Coloring Graphs without Induced Forests.
[BibTeX]
[DOI]
Hajo Broersma
,
Petr A. Golovach
,
Daniël Paulusma
,
Jian Song
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010


  Loading...