On the public citation graph
Online Interval Coloring and Variants
0 signed · 53 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/1520-6750(199406)41:4<579::aid-nav3220410409>3.0.co;2-gopenalex-snapshot
New worst-case results for the bin-packing problem
inferredcites →https://doi.org/10.1007/11537311_35openalex-snapshot
The Maximum Resource Bin Packing Problem
inferredcites →https://doi.org/10.1007/11809678_34openalex-snapshot
Improved On-Line Broadcast Scheduling with Deadlines
inferredcites →https://doi.org/10.1007/978-3-540-24592-6_1openalex-snapshot
Online Coloring of Intervals with Bandwidth
inferredcites →https://doi.org/10.1007/978-3-540-27798-9_36openalex-snapshot
Dynamic Storage Allocation and On-Line Colouring Interval Graphs
inferredcites →https://doi.org/10.1007/978-3-540-31833-0_18openalex-snapshot
Off-line Admission Control for Advance Reservations in Star Networks
inferredcites →https://doi.org/10.1016/0012-365x(94)00285-qopenalex-snapshot
Coloring interval graphs with first-fit
inferredcites →https://doi.org/10.1016/0020-0190(95)00046-fopenalex-snapshot
Simple linear time recognition of unit interval graphs
inferredcites →https://doi.org/10.1016/0022-2496(77)90030-xopenalex-snapshot
The Scott-Suppes theorem on semiorders
inferredcites →https://doi.org/10.1016/s0196-6774(02)00291-2openalex-snapshot
Interval selection: Applications, algorithms, and lower bounds
inferredcites →https://doi.org/10.1051/ita/1988220404871openalex-snapshot
On some packing problem related to dynamic storage allocation
inferredcites →https://doi.org/10.1137/0401048openalex-snapshot
The Linearity of First-Fit Coloring of Interval Graphs
inferredcites →https://doi.org/10.1137/s0895480191218861openalex-snapshot
On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $
inferredcites →https://doi.org/10.1145/585265.585269openalex-snapshot
On the online bin packing problem
inferredcites →https://doi.org/10.2307/2964389openalex-snapshot
Foundational aspects of theories of measurement
inferredcites →https://doi.org/10.5555/982792.982876openalex-snapshot
Buffer minimization using max-coloring
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.200910108openalex-snapshot
Reverse Mathematics and Grundy colorings of graphs
inferred← citeshttps://doi.org/10.1007/11537311_35openalex-snapshot
The Maximum Resource Bin Packing Problem
inferred← citeshttps://doi.org/10.1007/11549345_26openalex-snapshot
Online Interval Coloring with Packing Constraints
inferred← citeshttps://doi.org/10.1007/11785293_6openalex-snapshot
Variable Sized Online Interval Coloring with Bandwidth
inferred← citeshttps://doi.org/10.1007/11970125_10openalex-snapshot
A Randomized Algorithm for Online Unit Clustering
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_264openalex-snapshot
Online Interval Coloring
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_264openalex-snapshot
Online Interval Coloring
inferred← citeshttps://doi.org/10.1007/978-3-030-26176-4_40openalex-snapshot
Data Structures for Incremental Interval Coloring
inferred← citeshttps://doi.org/10.1007/978-3-032-06706-7_11openalex-snapshot
On the FirstFit Algorithm for Online Unit-Interval Coloring
inferred← citeshttps://doi.org/10.1007/978-3-319-51963-0_25openalex-snapshot
Lower Bounds for On-line Interval Coloring with Vector and Cardinality Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_22openalex-snapshot
Online Capacitated Interval Coloring
inferred← citeshttps://doi.org/10.1007/978-3-540-77918-6_12openalex-snapshot
On the Max Coloring Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_264-2openalex-snapshot
Online Interval Coloring
inferred← citeshttps://doi.org/10.1007/s00224-007-9085-7openalex-snapshot
A Randomized Algorithm for Online Unit Clustering
inferred← citeshttps://doi.org/10.1007/s00373-019-02125-zopenalex-snapshot
Online Coloring a Token Graph
inferred← citeshttps://doi.org/10.1007/s00453-007-9071-0openalex-snapshot
Variable Sized Online Interval Coloring with Bandwidth
inferred← citeshttps://doi.org/10.1007/s00453-022-01043-6openalex-snapshot
Improved Algorithms for Scheduling Unsplittable Flows on Paths
inferred← citeshttps://doi.org/10.1007/s10878-017-0180-7openalex-snapshot
Online lazy bureaucrat scheduling with a machine deadline
inferred← citeshttps://doi.org/10.1007/s44425-025-00018-3openalex-snapshot
Results on the Connected Greedy Coloring Game
inferred← citeshttps://doi.org/10.1016/j.ejc.2024.103919openalex-snapshot
Online coloring of short intervals
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.06.001openalex-snapshot
The maximum resource bin packing problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.05.018openalex-snapshot
Online interval coloring with packing constraints
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.07.037openalex-snapshot
On the max coloring problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.10.029openalex-snapshot
A new lower bound for the on-line coloring of intervals with bandwidth
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.06.024openalex-snapshot
Dynamic data structures for interval coloring
inferred← citeshttps://doi.org/10.1109/icdcs60910.2024.00025openalex-snapshot
Learning Minimum Linear Arrangement of Cliques and Lines
inferred← citeshttps://doi.org/10.1137/070682496openalex-snapshot
Online Capacitated Interval Coloring
inferred← citeshttps://doi.org/10.1145/3444815.3444830openalex-snapshot
SIGACT News Online Algorithms Column 36
inferred← citeshttps://doi.org/10.1587/transfun.e99.a.1885openalex-snapshot
A Tight Analysis of Kierstead-Trotter Algorithm for Online Unit Interval Coloring
inferred← citeshttps://doi.org/10.17760/d20316237openalex-snapshot
Scheduling flows and coflows in networks
inferred← citeshttps://doi.org/10.18297/etd/3974openalex-snapshot
The on-line width of various classes of posets.
inferred← citeshttps://doi.org/10.48550/arxiv.1702.03536openalex-snapshot
A new lower bound for the on-line coloring of intervals with bandwidth
inferred← citeshttps://doi.org/10.70675/ad0325a2zac94z4825z926dz7f1ac4ce2b33openalex-snapshot
Criticalité, identification et jeux de suppression de sommets dans les graphes : Des étoiles plein les jeux
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.