scientific article; zbMATH DE number 3769624
From MaRDI portal
Publication:3950561
Cited in
(65)- Variable sized online interval coloring with bandwidth
- An on-line graph coloring algorithm with sublinear performance ratio
- A polynomial time approximation algorithm for dynamic storage allocation
- Coloring inductive graphs on-line
- Lower bounds for on-line graph coloring
- On-line coloring of perfect graphs
- A new lower bound for the on-line coloring of intervals with bandwidth
- Non-clairvoyant scheduling with conflicts for unit-size jobs
- An easy subexponential bound for online chain partitioning
- Batch coloring of graphs
- Online independent sets.
- Coloring interval graphs with First-Fit
- On the on-line chromatic number of the family of on-line 3-chromatic graphs
- Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs
- On-line dimension for posets excluding two long incomparable chains
- On-line chain partitions of up-growing semi-orders
- On-line routing in all-optical networks
- Dynamic data structures for interval coloring
- Tight bounds for online coloring of basic graph classes
- A theory of recursive dimension of ordered sets
- On-line dimension of semi-orders
- On-line chain partitioning of up-growing interval orders
- On-line graph coloring of \({\mathbb{P}_5}\)-free graphs
- Improved algorithms for scheduling unsplittable flows on paths
- A subexponential upper bound for the on-line chain partitioning problem
- Lower bounds for on-line graph colorings
- An on-line competitive algorithm for coloring P₈-free bipartite graphs
- Lower bounds for on-line interval coloring with vector and cardinality constraints
- Batch Coloring of Graphs
- A refined analysis of online path coloring in trees
- Minimum entropy combinatorial optimization problems
- On the complexity of injective colorings and its generalizations
- Online selection of intervals and t-intervals
- Online coloring and L(2,1)-labeling of unit disk intersection graphs
- On-line routing in all-optical networks
- Optimal on-line coloring of circular arc graphs
- Tight bounds for online coloring of basic graph classes
- scientific article; zbMATH DE number 7278054 (Why is no real title available?)
- Foundations of online structure theory. II: The operator approach
- Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points
- An on-line competitive algorithm for coloring bipartite graphs without long induced paths
- First-fit coloring of bounded tolerance graphs
- On the Max Coloring Problem
- On the Online Unit Clustering Problem
- Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
- Complexity and online algorithms for minimum skyline coloring of intervals
- Improved lower bound on the on-line chain partitioning of semi-orders with representation
- scientific article; zbMATH DE number 7758354 (Why is no real title available?)
- A Modern View on Stability of Approximation
- Online coloring of short intervals
- Improved dynamic colouring of sparse graphs
- First-Fit is linear on posets excluding two long incomparable chains
- Online coloring of disk graphs
- On the \textsc{FirstFit} algorithm for online unit-interval coloring
- On the max coloring problem
- Minimum entropy combinatorial optimization problems
- Dynamic coloring of unit interval graphs with limited recourse budget
- On the on-line coloring of unit interval graphs with proper interval representation
- On-line approach to off-line coloring problems on graphs with geometric representations
- On-line chain partitions of orders: a survey
- A randomized algorithm for online unit clustering
- Online promise problems with online width metrics
- An improved algorithm for online coloring of intervals with bandwidth
- Online unit clustering: Variations on a theme
- Online interval coloring with packing constraints
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3950561)
