Author of the publication

Constant-Time Dynamic (Δ+1)-Coloring.

, and . STACS, volume 154 of LIPIcs, page 53:1-53:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Detecting the origin of text segments efficiently., , , and . WWW, page 61-70. ACM, (2009)A Tree Structure For Dynamic Facility Location., , and . ESA, volume 112 of LIPIcs, page 39:1-39:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Simple, Scalable and Effective Clustering via One-Dimensional Projections., , , , and . CoRR, (2023)Valuation Compressions in VCG-Based Combinatorial Auctions., , and . WINE, volume 8289 of Lecture Notes in Computer Science, page 146-159. Springer, (2013)Upper and Lower Bounds for Fully Retroactive Graph Problems., and . WADS, volume 12808 of Lecture Notes in Computer Science, page 471-484. Springer, (2021)Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives., , , , and . CAV (2), volume 10982 of Lecture Notes in Computer Science, page 178-197. Springer, (2018)Dynamically Maintaining the Persistent Homology of Time Series., , , and . SODA, page 243-295. SIAM, (2024)An O(n2) time algorithm for alternating Büchi games., and . SODA, page 1386-1399. SIAM, (2012)Combinatorial algorithms for web search engines: three success stories.. SODA, page 1022-1026. SIAM, (2007)Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time., , and . SODA, page 470-489. SIAM, (2017)