On the public citation graph
Coloring inductive graphs on-line
0 signed · 92 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/jgt.3190120212openalex-snapshot
On‐line and first fit colorings of graphs
inferredcites →https://doi.org/10.1007/bf02124674openalex-snapshot
A Dynamic location problem for graphs
inferredcites →https://doi.org/10.1016/0012-365x(89)90096-4openalex-snapshot
An on-line graph coloring algorithm with sublinear performance ratio
inferredcites →https://doi.org/10.1016/s0167-5060(08)70584-3openalex-snapshot
An On-Line Graph Coloring Algorithm with Sublinear Performance Ratio
inferredcites →https://doi.org/10.1109/fscs.1990.89567openalex-snapshot
Randomized online graph coloring
inferredcites →https://doi.org/10.1109/sfcs.1991.185422openalex-snapshot
Search problems in the decision tree model
inferredcites →https://doi.org/10.1137/0401048openalex-snapshot
The Linearity of First-Fit Coloring of Interval Graphs
inferredcites →https://doi.org/10.1145/2465.214917openalex-snapshot
Reduced instruction set computers
inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1145/800230.806984openalex-snapshot
Register allocation & spilling via graph coloring
inferredcites →https://doi.org/10.1145/872726.806984openalex-snapshot
Register allocation & spilling via graph coloring
inferredcites →https://doi.org/10.5555/71777.71779openalex-snapshot
On the performance of on-line algorithms for partition problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0471224561.ch16openalex-snapshot
Broadcast Scheduling for TDMA in Wireless Multihop Networks
inferred← citeshttps://doi.org/10.1006/inco.2001.3057openalex-snapshot
Delayed Information and Action in On-Line Algorithms
inferred← citeshttps://doi.org/10.1006/jagm.1996.0827openalex-snapshot
On-Line Coloring of Sparse Random Graphs and Random Trees
inferred← citeshttps://doi.org/10.1006/jagm.1999.1068openalex-snapshot
Distributed Online Frequency Assignment in Cellular Networks
inferred← citeshttps://doi.org/10.1007/11429647_8openalex-snapshot
A Tight Bound for Online Coloring of Disk Graphs
inferred← citeshttps://doi.org/10.1007/11533719_74openalex-snapshot
On the Power of Lookahead in On-Line Vehicle Routing Problems
inferred← citeshttps://doi.org/10.1007/11671541_3openalex-snapshot
Approximation Algorithms for Path Coloring in Trees
inferred← citeshttps://doi.org/10.1007/11671541_5openalex-snapshot
Independence and Coloring Problems on Intersection Graphs of Disks
inferred← citeshttps://doi.org/10.1007/11750321_1openalex-snapshot
On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_2openalex-snapshot
Online Algorithms: A Study of Graph-Theoretic Concepts
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_16openalex-snapshot
The Graph Coloring Problem: A Bibliographic Survey
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_20openalex-snapshot
Optimization Problems in Optical Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-04651-4_10openalex-snapshot
Generating Algebraic Expressions for Labeled Grid Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-60924-4_22openalex-snapshot
Online Graph Coloring with Predictions
inferred← citeshttps://doi.org/10.1007/978-3-319-14974-5_19openalex-snapshot
Algebraic Expressions of Rhomboidal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24838-5_30openalex-snapshot
Approximating Interval Coloring and Max-Coloring in Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_14openalex-snapshot
Online Algorithms for Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-30550-7_2openalex-snapshot
Some New Directions and Questions in Parameterized Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-31833-0_21openalex-snapshot
Strong Colorings of Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_21openalex-snapshot
Online Conflict-Free Colorings for Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_56openalex-snapshot
External-Memory Network Analysis Algorithms for Naturally Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-24372-1_16openalex-snapshot
Formal Analysis of Online Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-38756-2_12openalex-snapshot
A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_43openalex-snapshot
Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
inferred← citeshttps://doi.org/10.1007/bfb0028544openalex-snapshot
Distributed online frequency assignment in cellular networks
inferred← citeshttps://doi.org/10.1007/bfb0054353openalex-snapshot
An approximation scheme for bin packing with conflicts
inferred← citeshttps://doi.org/10.1007/pl00009158openalex-snapshot
On the Influence of Lookahead in Competitive Paging Algorithms
inferred← citeshttps://doi.org/10.1007/s002240000100openalex-snapshot
Competitive Analysis of On-Line Disk Scheduling
inferred← citeshttps://doi.org/10.1007/s00453-016-0172-5openalex-snapshot
Online Makespan Minimization with Parallel Schedules
inferred← citeshttps://doi.org/10.1007/s00453-020-00759-7openalex-snapshot
Tight Bounds for Online Coloring of Basic Graph Classes
inferred← citeshttps://doi.org/10.1007/s10878-015-9900-zopenalex-snapshot
First-Fit colorings of graphs with no cycles of a prescribed even length
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00118-wopenalex-snapshot
Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs
inferred← citeshttps://doi.org/10.1016/j.aim.2019.106884openalex-snapshot
R.e. prime powers and total rigidity
inferred← citeshttps://doi.org/10.1016/j.comgeo.2023.102020openalex-snapshot
Colouring bottomless rectangles and arborescences
inferred← citeshttps://doi.org/10.1016/j.compfluid.2022.105700openalex-snapshot
Efficacy of line-based explicit and compact high-order finite difference schemes for hybrid unstructured grids
inferred← citeshttps://doi.org/10.1016/j.dam.2016.01.011openalex-snapshot
Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.08.063openalex-snapshot
Incorporating predictions in online graph coloring algorithms
inferred← citeshttps://doi.org/10.1016/j.disc.2012.03.029openalex-snapshot
First-fit chromatic numbers of d -degenerate graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114326openalex-snapshot
Spectral upper bounds for the Grundy number of a graph
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114502openalex-snapshot
O(VE) time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with large girth
inferred← citeshttps://doi.org/10.1016/j.endm.2015.05.036openalex-snapshot
A Note on Algebraic Expressions of Rhomboidal Labeled Graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.08.006openalex-snapshot
A note on the online First-Fit algorithm for coloring k-inductive graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.12.008openalex-snapshot
Non-clairvoyant scheduling with conflicts for unit-size jobs
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.08.002openalex-snapshot
Online promise problems with online width metrics
inferred← citeshttps://doi.org/10.1016/j.neucom.2014.06.039openalex-snapshot
Constrained Semi-Supervised Growing Self-Organizing Map
inferred← citeshttps://doi.org/10.1016/j.omega.2015.10.009openalex-snapshot
A general modeling approach to online optimization with lookahead
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.025openalex-snapshot
A tight bound for online colouring of disk graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.04.026openalex-snapshot
On the complexity of injective colorings and its generalizations
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00109-5openalex-snapshot
On the performance of the first-fit coloring algorithm on permutation graphs
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80049-9openalex-snapshot
Chapter 16 A survey of recursive combinatorics
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80051-7openalex-snapshot
Chapter 18 Recursive and on-line graph coloring
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00089-5openalex-snapshot
On-line coloring of geometric intersection graphs
inferred← citeshttps://doi.org/10.1017/s0963548309990587openalex-snapshot
Online Conflict-Free Colouring for Hypergraphs
inferred← citeshttps://doi.org/10.1023/a:1009871302966openalex-snapshot
An Approximation Scheme for Bin Packing with Conflicts
inferred← citeshttps://doi.org/10.1023/a:1012311216333openalex-snapshot
Models and Approximation Algorithms for Channel Assignment in Radio Networks
inferred← citeshttps://doi.org/10.1109/ccc.2003.1214417openalex-snapshot
Parameterized complexity for the skeptic
inferred← citeshttps://doi.org/10.1109/tmc.2011.215openalex-snapshot
Using Partially Overlapping Channels to Improve Throughput in Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1109/tmc.2014.2360389openalex-snapshot
Simplicial Homology for Future Cellular Networks
inferred← citeshttps://doi.org/10.1109/tpds.2008.53openalex-snapshot
Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks
inferred← citeshttps://doi.org/10.1137/060672479openalex-snapshot
On the First-Fit Chromatic Number of Graphs
inferred← citeshttps://doi.org/10.1137/110854394openalex-snapshot
First-Fit Coloring of Incomparability Graphs
inferred← citeshttps://doi.org/10.1137/19m1275085openalex-snapshot
Effective Wireless Scheduling via Hypergraph Sketches
inferred← citeshttps://doi.org/10.1145/1064546.1180619openalex-snapshot
Approximating interval coloring and max-coloring in chordal graphs
inferred← citeshttps://doi.org/10.1145/1281192.1281221openalex-snapshot
Efficient incremental constrained clustering
inferred← citeshttps://doi.org/10.1145/1978782.1978790openalex-snapshot
Max-coloring and online coloring with bandwidths on interval graphs
inferred← citeshttps://doi.org/10.1145/237814.238001openalex-snapshot
Lower bounds for on-line graph problems with application to on-line circuit and optical routing
inferred← citeshttps://doi.org/10.1145/2488608.2488730openalex-snapshot
Tight bounds for online vector bin packing
inferred← citeshttps://doi.org/10.2514/1.j055141openalex-snapshot
Turbulent and Unsteady Flows on Unstructured Line-Based Hamiltonian Paths and Strands Grids
inferred← citeshttps://doi.org/10.2514/6.2016-1056openalex-snapshot
Unstructured/Structured Overset Methods for Flow Solver Using Hamiltonian Paths and Strand Grids
inferred← citeshttps://doi.org/10.2514/6.2017-1194openalex-snapshot
On the Accuracy and Convergence of a Hamiltonian-Strand Approach for Aerodynamic Flows
inferred← citeshttps://doi.org/10.26686/wgtn.20279553openalex-snapshot
Adversarial and Online Algorithms
inferred← citeshttps://doi.org/10.3990/1.9789036536264openalex-snapshot
Algorithmic and structural aspects of graph partitioning and related problems
inferred← citeshttps://doi.org/10.48550/arxiv.1106.6336openalex-snapshot
External-Memory Network Analysis Algorithms for Naturally Sparse Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1601.00252openalex-snapshot
Greedy online colouring with buffering
inferred← citeshttps://doi.org/10.5555/982792.982876openalex-snapshot
Buffer minimization using max-coloring
inferred← citeshttps://doi.org/10.5861/ijrsc.2012.137openalex-snapshot
Strong fault-tolerant conflict-free coloring (Strong FTCF Coloring) for intervals
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.