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. 2002.06005
  4. Cited By
A Breezing Proof of the KMW Bound
v1v2v3v4 (latest)

A Breezing Proof of the KMW Bound

SIAM Symposium on Simplicity in Algorithms (SOSA), 2020
14 February 2020
Corinna Coupette
Christoph Lenzen
ArXiv (abs)PDFHTML

Papers citing "A Breezing Proof of the KMW Bound"

4 / 4 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
164
0
0
23 Aug 2024
Low-Distortion Clustering in Bounded Growth Graphs
Low-Distortion Clustering in Bounded Growth GraphsColloquium on Structural Information & Communication Complexity (CSICC), 2024
Yi-Jun Chang
Varsha Dani
Thomas P. Hayes
211
0
0
08 May 2024
Node and Edge Averaged Complexities of Local Graph Problems
Node and Edge Averaged Complexities of Local Graph ProblemsDistributed computing (Distrib. Comput.), 2022
Alkida Balliu
M. Ghaffari
Fabian Kuhn
Dennis Olivetti
166
12
0
17 Aug 2022
Lower bounds for maximal matchings and maximal independent sets
Lower bounds for maximal matchings and maximal independent sets
Alkida Balliu
S. Brandt
J. Hirvonen
Dennis Olivetti
Mikael Rabie
Jukka Suomela
FedML
330
100
0
08 Jan 2019
1
Page 1 of 1