| Publication | Date of Publication | Type |
|---|
| Switch scheduling via randomized edge coloring | 2026-05-29 | Paper |
| Storage management for evolving databases | 2026-05-21 | Paper |
| Clustering data streams | 2026-05-08 | Paper |
On approximating the longest path in a graph
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Visibility-based pursuit-evasion in a polygonal environment
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Intractability of assembly sequencing: unit disks in the plane
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Constrained TSP and low-power computing
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Distinct Values Estimators for Power Law Distributions
2006 Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Complexity of graph partition problems
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | 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 |
Querying priced information in databases, the conjunctive case
ACM Transactions on Algorithms | 2015-09-02 | Paper |
| scientific article; zbMATH DE number 6472596 (Why is no real title available?) | 2015-08-14 | Paper |
| scientific article; zbMATH DE number 6469188 (Why is no real title available?) | 2015-08-03 | Paper |
| Finding large cycles in Hamiltonian graphs | 2014-10-13 | Paper |
Online graph edge-coloring in the random-order arrival model
Theory of Computing | 2014-10-06 | Paper |
Finding long paths and cycles in sparse Hamiltonian graphs
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Computing the median with uncertainty
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
On the decidability of accessibility problems (extended abstract)
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
| A 1.43-competitive online graph edge coloring algorithm in the random order arrival model | 2014-05-22 | Paper |
Approximate nearest neighbor: towards removing the curse of dimensionality
Theory of Computing | 2012-09-27 | Paper |
On the graph turnpike problem
Information Processing Letters | 2010-08-20 | Paper |
Finding large cycles in Hamiltonian graphs
Discrete Applied Mathematics | 2010-05-25 | Paper |
A combinatorial algorithm for MAX CSP
Information Processing Letters | 2009-03-23 | Paper |
| scientific article; zbMATH DE number 5506204 (Why is no real title available?) | 2009-02-10 | Paper |
Lower Bounds on Locality Sensitive Hashing
SIAM Journal on Discrete Mathematics | 2008-12-05 | Paper |
Estimating Sum by Weighted Sampling
Automata, Languages and Programming | 2007-11-28 | Paper |
Fractional Matching Via Balls-and-Bins
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Computing shortest paths with uncertainty
Journal of Algorithms | 2007-05-14 | Paper |
The price of validity in dynamic networks
Journal of Computer and System Sciences | 2007-04-26 | Paper |
A simple approach for pricing equity options with Markov switching state variables
Quantitative Finance | 2006-08-21 | Paper |
The load rebalancing problem
Journal of Algorithms | 2006-08-14 | Paper |
Scale-free aggregation in sensor networks
Theoretical Computer Science | 2005-12-05 | Paper |
Database Theory - ICDT 2005
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Database Theory - ICDT 2005
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Database Theory - ICDT 2005
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Algorithmic Aspects of Wireless Sensor Networks
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Incremental Clustering and Dynamic Information Retrieval
SIAM Journal on Computing | 2005-02-21 | Paper |
Proof verification and the hardness of approximation problems
Journal of the ACM | 2005-01-25 | Paper |
Combinatorial and experimental methods for approximate point pattern matching
Algorithmica | 2004-12-02 | Paper |
| scientific article; zbMATH DE number 2119720 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2119721 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2119649 (Why is no real title available?) | 2004-11-29 | Paper |
Combining request scheduling with web caching
Theoretical Computer Science | 2004-11-23 | Paper |
Modeling correlations in web traces and implications for designing replacement policies
Computer Networks | 2004-11-18 | Paper |
List Partitions
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
Online Scheduling with Lookahead: Multipass Assembly Lines
INFORMS Journal on Computing | 2003-12-16 | Paper |
| scientific article; zbMATH DE number 1962828 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1962827 (Why is no real title available?) | 2003-08-11 | Paper |
Computing the Median with Uncertainty
SIAM Journal on Computing | 2003-06-19 | Paper |
Worst-case time bounds for coloring and satisfiability problems
Journal of Algorithms | 2003-05-14 | Paper |
Maintaining Stream Statistics over Sliding Windows
SIAM Journal on Computing | 2003-01-05 | Paper |
Approximating the Longest Cycle Problem in Sparse Graphs
SIAM Journal on Computing | 2002-09-29 | Paper |
| scientific article; zbMATH DE number 1775450 (Why is no real title available?) | 2002-08-01 | Paper |
| scientific article; zbMATH DE number 1501059 (Why is no real title available?) | 2002-04-18 | Paper |
| scientific article; zbMATH DE number 1256636 (Why is no real title available?) | 2002-01-17 | Paper |
Approximation techniques for average completion time scheduling
SIAM Journal on Computing | 2001-06-21 | Paper |
| scientific article; zbMATH DE number 1559578 (Why is no real title available?) | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1559577 (Why is no real title available?) | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1445392 (Why is no real title available?) | 2001-01-17 | Paper |
| scientific article; zbMATH DE number 1517989 (Why is no real title available?) | 2000-10-17 | Paper |
| scientific article; zbMATH DE number 1303582 (Why is no real title available?) | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1419217 (Why is no real title available?) | 2000-05-11 | Paper |
| scientific article; zbMATH DE number 1305437 (Why is no real title available?) | 2000-04-25 | Paper |
The Angular-Metric Traveling Salesman Problem
SIAM Journal on Computing | 2000-03-19 | Paper |
Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
Discrete Applied Mathematics | 2000-01-17 | Paper |
| scientific article; zbMATH DE number 1263211 (Why is no real title available?) | 1999-11-08 | Paper |
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
SIAM Journal on Computing | 1999-10-28 | Paper |
Approximating Capacitated Routing and Delivery Problems
SIAM Journal on Computing | 1999-10-28 | Paper |
Randomized query processing in robot path planning
Journal of Computer and System Sciences | 1999-09-13 | Paper |
Realization of Matrices and Directed Graphs
Journal of Algorithms | 1999-08-23 | Paper |
Approximating probability distributions using small sample spaces
Combinatorica | 1999-05-18 | Paper |
| scientific article; zbMATH DE number 1256750 (Why is no real title available?) | 1999-03-01 | Paper |
| scientific article; zbMATH DE number 1248190 (Why is no real title available?) | 1999-02-02 | Paper |
| scientific article; zbMATH DE number 1246227 (Why is no real title available?) | 1999-01-27 | Paper |
Approximate graph coloring by semidefinite programming
Journal of the ACM | 1999-01-11 | Paper |
Approximate graph coloring by semidefinite programming
Journal of the ACM | 1999-01-11 | Paper |
| scientific article; zbMATH DE number 1305495 (Why is no real title available?) | 1999-01-01 | Paper |
On Syntactic versus Computational Views of Approximability
SIAM Journal on Computing | 1998-09-21 | Paper |
On certificates and lookahead in dynamic graph problems
Algorithmica | 1998-08-02 | Paper |
The Robot Localization Problem
SIAM Journal on Computing | 1998-02-10 | 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 871918 (Why is no real title available?) | 1996-04-28 | Paper |
| scientific article; zbMATH DE number 871954 (Why is no real title available?) | 1996-04-28 | Paper |
Tail bounds for occupancy and the satisfiability threshold conjecture
Random Structures & Algorithms | 1996-03-18 | Paper |
| scientific article; zbMATH DE number 797435 (Why is no real title available?) | 1996-03-05 | Paper |
| scientific article; zbMATH DE number 819814 (Why is no real title available?) | 1995-11-23 | Paper |
Clique partitions, graph compression and speeding-up algorithms
Journal of Computer and System Sciences | 1995-10-25 | Paper |
The probabilistic method yields deterministic parallel algorithms
Journal of Computer and System Sciences | 1995-10-24 | Paper |
Average-case analysis of algorithms for matchings and related problems
Journal of the ACM | 1995-04-10 | Paper |
Computing roots of graphs is hard
Discrete Applied Mathematics | 1994-11-03 | Paper |
scientific article; zbMATH DE number 432786 (Why is no real title available?)
(available as arXiv preprint) | 1994-09-19 | Paper |
Nonclairvoyant scheduling
Theoretical Computer Science | 1994-08-29 | Paper |
| scientific article; zbMATH DE number 437567 (Why is no real title available?) | 1993-12-15 | Paper |
Probabilistic Analysis of Network Flow Algorithms
Mathematics of Operations Research | 1993-06-29 | Paper |
The greedy algorithm is optimal for on-line edge coloring
Information Processing Letters | 1993-05-16 | Paper |
A Linear Time Approach to the Set Maxima Problem
SIAM Journal on Discrete Mathematics | 1992-06-28 | Paper |
Covering orthogonal polygons with star polygons: The perfect graph approach
Journal of Computer and System Sciences | 1990-01-01 | Paper |
Stable husbands
Random Structures & Algorithms | 1990-01-01 | Paper |
Perfect Graphs and Orthogonally Convex Covers
SIAM Journal on Discrete Mathematics | 1989-01-01 | Paper |
Deferred Data Structuring
SIAM Journal on Computing | 1988-01-01 | Paper |
