Leizhen Cai - RankMe

54 papers B 5C 4Journal 39Unranked 5

Year	Rank	Type	Title / Venue / Authors
2019	C	`conf`	Complexity of Vertex Switching on Edge-Bicolored Graphs. CIAC Ho Lam Pang, Leizhen Cai
2019	J	`jnl`	Two edge-disjoint paths with length constraints. Theor. Comput. Sci. Leizhen Cai, Junjie Ye
2018	J	`jnl`	Alternating Path and Coloured Clustering. CoRR Leizhen Cai, On Yin Leung
2018	J	`jnl`	Vertex Covers Revisited: Indirect Certificates and FPT Algorithms. CoRR Leizhen Cai
2016	B	`conf`	Finding Two Edge-Disjoint Paths with Length Constraints. WG Leizhen Cai, Junjie Ye
2015	J	`jnl`	Finding Two Edge-Disjoint Paths with Length Constraints. CoRR Leizhen Cai, Junjie Ye
2015	J	`jnl`	Guest Editors Foreword. Algorithmica Leizhen Cai, Siu-Wing Cheng, Tak Wah Lam
2015	J	`jnl`	Incompressibility of H-Free Edge Modification Problems. Algorithmica Leizhen Cai, Yufei Cai
2015	J	`jnl`	Obtaining split graphs by edge contraction. Theor. Comput. Sci. Chengwei Guo, Leizhen Cai
2015	J	`jnl`	Parameterized complexity of finding connected induced subgraphs. Theor. Comput. Sci. Leizhen Cai, Junjie Ye
2014	—	`conf`	Dual Connectedness of Edge-Bicolored Graphs and Beyond. MFCS (2) Leizhen Cai, Junjie Ye
2014	C	`conf`	Obtaining Split Graphs by Edge Contraction. AAIM Chengwei Guo, Leizhen Cai
2014	C	`conf`	Parameterized Complexity of Connected Induced Subgraph Problems. AAIM Leizhen Cai, Junjie Ye
2013	B	`ed.`	Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings ISAAC Leizhen Cai, Siu-Wing Cheng, Tak Wah Lam
2013	B	`conf`	Contracting Few Edges to Remove Forbidden Induced Subgraphs. IPEC Leizhen Cai, Chengwei Guo
2013	J	`jnl`	Contracting Graphs to Split Graphs and Threshold Graphs. CoRR Leizhen Cai, Chengwei Guo
2013	B	`conf`	Incompressibility of H-Free Edge Modification. IPEC Leizhen Cai, Yufei Cai
2011	J	`jnl`	Parameterized complexity of even/odd subgraph problems. J. Discrete Algorithms Leizhen Cai, Boting Yang
2011	J	`jnl`	Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum Algorithmica Mingyu Xiao, Leizhen Cai, Andrew Chi-Chih Yao
2010	J	`jnl`	Choosability of toroidal graphs without short cycles. J. Graph Theory Leizhen Cai, Weifan Wang, Xuding Zhu
2010	C	`conf`	Parameterized Complexity of Even/Odd Subgraph Problems. CIAC Leizhen Cai, Boting Yang
2010	J	`jnl`	Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem. SIAM J. Discret. Math. Leizhen Cai, Yongxi Cheng, Elad Verbin, Yuan Zhou
2009	J	`jnl`	The Surviving Rate of a Graph for the Firefighter Problem. SIAM J. Discret. Math. Leizhen Cai, Weifan Wang
2008	B	`conf`	Firefighting on Trees: (1-1/e)-Approximation, Fixed Parameter Tractability and a Subexponential Algorithm. ISAAC Leizhen Cai, Elad Verbin, Lin Yang
2008	J	`jnl`	Labelling planar graphs without 4-cycles with a condition on distance two. Discret. Appl. Math. Weifan Wang, Leizhen Cai
2008	J	`jnl`	Parameterized Complexity of Cardinality Constrained Optimization Problems. Comput. J. Leizhen Cai
2008	J	`jnl`	Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem CoRR Mingyu Xiao, Leizhen Cai, Andrew C. Yao
2006	—	`conf`	Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems. IWPEC Leizhen Cai, Siu Man Chan, Siu On Chan
2003	J	`jnl`	Parameterized Complexity of Vertex Colouring. Discret. Appl. Math. Leizhen Cai
2003	J	`jnl`	The complexity of the locally connected spanning tree problem. Discret. Appl. Math. Leizhen Cai
2001	J	`jnl`	Game chromatic index of J. Graph Theory Leizhen Cai, Xuding Zhu
2001	J	`jnl`	Stable 2-pairs and ( Discret. Math. Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski
1999	J	`jnl`	Computing the Optimal Bridge Between Two Convex Polygons. Inf. Process. Lett. Leizhen Cai, Yin-Feng Xu, Binhai Zhu
1997	J	`jnl`	A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph. Discret. Appl. Math. Leizhen Cai, Baruch Schieber
1997	J	`jnl`	Computing Visibility Information in an Inaccurate Simple Polygon. Int. J. Comput. Geom. Appl. Leizhen Cai, J. Mark Keil
1997	J	`jnl`	On Spanning 2-trees in a Graph. Discret. Appl. Math. Leizhen Cai
1996	J	`jnl`	A generalization of line graphs: ( J. Graph Theory Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski
1996	J	`jnl`	A generalization of perfect graphs - J. Graph Theory Leizhen Cai, Derek G. Corneil
1996	—	`conf`	Algorithms on Polygonal Embeddings of Graphs. CCCG Leizhen Cai
1996	J	`jnl`	Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties. Inf. Process. Lett. Leizhen Cai
1995	J	`jnl`	Isomorphic Tree Spanner Problems. Algorithmica Leizhen Cai, Derek G. Corneil
1995	J	`jnl`	Path decompositions of multigraphs. J. Graph Theory Leizhen Cai
1995	—	`conf`	Spanning 2-Trees. ASIAN Leizhen Cai
1995	J	`jnl`	Tree Spanners. SIAM J. Discret. Math. Leizhen Cai, Derek G. Corneil
1995	—	`conf`	Visibility graphs of polygonal rings. CCCG Leizhen Cai, Hazel Everett
1994	J	`jnl`	NP-Completeness of Minimum Spanner Problems. Discret. Appl. Math. Leizhen Cai
1994	J	`jnl`	Spanners in graphs of bounded degree. Networks Leizhen Cai, J. Mark Keil
1993	J	`jnl`	Degree-Bounded Spanners. Parallel Process. Lett. Leizhen Cai, J. Mark Keil
1993	J	`jnl`	On the SPANNING Discret. Appl. Math. Leizhen Cai, Frédéric Maffray
1993	J	`jnl`	The Recognition of Union Trees. Inf. Process. Lett. Leizhen Cai
1992	J	`jnl`	Edge colouring line graphs of unicyclic graphs. Discret. Appl. Math. Leizhen Cai, John A. Ellis
1992	J	`jnl`	On cycle double covers of line graphs. Discret. Math. Leizhen Cai, Derek G. Corneil
1992	—	`—`	Tree spanners, spanning trees that approximate distances. Leizhen Cai
1991	J	`jnl`	NP-completeness of edge-colouring some restricted graphs. Discret. Appl. Math. Leizhen Cai, John A. Ellis