ENS Links
McGill Links
Research
Olds
|
|
List of publications
|
[1]
|
Zhentao Li and Bojan Mohar.
Planar digraphs of digirth four are 2-colourable.
arXiv preprint arXiv:1606.06114, 2016.
[ http ]
|
|
[2]
|
Vincent Cohen-Addad, Michael Hebdige, Daniel Kral, Zhentao Li, and Esteban
Salgado.
Steinberg's conjecture is false.
Journal of Combinatorial Theory, Series B, page to appear,
2016.
[ http ]
|
|
[3]
|
Jérémie Chalopin, Louis Esperet, Zhentao Li, and Patrice Ossona
de Mendez.
Restricted frame graphs and a conjecture of Scott.
Electronic Journal of Combinatorics, 23(1):1-30, 2016.
[ http ]
|
|
[4]
|
Nicolas Bousquet, Aurélie Lagoutte, Zhentao Li, Aline Parreau, and
Stéphan Thomassé.
Identifying codes in hereditary classes of graphs and VC-dimension.
Siam Journal on Discrete Mathematics, 29(4):2047-2064, 2015.
[ http ]
|
|
[5]
|
Nicolas Bousquet, Zhentao Li, and Adrian Vetta.
Coalition games on interaction graphs: a horticultural perspective.
In Proceedings of the Sixteenth ACM Conference on Economics and
Computation, pages 95-112, 2015.
[ http ]
|
|
[6]
|
Pierre Aboulker, Zhentao Li, and Stéphan Thomassé.
Excluding clocks.
In LAGOS'15: VIII Latin-American Algorithms, Graphs and
Optimization Symposium, 2015.
[ http ]
|
|
[7]
|
Celina Figueiredo, Zhentao Li, Helio Macedo Filho, Raphael Machado, and Nicolas
Trotignon.
Using SPQR-trees to speed up algorithms based on 2-cutset
decompositions.
In LAGOS'15: VIII Latin-American Algorithms, Graphs and
Optimization Symposium, 2015.
[ http ]
|
|
[8]
|
Huining Hu, Zhentao Li, and Adrian R Vetta.
Randomized experimental design for causal graph discovery.
In Advances in Neural Information Processing Systems, pages
2339-2347, 2014.
[ http ]
|
|
[9]
|
Vincent Cohen-Addad, Zhentao Li, Claire Mathieu, and Ioannis Milis.
Energy-efficient algorithms for non-preemptive speed-scaling.
In International Workshop on Approximation and Online
Algorithms, pages 107-118. Springer, 2014.
[ http ]
|
|
[10]
|
Nicolas Delfosse, Zhentao Li, and Stéphan Thomassé.
A note on the minimum distance of quantum LDPC codes.
In International Symposium on Mathematical Foundations of
Computer Science, pages 239-250. Springer, 2014.
[ http ]
|
|
[11]
|
Zhentao Li, Manikandan Narayanan, and Adrian Vetta.
The complexity of the simultaneous cluster problem.
J. Graph Algorithms Appl., 18(1):1-34, 2014.
[ .pdf ]
|
|
[12]
|
Mourad Baïou, Laurent Beaudou, Zhentao Li, and Vincent Limouzy.
Hardness and algorithms for variants of line graphs of directed
graphs.
In International Symposium on Algorithms and Computation, pages
196-206. Springer, 2013.
[ http ]
|
|
[13]
|
András Gyárfás, Zhentao Li, Raphael Machado, András Sebő,
Stéphan Thomassé, and Nicolas Trotignon.
Complements of nearly perfect graphs.
Journal of Combinatorics, 4(3), 2013.
[ http ]
|
|
[14]
|
Peter Keevash, Zhentao Li, Bojan Mohar, and Bruce Reed.
Digraph girth via chromatic number.
SIAM Journal on Discrete Mathematics, 27(2):693-696, 2013.
|
|
[15]
|
Ken-ichi Kawarabayashi, Zhentao Li, and Bruce Reed.
Recognizing a totally odd k4-subdivision, parity 2-disjoint rooted
paths and a parity cycle through specified elements.
In Proceedings of the twenty-first annual ACM-SIAM symposium on
Discrete Algorithms, pages 318-328. Society for Industrial and Applied
Mathematics, 2010.
[ http ]
|
|
[16]
|
Zhentao Li and Adrian Vetta.
Bounds on the cleaning times of robot vacuums.
Operations Research Letters, 38(1):69-71, 2010.
[ http ]
|
|
[17]
|
Xavier Muñoz, Zhentao Li, and Ignasi Sau.
Edge-partitioning regular graphs for ring traffic grooming with a
priori placement of the adms.
SIAM Journal on Discrete Mathematics, 25(4):1490-1505, 2011.
[ http ]
|
|
[18]
|
Zhentao Li and Ignasi Sau.
Graph partitioning and traffic grooming with bounded degree request
graph.
In International Workshop on Graph-Theoretic Concepts in
Computer Science, pages 250-261. Springer, 2009.
[ http ]
|
|
[19]
|
Bruce Reed and Zhentao Li.
Optimization and recognition for k 5-minor free graphs in linear
time.
In Latin American Symposium on Theoretical Informatics, pages
206-215. Springer, 2008.
[ http ]
|
|
[20]
|
Louigi Addario-Berry, W Sean Kennedy, Andrew D King, Zhentao Li, and Bruce
Reed.
Finding a maximum-weight induced k-partite subgraph of an
i-triangulated graph.
Discrete Applied Mathematics, 158(7):765-770, 2010.
[ http ]
|
|
[21]
|
Leonid Chindelevitch, Zhentao Li, Eric Blais, and Mathieu Blanchette.
On the inference of parsimonious indel evolutionary scenarios.
Journal of bioinformatics and computational biology,
4(03):721-744, 2006.
[ http ]
|
|
[22]
|
Zhentao Li and Bruce A Reed.
Heap building bounds.
In Workshop on Algorithms and Data Structures, pages 14-23.
Springer, 2005.
[ http ]
|
|
|