Author of the publication

Min-Cost Bipartite Perfect Matching with Delays.

, , , , , , , , and . APPROX-RANDOM, volume 81 of LIPIcs, page 1:1-1:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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

DelayCheck: Scheduling voice over multi-hop multi-channel wireless mesh networks., , , and . COMSNETS, page 1-10. IEEE, (2011)Approximating the Regular Graphic TSP in Near Linear Time., and . FSTTCS, volume 45 of LIPIcs, page 125-135. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Factorial Lower Bounds for (Almost) Random Order Streams., , , and . FOCS, page 486-497. IEEE, (2022)Set Cover with Delay - Clairvoyance Is Not Required., , , and . ESA, volume 173 of LIPIcs, page 8:1-8:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Online Min-Max Paging., , , and . SODA, page 1545-1565. SIAM, (2023)On Randomized Algorithms for Matching in the Online Preemptive Model., , and . CoRR, (2014)Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays., , and . CoRR, (2016)Nash Equilibrium in Weighted Concurrent Timed Games with Reachability Objectives., , and . ICDCIT, volume 7154 of Lecture Notes in Computer Science, page 117-128. Springer, (2012)Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays., , and . SODA, page 1051-1061. SIAM, (2017)Set Cover and Vertex Cover with Delay., , , and . CoRR, (2018)