On the public citation graph
A self-stabilizing algorithm for coloring planar graphs
0 signed · 94 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-10704-5_2openalex-snapshot
A linear algorithm for five-coloring a planar graph
inferredcites →https://doi.org/10.1007/bf01840403openalex-snapshot
Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
inferredcites →https://doi.org/10.1007/bf01843566openalex-snapshot
A belated proof of self-stabilization
inferredcites →https://doi.org/10.1090/s0002-9904-1976-14122-5openalex-snapshot
Every planar map is four colorable
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
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.5033616openalex-extracted
Locally-Iterative (Δ+1)-Coloring in Sublinear (in Δ) Rounds
inferred← citeshttps://doi.org/10.1002/net.20067openalex-snapshot
Minimal feedback vertex sets in directed split‐stars
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1833openalex-snapshot
A Stabilizing Algorithm for Finding Biconnected Components
inferred← citeshttps://doi.org/10.1007/11785231_120openalex-snapshot
Self-stabilizing Algorithms for Graph Coloring with Improved Performance Guarantees
inferred← citeshttps://doi.org/10.1007/11795490_11openalex-snapshot
A Self-stabilizing Link-Coloring Protocol Resilient to Unbounded Byzantine Faults in Arbitrary Networks
inferred← citeshttps://doi.org/10.1007/3-540-40026-5_15openalex-snapshot
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement
inferred← citeshttps://doi.org/10.1007/3-540-44681-8_67openalex-snapshot
Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler
inferred← citeshttps://doi.org/10.1007/3-540-45982-0_6openalex-snapshot
Self-Stabilizing Distributed Algorithms for Defeat Status Computation in Argumentation
inferred← citeshttps://doi.org/10.1007/978-3-030-03232-6_13openalex-snapshot
Acyclic Strategy for Silent Self-stabilization in Spanning Forests
inferred← citeshttps://doi.org/10.1007/978-3-031-02013-1openalex-snapshot
Introduction to Distributed Self-Stabilizing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-03089-0_34openalex-snapshot
Self-stabilizing DAG-Constructing Protocols with Application to Geocast in MANET
inferred← citeshttps://doi.org/10.1007/978-3-540-27820-7_6openalex-snapshot
A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-27860-3_18openalex-snapshot
Transformations for Write-All-with-Collision Model
inferred← citeshttps://doi.org/10.1007/978-3-540-69355-0_20openalex-snapshot
Self-stabilizing Cuts in Synchronous Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_8openalex-snapshot
A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives
inferred← citeshttps://doi.org/10.1007/978-3-540-77444-0_19openalex-snapshot
A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_15openalex-snapshot
Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-89335-6_5openalex-snapshot
Distance-2 Self-stabilizing Algorithm for a b-Coloring of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_16openalex-snapshot
Stability of Distributed Algorithms in the Face of Incessant Faults
inferred← citeshttps://doi.org/10.1007/978-3-642-11476-2_19openalex-snapshot
An Efficient Self-stabilizing Distance-2 Coloring Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_31openalex-snapshot
Analysis of an Iterated Local Search Algorithm for Vertex Coloring
inferred← citeshttps://doi.org/10.1007/978-3-642-35452-6_6openalex-snapshot
Randomized Self-stabilization under Distributed Daemon for 6-Coloring Planar Graph
inferred← citeshttps://doi.org/10.1007/s00224-002-1032-zopenalex-snapshot
Competitive Call Control in Mobile Networks
inferred← citeshttps://doi.org/10.1007/s00446-003-0087-7openalex-snapshot
Alternators on uniform rings of odd size
inferred← citeshttps://doi.org/10.1007/s004460050034openalex-snapshot
A self-stabilizing algorithm for the maximum flow problem
inferred← citeshttps://doi.org/10.1007/s004460050055openalex-snapshot
A self-stabilizing algorithm for bridge finding
inferred← citeshttps://doi.org/10.1007/s00453-010-9447-4openalex-snapshot
A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives
inferred← citeshttps://doi.org/10.1007/s11786-011-0081-6openalex-snapshot
Improved Self-Stabilizing Algorithms for L(2, 1)-Labeling Tree Networks
inferred← citeshttps://doi.org/10.1016/j.artint.2005.02.003openalex-snapshot
Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems
inferred← citeshttps://doi.org/10.1016/j.comcom.2005.05.016openalex-snapshot
Transformations for write-all-with-collision model
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.03.005openalex-snapshot
Self-stabilizing coloration in anonymous planar networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.09.004openalex-snapshot
A self-stabilizing ()-edge-coloring algorithm for planar graphs in anonymous uniform systems
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.01.013openalex-snapshot
A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.05.010openalex-snapshot
A new self-stabilizing algorithm for maximal p-star decomposition of general graphs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.11.006openalex-snapshot
A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.008openalex-snapshot
A self-stabilizing algorithm for cut problems in synchronous networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.044openalex-snapshot
Local 7-coloring for planar subgraphs of unit disk graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.034openalex-snapshot
An efficient self-stabilizing distance-2 coloring algorithm
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114744openalex-snapshot
Resource efficient stabilization for local tasks despite unknown capacity links
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115456openalex-snapshot
Locally-iterative (Δ + 1)-coloring in sublinear (in Δ) rounds
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00158-2openalex-snapshot
Optimal 1-fair alternators
inferred← citeshttps://doi.org/10.1016/s0020-0190(03)00299-0openalex-snapshot
Linear time self-stabilizing colorings
inferred← citeshttps://doi.org/10.1016/s0020-0255(99)00028-6openalex-snapshot
A self-stabilizing algorithm for minimum-depth search of graphs
inferred← citeshttps://doi.org/10.1016/s0898-1221(03)90143-xopenalex-snapshot
Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
inferred← citeshttps://doi.org/10.1023/a:1012719525108openalex-snapshot
Distributed Long-Lived List Colouring: How to Dynamically Allocate Frequencies in Cellular Networks
inferred← citeshttps://doi.org/10.1080/09528130110116642openalex-snapshot
Argumentation through a distributed self-stabilizing approach
inferred← citeshttps://doi.org/10.1093/comjnl/bxz102openalex-snapshot
Polynomial Silent Self-Stabilizing p-Star Decomposition†
inferred← citeshttps://doi.org/10.1109/71.920585openalex-snapshot
Self-stabilizing strong fairness under weak fairness
inferred← citeshttps://doi.org/10.1109/ftxs49593.2019.00011openalex-snapshot
Self-stabilizing Connected Components
inferred← citeshttps://doi.org/10.1109/icapp.1995.472220openalex-snapshot
Self-stabilizing algorithms for tree metrics
inferred← citeshttps://doi.org/10.1109/iccs.2008.4737446openalex-snapshot
Distributed algorithm for cooperative coverage provisioning in mobile cellular networks
inferred← citeshttps://doi.org/10.1109/ipdps.2001.925027openalex-snapshot
A distributed self-stabilizing algorithm for argumentation
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016537openalex-snapshot
Fault tolerant distributed coloring algorithms that stabilize in linear time
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303177openalex-snapshot
Fault tolerant algorithms for orderings and colorings
inferred← citeshttps://doi.org/10.1109/ispan.1999.778938openalex-snapshot
Self-stabilizing algorithms in DAG structured networks
inferred← citeshttps://doi.org/10.1109/issre.1993.624289openalex-snapshot
A new fault tolerant distributed algorithm for longest paths in a DAG
inferred← citeshttps://doi.org/10.1109/istcs.1993.253472openalex-snapshot
Structured design of self-stabilizing programs
inferred← citeshttps://doi.org/10.1109/lcomm.2008.080786openalex-snapshot
Distributed Algorithm for Real Time Cooperative Synthesis of Wireless Cell Coverage Patterns
inferred← citeshttps://doi.org/10.1109/pccc.1995.472471openalex-snapshot
A self-stabilizing shortest path algorithm in a DAG
inferred← citeshttps://doi.org/10.1109/pccc.1995.472519openalex-snapshot
A self-stabilizing algorithm for the maximum flow problem
inferred← citeshttps://doi.org/10.1109/pdcat.2009.71openalex-snapshot
A Self-Stabilizing (Δ+ 1)- Edge-Coloring Algorithm of Arbitrary Graphs
inferred← citeshttps://doi.org/10.1109/sai.2016.7556052openalex-snapshot
An efficient self-stabilizing vertex coloring algorithm
inferred← citeshttps://doi.org/10.1109/sitis.2009.61openalex-snapshot
A Self-Stabilizing Web Services Communities Management Scheme
inferred← citeshttps://doi.org/10.1109/spdp.1996.570312openalex-snapshot
Distributed list coloring: how to dynamically allocate frequencies to mobile base stations
inferred← citeshttps://doi.org/10.1109/srds.2009.13openalex-snapshot
A Self-Stabilizing O(n)-Round k-Clustering Algorithm
inferred← citeshttps://doi.org/10.1109/srds51746.2020.00009openalex-snapshot
Benefits of Stabilization versus Rollback in Self-Stabilizing Graph-Based Applications on Eventually Consistent Key-Value Stores
inferred← citeshttps://doi.org/10.1109/tcns.2018.2809963openalex-snapshot
Scheduled-Asynchronous Distributed Algorithm for Optimal Power Flow
inferred← citeshttps://doi.org/10.1109/tcomm.2012.121112.110580openalex-snapshot
Distributed Dynamic Frequency Allocation in Fractional Frequency Reused Relay Based Cellular Networks
inferred← citeshttps://doi.org/10.1109/tsp.2014.2340812openalex-snapshot
Distributed Compressed Sensing for Static and Time-Varying Networks
inferred← citeshttps://doi.org/10.1137/s0097539798427156openalex-snapshot
Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
inferred← citeshttps://doi.org/10.1142/s012905410500284xopenalex-snapshot
SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS
inferred← citeshttps://doi.org/10.1142/s0129054111008623openalex-snapshot
SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS
inferred← citeshttps://doi.org/10.1142/s0129054199000046openalex-snapshot
A SELF-STABILIZING ALGORITHM FOR FINDING ARTICULATION POINTS
inferred← citeshttps://doi.org/10.1142/s0129626499000529openalex-snapshot
SELF-STABILIZING ALGORITHMS IN DAG STRUCTURED NETWORKS
inferred← citeshttps://doi.org/10.1145/197917.198130openalex-snapshot
Self-stabilizing algorithms for finding centers and medians of trees
inferred← citeshttps://doi.org/10.1145/331697.332329openalex-snapshot
Fault-containing network protocols
inferred← citeshttps://doi.org/10.15480/882.1091openalex-snapshot
Time- and space-efficient self-stabilizing algorithms
inferred← citeshttps://doi.org/10.2200/s00908ed1v01y201903dct015openalex-snapshot
Introduction to Distributed Self-Stabilizing Algorithms
inferred← citeshttps://doi.org/10.4018/978-1-4666-2533-4.ch005openalex-snapshot
Self-Stabilizing Graph Coloring Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1910.08248openalex-snapshot
Benefits of Stabilization versus Rollback in Eventually Consistent Key-Value Stores
inferred← citeshttps://doi.org/10.48550/arxiv.2002.05382openalex-snapshot
Ressource Efficient Stabilization for Local Tasks despite Unknown Capacity Links
inferred← citeshttps://doi.org/10.48550/arxiv.2007.14218openalex-snapshot
Technical Report: Benefits of Stabilization versus Rollback in Self-Stabilizing Graph-Based Applications on Eventually Consistent Key-Value Stores
inferred← citeshttps://doi.org/10.5860/choice.33-0987openalex-snapshot
Introduction to distributed algorithms
inferred← citeshttps://doi.org/10.6688/jise.2010.26.1.12openalex-snapshot
A Fault-Containing Self-Stabilizing Algorithm for 6-Coloring Planar Graphs
inferred← citeshttps://doi.org/10.7936/k7ht2mjjopenalex-snapshot
Studying Network Optimization in the Context of Self-Stabilization
inferred← citeshttps://doi.org/10.7936/k7ng4nw0openalex-snapshot
Self-Stabilization in the Distributed Systems of Finite State Machines
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.