The following pages link to (Q5501309):
Displaying 35 items.
- First-fit chromatic numbers of \(d\)-degenerate graphs (Q427876) (← links)
- First-fit coloring on interval graphs has performance ratio at least 5 (Q499473) (← links)
- First-fit coloring of bounded tolerance graphs (Q531602) (← links)
- On the max-weight edge coloring problem (Q613668) (← links)
- First-Fit is linear on posets excluding two long incomparable chains (Q651432) (← links)
- On the max coloring problem (Q690449) (← links)
- Minimum entropy combinatorial optimization problems (Q693045) (← links)
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
- A note on first-fit coloring of interval graphs (Q925259) (← links)
- Online unit clustering: Variations on a theme (Q954982) (← links)
- Online interval coloring with packing constraints (Q954991) (← links)
- Approximating the max-edge-coloring problem (Q986540) (← links)
- Minimum entropy coloring (Q1016051) (← links)
- Variable sized online interval coloring with bandwidth (Q1024785) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Weighted coloring: further complexity and approximability results (Q1045908) (← links)
- An easy subexponential bound for online chain partitioning (Q1753118) (← links)
- On-line dimension for posets excluding two long incomparable chains (Q1943697) (← links)
- A note on the Cornaz-Jost transformation to solve the graph coloring problem (Q2444903) (← links)
- Bounded max-colorings of graphs (Q2447538) (← links)
- A one-to-one correspondence between colorings and stable sets (Q2517790) (← links)
- Iterated local search with tabu search for the weighted vertex coloring problem (Q2664440) (← links)
- Forbidden structures for efficient first-fit chain partitioning (extended abstract) (Q2857340) (← links)
- A Refined Analysis of Online Path Coloring in Trees (Q2971164) (← links)
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)
- Approximating interval coloring and max-coloring in chordal graphs (Q3507752) (← links)
- Minimum Entropy Combinatorial Optimization Problems (Q3576040) (← links)
- On the Maximum Edge Coloring Problem (Q3602848) (← links)
- A Dichotomy Theorem for First-Fit Chain Partitions (Q5218437) (← links)
- On the Max Coloring Problem (Q5443379) (← links)
- Automata, Languages and Programming (Q5716853) (← links)
- Complexity and online algorithms for minimum skyline coloring of intervals (Q5919565) (← links)
- Max-coloring of vertex-weighted graphs (Q5964985) (← links)
- Buffer minimization with conflicts on a line (Q5970726) (← links)
- On-line interval graphs coloring — Modification of the First-Fit algorithm and its performance ratio (Q6115748) (← links)
