Parameterized complexity of Eulerian deletion problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5485529 (Why is no real title available?)
- scientific article; zbMATH DE number 1261820 (Why is no real title available?)
- A quartic kernel for pathwidth-one vertex deletion
- Approximation and tidying -- a problem kernel for s-plex cluster vertex deletion
- Chordal deletion is fixed-parameter tractable
- Color-coding
- Competing provers yield improved Karp-Lipton collapse results
- Complexity classification of some edge modification problems
- Computing the Deficiency of Housing Markets with Duplicate Houses
- Cross-composition: a new technique for kernelization lower bounds
- Efficient algorithms for Eulerian extension
- Fast FPT-Algorithms for Cleaning Grids
- Finding minimum-cost flows by double scaling
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Matching, Euler tours and the Chinese postman
- NP-completeness results for edge modification problems
- On the complexity of paths avoiding forbidden pairs
- On the parameterized complexity of multiple-interval graph problems
- Parameterized algorithms for feedback set problems and their duals in tournaments
- Parameterized complexity of even/odd subgraph problems
- Parameterized complexity of finding regular induced subgraphs
- Parameterized complexity of finding subgraphs with hereditary properties.
- Parameterized complexity of the induced subgraph problem in directed graphs
- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
- Some consequences of non-uniform conditions on uniform classes
- The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
- The Parameterized Complexity of the Unique Coverage Problem
- The Planar Hamiltonian Circuit Problem is NP-Complete
- The node-deletion problem for hereditary properties is NP-complete
- Two edge modification problems without polynomial kernels
- Wheel-Free Deletion Is W[2]-Hard
Cited in
(32)- Parameterized complexity of connected even/odd subgraph problems
- Two edge-disjoint paths with length constraints
- A parameterized algorithmics framework for degree sequence completion problems in directed graphs
- Quantum encoding of dynamic directed graphs
- Parameterized algorithms for generalizations of directed feedback vertex set
- Parameterized Eulerian strong component arc deletion problem on tournaments
- An updated annotated bibliography on arc routing problems
- A survey of parameterized algorithms and the complexity of edge modification
- Parameterized complexity of Eulerian deletion problems
- Switches in Eulerian graphs
- Plane augmentation of plane graphs to meet parity constraints
- On the parameterized complexity of Eulerian strong component arc deletion
- Finding even subgraphs even faster
- Graph editing to a given degree sequence
- Finding two edge-disjoint paths with length constraints
- Determinantal sieving
- Graph editing to a given degree sequence
- Trimming forests is hard (unless they are made of stars)
- Finding even subgraphs even faster
- Königsberg sightseeing: Eulerian walks in temporal graphs
- From few components to an Eulerian graph by adding ARCS
- Editing to Eulerian graphs
- scientific article; zbMATH DE number 7278081 (Why is no real title available?)
- Editing to Eulerian graphs
- On the complexity of finding large odd induced subgraphs and odd colorings
- Eulerian walks in temporal graphs
- Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations
- Complexity of some arc-partition problems for digraphs
- Editing to a planar graph of given degrees
- On the parameterized complexity of Eulerian strong component arc deletion
- Editing to a planar graph of given degrees
- Directed graph encoding in quantum computing supporting edge-failures
This page was built for publication: Parameterized complexity of Eulerian deletion problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2441593)
