The following pages link to Zhentao Li (Q252836):
Displaying 24 items.
- Restricted frame graphs and a conjecture of Scott (Q252837) (← links)
- Excluding clocks (Q324738) (← links)
- Using SPQR-trees to speed up algorithms based on 2-cutset decompositions (Q324769) (← links)
- Steinberg's conjecture is false (Q345097) (← links)
- Complements of nearly perfect graphs (Q376556) (← links)
- Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph (Q972337) (← links)
- (Q1752487) (redirect page) (← links)
- Using SPQR-trees to speed up recognition algorithms based on 2-cutsets (Q1752488) (← links)
- The fair division of hereditary set systems (Q2190407) (← links)
- Bounds on the cleaning times of robot vacuums (Q2270327) (← links)
- Digraph Girth via Chromatic Number (Q2848530) (← links)
- The Complexity of the Simultaneous Cluster Problem (Q2871222) (← links)
- Hardness and Algorithms for Variants of Line Graphs of Directed Graphs (Q2872084) (← links)
- A Note on the Minimum Distance of Quantum LDPC Codes (Q2922612) (← links)
- Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs (Q3225135) (← links)
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863) (← links)
- Energy-Efficient Algorithms for Non-preemptive Speed-Scaling (Q3453287) (← links)
- (Q4527664) (← links)
- (Q5289416) (← links)
- Planar Digraphs of Digirth Four are 2-Colorable (Q5361236) (← links)
- Algorithms and Data Structures (Q5394234) (← links)
- (Q5417627) (← links)
- Optimization and Recognition for K 5-minor Free Graphs in Linear Time (Q5458529) (← links)
- Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph (Q5851110) (← links)
