| Publication | Date of Publication | Type |
|---|
| A faster combinatorial algorithm for maximum bipartite matching | 2024-11-28 | Paper |
| Parallel approximate maximum flows in near-linear work and polylogarithmic depth | 2024-11-28 | Paper |
| Code sparsification and its applications | 2024-11-28 | Paper |
| Sublinear algorithms and lower bounds for estimating MST and TSP cost in general metrics | 2024-11-14 | Paper |
| New trade-offs for fully dynamic matching via hierarchical EDCS | 2024-07-19 | Paper |
| Query complexity of the metric Steiner tree problem | 2024-05-14 | Paper |
| Nearly tight bounds for discrete search under outlier noise | 2024-05-14 | Paper |
| On regularity lemma and barriers in streaming and dynamic matching | 2024-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126337 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147435 | 2024-01-15 | Paper |
| Graph connectivity and single element recovery via linear and OR queries | 2023-09-20 | Paper |
| A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling | 2022-07-18 | Paper |
| Top-k and Clustering with Noisy Comparisons | 2021-11-25 | Paper |
| Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling | 2021-07-02 | Paper |
| Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem | 2021-06-29 | Paper |
| On the Power of Planned Infections in Networks | 2021-04-26 | Paper |
| Space-efficient Query Evaluation over Probabilistic Event Streams | 2021-01-21 | Paper |
| Polynomial pass lower bounds for graph streaming algorithms | 2020-01-30 | Paper |
| A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems | 2020-01-30 | Paper |
| A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs | 2019-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5240418 | 2019-10-25 | Paper |
| Sublinear Algorithms for (Δ + 1) Vertex Coloring | 2019-10-15 | Paper |
| Stochastic Submodular Cover with Limited Adaptivity | 2019-10-15 | Paper |
| Perfect matchings in \(\tilde{O}(n^{1.5})\) time in regular bipartite graphs | 2019-09-04 | Paper |
| Approximating matching size from random streams | 2019-06-20 | Paper |
| Disjoint Set Union with Randomized Linking | 2019-06-20 | Paper |
| Influence Maximization in Undirected Networks | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743414 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633805 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633807 | 2019-05-06 | Paper |
| Edge-disjoint paths revisited | 2018-11-05 | Paper |
| Sensitivity and computational complexity in financial networks | 2018-09-13 | Paper |
| Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model | 2018-07-16 | Paper |
| (1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space | 2018-07-16 | Paper |
| On Estimating Maximum Matching Size in Graph Streams | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607911 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608050 | 2018-03-15 | Paper |
| On (1,∊)-Restricted Assignment Makespan Minimization | 2017-10-05 | Paper |
| Connectivity in Random Forests and Credit Networks | 2017-10-05 | Paper |
| Streaming Lower Bounds for Approximating MAX-CUT | 2017-10-05 | Paper |
| Tight bounds for single-pass streaming complexity of the set cover problem | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365145 | 2017-09-29 | Paper |
| A greedy approximation algorithm for minimum-gap scheduling | 2017-09-01 | Paper |
| Algorithms for Provisioning Queries and Analytics | 2017-07-14 | Paper |
| Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches | 2017-07-13 | Paper |
| Strategic Network Formation with Attack and Immunization | 2017-02-10 | Paper |
| Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems | 2016-09-29 | Paper |
| Design networks with bounded pairwise distance | 2016-09-29 | Paper |
| Fast Convergence in the Double Oral Auction | 2016-01-08 | Paper |
| Polynomial flow-cut gaps and hardness of directed cut problems | 2015-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501799 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501353 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501370 | 2015-08-03 | Paper |
| Approximability of capacitated network design | 2015-07-10 | Paper |
| Algorithms for minimizing weighted flow time | 2015-02-27 | Paper |
| On the Power of Adversarial Infections in Networks | 2015-01-13 | Paper |
| Hardness of cut problems in directed graphs | 2014-11-25 | Paper |
| Edge-disjoint paths in Planar graphs with constant congestion | 2014-11-25 | Paper |
| Approximation algorithms for data placement on parallel disks | 2014-11-18 | Paper |
| Perfect matchings via uniform sampling in regular bipartite graphs | 2014-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921673 | 2014-10-13 | Paper |
| Perfect matchings in o( n log n ) time in regular bipartite graphs | 2014-08-13 | Paper |
| Algorithms for the Generalized Sorting Problem | 2014-07-30 | Paper |
| Delays and the Capacity of Continuous-Time Channels | 2014-07-30 | Paper |
| An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design | 2014-07-25 | Paper |
| On Allocating Goods to Maximize Fairness | 2014-07-25 | Paper |
| Dynamic and Non-uniform Pricing Strategies for Revenue Maximization | 2014-07-25 | Paper |
| A Utility Equivalence Theorem for Concave Functions | 2014-06-02 | Paper |
| Dynamic and Nonuniform Pricing Strategies for Revenue Maximization | 2014-04-11 | Paper |
| The All-or-Nothing Multicommodity Flow Problem | 2013-11-14 | Paper |
| Perfect Matchings in $O(n\log n)$ Time in Regular Bipartite Graphs | 2013-09-25 | Paper |
| Distributed Private Heavy Hitters | 2013-08-12 | Paper |
| A Greedy Approximation Algorithm for Minimum-Gap Scheduling | 2013-06-07 | Paper |
| Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply | 2012-11-02 | Paper |
| STCON in Directed Unique-Path Graphs | 2012-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2913818 | 2012-09-27 | Paper |
| Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs | 2011-12-19 | Paper |
| Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs | 2011-08-17 | Paper |
| Social Welfare in One-Sided Matching Markets without Money | 2011-08-17 | Paper |
| Approximability of Capacitated Network Design | 2011-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002769 | 2011-05-24 | Paper |
| Multicommodity flow, well-linked terminals, and routing problems | 2010-08-16 | Paper |
| Asymmetric k-center is log * n -hard to approximate | 2010-08-15 | Paper |
| The all-or-nothing multicommodity flow problem | 2010-08-15 | Paper |
| Multi-processor scheduling to minimize flow time with ε resource augmentation | 2010-08-15 | Paper |
| Approximation schemes for preemptive weighted flow time | 2010-08-05 | Paper |
| Robust self-assembly of graphs | 2010-05-05 | Paper |
| Edge-Disjoint Paths in Planar Graphs with Constant Congestion | 2010-03-17 | Paper |
| Nash Dynamics in Constant Player and Bounded Jump Congestion Games | 2009-12-01 | Paper |
| Robust Self-assembly of Graphs | 2009-11-10 | Paper |
| A note on multiflows and treewidth | 2009-08-27 | Paper |
| The network as a storage device: dynamic routing with bounded buffers | 2009-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549611 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549612 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549697 | 2009-01-05 | Paper |
| Asymmetric k -center is log * n -hard to approximate | 2008-12-21 | Paper |
| Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data | 2008-09-09 | Paper |
| Algorithms for 2-Route Cut Problems | 2008-08-28 | Paper |
| On the complexity of graph self-assembly in accretive systems | 2008-07-31 | Paper |
| A Formal Investigation of Diff3 | 2008-04-24 | Paper |
| On the Complexity of Graph Self-assembly in Accretive Systems | 2008-04-04 | Paper |
| Efficient Enumeration of Phylogenetically Informative Substrings | 2007-08-30 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem | 2006-06-01 | Paper |
| Randomized Pursuit-Evasion with Local Visibility | 2006-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692739 | 2005-09-28 | Paper |
| A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem | 2005-09-16 | Paper |
| Directed Network Design with Orientation Constraints | 2005-09-16 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| On the Hardness of 4-Coloring a 3-Colorable Graph | 2005-02-28 | Paper |
| On Multidimensional Packing Problems | 2005-02-21 | Paper |
| Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737152 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472435 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473278 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471268 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471352 | 2004-07-28 | Paper |
| Time-constrained scheduling of weighted packets on trees and meshes | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768299 | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542565 | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542586 | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535067 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768280 | 2002-03-24 | Paper |
| Complexity Classifications of Boolean Constraint Satisfaction Problems | 2001-07-03 | Paper |
| On the hardness of approximating the chromatic number | 2001-06-12 | Paper |
| The Approximability of Constraint Satisfaction Problems | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526965 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952619 | 2001-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952683 | 2000-10-23 | Paper |
| On indexed data broadcast | 2000-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252288 | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252398 | 2000-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952620 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952674 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252268 | 2000-04-13 | Paper |
| The Angular-Metric Traveling Salesman Problem | 2000-03-19 | Paper |
| On Broadcast Disk Paging | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259987 | 1999-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228486 | 1999-03-01 | Paper |
| On Syntactic versus Computational Views of Approximability | 1998-09-21 | Paper |
| On certificates and lookahead in dynamic graph problems | 1998-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875189 | 1996-04-28 | Paper |
| A linear time algorithm for sequential diagnosis in hypercubes | 1995-07-06 | Paper |
