Jian Song

14 papers B 4Misc 1Journal 8Unranked 1
YearRankTypeTitle / Venue / Authors
2017 J jnl
A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs.
J. Graph Theory
Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song
2014 J jnl
A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs.
CoRR
Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song
2014 J jnl
Closing complexity gaps for coloring problems on H-free graphs.
Inf. Comput.
Petr A. Golovach, Daniël Paulusma, Jian Song
2014 J jnl
Coloring graphs without short cycles and long induced paths.
Discret. Appl. Math.
Petr A. Golovach, Daniël Paulusma, Jian Song
2013 J jnl
4-coloring H-free graphs when H is small.
Discret. Appl. Math.
Petr A. Golovach, Daniël Paulusma, Jian Song
2012 B conf
4-Coloring H-Free Graphs When H Is Small.
SOFSEM
Petr A. Golovach, Daniël Paulusma, Jian Song
2012 B conf
Closing Complexity Gaps for Coloring Problems on H-Free Graphs.
ISAAC
Petr A. Golovach, Daniël Paulusma, Jian Song
2012 J jnl
Computing vertex-surjective homomorphisms to partially reflexive trees.
Theor. Comput. Sci.
Petr A. Golovach, Daniël Paulusma, Jian Song
2012 J jnl
Determining the chromatic number of triangle-free 2P
Theor. Comput. Sci.
Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
2012 J jnl
Updating the complexity status of coloring graphs without a fixed induced linear forest.
Theor. Comput. Sci.
Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
2011 B conf
Coloring Graphs without Short Cycles and Long Induced Paths.
FCT
Petr A. Golovach, Daniël Paulusma, Jian Song
2011 Misc conf
Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees.
CSR
Petr A. Golovach, Daniël Paulusma, Jian Song
2010 B conf
Narrowing Down the Gap on the Complexity of Coloring
WG
Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
2010 — conf
On Coloring Graphs without Induced Forests.
ISAAC (2)
Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song