What’s Next? Future Directions in Parameterized Complexity (Q2908548): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-30891-8_20
+Normal rank
@@ Property / OpenAlex ID @@
+W33845589
@@ Property / OpenAlex ID: W33845589 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved kernelization algorithm for \(r\)-set packing
+Normal rank
@@ Property / cites work @@
+A kernelization algorithm for \(d\)-hitting set
@@ Property / cites work: A kernelization algorithm for \(d\)-hitting set / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity: exponential speed-up for planar graph problems
+Normal rank
@@ Property / cites work @@
+Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
+Normal rank
@@ Property / cites work @@
+Fast FAST
@@ Property / cites work: Fast FAST / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Directed path-width and monotonicity in digraph searching
+Normal rank
@@ Property / cites work @@
+Q4488089
@@ Property / cites work: Q4488089 / rank @@
+Normal rank
@@ Property / cites work @@
+DAG-Width and Parity Games
@@ Property / cites work: DAG-Width and Parity Games / rank @@
+Normal rank
@@ Property / cites work @@
+ON DISJOINT CYCLES
@@ Property / cites work: ON DISJOINT CYCLES / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization: New Upper and Lower Bound Techniques
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Faster parameterized algorithms for \textsc{Minimum Fill-in}
+Normal rank
@@ Property / cites work @@
+Multicut is FPT
@@ Property / cites work: Multicut is FPT / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of graph modification problems for hereditary properties
+Normal rank
@@ Property / cites work @@
+The Complexity of Satisfiability of Small Depth Circuits
+Normal rank
@@ Property / cites work @@
+Computing the Deficiency of Housing Markets with Duplicate Houses
+Normal rank
@@ Property / cites work @@
+Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
+Normal rank
@@ Property / cites work @@
+Improved algorithms for feedback vertex set problems
+Normal rank
@@ Property / cites work @@
+Linear FPT reductions and computational lower bounds
+Normal rank
@@ Property / cites work @@
+Improved upper bounds for vertex cover
@@ Property / cites work: Improved upper bounds for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
+Normal rank
@@ Property / cites work @@
+A fixed-parameter algorithm for the directed feedback vertex set problem
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset
+Normal rank
@@ Property / cites work @@
+Tournament immersion and cutwidth
@@ Property / cites work: Tournament immersion and cutwidth / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint paths in tournaments
@@ Property / cites work: Disjoint paths in tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of Eulerian Deletion Problems
+Normal rank
@@ Property / cites work @@
+Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
+Normal rank
@@ Property / cites work @@
+On Multiway Cut Parameterized above Lower Bounds
@@ Property / cites work: On Multiway Cut Parameterized above Lower Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability Certificates Verifiable in Subexponential Time
+Normal rank
@@ Property / cites work @@
+An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem
+Normal rank
@@ Property / cites work @@
+Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
+Normal rank
@@ Property / cites work @@
+The Bidimensional Theory of Bounded-Genus Graphs
@@ Property / cites work: The Bidimensional Theory of Bounded-Genus Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921717
@@ Property / cites work: Q2921717 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Subgraph Isomorphism Revisited
@@ Property / cites work: Planar Subgraph Isomorphism Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Q3113754
@@ Property / cites work: Q3113754 / rank @@
+Normal rank
@@ Property / cites work @@
+A Basic Parameterized Complexity Primer
@@ Property / cites work: A Basic Parameterized Complexity Primer / rank @@
+Normal rank
@@ Property / cites work @@
+Q4027320
@@ Property / cites work: Q4027320 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4850549
@@ Property / cites work: Q4850549 / rank @@
+Normal rank
@@ Property / cites work @@
+Subgraph Isomorphism in Planar Graphs and Related Problems
+Normal rank
@@ Property / cites work @@
+Distortion Is Fixed Parameter Tractable
@@ Property / cites work: Distortion Is Fixed Parameter Tractable / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of some colorful problems parameterized by treewidth
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of Counting Problems
@@ Property / cites work: The Parameterized Complexity of Counting Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417642
@@ Property / cites work: Q5417642 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+Subexponential Parameterized Algorithm for Minimum Fill-In
+Normal rank
@@ Property / cites work @@
+Q3549693
@@ Property / cites work: Q3549693 / rank @@
+Normal rank
@@ Property / cites work @@
+Are There Any Good Digraph Width Measures?
@@ Property / cites work: Are There Any Good Digraph Width Measures? / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for CLOSEST STRING and related problems
+Normal rank
@@ Property / cites work @@
+FPT algorithms for path-transversal and cycle-transversal problems
+Normal rank
@@ Property / cites work @@
+Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
+Normal rank
@@ Property / cites work @@
+-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General
+Normal rank
@@ Property / cites work @@
+Digraph measures: Kelly decompositions, games, and orderings
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Directed tree-width
@@ Property / cites work: Directed tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
+Normal rank
@@ Property / cites work @@
+Planarity Allowing Few Error Vertices in Linear Time
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding subgraphs with hereditary properties.
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
+Normal rank
@@ Property / cites work @@
+Digraph decompositions and monotonicity in digraph searching
+Normal rank
@@ Property / cites work @@
+Q5365080
@@ Property / cites work: Q5365080 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365079
@@ Property / cites work: Q5365079 / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization – Preprocessing with a Guarantee
@@ Property / cites work: Kernelization – Preprocessing with a Guarantee / rank @@
+Normal rank
@@ Property / cites work @@
+More Efficient Algorithms for Closest String and Substring Problems
+Normal rank
@@ Property / cites work @@
+Parameterized graph separation problems
@@ Property / cites work: Parameterized graph separation problems / rank @@
+Normal rank
@@ Property / cites work @@
+Closest Substring Problems with Small Distances
@@ Property / cites work: Closest Substring Problems with Small Distances / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002818
@@ Property / cites work: Q3002818 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of multicut parameterized by the size of the cutset
+Normal rank
@@ Property / cites work @@
+Obtaining a planar graph by vertex deletion
@@ Property / cites work: Obtaining a planar graph by vertex deletion / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on kernelization
@@ Property / cites work: Lower bounds on kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417690
@@ Property / cites work: Q5417690 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of circuit satisfiability
@@ Property / cites work: On the complexity of circuit satisfiability / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized algorithms for feedback set problems and their duals in tournaments
+Normal rank
@@ Property / cites work @@
+Almost 2-SAT is fixed-parameter tractable
@@ Property / cites work: Almost 2-SAT is fixed-parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Finding odd cycle transversals.
@@ Property / cites work: Finding odd cycle transversals. / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths of length \(k\) in \(O^{*}(2^k)\) time
+Normal rank
@@ Property / cites work @@
+Some consequences of non-uniform conditions on uniform classes
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2908548