The following pages link to (Q4763409):
Displayed 10 items.
- Impartial coloring games (Q388789) (← links)
- A competitive analysis of the list update problem with lookahead (Q1128665) (← links)
- A still better performance guarantee for approximate graph coloring (Q1209311) (← links)
- Lower bounds for on-line graph coloring (Q1331951) (← links)
- Delayed information and action in on-line algorithms (Q1854463) (← links)
- The dynamic frequency assignment problem (Q2378376) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Circumference, chromatic number and online coloring (Q2439828) (← links)
- A Competitive analysis of the list update problem with lookahead (Q5096877) (← links)
- Online coloring and a new type of adversary for online graph problems (Q5918632) (← links)