scientific article; zbMATH DE number 5485529
From MaRDI portal
Publication:3549698
zbMATH Open1231.68149MaRDI QIDQ3549698FDOQ3549698
Igor Razgon, Jianer Chen, Barry O'Sullivan, Songjian Lu, Yang Liu
Publication date: 5 January 2009
Title of this publication is not available (Why is that?)
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (49)
- Slightly Superexponential Parameterized Problems
- A Linear Kernel for Planar Feedback Vertex Set
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes
- Invertibility of Digraphs and Tournaments
- FPT algorithms for path-transversal and cycle-transversal problems
- On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts
- Title not available (Why is that?)
- Parameterized complexity and approximability of the longest compatible sequence problem
- Improved algorithms for feedback vertex set problems
- Parameterized complexity of finding regular induced subgraphs
- Almost 2-SAT is fixed-parameter tractable
- Aligning and Labeling Genomes under the Duplication-Loss Model
- Parameterized complexity of Eulerian deletion problems
- Bounding the feedback vertex number of digraphs in terms of vertex degrees
- Feedback vertex sets on restricted bipartite graphs
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions
- A survey of parameterized algorithms and the complexity of edge modification
- Fixed-parameter algorithms for Kemeny rankings
- Obtaining a planar graph by vertex deletion
- Constant ratio fixed-parameter approximation of the edge multicut problem
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments
- On Weighted Graph Separation Problems and Flow Augmentation
- A cubic kernel for feedback vertex set and loop cutset
- Title not available (Why is that?)
- Digraph width measures in parameterized algorithmics
- Hitting Selected (Odd) Cycles
- Kernels for deletion to classes of acyclic digraphs
- On Multiway Cut Parameterized above Lower Bounds
- The parameterized complexity of editing graphs for bounded degeneracy
- Odd cycle transversal in mixed graphs
- Hardness of subgraph and supergraph problems in \(c\)-tournaments
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable
- Parameterized Complexity and Approximability of the SLCS Problem
- Euler Digraphs
- Acyclic Digraphs
- Multicut Is FPT
- On the parameterized complexity of deletion to \(\mathcal{H}\)-free strong components
- Degreewidth: A New Parameter for Solving Problems on Tournaments
- Possible winner problems on partial tournaments: a parameterized study
- Linear Time Parameterized Algorithms for Subset Feedback Vertex Set
- Iterative Compression and Exact Algorithms
- Faster deterministic \textsc{Feedback Vertex Set}
- Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs
- Fixed-Parameter Algorithms for Kemeny Scores
- Analyzing and reconstructing reticulation networks under timing constraints
- Iterative compression and exact algorithms
- Faster graph bipartization
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549698)
