ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2108.02697
  4. Cited By
A tight local algorithm for the minimum dominating set problem in
  outerplanar graphs
v1v2 (latest)

A tight local algorithm for the minimum dominating set problem in outerplanar graphs

International Symposium on Distributed Computing (DISC), 2021
5 August 2021
Marthe Bonamy
Linda Cook
C. Groenland
Alexandra Wesolek
ArXiv (abs)PDFHTMLGithub

Papers citing "A tight local algorithm for the minimum dominating set problem in outerplanar graphs"

10 / 10 papers shown
Tight Bounds for Constant-Round Domination on Graphs of High Girth and
  Low Expansion
Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low ExpansionSafety-critical Systems Symposium (SSS), 2024
Christoph Lenzen
Sophie Wenning
201
0
0
23 Aug 2024
The Distributed Complexity of Locally Checkable Labeling Problems Beyond
  Paths and Trees
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and TreesInformation Technology Convergence and Services (ITCS), 2023
Yi-Jun Chang
224
5
0
12 Nov 2023
Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs
Fully Scalable Massively Parallel Algorithms for Embedded Planar GraphsACM-SIAM Symposium on Discrete Algorithms (SODA), 2023
Yi-Jun Chang
Danling Zheng
293
1
0
15 Apr 2023
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free
  Networks and Their Applications
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their ApplicationsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023
Yi-Jun Chang
261
7
0
10 Apr 2023
Distributed domination on sparse graph classes
Distributed domination on sparse graph classes
O. Heydt
Simeon Kublenz
P. D. Mendez
S. Siebertz
Alexandre Vigny
GNN
204
4
0
06 Jul 2022
Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs
Near-Optimal Distributed Dominating Set in Bounded Arboricity GraphsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022
Michal Dory
M. Ghaffari
S. Ilchi
213
6
0
10 Jun 2022
Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via
  Expander Decompositions
Narrowing the LOCAL\unicodex2013\unicode{x2013}\unicodex2013CONGEST Gaps in Sparse Networks via Expander DecompositionsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022
Yi-Jun Chang
Hsin-Hao Su
254
10
0
17 May 2022
Distributed distance domination in graphs with no $K_{2,t}$-minor
Distributed distance domination in graphs with no K2,tK_{2,t}K2,t​-minorTheoretical Computer Science (TCS), 2022
A. Czygrinow
Michal Hanćkowiak
Marcin Witkowski
143
2
0
07 Mar 2022
Local planar domination revisited
Local planar domination revisitedColloquium on Structural Information & Communication Complexity (SIROCCO), 2021
O. Heydt
S. Siebertz
Alexandre Vigny
187
5
0
29 Nov 2021
Bibliography of distributed approximation beyond bounded degree
Bibliography of distributed approximation beyond bounded degree
Laurent Feuilloley
310
3
0
22 Jan 2020
1
Page 1 of 1