| Publication | Date of Publication | Type |
|---|
| Recursive random contraction revisited | 2024-05-14 | Paper |
| On approximating the longest path in a graph | 2023-01-18 | Paper |
| A phase transition and a quadratic time unbiased estimator for network reliability | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633832 | 2019-05-06 | Paper |
| Random Contractions and Sampling for Hypergraph and Hedge Connectivity | 2018-07-16 | Paper |
| Enumerating parametric global minimum cuts by random interleaving | 2017-09-29 | Paper |
| Rounding algorithms for a geometric embedding of minimum multiway cut | 2016-09-29 | Paper |
| Random sampling in cut, flow, and network design problems | 2016-09-01 | Paper |
| Derandomization through approximation, an NC algorithm for minimum cuts | 2016-09-01 | Paper |
| An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs | 2016-06-01 | Paper |
| Faster information dissemination in dynamic networks via network coding | 2015-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501810 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501811 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501328 | 2015-08-03 | Paper |
| Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs | 2015-06-02 | Paper |
| Fast Augmenting Paths by Random Sampling from Residual Graphs | 2015-06-02 | Paper |
| An Õ(n2) algorithm for minimum cuts | 2015-05-07 | Paper |
| A nearly optimal oracle for avoiding failed vertices and edges | 2015-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934716 | 2014-12-18 | Paper |
| Deterministic network coding by matrix completion | 2014-10-13 | Paper |
| Analysis of the evolution of peer-to-peer systems | 2014-07-25 | Paper |
| Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems | 2014-06-26 | Paper |
| The complexity of matrix completion | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579391 | 2010-08-06 | Paper |
| Random sampling in residual graphs | 2010-08-05 | Paper |
| Finding nearest neighbors in growth-restricted metrics | 2010-08-05 | Paper |
| Byzantine Modification Detection in Multicast Networks With Random Network Coding | 2009-02-24 | Paper |
| Using Linear Programming to Decode Binary Linear Codes | 2008-12-21 | Paper |
| Minimum-Cost Multicast over Coded Packet Networks | 2008-12-21 | Paper |
| Approximation Algorithms for Orienteering and Discounted-Reward TSP | 2008-04-22 | Paper |
| Subjective-cost policy routing | 2007-06-13 | Paper |
| Simple efficient load-balancing algorithms for peer-to-peer systems | 2007-01-25 | Paper |
| Minimum cuts in near-linear time | 2006-09-12 | Paper |
| Rounding algorithms for a geometric embedding of minimum multiway cut | 2005-11-11 | Paper |
| An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms | 2005-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4650826 | 2005-02-18 | Paper |
| Techniques for scheduling with rejection | 2004-10-01 | Paper |
| Decoding turbo-like codes via linear programming | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4709123 | 2003-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4706401 | 2003-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788599 | 2003-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542522 | 2002-08-01 | Paper |
| Learning Markov networks: Maximum bounded tree-width graphs | 2002-01-30 | Paper |
| Parallel processor scheduling with delay constraints | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234046 | 2002-01-29 | Paper |
| Random sampling in cut, flow, and network design problems | 2001-11-26 | Paper |
| A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem | 2001-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234075 | 2001-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721962 | 2001-07-11 | Paper |
| Augmenting Undirected Edge Connectivity in Õ(n2) Time | 2001-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527033 | 2001-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526987 | 2001-02-28 | Paper |
| Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems | 2000-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250218 | 2000-02-09 | Paper |
| A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234047 | 1999-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228454 | 1999-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250217 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250161 | 1999-06-17 | Paper |
| Random sampling and greedy sparsification for matroid optimization problems | 1999-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228453 | 1999-05-18 | Paper |
| Fast Connected Components Algorithms for the EREW PRAM | 1999-02-22 | Paper |
| Approximate graph coloring by semidefinite programming | 1999-01-11 | Paper |
| (De)randomized construction of small sample spaces in \(\mathcal{NC}\) | 1998-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398367 | 1998-07-19 | Paper |
| A randomized linear-time algorithm to find minimum spanning trees | 1998-02-02 | Paper |
| A new approach to the minimum cut problem | 1998-01-22 | Paper |
| On approximating the longest path in a graph | 1997-11-12 | Paper |
| An $\NC$ Algorithm for Minimum Cuts | 1997-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335203 | 1997-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128903 | 1997-04-23 | Paper |
| A Better Algorithm for an Ancient Scheduling Problem | 1996-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140397 | 1994-11-29 | Paper |
| Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths | 1994-02-07 | Paper |
