The following pages link to Erik Jan van Leeuwen (Q295636):
Displaying 50 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Complexity of metric dimension on planar graphs (Q314819) (← links)
- What graphs are 2-dot product graphs? (Q322356) (← links)
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- Finding disjoint paths in split graphs (Q493652) (← links)
- Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
- Structure of polynomial-time approximation (Q692893) (← links)
- Algorithms for the rainbow vertex coloring problem on graph classes (Q820548) (← links)
- The firefighter problem on graph classes (Q899308) (← links)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
- Co-bipartite neighborhood edge elimination orderings (Q1689989) (← links)
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
- Polynomial kernels for deletion to classes of acyclic digraphs (Q1751231) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- Spanners of bounded degree graphs (Q1944059) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q1987245) (← links)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Steiner trees for hereditary graph classes (Q2081657) (← links)
- Few induced disjoint paths for \(H\)-free graphs (Q2098179) (← links)
- Upper bounding rainbow connection number by forest number (Q2138952) (← links)
- Streaming deletion problems parameterized by vertex cover (Q2140522) (← links)
- Disconnected cuts in claw-free graphs (Q2186821) (← links)
- Complexity of independency and cliquy trees (Q2283099) (← links)
- Algorithms and bounds for very strong rainbow coloring (Q2294720) (← links)
- Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
- Parameterized complexity of firefighting (Q2453548) (← links)
- Induced disjoint paths in circular-arc graphs in linear time (Q2629233) (← links)
- Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
- Polynomial Kernelization for Removing Induced Claws and Diamonds (Q2827828) (← links)
- Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs (Q2872078) (← links)
- Parameterized Complexity of Firefighting Revisited (Q2891334) (← links)
- k-Gap Interval Graphs (Q2894479) (← links)
- Reducing a Target Interval to a Few Exact Queries (Q2912770) (← links)
- On the Complexity of Metric Dimension (Q2912859) (← links)
- Induced Disjoint Paths in Claw-Free Graphs (Q2912870) (← links)
- Parameterized Complexity of Induced H-Matching on Claw-Free Graphs (Q2912880) (← links)
- Finding Disjoint Paths in Split Graphs (Q2938109) (← links)
- Induced Disjoint Paths in Circular-Arc Graphs in Linear Time (Q2945192) (← links)
- (Q2954992) (← links)
- Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs (Q2957897) (← links)
- Domination When the Stars Are Out (Q3012826) (← links)
- Complexity Results for the Spanning Tree Congestion Problem (Q3057608) (← links)
- Convex Polygon Intersection Graphs (Q3073689) (← links)
- (Q3579437) (← links)
- Faster Algorithms on Branch and Clique Decompositions (Q3586082) (← links)
- PTAS for Weighted Set Cover on Unit Squares (Q3588405) (← links)
- Independence and Efficient Domination on <i>P</i> <sub>6</sub> -free Graphs (Q4554948) (← links)
- Independence and Efficient Domination on <i>P</i><sub>6</sub>-free Graphs (Q4575708) (← links)
- Polynomial Kernels for Deletion to Classes of Acyclic Digraphs (Q4601907) (← links)
