default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaximilian Probst Gutenberg
Person information
- affiliation: ETH Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c28]Lars Gottesbüren, Nikos Parotsidis, Maximilian Probst Gutenberg:
Practical Expander Decomposition. ESA 2024: 61:1-61:17- [c27]Cella Florescu, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva:
Optimal Electrical Oblivious Routing on Expanders. ICALP 2024: 65:1-65:19 - [c26]Jan van den Brand
, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford:
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. SODA 2024: 2980-2998 - [c25]Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg:
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. STOC 2024: 1165-1173 - [c24]Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg:
A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications. STOC 2024: 1174-1183 - [i29]Aurelio L. Sulser, Maximilian Probst Gutenberg:
A Simple and Near-Optimal Algorithm for Directed Expander Decompositions. CoRR abs/2403.04542 (2024) - [i28]Cella Florescu, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva:
Optimal Electrical Oblivious Routing on Expanders. CoRR abs/2406.07252 (2024) - [i27]Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg, Sushant Sachdeva:
Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality. CoRR abs/2407.10830 (2024) - [i26]Daoyuan Chen, Simon Meierhans, Maximilian Probst Gutenberg, Thatchaphol Saranurak:
Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal. CoRR abs/2410.13451 (2024) - 2023
- [j1]Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva:
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow. Commun. ACM 66(12): 85-92 (2023) - [c23]Jan van den Brand, Li Chen, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford:
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. FOCS 2023: 503-514 - [c22]Yiding Hua, Rasmus Kyng, Maximilian Probst Gutenberg, Zihang Wu:
Maintaining Expander Decompositions via Sparse Cuts. SODA 2023: 48-69 - [c21]Li Chen, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva:
A Simple Framework for Finding Balanced Sparse Cuts via APSP. SOSA 2023: 42-55 - [c20]Sebastian Forster, Yasamin Nazari, Maximilian Probst Gutenberg:
Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch. STOC 2023: 1173-1186 - [i25]Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford:
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. CoRR abs/2309.16629 (2023) - [i24]Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford:
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. CoRR abs/2311.03174 (2023) - [i23]Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg:
A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and their Applications. CoRR abs/2311.06402 (2023) - [i22]Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg:
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. CoRR abs/2311.18295 (2023) - 2022
- [c19]Maik Fröbe, Sebastian Günther, Maximilian Probst, Martin Potthast, Matthias Hagen:
The Power of Anchor Text in the Neural Retrieval Era. ECIR (1) 2022: 567-583 - [c18]Rasmus Kyng, Simon Meierhans, Maximilian Probst:
Derandomizing Directed Random Walks in Almost-Linear Time. FOCS 2022: 407-418 - [c17]Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva:
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. FOCS 2022: 612-623 - [c16]Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun:
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. ICALP 2022: 20:1-20:20 - [c15]Ming Ding, Rasmus Kyng, Maximilian Probst Gutenberg, Peng Zhang:
Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets. ICALP 2022: 53:1-53:19 - [c14]Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg:
Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier. SODA 2022: 3452-3481 - [c13]Debarati Das, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs. SODA 2022: 3482-3495 - [c12]Debarati Das, Evangelos Kipouridis, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs. SOSA 2022: 1-11 - [d1]Maik Fröbe, Sebastian Günther, Maximilian Probst, Martin Potthast, Matthias Hagen:
Webis-MS-MARCO-Anchor-Texts-22. Zenodo, 2022
- [i21]Ming Ding, Rasmus Kyng, Maximilian Probst Gutenberg, Peng Zhang:
Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets. CoRR abs/2202.05011 (2022) - [i20]Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva:
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. CoRR abs/2203.00671 (2022) - [i19]Yiding Hua, Rasmus Kyng, Maximilian Probst Gutenberg, Zihang Wu:
Maintaining Expander Decompositions via Sparse Cuts. CoRR abs/2204.02519 (2022) - [i18]Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg:
Derandomizing Directed Random Walks in Almost-Linear Time. CoRR abs/2208.10959 (2022) - [i17]Li Chen, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva:
A Simple Framework for Finding Balanced Sparse Cuts via APSP. CoRR abs/2209.08845 (2022) - [i16]Sebastian Forster, Yasamin Nazari, Maximilian Probst Gutenberg:
Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch. CoRR abs/2211.04217 (2022) - 2021
- [c11]Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak:
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time. FOCS 2021: 1000-1008 - [c10]Jacob Evald, Viktor Fredslund-Hansen, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary. ICALP 2021: 64:1-64:20 - [c9]Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein:
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. SODA 2021: 1836-1855 - [i15]Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak:
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time. CoRR abs/2101.07149 (2021) - [i14]Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg:
Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier. CoRR abs/2110.11712 (2021) - [i13]Debarati Das, Evangelos Kipouridis, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs. CoRR abs/2111.07360 (2021) - 2020
- [c8]Aaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Near-Optimal Decremental SSSP in Dense Weighted Digraphs. FOCS 2020: 1112-1122 - [c7]Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak:
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing. FOCS 2020: 1123-1134 - [c6]Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler. SODA 2020: 2522-2541 - [c5]Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary. SODA 2020: 2542-2561 - [c4]Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds. SODA 2020: 2562-2574 - [c3]Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein:
New algorithms and hardness for incremental single-source shortest paths in directed graphs. STOC 2020: 153-166 - [i12]Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein:
New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs. CoRR abs/2001.10751 (2020) - [i11]Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds. CoRR abs/2001.10801 (2020) - [i10]Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler. CoRR abs/2001.10809 (2020) - [i9]Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary. CoRR abs/2001.10821 (2020) - [i8]Aaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Near-Optimal Decremental SSSP in Dense Weighted Digraphs. CoRR abs/2004.04496 (2020) - [i7]Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun:
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. CoRR abs/2004.08432 (2020) - [i6]Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak:
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing. CoRR abs/2009.02584 (2020) - [i5]Jacob Evald, Viktor Fredslund-Hansen, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Decremental APSP in Directed Graphs Versus an Adaptive Adversary. CoRR abs/2010.00937 (2020) - [i4]Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein:
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. CoRR abs/2010.10134 (2020) - [i3]Maximilian Probst Gutenberg:
Near-Optimal Algorithms for Reachability, Strongly-Connected Components and Shortest Paths in Partially Dynamic Digraphs. CoRR abs/2011.13702 (2020)
2010 – 2019
- 2019
- [c2]Aaron Bernstein, Maximilian Probst, Christian Wulff-Nilsen:
Decremental strongly-connected components and single-source reachability in near-linear time. STOC 2019: 365-376 - [i2]Aaron Bernstein, Maximilian Probst, Christian Wulff-Nilsen:
Decremental Strongly-Connected Components and Single-Source Reachability in Near-Linear Time. CoRR abs/1901.03615 (2019) - 2018
- [c1]Maximilian Probst:
On the Complexity of the (Approximate) Nearest Colored Node Problem. ESA 2018: 68:1-68:14 - [i1]Maximilian Probst:
On the complexity of the (approximate) nearest colored node problem. CoRR abs/1807.03721 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 22:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
