Pages that link to "Item:Q5384092"

The following pages link to A Near-Optimal Planarization Algorithm (Q5384092):

Displaying 38 items.

• A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
• Paths to trees and cacti (Q1998842) (← links)
• Hitting forbidden induced subgraphs on bounded treewidth graphs (Q2051840) (← links)
• Faster FPT algorithms for deletion to pairs of graph classes (Q2140510) (← links)
• Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
• Hitting minors on bounded treewidth graphs. III. Lower bounds (Q2301360) (← links)
• Deleting vertices to graphs of bounded genus (Q2319638) (← links)
• A tight lower bound for vertex planarization on graphs of bounded treewidth (Q2403808) (← links)
• Hitting forbidden subgraphs in graphs of bounded treewidth (Q2407089) (← links)
• Experiments with the Fixed-Parameter Approach for Two-Layer Planarization (Q3378513) (← links)
• Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (Q3448850) (← links)
• How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
• (Q3732963) (← links)
• Bijective comparison of optimal planarity algorithms (Q4838131) (← links)
• (Q4952599) (← links)
• (Q5075776) (← links)
• Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs (Q5089257) (← links)
• Modification to Planarity is Fixed Parameter Tractable (Q5090477) (← links)
• A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs (Q5090489) (← links)
• A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)
• (Q5111863) (← links)
• Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
• (Q5136298) (← links)
• A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
• A fully dynamic algorithm for planar (Q5361574) (← links)
• The design and implementation of panar maps in CGAL (Q5463410) (← links)
• (Q5874521) (← links)
• Graph Drawing (Q5897658) (← links)
• On the number of labeled graphs of bounded treewidth (Q5915790) (← links)
• \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
• Polynomial Kernel for Interval Vertex Deletion (Q6075746) (← links)
• Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes (Q6098156) (← links)
• Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm (Q6115414) (← links)
• Planarizing graphs and their drawings by vertex splitting (Q6172199) (← links)
• Recognizing map graphs of bounded treewidth (Q6182682) (← links)
• Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)
• Parameterized complexity of vertex splitting to pathwidth at most 1 (Q6639742) (← links)
• Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion (Q6670351) (← links)