| Publication | Date of Publication | Type |
|---|
Mathematical Thinking
Compact Textbooks in Mathematics | 2023-10-30 | Paper |
Near-optimal disjoint-path facility location through set cover by pairs
Operations Research | 2020-11-04 | Paper |
Disjoint-path facility location: theory and practice
2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Capacitated metric labeling
| 2017-09-29 | Paper |
On construction of \(k\)-wise independent random variables
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
A lower bound of \(8/(7+\frac{1}{k-1})\) on the integrality ratio of the Călinescu-Karloff-Rabani relaxation for multiway cut
Information Processing Letters | 2016-06-16 | Paper |
On the convergence time of a path-vector protocol
| 2015-08-03 | Paper |
Compressing rectilinear pictures and minimizing access control lists
| 2014-12-18 | Paper |
On earthmover distance, metric labeling, and 0-extension
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
An improved approximation algorithm for \textsc{Resource Allocation}
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Fast algorithms for constructing maximum entropy summary trees
Automata, Languages, and Programming | 2014-07-01 | Paper |
scientific article; zbMATH DE number 6297759 (Why is no real title available?)
| 2014-05-22 | Paper |
Sequential dependency computation via geometric data structures
Computational Geometry | 2014-01-22 | Paper |
Scheduling to minimize staleness and stretch in real-time data warehouses
Theory of Computing Systems | 2012-12-10 | Paper |
On parsimonious explanations for 2-D tree- and linearly-ordered data
| 2012-01-23 | Paper |
Improved approximation algorithms for label cover problems
Algorithmica | 2011-08-16 | Paper |
Improved approximation algorithms for prize-collecting Steiner tree and TSP
SIAM Journal on Computing | 2011-07-29 | Paper |
OPT versus LOAD in dynamic storage allocation
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
On the fractal behavior of {TCP}
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
On earthmover distance, metric labeling, and 0-extension
SIAM Journal on Computing | 2010-04-29 | Paper |
Linear programming.
Modern Birkhäuser Classics | 2010-03-24 | Paper |
Improved Approximation Algorithms for Label Cover Problems
Lecture Notes in Computer Science | 2009-10-29 | Paper |
On the integrality ratio for tree augmentation
Operations Research Letters | 2009-03-04 | Paper |
New algorithms for an ancient scheduling problem.
Journal of Computer and System Sciences | 2008-12-21 | Paper |
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem
Mathematics of Operations Research | 2008-05-27 | Paper |
Lower bounds for linear locally decodable codes and private information retrieval
Computational Complexity | 2007-01-24 | Paper |
Caching with Expiration Times for Internet Applications
Internet Mathematics | 2006-05-09 | Paper |
SEPARATING POINTS BY AXIS-PARALLEL LINES
International Journal of Computational Geometry & Applications | 2006-03-13 | Paper |
Approximating directed multicuts
Combinatorica | 2006-01-26 | Paper |
OPTVersusLOADin Dynamic Storage Allocation
SIAM Journal on Computing | 2005-02-21 | Paper |
Approximation Algorithms for the 0-Extension Problem
SIAM Journal on Computing | 2005-02-21 | Paper |
scientific article; zbMATH DE number 2119709 (Why is no real title available?)
| 2004-11-29 | Paper |
scientific article; zbMATH DE number 2086936 (Why is no real title available?)
| 2004-08-11 | Paper |
A new approximation algorithm for finding heavy planar subgraphs
Algorithmica | 2003-08-17 | Paper |
scientific article; zbMATH DE number 1775387 (Why is no real title available?)
| 2002-08-01 | Paper |
Approximation algorithms for the 0-extension problem
| 2002-06-30 | Paper |
scientific article; zbMATH DE number 1256655 (Why is no real title available?)
| 2002-01-17 | Paper |
A decomposition theorem for task systems and bounds for randomized server problems
SIAM Journal on Computing | 2001-03-19 | Paper |
An improved approximation algorithm of MULTIWAY CUT.
Journal of Computer and System Sciences | 2000-11-21 | Paper |
New Results on the Old k-opt Algorithm for the Traveling Salesman Problem
SIAM Journal on Computing | 1999-10-28 | Paper |
How Good is the Goemans--Williamson MAX CUT Algorithm?
SIAM Journal on Computing | 1999-10-28 | Paper |
Competitive Algorithms for Layered Graph Traversal
SIAM Journal on Computing | 1998-09-21 | Paper |
On construction of \(k\)-wise independent random variables
Combinatorica | 1998-01-05 | Paper |
A Better Approximation Algorithm for Finding Planar Subgraphs
Journal of Algorithms | 1998-01-01 | Paper |
scientific article; zbMATH DE number 1003245 (Why is no real title available?)
| 1997-04-23 | Paper |
scientific article; zbMATH DE number 871902 (Why is no real title available?)
| 1996-10-21 | Paper |
scientific article; zbMATH DE number 928682 (Why is no real title available?)
| 1996-09-22 | Paper |
scientific article; zbMATH DE number 871895 (Why is no real title available?)
| 1996-06-16 | Paper |
scientific article; zbMATH DE number 1256761 (Why is no real title available?)
| 1996-01-01 | Paper |
scientific article; zbMATH DE number 432775 (Why is no real title available?)
| 1994-09-19 | Paper |
Algebraic methods for interactive proof systems
Journal of the ACM | 1994-08-21 | Paper |
A better lower bound for on-line scheduling
Information Processing Letters | 1994-06-15 | Paper |
Fast algorithms for approximately counting mismatches
Information Processing Letters | 1994-06-09 | Paper |
Lower Bounds for Randomized k-Server and Motion-Planning Algorithms
SIAM Journal on Computing | 1994-05-10 | Paper |
Randomized algorithms and pseudorandom numbers
Journal of the ACM | 1993-12-06 | Paper |
Fast geometric approximation techniques and geometric embedding problems
Theoretical Computer Science | 1993-04-22 | Paper |
scientific article; zbMATH DE number 50649 (Why is no real title available?)
| 1992-09-18 | Paper |
Connectivity vs. reachability
Information and Computation | 1991-01-01 | Paper |
How Long Can a Euclidean Traveling Salesman Tour Be?
SIAM Journal on Discrete Mathematics | 1989-01-01 | Paper |
The iterated mod problem
Information and Computation | 1989-01-01 | Paper |
An NC algorithm for Brooks' theorem
Theoretical Computer Science | 1989-01-01 | Paper |
Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques
Information Processing Letters | 1988-01-01 | Paper |
Coloring planar graphs in parallel
Journal of Algorithms | 1987-01-01 | Paper |
Efficient parallel algorithms for edge coloring problems
Journal of Algorithms | 1987-01-01 | Paper |
A Las Vegas RNC algorithm for maximum matching
Combinatorica | 1986-01-01 | Paper |
