On the public citation graph
Tight Lower Bounds for the Complexity of Multicoloring
0 signed · 40 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/1097-0037(200009)36:2<114::aid-net6>3.0.co;2-gopenalex-snapshot
Channel assignment and weighted coloring
inferredcites →https://doi.org/10.1002/jgt.3190200403openalex-snapshot
Fractional colorings with large denominators
inferredcites →https://doi.org/10.1006/inco.1995.1156openalex-snapshot
On the Structure of Parameterized Problems in NP
inferredcites →https://doi.org/10.1006/jcss.2001.1774openalex-snapshot
Which Problems Have Strongly Exponential Complexity?
inferredcites →https://doi.org/10.1007/3-540-45687-2_44openalex-snapshot
The Complexity of Tree Multicolorings
inferredcites →https://doi.org/10.1007/978-3-319-18263-6_8openalex-snapshot
Online Multi-Coloring with Advice
inferredcites →https://doi.org/10.1007/978-3-540-28629-5_2openalex-snapshot
Multicoloring: Problems and Techniques
inferredcites →https://doi.org/10.1007/978-3-662-48350-3_46openalex-snapshot
Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/s00224-007-2007-xopenalex-snapshot
Exact Algorithms for Graph Homomorphisms
inferredcites →https://doi.org/10.1007/s00224-010-9261-zopenalex-snapshot
New Plain-Exponential Time Classes for Graph Homomorphism
inferredcites →https://doi.org/10.1007/s004530010033openalex-snapshot
Optimal Reconstruction of Graphs under the Additive Model
inferredcites →https://doi.org/10.1016/0095-8956(90)90132-jopenalex-snapshot
On the complexity of H-coloring
inferredcites →https://doi.org/10.1016/0097-3165(78)90022-5openalex-snapshot
Kneser's conjecture, chromatic number, and homotopy
inferredcites →https://doi.org/10.1016/0166-218x(84)90081-7openalex-snapshot
A simplified NP-complete satisfiability problem
inferredcites →https://doi.org/10.1016/j.disc.2005.06.002openalex-snapshot
A technique for multicoloring triangle-free hexagonal graphs
inferredcites →https://doi.org/10.1016/j.disc.2007.07.015openalex-snapshot
Multicoloring and Mycielski construction
inferredcites →https://doi.org/10.1016/j.tcs.2010.02.016openalex-snapshot
Dynamic programming based algorithms for set multicover and multiset multicover problems
inferredcites →https://doi.org/10.1016/s0012-365x(00)00241-7openalex-snapshot
Channel assignment and multicolouring of the induced subgraphs of the triangular lattice
inferredcites →https://doi.org/10.1016/s0167-5060(08)70329-7openalex-snapshot
Two Results Concerning Multicoloring
inferredcites →https://doi.org/10.1137/070683933openalex-snapshot
Set Partitioning via Inclusion-Exclusion
inferredcites →https://doi.org/10.1145/3051094openalex-snapshot
Tight Lower Bounds on Graph Embedding Problems
inferredcites →https://doi.org/10.4153/cmb-1965-034-2openalex-snapshot
On a Combinatorial Problem in Number Theory
inferredcites →https://doi.org/10.46298/dmtcs.371openalex-snapshot
Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes
inferredcites →https://doi.org/10.48550/arxiv.0902.1868openalex-snapshot
Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4785217openalex-extracted
Linear Programming Complementation
inferred← citeshttps://doi.org/10.1007/s00224-023-10150-yopenalex-snapshot
Disentangling the Computational Complexity of Network Untangling
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115087openalex-snapshot
Linear Programming complementation
inferred← citeshttps://doi.org/10.1137/1.9781611975482.105openalex-snapshot
On r-Simple k-Path and Related Problems Parameterized by k/r
inferred← citeshttps://doi.org/10.1145/3397484openalex-snapshot
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints
inferred← citeshttps://doi.org/10.1145/3439721openalex-snapshot
r -Simple k -Path and Related Problems Parameterized by k / r
inferred← citeshttps://doi.org/10.1145/3665156openalex-snapshot
Structural Parameterizations for Two Bounded Degree Problems Revisited
inferred← citeshttps://doi.org/10.24963/ijcai.2022/283openalex-snapshot
Disentangling the Computational Complexity of Network Untangling
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.