Compound logics for modification problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5485473 (Why is no real title available?)
- scientific article; zbMATH DE number 5764786 (Why is no real title available?)
- scientific article; zbMATH DE number 3819693 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1870231 (Why is no real title available?)
- scientific article; zbMATH DE number 7297863 (Why is no real title available?)
- scientific article; zbMATH DE number 6737879 (Why is no real title available?)
- scientific article; zbMATH DE number 969067 (Why is no real title available?)
- scientific article; zbMATH DE number 7788442 (Why is no real title available?)
- scientific article; zbMATH DE number 7788458 (Why is no real title available?)
- (Meta) kernelization
- k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms
- A c^k n 5-approximation algorithm for treewidth
- A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
- A linear time algorithm for finding tree-decompositions of small treewidth
- A more accurate view of the flat wall theorem
- A near-optimal planarization algorithm
- A new proof of the flat wall theorem
- A parameterized approximation scheme for min k-cut
- A single-exponential time 2-approximation algorithm for treewidth
- Algorithmic meta-theorems
- Algorithms and data structures for first-order logic with connectivity under vertex failures
- An algorithmic meta-theorem for graph modification to planarity and FOL
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Bridge-depth characterizes which minor-closed structural parameterizations of vertex cover admit a polynomial kernel
- Compound logics for modification problems
- Deciding first-order properties of locally tree-decomposable structures
- Deciding first-order properties of nowhere dense graphs
- Definability equals recognizability for graphs of bounded treewidth
- Definable decompositions for graphs of bounded linear cliquewidth
- Deleting vertices to graphs of bounded genus
- Deleting, eliminating and decomposing to hereditary classes are all FPT-equivalent
- Detecting induced minors in AT-free graphs
- Easy problems for tree-decomposable graphs
- Edge-Deletion Problems
- Elements of finite model theory.
- Elimination Distance to Bounded Degree on Planar Graphs
- Faster deterministic \textsc{Feedback Vertex Set}
- Faster exact and approximate algorithms for k-cut
- Faster parameterized algorithms for modification problems to minor-closed classes
- First-order Logic with Connectivity Operators
- First-order interpretations of bounded expansion classes
- First-order logic with counting: at least, \textit{weak} Hanf normal forms always exist and can be computed!
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Fixed-parameter tractability, definability, and model-checking
- Fixed-parameter tractable distances to sparse graph classes
- Gaifman normal forms for counting extensions of first-order logic
- Grad and classes with bounded expansion. I: Decompositions
- Grad and classes with bounded expansion. II: Algorithmic aspects
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
- Graph isomorphism parameterized by elimination distance to bounded degree
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XX: Wagner's conjecture
- Graph searching and a min-max theorem for tree-width
- Graph structure and monadic second-order logic. A language-theoretic approach
- Hitting forbidden induced subgraphs on bounded treewidth graphs
- Hitting forbidden minors: approximation and kernelization
- Hitting forbidden subgraphs in graphs of bounded treewidth
- Hitting topological minors is FPT
- Improved Parameterized Upper Bounds for Vertex Cover
- Improved algorithms for feedback vertex set problems
- Improved bounds for the flat wall theorem
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
- Linear kernels and single-exponential algorithms via protrusion decompositions
- Linear rankwidth meets stability
- Linear time solvable optimization problems on graphs of bounded clique-width
- Locality of order-invariant first-order formulas
- Logic, graphs, and algorithms
- Measuring what matters: a hybrid approach to dynamic programming with treewidth
- Methods for algorithmic meta theorems
- Minimum bisection is fixed-parameter tractable
- Model checking disjoint-paths logic on topological-minor-free graph classes
- Model checking on interpretations of classes of bounded local cliquewidth
- Model-checking for first-order logic with disjoint paths predicates in proper minor-closed graph classes
- Modification to Planarity is Fixed Parameter Tractable
- Multicut Is FPT
- Nowhere dense classes of graphs
- Obtaining a planar graph by vertex deletion
- Optimizing the graph minors weak structure theorem
- Parameterized algorithms
- Parameterized and Exact Computation
- Parameterized complexity of elimination distance to first-order logic properties
- Planar graph bipartization in linear time
- Planarity Allowing Few Error Vertices in Linear Time
- Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time
- Sparsity. Graphs, structures, and algorithms
- Structural Properties of the First-Order Transduction Quasiorder
- Successor-invariant first-order logic on classes of bounded degree
- Succinctness of Order-Invariant Logics on Depth-Bounded Structures
- Testing first-order properties for subclasses of sparse graphs
- The minimum \(k\)-way cut of bounded size is fixed-parameter tractable
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The node-deletion problem for hereditary properties is NP-complete
- Transducing paths in graph classes with unbounded shrubdepth
- Twin-width IV: ordered graphs and matrices
- Twin-width. I: Tractable FO model checking
- Vertex deletion parameterized by elimination distance and even less
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions
- \textsc{Planar} \(\mathcal{F}\)-\textsc{deletion}: approximation, kernelization and optimal FPT algorithms
This page was built for publication: Compound logics for modification problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027563)
