Precoloring extension. I: Interval graphs

An optimization method for the channel assignment in mixed environments

MobiCom '95 Proceedings of the 1st annual international conference on Mobile computing and networking

Distributed long-lived list colouring: how to dynamically allocate frequencies in cellular networks

Wireless Networks

A note on planar 5-list colouring: non-extendability at distance 4

Discrete Mathematics

Disjoint paths in circular arc graphs

Nordic Journal of Computing

The complexity of chromatic strength and chromatic edge strength

Computational Complexity

Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing

Parameterized coloring problems on chordal graphs

Theoretical Computer Science - Parameterized and exact computation

Precoloring extension on unit interval graphs

Discrete Applied Mathematics

Hard coloring problems in low degree planar bipartite graphs

Discrete Applied Mathematics

A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding

Computers and Operations Research

Distance constraints in graph color extensions

Journal of Combinatorial Theory Series B

Register allocation by puzzle solving

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation

Aliased register allocation for straight-line programs is NP-complete

Theoretical Computer Science

Complexity results for minimum sum edge coloring

Discrete Applied Mathematics

Multiagent graph coloring: Pareto efficiency, fairness and individual rationality

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1

Precoloring extension on unit interval graphs

Discrete Applied Mathematics

A fast cutting-plane algorithm for optimal coalescing

CC'07 Proceedings of the 16th international conference on Compiler construction

Using local search to speed up filtering algorithms for some NP-hard constraints

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems

The complexity of changing colourings with bounded maximum degree

Information Processing Letters

An optimal linear-time algorithm for interprocedural register allocation in high level synthesis using SSA form

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines

Journal of Scheduling

Register allocation after classical SSA elimination is NP-Complete

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures

Punctual coalescing

CC'10/ETAPS'10 Proceedings of the 19th joint European conference on Theory and Practice of Software, international conference on Compiler Construction

Constraint satisfaction problems: convexity makes all different constraints tractable

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One

Survey: Colouring, constraint satisfaction, and complexity

Computer Science Review

Routing equal-size messages on a slotted ring

Journal of Scheduling

Aliased register allocation for straight-line programs is NP-complete

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Elimination of parallel copies using code motion on data dependence graphs

Computer Languages, Systems and Structures

Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable

Theoretical Computer Science

Incremental list coloring of graphs, parameterized by conservation

Theoretical Computer Science