( en | de | ru )

 

Disambiguation of "Gutenberg, Maximilian Probst"

Author of the publication

copydeleteadd this publication to your clipboard
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow.

, , , , , and . Commun. ACM, 66 (12): 85-92 (December 2023)

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.

Andrea Gutenberg

Angelika Gutenberg

Angelika Gutenberg

Norbert Gutenberg

Andrea Gutenberg

 

Other publications of authors with the same name

A Simple Framework for Finding Balanced Sparse Cuts via APSP., , , and . CoRR, (2022)Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary., , , , , , and . CoRR, (2020)Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary., , , and . ICALP, volume 198 of LIPIcs, page 64:1-64:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Maximum Flow and Minimum-Cost Flow in Almost-Linear Time., , , , , and . FOCS, page 612-623. IEEE, (2022)Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow., , , , , and . Commun. ACM, 66 (12): 85-92 (December 2023)Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler., and . SODA, page 2522-2541. SIAM, (2020)Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary., and . SODA, page 2542-2561. SIAM, (2020)Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds., and . SODA, page 2562-2574. SIAM, (2020)Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier., , and . SODA, page 3452-3481. SIAM, (2022)A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs., , and . SODA, page 3482-3495. SIAM, (2022)