Search

Note: If personal data such as name, room number, or email are no longer up to date, please contact the service desk.

You can use an asterisk (*) for a wildcard search.

Group Members

(2019-2023) and Postdoc (2023-2024), now CWI Amsterdam Lukas Nölke, PhD student (2017-2023) Mohit Garg, Postdoc (2021-2022, jointly with Petra Berenbrink) Franziska Eberle , PhD student (2016-2020) and

Section: FB3

Relevance:

100%
Group's Publications

Algorithmica 87: 813–841, 2025 A 5/4-Approximation for Two-Edge Connectivity Miguel Bosch-Calvo, Mohit Garg, Fabrizio Grandoni, Felix Hommelsheim, Afrouz Jabal Ameli, Alexander Lindermayr STOC 2025 Protecting [...] Schlöter ICML 2023: 18563-18583. Matching Augmentation via Simultaneous Contractions arxiv DOI Mohit Garg, Felix Hommelsheim, Nicole Megow ICALP 2023: 65:1-65:17. Sorting and Hypergraph Orientation under [...] Science (STACS 2015), pp. 276-287, 2015 Meeting deadlines: How much speed suffices? PDF PDF S. Anand, N. Garg, N. Megow In Proc. of the 38th International Colloquium on Automata, Languages and Programming (ICALP

Section: FB3

Relevance:

60%
Nicole Megow's Publications

Schlöter ICML 2023: 18563-18583. Matching Augmentation via Simultaneous Contractions arxiv DOI Mohit Garg, Felix Hommelsheim, Nicole Megow ICALP 2023: 65:1-65:17. Sorting and Hypergraph Orientation under [...] Science (STACS 2015), pp. 276-287, 2015 Meeting deadlines: How much speed suffices? PDF PDF S. Anand, N. Garg, N. Megow In Proc. of the 38th International Colloquium on Automata, Languages and Programming (ICALP

Section: FB3

Relevance:

51%
Research Seminar

approximation algorithm, which required a long and tedious case analysis. This is joint work with Mohit Garg and Alexander Lindermayr. October 21, 2024, Alexander Lindermayr (University of Bremen), The Power [...] scheduling and the dual-fitting technique Alexander Lindermeyr (University of Bremen) Abstract: In 2019, Garg et al. proposed a novel algorithm for non-clairvoyant precedence constrained scheduling with weighted [...] We give a 10/7-approximation algorithm for this problem, improving on the 3/2-approximation from Garg, Vempala and Singla. The algorithm is similar to the 17/12-approximation algorithm for the related

Section: FB3

Relevance:

21%

Updated by: TYPO3-Support