Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …

Control of Robot Manipulators in Joint Space addresses robot control in depth, treating a
range of model-based controllers in detail: proportional derivative; proportional integral …

A graph coloring algorithm that immediately colors the vertices taken from a list without
looking ahead or changing colors already assigned is called “on‐line coloring.” The …

This chapter presents a survey of three types of results concerning on-line graph coloring:
The first type deals with the problem of on-line coloring k-chromatic graphs on n vertices, for …

THE LINEARITY OF FIRST-FIT COLORING OF INTERVAL GRAPHS* less than 40o(G) colors to
color G. Page 1 SIAM J. Disc. MATH. Vol. 1, No. November 1988 (C) 1988 Society forIndustrial …

Given a graph G=(V, E) and positive integral vertex weights w: V→ N, the max-coloring
problem seeks to find a proper vertex coloring of G whose color classes C1, C2,..., Ck …

We use an on-line algorithm for coloring interval graphs to construct a polynomial time
approximation algorithm WIC for Dynamic Storage Allocation. The performance ratio for WIC …

Dynamic Storage Allocation is the problem of packing given axis-aligned rectangles into a
horizontal strip of minimum height by sliding the rectangles vertically but not horizontally …

Given a dynamic graph subject to edge insertions and deletions, we show how to update an
implicit representation of a proper vertex colouring, such that colours of vertices are …

Interval orders and interval graphs are particularly natural examples of two widely studied
classes of discrete structures: partially ordered sets and undirected graphs. So it is not …