scientific article; zbMATH DE number 7525474
From MaRDI portal
Publication:5075776
DOI10.4230/LIPIcs.ESA.2019.37MaRDI QIDQ5075776
Brian Lavallee, Timothy D. Goodrich, Quanquan C. Liu, Andrew van der Poel, Erik D. Demaine, Kyle Kloster, Ali Vakilian, Blair D. Sullivan
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1806.02771
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Sparsity. Graphs, structures, and algorithms
- Semi-online preemptive scheduling: one algorithm for all variants
- A survey of graph edit distance
- Parameterized coloring problems on chordal graphs
- The parameterized complexity of editing graphs for bounded degeneracy
- A new approach for approximating node deletion problems
- The node-deletion problem for hereditary properties is NP-complete
- A unified approximation algorithm for node-deletion problems
- The graph crossing number and its variants: a survey
- On the threshold of intractability
- Obtaining a planar graph by vertex deletion
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Edge-Editing to a Dense and a Sparse Graph Class
- A Parameterized Algorithm for Bounded-Degree Vertex Deletion
- Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
- Smallest-last ordering and clustering and graph coloring algorithms
- Node-Deletion NP-Complete Problems
- Partitioning a Graph into Small Pieces with Applications to Path Transversal
- The approximation of maximum subgraph problems
- Tight Running Time Lower Bounds for Vertex Deletion Problems
- Planarity Allowing Few Error Vertices in Linear Time
- Losing Treewidth by Separating Subsets
- Parameterized and Exact Computation
- Inapproximability of $H$-Transversal/Packing
- A Near-Optimal Planarization Algorithm
- Node-and edge-deletion NP-complete problems
- Parameterized Graph Editing with Chosen Vertex Degrees
This page was built for publication:
