On the public citation graph
Graph labelings derived from models in distributed computing: A complete complexity classification
0 signed · 31 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.1007/3-540-36379-3_18openalex-snapshot
Generalized H-Coloring and H-Covering of Trees
inferredcites →https://doi.org/10.1007/3-540-59071-4_40openalex-snapshot
Complexity of graph covering problems
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_26openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-3-540-24727-2_8openalex-snapshot
Election and Local Computations on Edges
inferredcites →https://doi.org/10.1007/978-3-540-39890-5_26openalex-snapshot
Complexity of Hypergraph Coloring and Seidel’s Switching
inferredcites →https://doi.org/10.1007/978-3-642-13073-1_25openalex-snapshot
Packing Bipartite Graphs with Covers of Complete Bipartite Graphs
inferredcites →https://doi.org/10.1007/bfb0017162openalex-snapshot
On the computational complexity of codes in graphs
inferredcites →https://doi.org/10.1016/j.dam.2012.08.026openalex-snapshot
Packing bipartite graphs with covers of complete bipartite graphs
inferredcites →https://doi.org/10.1016/j.ejc.2007.11.006openalex-snapshot
Locally constrained graph homomorphisms and equitable partitions
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.029openalex-snapshot
A complete complexity classification of the role assignment problem
inferredcites →https://doi.org/10.1016/s0020-0190(97)00022-7openalex-snapshot
Distributed enumeration
inferredcites →https://doi.org/10.1017/cbo9781139168724openalex-snapshot
Introduction to Distributed Algorithms
inferredcites →https://doi.org/10.1109/71.481599openalex-snapshot
Computing on anonymous networks. I. Characterizing the solvable cases
inferredcites →https://doi.org/10.1109/71.481600openalex-snapshot
Computing on anonymous networks. II. Decision and membership problems
inferredcites →https://doi.org/10.1109/71.798313openalex-snapshot
Leader election problem on networks in which processor identity numbers are not distinct
inferredcites →https://doi.org/10.1145/800141.804655openalex-snapshot
Local and global properties in networks of processors (Extended Abstract)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-15914-5_9openalex-snapshot
An Algorithmic Framework for Locally Constrained Homomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-031-27051-2_1openalex-snapshot
Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult
inferred← citeshttps://doi.org/10.1007/978-3-031-43380-1_8openalex-snapshot
Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)
inferred← citeshttps://doi.org/10.1016/j.dam.2012.08.026openalex-snapshot
Packing bipartite graphs with covers of complete bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2026.01.019openalex-snapshot
Computational complexity of covering coloured mixed multigraphs with simple degree partitions
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103714openalex-snapshot
Computational complexity of covering multigraphs with semi-edges: Small cases
inferred← citeshttps://doi.org/10.1137/22m1513290openalex-snapshot
An Algorithmic Framework for Locally Constrained Homomorphisms
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2021.21openalex-snapshot
Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases
inferred← citeshttps://doi.org/10.6000/2371-1647.2015.01.02openalex-snapshot
A Unified Framework for Integer Programming Formulation of Graph Matching Problems
inferred← citeshttps://doi.org/10.70675/88f9e6c5z1be6z43f3z9f7ez0814c78e9baeopenalex-snapshot
Graphes, Partitions et Classes : G-graphs et leurs applications
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.