| Publication | Date of Publication | Type |
|---|
Recursive random contraction revisited
| 2024-05-14 | Paper |
On approximating the longest path in a graph
Lecture Notes in Computer Science | 2023-01-18 | Paper |
A phase transition and a quadratic time unbiased estimator for network reliability
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
A near-linear time algorithm for constructing a cactus representation of minimum cuts
| 2019-05-06 | Paper |
Random contractions and sampling for hypergraph and hedge connectivity
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Enumerating parametric global minimum cuts by random interleaving
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Rounding algorithms for a geometric embedding of minimum multiway cut
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Random sampling in cut, flow, and network design problems
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Derandomization through approximation, an NC algorithm for minimum cuts
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs
Information Processing Letters | 2016-06-01 | Paper |
Faster information dissemination in dynamic networks via network coding
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
scientific article; zbMATH DE number 6472607 (Why is no real title available?)
| 2015-08-14 | Paper |
scientific article; zbMATH DE number 6472608 (Why is no real title available?)
| 2015-08-14 | Paper |
scientific article; zbMATH DE number 6469210 (Why is no real title available?)
| 2015-08-03 | Paper |
Randomized approximation schemes for cuts and flows in capacitated graphs
SIAM Journal on Computing | 2015-06-02 | Paper |
Fast augmenting paths by random sampling from residual graphs
SIAM Journal on Computing | 2015-06-02 | Paper |
An Õ(n2) algorithm for minimum cuts
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
A nearly optimal oracle for avoiding failed vertices and edges
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems
| 2014-12-18 | Paper |
Deterministic network coding by matrix completion
| 2014-10-13 | Paper |
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing | 2014-07-25 | Paper |
Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems
Operations Research | 2014-06-26 | Paper |
The complexity of matrix completion
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
scientific article; zbMATH DE number 5764802 (Why is no real title available?)
| 2010-08-06 | Paper |
Random sampling in residual graphs
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Finding nearest neighbors in growth-restricted metrics
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Byzantine Modification Detection in Multicast Networks With Random Network Coding
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Using Linear Programming to Decode Binary Linear Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Minimum-Cost Multicast over Coded Packet Networks
| 2008-12-21 | Paper |
Approximation Algorithms for Orienteering and Discounted-Reward TSP
SIAM Journal on Computing | 2008-04-22 | Paper |
Subjective-cost policy routing
Theoretical Computer Science | 2007-06-13 | Paper |
Simple efficient load-balancing algorithms for peer-to-peer systems
Theory of Computing Systems | 2007-01-25 | Paper |
Minimum cuts in near-linear time
Journal of the ACM | 2006-09-12 | Paper |
Rounding algorithms for a geometric embedding of minimum multiway cut.
Mathematics of Operations Research | 2005-11-11 | Paper |
An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
scientific article; zbMATH DE number 2135149 (Why is no real title available?)
| 2005-02-18 | Paper |
Techniques for scheduling with rejection
Journal of Algorithms | 2004-10-01 | Paper |
Decoding turbo-like codes via linear programming
Journal of Computer and System Sciences | 2004-08-06 | Paper |
scientific article; zbMATH DE number 1931789 (Why is no real title available?)
| 2003-06-20 | Paper |
scientific article; zbMATH DE number 1928250 (Why is no real title available?)
| 2003-06-15 | Paper |
scientific article; zbMATH DE number 1857640 (Why is no real title available?)
| 2003-06-02 | Paper |
scientific article; zbMATH DE number 1775390 (Why is no real title available?)
| 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 |
scientific article; zbMATH DE number 1263176 (Why is no real title available?)
| 2002-01-29 | Paper |
Random sampling in cut, flow, and network design problems
Mathematics of Operations Research | 2001-11-26 | Paper |
A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem
SIAM Review | 2001-10-23 | Paper |
scientific article; zbMATH DE number 1263204 (Why is no real title available?)
| 2001-08-27 | Paper |
scientific article; zbMATH DE number 1617242 (Why is no real title available?)
| 2001-07-11 | Paper |
Augmenting Undirected Edge Connectivity in Õ(n2) Time
Journal of Algorithms | 2001-06-13 | Paper |
scientific article; zbMATH DE number 1559581 (Why is no real title available?)
| 2001-03-01 | Paper |
scientific article; zbMATH DE number 1559539 (Why is no real title available?)
| 2001-02-28 | Paper |
Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
Journal of Computer and System Sciences | 2000-02-17 | Paper |
scientific article; zbMATH DE number 1303592 (Why is no real title available?)
| 2000-02-09 | Paper |
A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
SIAM Journal on Computing | 1999-10-28 | Paper |
scientific article; zbMATH DE number 1263177 (Why is no real title available?)
| 1999-10-18 | Paper |
scientific article; zbMATH DE number 1256719 (Why is no real title available?)
| 1999-10-04 | Paper |
scientific article; zbMATH DE number 1303591 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1303538 (Why is no real title available?)
| 1999-06-17 | Paper |
Random sampling and greedy sparsification for matroid optimization problems
Mathematical Programming. Series A. Series B | 1999-06-03 | Paper |
scientific article; zbMATH DE number 1256718 (Why is no real title available?)
| 1999-05-18 | Paper |
Fast Connected Components Algorithms for the EREW PRAM
SIAM Journal on Computing | 1999-02-22 | Paper |
Approximate graph coloring by semidefinite programming
Journal of the ACM | 1999-01-11 | Paper |
(De)randomized construction of small sample spaces in \(\mathcal{NC}\)
Journal of Computer and System Sciences | 1998-08-04 | Paper |
scientific article; zbMATH DE number 1175950 (Why is no real title available?)
| 1998-07-19 | Paper |
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM | 1998-02-02 | Paper |
A new approach to the minimum cut problem
Journal of the ACM | 1998-01-22 | Paper |
On approximating the longest path in a graph
Algorithmica | 1997-11-12 | Paper |
An $\NC$ Algorithm for Minimum Cuts
SIAM Journal on Computing | 1997-09-07 | Paper |
scientific article; zbMATH DE number 1003243 (Why is no real title available?)
| 1997-04-23 | Paper |
scientific article; zbMATH DE number 1003274 (Why is no real title available?)
| 1997-04-23 | Paper |
A Better Algorithm for an Ancient Scheduling Problem
Journal of Algorithms | 1996-09-05 | Paper |
scientific article; zbMATH DE number 437525 (Why is no real title available?)
| 1994-11-29 | Paper |
Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
SIAM Journal on Computing | 1994-02-07 | Paper |
