The complexity of path coloring and call scheduling

Network Flows: Theory, Algorithms, and Applications.

David K. Smith, Ravindra K. Ahuja, Thomas L. Magnanti et al. · Journal of the Operational Research Society · 1994 · 8.2K citations · Full text

Computing, Computer Science, Computer Networks +10

Approximation Algorithms for NP-Hard Problems

Dorit S. Hochba · ACM SIGACT News · 1997 · 3.1K citations · Full text

Computing, Computer Science, Mathematics +13

The NP-Completeness of Edge-Coloring

Ian Holyer · SIAM Journal on Computing · 1981 · 1.1K citations

Natural Sciences, Visualization, Color Theory +10

Decomposition by clique separators

Robert E. Tarjan · Discrete Mathematics · 1985 · 439 citations

Natural Sciences, Mathematics, Combinatorics +4

The Complexity of Coloring Circular Arcs and Chords

M. R. Garey, David S. Johnson, Gary L. Miller et al. · SIAM Journal on Algebraic and Discrete Methods · 1980 · 391 citations

Computing, Computer Science, Mathematics +13