Algorithms – ESA 2004

DOI10.1007/B100428zbMath1111.68569OpenAlexW2483610301MaRDI QIDQ5464586

Dimitrios M. Thilikos, Josep Diaz, Maria J. Serna

Publication date: 18 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100428

Mathematics Subject Classification ID

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

Related Items (4)

Compactors for parameterized counting problems ⋮ Complexity issues on bounded restrictive \(H\)-coloring ⋮ Parameterized algorithms for min-max multiway cut and list digraph homomorphism ⋮ Efficient algorithms for counting parameterized list \(H\)-colorings

This page was built for publication: Algorithms – ESA 2004