Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
From MaRDI portal
Publication:3569903
DOI10.1007/978-3-642-13731-0_32zbMath1285.68207OpenAlexW1646322354MaRDI QIDQ3569903
Daniel Lokshtanov, Venkatesh Raman, Pinar Heggernes, Dieter Kratsch, 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
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
Fixed-parameter tractability and lower bounds for stabbing problems ⋮ 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 ⋮ Partitioning extended \(P_4\)-laden graphs into cliques and stable sets
This page was built for publication: Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
