| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147264 | 2024-01-15 | Paper |
| Subquadratic dynamic path reporting in directed graphs against an adaptive adversary | 2023-12-08 | Paper |
| Min-Cost Flow in Unit-Capacity Planar Graphs | 2022-05-11 | Paper |
| Shortest Augmenting Paths for Online Matchings on Trees | 2022-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009578 | 2021-08-04 | Paper |
| NC Algorithms for Weighted Planar Perfect Matching and Related Problems | 2021-07-28 | Paper |
| Budget feasible mechanisms on matroids | 2021-04-19 | Paper |
| Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors | 2021-04-14 | Paper |
| Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths | 2021-04-14 | Paper |
| Walking randomly, massively, and efficiently | 2021-01-19 | Paper |
| Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}. | 2020-11-25 | Paper |
| Round Compression for Parallel Matching Algorithms | 2020-10-29 | Paper |
| Contracting a Planar Graph Efficiently | 2020-05-27 | Paper |
| A tight bound for shortest augmenting paths on trees | 2020-02-12 | Paper |
| (1 + ∊)-Approximate Incremental Matching in Constant Deterministic Amortized Time | 2019-10-15 | Paper |
| Improved distance queries and cycle counting by Frobenius normal form | 2019-08-27 | Paper |
| Round compression for parallel matching algorithms | 2019-08-22 | Paper |
| Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs | 2019-03-28 | Paper |
| Min st -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time | 2018-10-30 | Paper |
| Algorithmic Applications of Baur-Strassen’s Theorem | 2018-08-02 | Paper |
| Online Pricing with Impatient Bidders | 2018-07-16 | Paper |
| Algorithmic Complexity of Power Law Networks | 2018-07-16 | Paper |
| Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m10/7 log W) Time (Extended Abstract) | 2018-07-16 | Paper |
| Improved Distance Queries and Cycle Counting by Frobenius Normal Form | 2018-04-19 | Paper |
| Shortest augmenting paths for online matchings on trees | 2018-04-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607988 | 2018-03-15 | Paper |
| Optimal decremental connectivity in planar graphs | 2018-02-01 | Paper |
| Budget feasible mechanisms on matroids | 2017-08-31 | Paper |
| Decremental single-source reachability in planar digraphs | 2017-08-17 | Paper |
| Reachability in graph timelines | 2017-05-16 | Paper |
| Catch them if you can | 2017-05-16 | Paper |
| Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs | 2017-01-30 | Paper |
| Optimal Decremental Connectivity in Planar Graphs. | 2017-01-24 | Paper |
| Network Elicitation in Adversarial Environment | 2016-12-21 | Paper |
| Online network design with outliers | 2016-11-01 | Paper |
| Locality-Sensitive Hashing Without False Negatives for $$l_p$$ | 2016-09-02 | Paper |
| Shortest Augmenting Paths for Online Matchings on Trees | 2016-02-26 | Paper |
| The Power of Dynamic Distance Oracles | 2015-08-21 | Paper |
| Efficiency of Truthful and Symmetric Mechanisms in One-Sided Matching | 2015-01-14 | Paper |
| Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets | 2015-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934589 | 2014-12-18 | Paper |
| The ring design game with fair cost allocation | 2014-12-02 | Paper |
| Improved algorithms for min cut and max flow in undirected planar graphs | 2014-06-05 | Paper |
| Network formation games with local coalitions | 2014-03-13 | Paper |
| Set Covering with Our Eyes Closed | 2013-09-25 | Paper |
| Single Source - All Sinks Max Flows in Planar Digraphs | 2012-10-17 | Paper |
| A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees | 2012-09-25 | Paper |
| Approximation Algorithms for Union and Intersection Covering Problems | 2012-08-31 | Paper |
| Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time | 2011-09-16 | Paper |
| Dynamic normal forms and dynamic characteristic polynomial | 2011-03-29 | Paper |
| Online Network Design with Outliers | 2010-09-07 | Paper |
| Fast Approximation in Subspaces by Doubling Metric Decomposition | 2010-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579386 | 2010-08-06 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Fast dynamic transitive closure with lookahead | 2010-02-23 | Paper |
| Maximum weight bipartite matching in matrix multiplication time | 2009-11-04 | Paper |
| Weighted Bipartite Matching in Matrix Multiplication Time | 2009-03-12 | Paper |
| Algebraic Graph Algorithms | 2009-02-03 | Paper |
| Dynamic Plane Transitive Closure | 2008-09-25 | Paper |
| Dynamic Normal Forms and Dynamic Characteristic Polynomial | 2008-08-28 | Paper |
| Processor efficient parallel matching | 2008-02-18 | Paper |
| Maximum matchings in planar graphs via Gaussian elimination | 2007-06-21 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418670 | 2003-08-11 | Paper |
