On the public citation graph
Online Coloring Known Graphs
0 signed · 24 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11758471_28openalex-snapshot
On-Line Coloring of H-Free Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_26openalex-snapshot
Removable Online Knapsack Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-52113-3_19openalex-snapshot
The Complexity of Online Graph Games
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_2openalex-snapshot
Online Chromatic Number is PSPACE-Complete
inferred← citeshttps://doi.org/10.1007/978-3-540-31833-0_21openalex-snapshot
Strong Colorings of Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00373-019-02125-zopenalex-snapshot
Online Coloring a Token Graph
inferred← citeshttps://doi.org/10.1007/s10801-013-0438-9openalex-snapshot
Jack vertex operators and realization of Jack functions
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.11.003openalex-snapshot
Applications of a Laplace–Beltrami operator for Jack polynomials
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.03.001openalex-snapshot
Online coloring of hypergraphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00411-xopenalex-snapshot
Online independent sets
inferred← citeshttps://doi.org/10.1109/sc.2016.29openalex-snapshot
Graph Colouring as a Challenge Problem for Dynamic Graph Processing on Distributed Systems
inferred← citeshttps://doi.org/10.1109/wcnc.2006.1683432openalex-snapshot
Online pn offset planning: an example of cellular network autoconfiguration
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2005.00497.xopenalex-snapshot
On-line maximum-order induced hereditary subgraph problems
inferred← citeshttps://doi.org/10.24355/dbbs.084-201103151022-0openalex-snapshot
Optimal Sorting Of Rolling Stock
inferred← citeshttps://doi.org/10.48550/arxiv.1506.08592openalex-snapshot
Adding Isolated Vertices Makes some Online Algorithms Optimal
inferred← citeshttps://doi.org/10.48550/arxiv.1601.00252openalex-snapshot
Greedy online colouring with buffering
inferred← citeshttps://doi.org/10.5555/3014904.3014945openalex-snapshot
Graph colouring as a challenge problem for dynamic graph processing on distributed systems
inferred← citeshttps://doi.org/10.70675/b9a69b41z56efz40ccz814dza2639f67b149openalex-snapshot
Reconfiguration and combinatorial games
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.