| Publication | Date of Publication | Type |
|---|
| Deterministic near-linear time minimum cut in weighted graphs | 2024-11-28 | Paper |
| Dynamically maintaining the persistent homology of time series | 2024-11-28 | Paper |
| A unifying framework for differentially private sums under continual observation | 2024-11-28 | Paper |
| Efficient data structures for incremental exact and approximate maximum flow | 2024-11-14 | Paper |
| Faster submodular maximization for several classes of matroids | 2024-11-14 | Paper |
| Dynamic maintenance of monotone dynamic programs and applications | 2024-10-08 | Paper |
| Asymptotically tight bounds on the time complexity of broadcast and its variants in dynamic networks | 2024-09-25 | Paper |
| A combinatorial cut-toggling algorithm for solving Laplacian linear systems | 2024-09-25 | Paper |
| Modern dynamic data structures (invited talk) | 2024-08-06 | Paper |
| The complexity of average-case dynamic subgraph counting | 2024-07-19 | Paper |
| Experimental evaluation of fully dynamic \(k\)-means via coresets | 2024-05-29 | Paper |
| Practical fully dynamic minimum cut algorithms | 2024-05-24 | Paper |
| Fully dynamic exact edge connectivity in sublinear time | 2024-05-14 | Paper |
| Online min-max paging | 2024-05-14 | Paper |
| Optimal fully dynamic \(k\)-center clustering for adaptive and oblivious adversaries | 2024-05-14 | Paper |
| Almost tight error bounds on differentially private continual counting | 2024-05-14 | Paper |
| Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide | 2024-04-14 | Paper |
| Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147327 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147366 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147407 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147424 | 2024-01-15 | Paper |
| A combinatorial cut-toggling algorithm for solving Laplacian linear systems | 2023-12-13 | Paper |
| Multiplicative auction algorithm for approximate maximum weight bipartite matching | 2023-11-09 | Paper |
| Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles | 2023-11-02 | Paper |
| Constant-time Dynamic (Δ +1)-Coloring | 2023-10-31 | Paper |
| Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover | 2023-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075931 | 2023-09-20 | Paper |
| Fine-grained complexity lower bounds for problems in computer aided verification | 2023-08-10 | Paper |
| Certificates and fast algorithms for biconnectivity in fully-dynamic graphs | 2023-05-08 | Paper |
| Symbolic algorithms for graphs and Markov decision processes with fairness objectives | 2023-05-05 | Paper |
| Faster fully dynamic transitive closure in practice | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874528 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874530 | 2023-02-07 | Paper |
| Constant-time dynamic \((\Delta+1)\)-coloring | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875368 | 2023-02-03 | Paper |
| An algorithm for finding predecessors in integer sets | 2023-01-18 | Paper |
| Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning | 2022-12-09 | Paper |
| Fully dynamic 2-edge-connectivity in planar graphs | 2022-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091161 | 2022-07-21 | Paper |
| Upper and lower bounds for fully retroactive graph problems | 2022-03-25 | Paper |
| A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching | 2022-02-22 | Paper |
| Constant-time dynamic weight approximation for minimum spanning forest | 2021-11-25 | Paper |
| Algorithms and conditional lower bounds for planning problems | 2021-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009600 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009599 | 2021-08-04 | Paper |
| A deterministic almost-tight distributed algorithm for approximating single-source shortest paths | 2021-06-29 | Paper |
| Approximating the minimum cycle mean | 2021-06-09 | Paper |
| Fully Dynamic k-Center Clustering in Low Dimensional Metrics | 2021-01-27 | Paper |
| Fully Dynamic Single-Source Reachability in Practice: An Experimental Study | 2021-01-27 | Paper |
| Shared-Memory Branch-and-Reduce for Multiterminal Cuts | 2021-01-27 | Paper |
| Memetic graph clustering | 2020-12-16 | Paper |
| The State of the Art in Dynamic Graph Algorithms | 2020-10-21 | Paper |
| Dynamic clustering to minimize the sum of radii | 2020-10-21 | Paper |
| The power of vertex sparsifiers in dynamic graph algorithms | 2020-05-27 | Paper |
| Dynamic clustering to minimize the sum of radii | 2020-05-27 | Paper |
| Improved guarantees for vertex sparsification in planar graphs | 2020-05-27 | Paper |
| Improved set-based symbolic algorithms for parity games | 2020-05-26 | Paper |
| Faster algorithms for mean-payoff parity games | 2020-05-26 | Paper |
| Faster Parallel Multiterminal Cuts | 2020-04-24 | Paper |
| Deterministic dynamic matching in \(O(1)\) update time | 2020-02-28 | Paper |
| Distributed edge connectivity in sublinear time | 2020-01-30 | Paper |
| Local flow partitioning for faster edge connectivity | 2020-01-21 | Paper |
| Improved guarantees for vertex sparsification in planar graphs | 2020-01-10 | Paper |
| A deamortization approach for dynamic spanner and dynamic maximal matching | 2019-10-15 | Paper |
| Practical minimum cut algorithms | 2019-09-12 | Paper |
| Quasipolynomial set-based symbolic algorithms for parity games | 2019-07-04 | Paper |
| A subquadratic-time algorithm for decremental single-source shortest paths | 2019-06-20 | Paper |
| New amortized cell-probe lower bounds for dynamic problems | 2019-06-06 | Paper |
| An \(O(n^2)\) time algorithm for alternating Büchi games | 2019-05-10 | Paper |
| Practical minimum cut algorithms | 2019-03-27 | Paper |
| Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time | 2019-02-25 | Paper |
| Approximating minimum cuts under insertions | 2019-01-10 | Paper |
| Incremental exact min-cut in polylogarithmic amortized update time | 2018-11-13 | Paper |
| Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks | 2018-11-12 | Paper |
| Local flow partitioning for faster edge connectivity | 2018-07-16 | Paper |
| Fully dynamic approximate maximum matching and minimum vertex cover in \(O(\log^3 n)\) worst case update time | 2018-07-16 | Paper |
| Deterministic fully dynamic data structures for vertex cover and matching | 2018-07-04 | Paper |
| Maintaining minimum spanning trees in dynamic graphs | 2018-07-04 | Paper |
| Dynamic algorithms via the primal-dual method | 2018-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643877 | 2018-05-29 | Paper |
| Conditional hardness for sensitivity problems | 2018-05-03 | Paper |
| Improved algorithms for one-pair and \(k\)-pair Streett objectives | 2018-04-23 | Paper |
| Model and objective separation with conditional lower bounds: disjunction is harder than conjunction | 2018-04-23 | Paper |
| Conditionally Optimal Algorithms for Generalized B\"uchi Games | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607872 | 2018-03-15 | Paper |
| Lower bounds for symbolic computation on graphs: strongly connected components, liveness, safety, and diameter | 2018-03-15 | Paper |
| Incremental and fully dynamic subgraph connectivity for emergency planning | 2018-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606317 | 2018-03-02 | Paper |
| Welfare maximization with friends-of-friends network externalities | 2018-02-01 | Paper |
| Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds | 2017-12-19 | Paper |
| Improved algorithms for parity and Streett objectives | 2017-10-12 | Paper |
| Deterministic fully dynamic data structures for vertex cover and matching | 2017-10-05 | Paper |
| Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification | 2017-09-29 | Paper |
| A deterministic almost-tight distributed algorithm for approximating single-source shortest paths | 2017-09-29 | Paper |
| New deterministic approximation algorithms for fully dynamic matching | 2017-09-29 | Paper |
| Deterministic fully dynamic approximate vertex cover and fractional matching in \(O(1)\) amortized update time | 2017-08-31 | Paper |
| Maximizing a submodular function with viability constraints | 2017-03-06 | Paper |
| Welfare maximization with friends-of-friends network externalities | 2017-01-24 | Paper |
| Scheduling data transfers in a network and the set scheduling problem | 2016-09-29 | Paper |
| Improved data structures for fully dynamic biconnectivity | 2016-09-01 | Paper |
| Faster shortest-path algorithms for planar graphs | 2016-09-01 | Paper |
| Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization | 2016-07-04 | Paper |
| Ad exchange: envy-free auctions with mediators | 2016-01-08 | Paper |
| Combinatorial auctions with conflict-based externalities | 2016-01-08 | Paper |
| Online ad assignment with an ad exchange | 2015-11-20 | Paper |
| Finding 2-edge and 2-vertex strongly connected components in quadratic time | 2015-10-27 | Paper |
| Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs | 2015-10-27 | Paper |
| Design of dynamic algorithms via primal-dual method | 2015-10-27 | Paper |
| Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture | 2015-08-21 | Paper |
| Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams | 2015-08-21 | Paper |
| Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs | 2015-06-26 | Paper |
| Truthful unit-demand auctions with budgets revisited | 2015-02-24 | Paper |
| Polynomial-time algorithms for energy games with special weight structures | 2015-01-19 | Paper |
| Valuation compressions in VCG-based combinatorial auctions | 2015-01-12 | Paper |
| Limiting Price Discrimination when Selling Products with Positive Network Externalities | 2015-01-07 | Paper |
| Combinatorial algorithms for web search engines -- three success stories | 2014-12-18 | Paper |
| Online bipartite matching with decomposable weights | 2014-10-08 | Paper |
| Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition | 2014-09-12 | Paper |
| Approximating the minimum cycle mean | 2014-07-25 | Paper |
| Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives | 2014-06-30 | Paper |
| Maximizing a submodular function with viability constraints | 2013-09-17 | Paper |
| Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks | 2013-08-07 | Paper |
| Bidder optimal assignments for general utilities | 2013-06-06 | Paper |
| Offline file assignments for online load balancing | 2013-04-04 | Paper |
| Sponsored search, market equilibria, and the Hungarian method | 2013-03-20 | Paper |
| On multiple keyword sponsored search auctions with budgets | 2012-11-01 | Paper |
| Polynomial-time algorithms for energy games with special weight structures | 2012-09-25 | Paper |
| Sponsored Search, Market Equilibria, and the Hungarian Method | 2012-01-23 | Paper |
| Multi-parameter mechanism design under budget and matroid constraints | 2011-09-16 | Paper |
| Online stochastic packing applied to display ad allocation | 2010-09-06 | Paper |
| Mechanisms for the Marriage and the Assignment Game | 2010-05-28 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Algorithmic Challenges in Web Search Engines | 2005-05-09 | Paper |
| An online throughput-competitive algorithm for multicast routing and admission control | 2005-05-04 | Paper |
| Randomized fully dynamic graph algorithms with polylogarithmic time per operation | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818842 | 2004-09-24 | Paper |
| Scheduling data transfers in a network and the set scheduling problem | 2004-03-14 | Paper |
| Scheduling multicasts on unit-capacity trees and meshes. | 2003-08-19 | Paper |
| On the number of small cut in a graph | 2003-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552037 | 2002-10-06 | Paper |
| Maintaining minimum spanning forests in dynamic graphs | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234100 | 2002-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753917 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527009 | 2001-02-28 | Paper |
| Improved Data Structures for Fully Dynamic Biconnectivity | 2000-10-18 | Paper |
| Computing Vertex Connectivity: New Bounds from Old Techniques | 2000-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252730 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252752 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945538 | 2000-03-23 | Paper |
| Exploring Unknown Environments | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250170 | 2000-02-17 | Paper |
| Lower bounds for fully dynamic connectivity problems in graphs | 1999-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230326 | 1999-07-05 | Paper |
| Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology | 1999-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252318 | 1999-06-17 | Paper |
| Average-case analysis of dynamic graph algorithms | 1998-09-08 | Paper |
| Sampling to provide or to bound: With applications to fully dynamic graph algorithms | 1998-05-13 | Paper |
| A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity | 1998-01-12 | Paper |
| Faster shortest-path algorithms for planar graphs | 1997-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875203 | 1996-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886061 | 1996-08-22 | Paper |
| Data structures for two-edge connectivity in planar graphs | 1995-10-09 | Paper |
| Fully dynamic biconnectivity in graphs | 1995-06-19 | Paper |
| Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time | 1993-03-09 | Paper |
