Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing
DOI10.1007/978-3-642-13731-0_32zbMATH Open1285.68207OpenAlexW1646322354MaRDI QIDQ3569903FDOQ3569903
Authors: Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh 
Publication date: 22 June 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13731-0_32
Recommendations
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
- The parameterized complexity of stabbing rectangles
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
- Publication:4724636
- Fixed-parameter tractability and lower bounds for stabbing problems
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Coloring of graphs and hypergraphs (05C15)
Cited In (6)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
- The parameterized complexity of stabbing rectangles
- Fixed-parameter algorithms for the cocoloring problem
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
- Partitioning extended \(P_4\)-laden graphs into cliques and stable sets
- Fixed-parameter tractability and lower bounds for stabbing problems
This page was built for publication: Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569903)
