The following pages link to Erik Jan van Leeuwen (Q295636):
Displaying 35 items.
- Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs (Q4629967) (← links)
- Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces (Q4987446) (← links)
- Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs (Q5005187) (← links)
- (Q5009615) (← links)
- (Q5009627) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q5009632) (← links)
- What Graphs are 2-Dot Product Graphs? (Q5024919) (← links)
- On Geometric Set Cover for Orthants (Q5075763) (← links)
- Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes (Q5089235) (← links)
- A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs (Q5090489) (← links)
- Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking (Q5111257) (← links)
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
- Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)
- Induced Disjoint Paths in Claw-Free Graphs (Q5251566) (← links)
- Integer Representations of Convex Polygon Intersection Graphs (Q5300490) (← links)
- (Q5369516) (← links)
- (Q5396694) (← links)
- Integer representations of convex polygon intersection graphs (Q5404443) (← links)
- Domination in Geometric Intersection Graphs (Q5458576) (← links)
- Better Approximation Schemes for Disk Graphs (Q5757904) (← links)
- (Q5875557) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897569) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918405) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918624) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)
- Streaming deletion problems Parameterized by vertex cover (Q6057830) (← links)
- Algorithms and Bounds for Very Strong Rainbow Coloring (Q6283756) (← links)
- Disconnected Cuts in Claw-free Graphs (Q6298858) (← links)
- The parameterized complexity of the survivable network design problem (Q6538769) (← links)
- Planar multiway cut with terminals on few faces (Q6575155) (← links)
- Parameterized complexity of streaming diameter and connectivity problems (Q6614110) (← links)
- Maximal induced matchings in \(K_4\)-free and \(K_5\)-free graphs (Q6633556) (← links)
- Complexity framework for forbidden subgraphs III: when problems are tractable on subcubic graphs (Q6647690) (← links)
- The parameterized complexity of the survivable network design problem (Q6655676) (← links)
- Space-efficient parameterized algorithms on graphs of low shrubdepth (Q6656958) (← links)
