Pages that link to "Item:Q5716811"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5716811):
Displaying 26 items.
- Asymmetric coloring games on incomparability graphs (Q324375) (← links)
- On a reduction of the interval coloring problem to a series of bandwidth coloring problems (Q633552) (← links)
- On the max coloring problem (Q690449) (← links)
- Online chromatic number is PSPACE-complete (Q726097) (← links)
- A randomized algorithm for online unit clustering (Q839627) (← links)
- An improved algorithm for online coloring of intervals with bandwidth (Q860808) (← links)
- Online interval coloring with packing constraints (Q954991) (← links)
- Variable sized online interval coloring with bandwidth (Q1024785) (← links)
- A note on online colouring problems in overlap graphs and their complements (Q1641110) (← links)
- A new lower bound for the on-line coloring of intervals with bandwidth (Q1686078) (← links)
- Online lazy bureaucrat scheduling with a machine deadline (Q1702835) (← links)
- Dynamic data structures for interval coloring (Q2197541) (← links)
- Online coloring a token graph (Q2303438) (← links)
- Online coloring co-interval graphs (Q2380735) (← links)
- The maximum resource bin packing problem (Q2508970) (← links)
- Improved algorithms for scheduling unsplittable flows on paths (Q2684488) (← links)
- The connected greedy coloring game (Q2699943) (← links)
- Online conflict-free coloring for intervals (Q2921711) (← links)
- Reverse Mathematics and Grundy colorings of graphs (Q3053234) (← links)
- Max-coloring and online coloring with bandwidths on interval graphs (Q3189018) (← links)
- (Q5136269) (← links)
- On the Max Coloring Problem (Q5443379) (← links)
- Variable Sized Online Interval Coloring with Bandwidth (Q5757892) (← links)
- Improved lower bound on the on-line chain partitioning of semi-orders with representation (Q6056742) (← links)
- (Q6084415) (← links)
- Online coloring of short intervals (Q6201896) (← links)
