On the public citation graph
Low diameter graph decompositions
0 signed · 214 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.1006/jagm.1993.1016openalex-snapshot
Sparser: A Paradigm for Running Distributed Algorithms
inferredcites →https://doi.org/10.1007/3-540-56188-9_1openalex-snapshot
Sparser: A paradigm for running distributed algorithms
inferredcites →https://doi.org/10.1007/978-3-642-50327-6openalex-snapshot
The Computation of Fixed Points and Applications
inferredcites →https://doi.org/10.1007/bf02765904openalex-snapshot
A combinatorial proof of the Borsuk-Ulam antipodal point theorem
inferredcites →https://doi.org/10.1016/0097-3165(81)90027-3openalex-snapshot
A constructive proof of Tucker's combinatorial lemma
inferredcites →https://doi.org/10.1016/0196-6774(86)90019-2openalex-snapshot
A fast and simple randomized parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1016/c2013-0-10385-6openalex-snapshot
An Introduction to Algebraic and Combinatorial Coding Theory
inferredcites →https://doi.org/10.1080/00029890.1979.11994922openalex-snapshot
The Game of Hex and the Brouwer Fixed-Point Theorem
inferredcites →https://doi.org/10.1109/fscs.1990.89547openalex-snapshot
Asymptotically tight bounds for computing with faulty arrays of processors
inferredcites →https://doi.org/10.1109/sfcs.1989.63504openalex-snapshot
Network decomposition and locality in distributed computation
inferredcites →https://doi.org/10.1137/0215074openalex-snapshot
A Simple Parallel Algorithm for the Maximal Independent Set Problem
inferredcites →https://doi.org/10.1137/0221015openalex-snapshot
Locality in Distributed Graph Algorithms
inferredcites →https://doi.org/10.1137/0401044openalex-snapshot
Parallel Symmetry-Breaking in Sparse Graphs
inferredcites →https://doi.org/10.1145/12130.12151openalex-snapshot
Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms
inferredcites →https://doi.org/10.1145/4221.4227openalex-snapshot
Complexity of network synchronization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.20727openalex-snapshot
Decomposing a graph into expanding subgraphs
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1811openalex-snapshot
Self-Stabilizing Deterministic Network Decomposition
inferred← citeshttps://doi.org/10.1007/11841036_14openalex-snapshot
Deciding Relaxed Two-Colorability—A Hardness Jump
inferred← citeshttps://doi.org/10.1007/978-3-030-54921-3_1openalex-snapshot
Network Decomposition and Distributed Derandomization (Invited Paper)
inferred← citeshttps://doi.org/10.1007/978-3-319-25258-2_15openalex-snapshot
A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-46642-0_26openalex-snapshot
Self-Stabilizing Network Decompostion
inferred← citeshttps://doi.org/10.1007/978-3-540-48413-4_9openalex-snapshot
Testing the Diameter of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-79309-0_23openalex-snapshot
The Local and Global Price of Anarchy of Graphical Games
inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_23openalex-snapshot
Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_37openalex-snapshot
On the Locality of Some NP-Complete Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_13openalex-snapshot
No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-3-662-45174-8_32openalex-snapshot
Distributed Symmetry Breaking in Hypergraphs
inferred← citeshttps://doi.org/10.1007/bf01200757openalex-snapshot
The geometry of graphs and some of its algorithmic applications
inferred← citeshttps://doi.org/10.1007/pl00008932openalex-snapshot
Some simple distributed algorithms for sparse networks
inferred← citeshttps://doi.org/10.1007/s00222-004-0400-5openalex-snapshot
Extending Lipschitz functions via random metric partitions
inferred← citeshttps://doi.org/10.1007/s00224-010-9271-xopenalex-snapshot
Distributed Approximation of Capacitated Dominating Sets
inferred← citeshttps://doi.org/10.1007/s00224-017-9842-1openalex-snapshot
Set Cover Problems with Small Neighborhood Covers
inferred← citeshttps://doi.org/10.1007/s00446-011-0127-7openalex-snapshot
Distributed algorithms for covering, packing and maximum weighted matching
inferred← citeshttps://doi.org/10.1007/s00446-012-0167-7openalex-snapshot
Distributed deterministic edge coloring using bounded neighborhood independence
inferred← citeshttps://doi.org/10.1007/s00446-013-0194-zopenalex-snapshot
No sublogarithmic-time approximation scheme for bipartite vertex cover
inferred← citeshttps://doi.org/10.1007/s00446-025-00485-9openalex-snapshot
Distributed symmetry breaking on power graphs via sparsification
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-022-00994-0openalex-snapshot
Light Spanners for High Dimensional Norms via Stochastic Decompositions
inferred← citeshttps://doi.org/10.1007/s00453-024-01266-9openalex-snapshot
Connected k-Center and k-Diameter Clustering
inferred← citeshttps://doi.org/10.1007/s00454-007-9007-0openalex-snapshot
Fréchet Embeddings of Negative Type Metrics
inferred← citeshttps://doi.org/10.1007/s00454-009-9135-9openalex-snapshot
Volume Distortion for Subsets of Euclidean Spaces
inferred← citeshttps://doi.org/10.1007/s00493-007-2183-yopenalex-snapshot
The intrinsic dimensionality of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00208-zopenalex-snapshot
On the bandwidth of triangulated triangles
inferred← citeshttps://doi.org/10.1016/j.aim.2025.110290openalex-snapshot
Large-scale geometry of Borel graphs of polynomial growth
inferred← citeshttps://doi.org/10.1016/j.crma.2004.03.005openalex-snapshot
Absolute Lipschitz extendability
inferred← citeshttps://doi.org/10.1016/j.disc.2008.11.023openalex-snapshot
Short paths in ε -regular pairs and small diameter decompositions of dense graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2007.07.002openalex-snapshot
Large Monochromatic Components in Two-colored Grids
inferred← citeshttps://doi.org/10.1016/j.endm.2007.07.020openalex-snapshot
Graph coloring with no large monochromatic components
inferred← citeshttps://doi.org/10.1016/j.ic.2010.07.001openalex-snapshot
About randomised distributed graph colouring and graph partition algorithms
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.04.002openalex-snapshot
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
inferred← citeshttps://doi.org/10.1016/j.jfa.2009.12.009openalex-snapshot
Random martingales and localization of maximal inequalities
inferred← citeshttps://doi.org/10.1016/j.jpdc.2022.09.012openalex-snapshot
Secured distributed algorithms without hardness assumptions
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.064openalex-snapshot
Local and global price of anarchy of graphical games
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.07.005openalex-snapshot
A fast network-decomposition algorithm and its applications to constant-time distributed computation
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.11.028openalex-snapshot
Improved distributed algorithms for coloring interval graphs with application to multicoloring trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.019openalex-snapshot
Distributed strong diameter network decomposition
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.047openalex-snapshot
Distributed minimum vertex coloring and maximum independent set in chordal graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)81663-8openalex-snapshot
An approximation algorithm for clustering graphs with dominating diametral path
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00094-8openalex-snapshot
Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00292-4openalex-snapshot
Centralized broadcast in multihop radio networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00206-0openalex-snapshot
Simple and efficient network decomposition and synchronization
inferred← citeshttps://doi.org/10.1017/s0963548300000857openalex-snapshot
Local-Global Phenomena in Graphs
inferred← citeshttps://doi.org/10.1017/s0963548308009140openalex-snapshot
Graph Colouring with No Large Monochromatic Components
inferred← citeshttps://doi.org/10.1017/s0963548309009663openalex-snapshot
Deciding Relaxed Two-Colourability: A Hardness Jump
inferred← citeshttps://doi.org/10.1017/s0963548310000040openalex-snapshot
Decompositions into Subgraphs of Small Diameter
inferred← citeshttps://doi.org/10.1017/s0963548314000170openalex-snapshot
Colouring Planar Graphs With Three Colours and No Large Monochromatic Components
inferred← citeshttps://doi.org/10.1090/s0894-0347-07-00573-5openalex-snapshot
Euclidean distortion and the sparsest cut
inferred← citeshttps://doi.org/10.1109/90.779203openalex-snapshot
QoS routing in networks with inaccurate information: theory and algorithms
inferred← citeshttps://doi.org/10.1109/aimoc.2015.7083829openalex-snapshot
Multiple sink deployment in multi-hop wireless sensor networks to enhance lifetime
inferred← citeshttps://doi.org/10.1109/focs.2004.41openalex-snapshot
Measured Descent: A New Embedding Method for Finite Metrics
inferred← citeshttps://doi.org/10.1109/focs.2010.59openalex-snapshot
Subexponential Algorithms for Unique Games and Related Problems
inferred← citeshttps://doi.org/10.1109/focs.2016.62openalex-snapshot
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
inferred← citeshttps://doi.org/10.1109/focs.2018.00069openalex-snapshot
On Derandomizing Local Distributed Algorithms
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00082openalex-snapshot
Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00107openalex-snapshot
Near-Optimal Decremental SSSP in Dense Weighted Digraphs
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00050openalex-snapshot
Streaming Facility Location in High Dimension via Geometric Hashing
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00063openalex-snapshot
Negative-Weight Single-Source Shortest Paths in Near-linear Time
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00107openalex-snapshot
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00012openalex-snapshot
One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00038openalex-snapshot
Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00007openalex-snapshot
Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
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/sfcs.1994.365733openalex-snapshot
The geometry of graphs and some of its algorithmic applications
inferred← citeshttps://doi.org/10.1109/ssst.2010.5442851openalex-snapshot
Opportunistic relay placement in mobile multihop wireless ad hoc networks
inferred← citeshttps://doi.org/10.1109/tnet.2004.838599openalex-snapshot
Efficient Integration of Multihop Wireless and Wired Networks With QoS Constraints
inferred← citeshttps://doi.org/10.1109/wcnc.2003.1200626openalex-snapshot
Message-efficient self-organization of wireless sensor networks
inferred← citeshttps://doi.org/10.1137/070684112openalex-snapshot
Large Monochromatic Components in Two-Colored Grids
inferred← citeshttps://doi.org/10.1137/1.9781611973402.77openalex-snapshot
Cutting corners cheaply, or how to remove Steiner points
inferred← citeshttps://doi.org/10.1137/1.9781611973730.85openalex-snapshot
Decomposing a Graph Into Expanding Subgraphs
inferred← citeshttps://doi.org/10.1137/1.9781611976465.173openalex-snapshot
Improved Deterministic Network Decomposition
inferred← citeshttps://doi.org/10.1137/140951382openalex-snapshot
Cutting Corners Cheaply, or How to Remove Steiner Points
inferred← citeshttps://doi.org/10.1137/17m1112406openalex-snapshot
Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs
inferred← citeshttps://doi.org/10.1137/19m1249527openalex-snapshot
Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering
inferred← citeshttps://doi.org/10.1137/19m1262504openalex-snapshot
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
inferred← citeshttps://doi.org/10.1137/21m1434441openalex-snapshot
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition
inferred← citeshttps://doi.org/10.1137/22m1489034openalex-snapshot
Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions
inferred← citeshttps://doi.org/10.1145/1060590.1060673openalex-snapshot
Euclidean distortion and the sparsest cut
inferred← citeshttps://doi.org/10.1145/1073814.1073826openalex-snapshot
On the locality of bounded growth
inferred← citeshttps://doi.org/10.1145/1137856.1137888openalex-snapshot
Volume distortion for subsets of Euclidean spaces
inferred← citeshttps://doi.org/10.1145/1146381.1146387openalex-snapshot
On the complexity of distributed graph coloring
inferred← citeshttps://doi.org/10.1145/1248377.1248403openalex-snapshot
Distributed approximation of capacitated dominating sets
inferred← citeshttps://doi.org/10.1145/1281100.1281128openalex-snapshot
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
inferred← citeshttps://doi.org/10.1145/1347082.1347119openalex-snapshot
Ultra-low-dimensional embeddings for doubling metrics
inferred← citeshttps://doi.org/10.1145/1378533.1378577openalex-snapshot
Fast distributed scheduling via primal-dual
inferred← citeshttps://doi.org/10.1145/1582716.1582746openalex-snapshot
Distributed and parallel algorithms for weighted vertex cover and other covering problems
inferred← citeshttps://doi.org/10.1145/1734213.1734215openalex-snapshot
Ultra-low-dimensional embeddings for doubling metrics
inferred← citeshttps://doi.org/10.1145/1835698.1835797openalex-snapshot
Deterministic distributed vertex coloring in polylogarithmic time
inferred← citeshttps://doi.org/10.1145/1993806.1993825openalex-snapshot
Distributed deterministic edge coloring using bounded neighborhood independence
inferred← citeshttps://doi.org/10.1145/2027216.2027221openalex-snapshot
Deterministic Distributed Vertex Coloring in Polylogarithmic Time
inferred← citeshttps://doi.org/10.1145/2591796.2591849openalex-snapshot
Cops, robbers, and threatening skeletons
inferred← citeshttps://doi.org/10.1145/2612669.2612692openalex-snapshot
A simple and practical linear-work parallel algorithm for connectivity
inferred← citeshttps://doi.org/10.1145/2775105openalex-snapshot
Subexponential Algorithms for Unique Games and Related Problems
inferred← citeshttps://doi.org/10.1145/2812811openalex-snapshot
Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1145/2897518.2897533openalex-snapshot
Distributed (∆+1)-coloring in sublogarithmic rounds
inferred← citeshttps://doi.org/10.1145/2903137openalex-snapshot
The Locality of Distributed Symmetry Breaking
inferred← citeshttps://doi.org/10.1145/2933057.2933094openalex-snapshot
Distributed Strong Diameter Network Decomposition
inferred← citeshttps://doi.org/10.1145/301308.301360openalex-snapshot
A faster distributed algorithm for computing maximal matchings deterministically
inferred← citeshttps://doi.org/10.1145/3018787openalex-snapshot
Shared-Memory Parallelism Can Be Simple, Fast, and Scalable
inferred← citeshttps://doi.org/10.1145/3018787.3018791openalex-snapshot
Internally Deterministic Parallelism: Techniques and Algorithms
inferred← citeshttps://doi.org/10.1145/3018787.3018792openalex-snapshot
Deterministic Parallelism in Sequential Iterative Algorithms
inferred← citeshttps://doi.org/10.1145/3018787.3018793openalex-snapshot
A Deterministic Phase-Concurrent Parallel Hash Table
inferred← citeshttps://doi.org/10.1145/3018787.3018794openalex-snapshot
Priority Updates: A Contention-Reducing Primitive for Deterministic Programming
inferred← citeshttps://doi.org/10.1145/3018787.3018795openalex-snapshot
Ligra: A Lightweight Graph Processing Framework for Shared Memory
inferred← citeshttps://doi.org/10.1145/3018787.3018796openalex-snapshot
Ligra+: Adding Compression to Ligra
inferred← citeshttps://doi.org/10.1145/3018787.3018797openalex-snapshot
Linear-Work Parallel Graph Connectivity
inferred← citeshttps://doi.org/10.1145/3018787.3018798openalex-snapshot
Parallel and Cache-Oblivious Triangle Computations
inferred← citeshttps://doi.org/10.1145/3018787.3018799openalex-snapshot
Parallel Cartesian Tree and Suffix Tree Construction
inferred← citeshttps://doi.org/10.1145/3018787.3018800openalex-snapshot
Parallel Computation of Longest Common Prefixes
inferred← citeshttps://doi.org/10.1145/3018787.3018801openalex-snapshot
Parallel Lempel-Ziv Factorization
inferred← citeshttps://doi.org/10.1145/3018787.3018802openalex-snapshot
Parallel Wavelet Tree Construction
inferred← citeshttps://doi.org/10.1145/3055399.3055471openalex-snapshot
On the complexity of local distributed graph problems
inferred← citeshttps://doi.org/10.1145/3178120openalex-snapshot
Distributed (Δ +1)-Coloring in Sublogarithmic Rounds
inferred← citeshttps://doi.org/10.1145/3274651openalex-snapshot
Efficient Algorithms for Constructing Very Sparse Spanners and Emulators
inferred← citeshttps://doi.org/10.1145/3293611.3331610openalex-snapshot
On the Use of Randomness in Local Distributed Graph Algorithms
inferred← citeshttps://doi.org/10.1145/3293611.3331618openalex-snapshot
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration
inferred← citeshttps://doi.org/10.1145/3293611.3331626openalex-snapshot
Deterministic Distributed Dominating Set Approximation in the CONGEST Model
inferred← citeshttps://doi.org/10.1145/3357713.3384298openalex-snapshot
Polylogarithmic-time deterministic network decomposition and distributed derandomization
inferred← citeshttps://doi.org/10.1145/3380546openalex-snapshot
A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities
inferred← citeshttps://doi.org/10.1145/3382734.3404504openalex-snapshot
Efficient Deterministic Distributed Coloring with Small Bandwidth
inferred← citeshttps://doi.org/10.1145/3382734.3405735openalex-snapshot
Efficient and Simple Algorithms for Fault-Tolerant Spanners
inferred← citeshttps://doi.org/10.1145/3446330openalex-snapshot
Near-optimal Distributed Triangle Enumeration via Expander Decompositions
inferred← citeshttps://doi.org/10.1145/3465084.3467908openalex-snapshot
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition
inferred← citeshttps://doi.org/10.1145/3465084.3467933openalex-snapshot
Strong-Diameter Network Decomposition
inferred← citeshttps://doi.org/10.1145/3564246.3585243openalex-snapshot
Faster Deterministic Distributed MIS and Approximate Matching
inferred← citeshttps://doi.org/10.1145/3583668.3594598openalex-snapshot
A Near-Optimal Deterministic Distributed Synchronizer
inferred← citeshttps://doi.org/10.1145/3618260.3649679openalex-snapshot
No Distributed Quantum Advantage for Approximate Graph Coloring
inferred← citeshttps://doi.org/10.1145/3631536openalex-snapshot
Negative-Weight Single-Source Shortest Paths in Near-Linear Time
inferred← citeshttps://doi.org/10.1145/3662158.3662812openalex-snapshot
A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP
inferred← citeshttps://doi.org/10.1145/3742890openalex-snapshot
Negative-Weight Single-Source Shortest Paths in Near-linear Time
inferred← citeshttps://doi.org/10.1145/570645.570672openalex-snapshot
Efficient integration of multi-hop wireless and wired networks with QoS constraints
inferred← citeshttps://doi.org/10.1145/780542.780607openalex-snapshot
The intrinsic dimensionality of graphs
inferred← citeshttps://doi.org/10.1184/r1/6714635openalex-snapshot
Algorithm Design Using Spectral Graph Theory
inferred← citeshttps://doi.org/10.14778/3402707.3402747openalex-snapshot
Scalable SPARQL querying of large RDF graphs
inferred← citeshttps://doi.org/10.1515/itit-2019-0051openalex-snapshot
The power of locality: Exploring the limits of randomness in distributed computing
inferred← citeshttps://doi.org/10.1515/jci-2022-0014openalex-snapshot
Randomized graph cluster randomization
inferred← citeshttps://doi.org/10.17760/d20621544openalex-snapshot
Scheduling under network communication constraints
inferred← citeshttps://doi.org/10.2200/s00520ed1v01y201307dct011openalex-snapshot
Distributed Graph Coloring: Fundamentals and Recent Developments
inferred← citeshttps://doi.org/10.23919/ecc51009.2020.9143722openalex-snapshot
Exploiting Locality and Structure for Distributed Optimization in Multi-Agent Systems
inferred← citeshttps://doi.org/10.3929/ethz-a-005092069openalex-snapshot
The Price of Locality: Exploring the Complexity of Distributed Coordination Primitives
inferred← citeshttps://doi.org/10.3929/ethz-a-005273546openalex-snapshot
Locality, Scheduling, and Selfishness: Algorithmic Foundations of Highly Decentralized Networks
inferred← citeshttps://doi.org/10.3929/ethz-a-005664983openalex-snapshot
Colorings and transversals of graphs
inferred← citeshttps://doi.org/10.3929/ethz-a-006714798openalex-snapshot
Distributed combinatorial optimization - Extended Abstract
inferred← citeshttps://doi.org/10.3929/ethz-a-006742100openalex-snapshot
Lower and Upper Bounds for Distributed Packing and Covering
inferred← citeshttps://doi.org/10.3929/ethz-b-000377526openalex-snapshot
Improved Network Decompositions Using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2019.6openalex-snapshot
On Strong Diameter Padded Decompositions
inferred← citeshttps://doi.org/10.4230/lipics.disc.2019.7openalex-snapshot
Message Reduction in the LOCAL Model Is a Free Lunch
inferred← citeshttps://doi.org/10.4230/lipics.disc.2020.15openalex-snapshot
Distributed Dense Subgraph Detection and Low Outdegree Orientation
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2013.249openalex-snapshot
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2022.44openalex-snapshot
LCC and LDC: Tailor-Made Distance Amplification and a Refined Separation
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2018.41openalex-snapshot
Graph Clustering using Effective Resistance
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.36openalex-snapshot
Distributed Vertex Cover Reconfiguration
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2020.29openalex-snapshot
Approximate Bipartite Vertex Cover in the CONGEST Model
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2021.16openalex-snapshot
An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2021.17openalex-snapshot
Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings
inferred← citeshttps://doi.org/10.48550/arxiv.0809.1902openalex-snapshot
Fast C-K-R Partitions of Sparse Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0903.0607openalex-snapshot
Expansion properties of metric spaces not admitting a coarse embedding into a Hilbert space
inferred← citeshttps://doi.org/10.48550/arxiv.1003.1608openalex-snapshot
Deterministic Distributed Vertex Coloring in Polylogarithmic Time
inferred← citeshttps://doi.org/10.48550/arxiv.1010.2454openalex-snapshot
Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence
inferred← citeshttps://doi.org/10.48550/arxiv.1011.5470openalex-snapshot
Local Computation: Lower and Upper Bounds
inferred← citeshttps://doi.org/10.48550/arxiv.1101.5753openalex-snapshot
Fault-Tolerant Spanners: Better and Simpler
inferred← citeshttps://doi.org/10.48550/arxiv.1202.1983openalex-snapshot
The Locality of Distributed Symmetry Breaking
inferred← citeshttps://doi.org/10.48550/arxiv.1204.6675openalex-snapshot
On the Locality of Some NP-Complete Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1405.1649openalex-snapshot
Distributed Symmetry Breaking in Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1505.05697openalex-snapshot
A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1611.02663openalex-snapshot
On the Complexity of Local Distributed Graph Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1805.03357openalex-snapshot
Efficient Distributed Computation of MIS and Generalized MIS in Linear Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1807.06481openalex-snapshot
Dynamic Sampling from Graphical Models
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.1909.09002openalex-snapshot
Low Diameter Graph Decompositions by Approximate Distance Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1911.10863openalex-snapshot
Coloring outerplanar graphs and planar 3-trees with small monochromatic components
inferred← citeshttps://doi.org/10.48550/arxiv.2011.13702openalex-snapshot
Near-Optimal Algorithms for Reachability, Strongly-Connected Components and Shortest Paths in Partially Dynamic Digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.math/0508154openalex-snapshot
Euclidean distortion and the Sparsest Cut
inferred← citeshttps://doi.org/10.5555/2722129.2722214openalex-snapshot
Decomposing a graph into expanding subgraphs
inferred← citeshttps://doi.org/10.5555/314613.314705openalex-snapshot
On the distributed complexity of computing maximal matchings
inferred← citeshttps://doi.org/10.5555/982792.982952openalex-snapshot
Approximate classification via earthmover metrics
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.