Pages that link to "Item:Q5417643"
From MaRDI portal
The following pages link to Bidimensionality and Geometric Graphs (Q5417643):
Displaying 37 items.
- Finite Integer Index of Pathwidth and Treewidth (Q2946024) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs (Q3057621) (← links)
- Planar k-Path in Subexponential Time and Polynomial Space (Q3104782) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- Uniform Kernelization Complexity of Hitting Forbidden Minors (Q3448821) (← links)
- Smaller Kernels for Several FPT Problems Based on Simple Observations (Q3452562) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- (Q4972036) (← links)
- (Q5009491) (← links)
- On the Parameterized Complexity of the Expected Coverage Problem (Q5042243) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Hitting Weighted Even Cycles in Planar Graphs (Q5048307) (← links)
- A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs (Q5090489) (← links)
- (Q5090497) (← links)
- (Q5091010) (← links)
- (Q5092402) (← links)
- (Q5111863) (← links)
- Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs (Q5111869) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5150814) (← links)
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
- Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- (Q5365078) (← links)
- Algorithmic Learning Theory (Q5464494) (← links)
- (Q5743378) (← links)
- (Q5743379) (← links)
- (Q5743380) (← links)
- (Q5743382) (← links)
- (Q5743499) (← links)
- First-Order Model-Checking in Random Graphs and Complex Networks (Q5874510) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
- (Q6089655) (← links)
