Author of the publication

Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies.

, , , and . INFOCOM, page 1649-1658. IEEE, (2022)

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

Fully Dynamic Single-Source Reachability in Practice: An Experimental Study., , and . CoRR, (2019)Faster Fully Dynamic Transitive Closure in Practice., , and . SEA, volume 160 of LIPIcs, page 14:1-14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Recent Advances in Fully Dynamic Graph Algorithms., , and . CoRR, (2021)Linear Orderings of Sparse Graphs. Passau University, Germany, (2018)base-search.net (ftunivpassau:oai:kobv.de-opus4-uni-passau:552).O'Reach: Even Faster Reachability in Large Graphs., , and . SEA, volume 190 of LIPIcs, page 13:1-13:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)DJ-Match/DJ-Match: Version 1.0.0., , , and . (January 2022)Characterizing Planarity by the Splittable Deque., , , and . GD, volume 8242 of Lecture Notes in Computer Science, page 25-36. Springer, (2013)Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk)., , and . SAND, volume 221 of LIPIcs, page 1:1-1:47. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Improved Exact and Heuristic Algorithms for Maximum Weight Clique., , , , and . CoRR, (2023)On b-Matching and Fully-Dynamic Maximum k-Edge Coloring., , and . CoRR, (2023)