Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
DOI10.1016/J.IC.2013.08.007zbMATH Open1358.68313OpenAlexW2143632336MaRDI QIDQ393084FDOQ393084
Authors: Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh 
Publication date: 16 January 2014
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2013.08.007
Recommendations
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing
- The parameterized complexity of stabbing rectangles
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
- Fixed-parameter tractability and lower bounds for stabbing problems
- The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
Permutations, words, matrices (05A05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Graph Classes: A Survey
- Finding odd cycle transversals.
- Algorithmic graph theory and perfect graphs
- Threshold graphs and related topics
- Parametrized complexity theory.
- A characterization of perfect graphs
- Title not available (Why is that?)
- A fixed-parameter algorithm for the directed feedback vertex set problem
- An efficient parameterized algorithm for m-set packing
- Title not available (Why is that?)
- The strong perfect graph theorem
- Improved algorithms for feedback vertex set problems
- Recognizing Berge graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partitions of graphs into one or two independent sets and cliques
- On chain and antichain families of a partially ordered set
- Approximation algorithms for hitting objects with straight lines
- Title not available (Why is that?)
- Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems
- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
- The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
- Constant approximation algorithms for rectangle stabbing and related problems
- Approximating minimum cocolorings.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some extremal results in cochromatic and dichromatic theory
- Title not available (Why is that?)
- Parameterized and Exact Computation
Cited In (3)
This page was built for publication: Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393084)
