On the public citation graph
Distributed Dominating Set Approximations beyond Planar Graphs
0 signed · 52 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/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-319-25258-2_15openalex-snapshot
A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation
inferredcites →https://doi.org/10.1007/978-3-540-87779-0_27openalex-snapshot
Leveraging Linial’s Locality Limit
inferredcites →https://doi.org/10.1007/978-3-540-87779-0_6openalex-snapshot
Fast Distributed Approximations in Planar Graphs
inferredcites →https://doi.org/10.1007/978-3-642-15763-9_48openalex-snapshot
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
inferredcites →https://doi.org/10.1007/978-3-642-27875-4openalex-snapshot
Sparsity (Graphs, Structures, and Algorithms)
inferredcites →https://doi.org/10.1007/978-3-662-48350-3_60openalex-snapshot
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
inferredcites →https://doi.org/10.1007/bf02570718openalex-snapshot
Almost optimal set covers in finite VC-dimension
inferredcites →https://doi.org/10.1007/s00446-013-0186-zopenalex-snapshot
Distributed minimum dominating set approximations in restricted families of graphs
inferredcites →https://doi.org/10.1007/s004530010020openalex-snapshot
Diameter and Treewidth in Minor-Closed Graph Families
inferredcites →https://doi.org/10.1007/s00493-003-0037-9openalex-snapshot
Local Tree-Width, Excluded Minors, and Approximation Algorithms
inferredcites →https://doi.org/10.1016/0012-365x(75)90058-8openalex-snapshot
On the ratio of optimal integral and fractional covers
inferredcites →https://doi.org/10.1016/j.ipl.2005.03.010openalex-snapshot
Hitting sets when the VC-dimension is small
inferredcites →https://doi.org/10.1016/j.ipl.2013.11.008openalex-snapshot
A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs
inferredcites →https://doi.org/10.1016/j.ipl.2017.01.011openalex-snapshot
Tight approximation bounds for dominating set on graphs of bounded arboricity
inferredcites →https://doi.org/10.1016/j.ipl.2019.01.006openalex-snapshot
Greedy domination on biclique-free graphs
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1137/0221015openalex-snapshot
Locality in Distributed Graph Algorithms
inferredcites →https://doi.org/10.1145/174644.174650openalex-snapshot
Approximation algorithms for NP-complete problems on planar graphs
inferredcites →https://doi.org/10.1145/2484239.2484244openalex-snapshot
Stone age distributed computing
inferredcites →https://doi.org/10.1145/2591796.2591884openalex-snapshot
Analytical approach to parallel repetition
inferredcites →https://doi.org/10.1145/2933057.2933084openalex-snapshot
A Local Constant Factor MDS Approximation for Bounded Genus Graphs
inferredcites →https://doi.org/10.1145/3210377.3210383openalex-snapshot
Distributed Domination on Graph Classes of Bounded Expansion
inferredcites →https://doi.org/10.14279/depositonce-6538openalex-snapshot
Structural graph theory meets algorithms: covering and connectivity problems in graphs
inferredcites →https://doi.org/10.48550/arxiv.1202.1186openalex-snapshot
Stone Age Distributed Computing
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-030-79527-6_19openalex-snapshot
Constant Round Distributed Domination on Graph Classes with Bounded Expansion
inferred← citeshttps://doi.org/10.1007/978-3-031-09993-9_9openalex-snapshot
Local Planar Domination Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-74498-3_20openalex-snapshot
Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion
inferred← citeshttps://doi.org/10.1007/s00446-023-00447-zopenalex-snapshot
Near-optimal distributed dominating set in bounded arboricity graphs
inferred← citeshttps://doi.org/10.1007/s00446-025-00496-6openalex-snapshot
Narrowing the LOCAL–CONGEST gaps in sparse networks via expander decompositions
inferred← citeshttps://doi.org/10.1007/s00453-021-00823-wopenalex-snapshot
Compact Distributed Certification of Planar Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2022.10.004openalex-snapshot
Local certification of graphs with bounded genus
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103773openalex-snapshot
Distributed domination on sparse graph classes
inferred← citeshttps://doi.org/10.1109/infocom.2019.8737382openalex-snapshot
On the Power of Preprocessing in Decentralized Network Optimization
inferred← citeshttps://doi.org/10.1109/mswim67937.2025.11308770openalex-snapshot
DS-Based Optimization Algorithms for Resource Allocation in Wireless Communication
inferred← citeshttps://doi.org/10.1145/3382734.3404505openalex-snapshot
Compact Distributed Certification of Planar Graphs
inferred← citeshttps://doi.org/10.1145/3519270.3538423openalex-snapshot
Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions
inferred← citeshttps://doi.org/10.1145/3519270.3538437openalex-snapshot
Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs
inferred← citeshttps://doi.org/10.1145/3583668.3594562openalex-snapshot
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs
inferred← citeshttps://doi.org/10.1145/3583668.3594604openalex-snapshot
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
inferred← citeshttps://doi.org/10.1145/3805031openalex-snapshot
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
inferred← citeshttps://doi.org/10.1145/3816782.3819190openalex-snapshot
Distributed Dominating Set With Optimal Rounds and Message Size in Bounded Arboricity Graphs
inferred← citeshttps://doi.org/10.3390/a18050280openalex-snapshot
A Local 6-Approximation Distributed Algorithm for Minimum Dominating Set Problem in Planar Triangle-Free Graphs
inferred← citeshttps://doi.org/10.4230/lipics.disc.2021.13openalex-snapshot
A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1812.00854openalex-snapshot
On the Power of Preprocessing in Decentralized Network Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.2012.04883openalex-snapshot
On Distributed Algorithms for Minimum Dominating Set problem, from theory to application
inferred← citeshttps://doi.org/10.48550/arxiv.2102.08076openalex-snapshot
Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2103.08061openalex-snapshot
On distributed algorithms for minimum dominating set problem and beyond
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.