Jian Song

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Some results on optimal stopping problems for one-dimensional regular diffusions	2017-07-09	Paper
Degeneration of Kahler-Einstein manifolds of negative scalar curvature	2017-06-05	Paper
A survey on the computational complexity of coloring graphs with forbidden subgraphs Journal of Graph Theory	2017-04-21	Paper
A survey on the computational complexity of coloring graphs with forbidden subgraphs Journal of Graph Theory	2017-04-21	Paper
Extensions of the I-MMSE Relation	2015-06-23	Paper
Riemannian geometry of Kahler-Einstein currents II: an analytic proof of Kawamata's base point free theorem	2014-09-29	Paper
Closing complexity gaps for coloring problems on \(H\)-free graphs Information and Computation	2014-07-18	Paper
Riemannian geometry of Kahler-Einstein currents	2014-04-01	Paper
Coloring graphs without short cycles and long induced paths Discrete Applied Mathematics	2014-03-27	Paper
Ricci flow and birational surgery	2013-04-09	Paper
Closing complexity gaps for coloring problems on \(H\)-free graphs Algorithms and Computation	2013-03-21	Paper
4-coloring \(H\)-free graphs when \(H\) is small Discrete Applied Mathematics	2012-11-22	Paper
Computing vertex-surjective homomorphisms to partially reflexive trees Theoretical Computer Science	2012-10-11	Paper
4-coloring \(H\)-free graphs when \(H\) is small SOFSEM 2012: Theory and Practice of Computer Science	2012-06-15	Paper
Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time Theoretical Computer Science	2012-05-14	Paper
Updating the complexity status of coloring graphs without a fixed induced linear forest Theoretical Computer Science	2012-03-13	Paper
Coloring graphs without short cycles and long induced paths Fundamentals of Computation Theory	2011-08-19	Paper
Computing vertex-surjective homomorphisms to partially reflexive trees Computer Science – Theory and Applications	2011-06-17	Paper
On coloring graphs without induced forests Algorithms and Computation	2010-12-09	Paper
Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs Graph Theoretic Concepts in Computer Science	2010-11-16	Paper

Research outcomes over time

This page was built for person: Jian Song