Automata, Languages and Programming

DOI10.1007/11523468zbMath1085.68603OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716811

Meital Levy, Leah Epstein

Publication date: 10 January 2006

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

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (17)

A randomized algorithm for online unit clustering ⋮ A new lower bound for the on-line coloring of intervals with bandwidth ⋮ Improved lower bound on the on-line chain partitioning of semi-orders with representation ⋮ Improved algorithms for scheduling unsplittable flows on paths ⋮ Dynamic data structures for interval coloring ⋮ Online coloring of short intervals ⋮ Online lazy bureaucrat scheduling with a machine deadline ⋮ The connected greedy coloring game ⋮ Unnamed Item ⋮ Online interval coloring with packing constraints ⋮ On the max coloring problem ⋮ Reverse Mathematics and Grundy colorings of graphs ⋮ On the Max Coloring Problem ⋮ The maximum resource bin packing problem ⋮ Online coloring a token graph ⋮ Variable sized online interval coloring with bandwidth ⋮ Unnamed Item

This page was built for publication: Automata, Languages and Programming