scientific article

zbMath1231.68149MaRDI QIDQ3549698

Igor Razgon, Barry O'Sullivan, Songjian Lu, Yang Liu, Jian'er Chen

Publication date: 5 January 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Possible winner problems on partial tournaments: a parameterized study, On Multiway Cut Parameterized above Lower Bounds, Linear Time Parameterized Algorithms for Subset Feedback Vertex Set, Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes, FPT Suspects and Tough Customers: Open Problems of Downey and Fellows, Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments, Designing FPT Algorithms for Cut Problems Using Randomized Contractions, Aligning and Labeling Genomes under the Duplication-Loss Model, Analyzing and reconstructing reticulation networks under timing constraints, Kernels for deletion to classes of acyclic digraphs, Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs, Odd cycle transversal in mixed graphs, Feedback vertex sets on restricted bipartite graphs, Hitting Selected (Odd) Cycles, Parameterized Complexity and Approximability of the SLCS Problem, A Linear Kernel for Planar Feedback Vertex Set, Invertibility of Digraphs and Tournaments, On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts, A survey of parameterized algorithms and the complexity of edge modification, Fixed-Parameter Algorithms for Kemeny Scores, Obtaining a planar graph by vertex deletion, On Weighted Graph Separation Problems and Flow Augmentation, Multicut Is FPT, Hardness of subgraph and supergraph problems in \(c\)-tournaments, Parameterized complexity of Eulerian deletion problems, Digraph width measures in parameterized algorithmics, Parameterized complexity and approximability of the longest compatible sequence problem, FPT algorithms for path-transversal and cycle-transversal problems, Subset Feedback Vertex Set Is Fixed-Parameter Tractable, Improved algorithms for feedback vertex set problems, Bounding the feedback vertex number of digraphs in terms of vertex degrees, A cubic kernel for feedback vertex set and loop cutset, Slightly Superexponential Parameterized Problems, Faster deterministic \textsc{Feedback Vertex Set}, Iterative compression and exact algorithms, Iterative Compression and Exact Algorithms, The parameterized complexity of editing graphs for bounded degeneracy, Unnamed Item, Constant ratio fixed-parameter approximation of the edge multicut problem, Unnamed Item, Faster graph bipartization, Iterative Compression for Exactly Solving NP-Hard Minimization Problems, Parameterized complexity of finding regular induced subgraphs, Almost 2-SAT is fixed-parameter tractable, Fixed-parameter algorithms for Kemeny rankings, Acyclic Digraphs, Euler Digraphs