Year |
Citation |
Score |
2019 |
Cai L, Ye J. Two edge-disjoint paths with length constraints Theoretical Computer Science. 795: 275-284. DOI: 10.1016/J.Tcs.2019.07.009 |
0.351 |
|
2015 |
Cai L, Ye J. Parameterized complexity of finding connected induced subgraphs Theoretical Computer Science. 607: 49-59. DOI: 10.1016/J.Tcs.2015.05.020 |
0.491 |
|
2015 |
Guo C, Cai L. Obtaining split graphs by edge contraction Theoretical Computer Science. 607: 60-67. DOI: 10.1016/J.Tcs.2015.01.056 |
0.49 |
|
2015 |
Cai L, Cai Y. Incompressibility of $$H$$H-Free Edge Modification Problems Algorithmica. 71: 731-757. DOI: 10.1007/S00453-014-9937-X |
0.347 |
|
2011 |
Cai L, Yang B. Parameterized complexity of even/odd subgraph problems Journal of Discrete Algorithms. 9: 231-240. DOI: 10.1016/J.Jda.2011.03.004 |
0.495 |
|
2010 |
Cai L, Cheng Y, Verbin E, Zhou Y. Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem Siam Journal On Discrete Mathematics. 24: 1322-1335. DOI: 10.1137/100791130 |
0.453 |
|
2009 |
Xiao M, Cai L, Yao AC. Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem Algorithmica. 59: 510-520. DOI: 10.1007/S00453-009-9316-1 |
0.447 |
|
2008 |
Cai L. Parameterized complexity of cardinality constrained optimization problems Computer Journal. 51: 102-121. DOI: 10.1093/Comjnl/Bxm086 |
0.336 |
|
2008 |
Wang W, Cai L. Labelling planar graphs without 4-cycles with a condition on distance two Discrete Applied Mathematics. 156: 2241-2249. DOI: 10.1016/J.Dam.2007.05.061 |
0.36 |
|
2003 |
Cai L. The complexity of the locally connected spanning tree problem Discrete Applied Mathematics. 131: 63-75. DOI: 10.1016/S0166-218X(02)00417-1 |
0.466 |
|
2003 |
Cai L. Parameterized complexity of vertex colouring Discrete Applied Mathematics. 127: 415-429. DOI: 10.1016/S0166-218X(02)00242-1 |
0.461 |
|
1997 |
Cai L, Schieber B. A linear-time algorithm for computing the intersection of all odd cycles in a graph Discrete Applied Mathematics. 73: 27-34. DOI: 10.1016/S0166-218X(96)00074-1 |
0.409 |
|
1997 |
Cai L. On spanning 2-trees in a graph Discrete Applied Mathematics. 74: 203-216. DOI: 10.1016/S0166-218X(96)00045-5 |
0.472 |
|
1996 |
Cai L. Fixed-parameter tractability of graph modification problems for hereditary properties Information Processing Letters. 58: 171-176. DOI: 10.1016/0020-0190(96)00050-6 |
0.478 |
|
1995 |
Cai L. Spanning 2-trees Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1023: 10-22. |
0.431 |
|
1994 |
Cai L. NP-completeness of minimum spanner problems Discrete Applied Mathematics. 48: 187-194. DOI: 10.1016/0166-218X(94)90073-6 |
0.364 |
|
Show low-probability matches. |