On the public citation graph

Online Interval Coloring with Packing Constraints

0 signed · 28 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9781118032497openalex-snapshot
Graph Coloring Problems
inferredcites →https://doi.org/10.1002/nav.10058openalex-snapshot
Approximation schemes for ordered vector packing problems
inferredcites →https://doi.org/10.1007/11523468_49openalex-snapshot
Online Interval Coloring and Variants
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/bfb0029568openalex-snapshot
On-line packing and covering problems
inferredcites →https://doi.org/10.1016/0012-365x(94)00285-qopenalex-snapshot
Coloring interval graphs with first-fit
inferredcites →https://doi.org/10.1016/0097-3165(76)90001-7openalex-snapshot
Resource constrained scheduling as generalized bin packing
inferredcites →https://doi.org/10.1016/j.dam.2003.05.006openalex-snapshot
Algorithms for on-line bin-packing problems with cardinality constraints
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/321906.321917openalex-snapshot
Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
inferredcites →https://doi.org/10.1145/322017.322032openalex-snapshot
Errata: `` Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems''
inferredcites →https://doi.org/10.1147/rd.215.0443openalex-snapshot
Multidimensional Bin Packing Algorithms
inferredcites →https://doi.org/10.1287/opre.51.5.759.16753openalex-snapshot
The Ordered Open-End Bin-Packing Problem
inferredcites →https://doi.org/10.5555/982792.982876openalex-snapshot
Buffer minimization using max-coloring
inferredcites →https://doi.org/10.5860/choice.32-6283openalex-snapshot
Graph coloring problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11785293_6openalex-snapshot
Variable Sized Online Interval Coloring with Bandwidth
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-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/s00453-007-9071-0openalex-snapshot
Variable Sized Online Interval Coloring with Bandwidth
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.1137/070682496openalex-snapshot
Online Capacitated Interval Coloring
inferred← citeshttps://doi.org/10.1145/1122480.1122499openalex-snapshot
2005
inferred← citeshttps://doi.org/10.48550/arxiv.1702.03536openalex-snapshot
A new lower bound for the on-line coloring of intervals with bandwidth
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.