Author of the publication

Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems.

, , and . APPROX-RANDOM, volume 207 of LIPIcs, page 24:1-24:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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

Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems., , and . CoRR, (2020)Temporal Fairness in Decision Making Problems., , , , and . ECAI, volume 392 of Frontiers in Artificial Intelligence and Applications, page 1132-1139. IOS Press, (2024)Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching., , , and . CCCG, page 98-113. (2018)_1 -sparsity Approximation Bounds for Packing Integer Programs., , and . IPCO, volume 11480 of Lecture Notes in Computer Science, page 128-140. Springer, (2019)Densest Subgraph: Supermodularity, Iterative Peeling, and Flow., , and . SODA, page 1531-1555. SIAM, (2022)Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems., , and . APPROX-RANDOM, volume 207 of LIPIcs, page 24:1-24:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms., , , and . APPROX/RANDOM, volume 317 of LIPIcs, page 9:1-9:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)A topological algorithm for determining how road networks evolve over time., , and . SIGSPATIAL/GIS, page 31:1-31:10. ACM, (2016)2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection., , , and . PODS, page 247-260. ACM, (2017)Knuthian Drawings of Series-Parallel Flowcharts., , and . GD, volume 9411 of Lecture Notes in Computer Science, page 556-557. Springer, (2015)