The following pages link to Leizhen Cai (Q175508):
Displaying 41 items.
- Computing the optimal bridge between two convex polygons (Q294636) (← links)
- Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem (Q633844) (← links)
- Parameterized complexity of even/odd subgraph problems (Q635735) (← links)
- A linear-time algorithm for computing the intersection of all odd cycles in a graph (Q674917) (← links)
- On the SPANNING \(k\)-TREE problem (Q686254) (← links)
- Parameterized complexity of finding connected induced subgraphs (Q897959) (← links)
- Obtaining split graphs by edge contraction (Q897961) (← links)
- Labelling planar graphs without 4-cycles with a condition on distance two (Q947103) (← links)
- NP-completeness of edge-colouring some restricted graphs (Q1173977) (← links)
- Edge colouring line graphs of unicyclic graphs (Q1186166) (← links)
- On cycle double covers of line graphs (Q1193439) (← links)
- NP-completeness of minimum spanner problems (Q1315465) (← links)
- Fixed-parameter tractability of graph modification problems for hereditary properties (Q1352005) (← links)
- On spanning 2-trees in a graph (Q1356500) (← links)
- The complexity of the locally connected spanning tree problem (Q1408813) (← links)
- Parameterized complexity of vertex colouring (Q1811065) (← links)
- Isomorphic tree spanner problems (Q1899446) (← links)
- Complexity of vertex switching on edge-bicolored graphs (Q2294065) (← links)
- Two edge-disjoint paths with length constraints (Q2330117) (← links)
- Incompressibility of \(H\)-free edge modification problems (Q2343091) (← links)
- The recognition of union trees (Q2365813) (← links)
- Game chromatic index ofk-degenerate graphs (Q2712591) (← links)
- Incompressibility of H-Free Edge Modification (Q2867075) (← links)
- Contracting Few Edges to Remove Forbidden Induced Subgraphs (Q2867076) (← links)
- Dual Connectedness of Edge-Bicolored Graphs and Beyond (Q2922603) (← links)
- Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem (Q3013133) (← links)
- Choosability of toroidal graphs without short cycles (Q3055923) (← links)
- (Q3139523) (← links)
- Finding Two Edge-Disjoint Paths with Length Constraints (Q3181047) (← links)
- Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems (Q3499742) (← links)
- Parameterized Complexity of Even/Odd Subgraph Problems (Q3562994) (← links)
- Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm (Q3596724) (← links)
- Spanners in graphs of bounded degree (Q4303628) (← links)
- Computing Visibility Information in an Inaccurate Simple Polygon (Q4375868) (← links)
- Path decompositions of multigraphs (Q4698080) (← links)
- Tree Spanners (Q4847362) (← links)
- A generalization of line graphs: (X, Y)-intersection graphs (Q4875681) (← links)
- A generalization of perfect graphs?i-perfect graphs (Q4892347) (← links)
- Obtaining Split Graphs by Edge Contraction (Q5251646) (← links)
- Parameterized Complexity of Connected Induced Subgraph Problems (Q5251647) (← links)
- Stable 2-pairs and \((X,Y)\)-intersection graphs (Q5931414) (← links)
