Mathematical Foundations of Computer Science 2004

DOI10.1007/b99679zbMath1096.68116OpenAlexW2488008928MaRDI QIDQ5311095

Fedor V. Fomin, Hans L. Bodlaender

Publication date: 22 August 2005

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

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

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)

Mutual exclusion scheduling with interval graphs or related classes. II ⋮ Scheduling jobs on identical machines with agreement graph ⋮ Monadic Second Order Logic on Graphs with Local Cardinality Constraints ⋮ Mutual exclusion scheduling with interval graphs or related classes. I

This page was built for publication: Mathematical Foundations of Computer Science 2004