| Publication | Date of Publication | Type |
|---|
| Optimal energetic paths for electric cars | 2025-01-06 | Paper |
| The unweighted and weighted reverse shortest path problem for disk graphs | 2025-01-06 | Paper |
| Expander decomposition with fewer inter-cluster edges using a spectral cut player | 2024-11-14 | Paper |
| Fast approximation of search trees on trees with centroid trees | 2024-11-14 | Paper |
| Dynamic binary search trees: improved lower bounds for the greedy-future Algorithm | 2024-10-08 | Paper |
| Selection from heaps, row-sorted matrices, and \(X+Y\) using soft heaps | 2024-08-26 | Paper |
| Online weighted matching with a sample | 2024-07-19 | Paper |
| Simulating a stack using queues | 2024-07-19 | Paper |
Adversarially robust streaming algorithms via differential privacy
Journal of the ACM | 2024-06-06 | Paper |
| Insertion-only dynamic connectivity in general disk graphs | 2024-05-29 | Paper |
| Minimum-cost paths for electric cars | 2024-05-29 | Paper |
| Almost tight bounds for online facility location in the random-order model | 2024-05-14 | Paper |
| Dynamic connectivity in disk graphs | 2024-05-14 | Paper |
Dynamic connectivity in disk graphs
Discrete & Computational Geometry | 2024-01-09 | Paper |
Algorithms and complexity of sandwich problems in graphs (extended abstract)
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations
(available as arXiv preprint) | 2023-11-02 | Paper |
How to Find a Point in the Convex Hull Privately
(available as arXiv preprint) | 2023-11-02 | Paper |
scientific article; zbMATH DE number 7650377 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Simple confluently persistent catenable lists
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
| Fast approximation of search trees on trees with centroid trees | 2022-09-16 | Paper |
Differentially private learning of geometric concepts
SIAM Journal on Computing | 2022-07-22 | Paper |
| scientific article; zbMATH DE number 7561404 (Why is no real title available?) | 2022-07-21 | Paper |
| A faster deterministic exponential time algorithm for energy games and mean payoff games | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561380 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559208 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Triangles and girth in disk graphs and transmission graphs
(available as arXiv preprint) | 2022-05-11 | Paper |
| Separating adaptive streaming from oblivious streaming using the bounded storage model | 2022-04-22 | Paper |
Pairing heaps: the forward variant
(available as arXiv preprint) | 2021-08-04 | Paper |
Improved bounds for multipass pairing heaps and path-balanced binary search trees
(available as arXiv preprint) | 2021-08-04 | Paper |
| Min-cost bipartite perfect matching with delays | 2021-07-28 | Paper |
| Union of hypercubes and 3D Minkowski sums with random sizes | 2021-07-28 | Paper |
Stabbing pairwise intersecting disks by five points
Discrete Mathematics | 2021-06-14 | Paper |
Stabbing pairwise intersecting disks by five points
Discrete Mathematics | 2021-06-14 | Paper |
Clustering in hypergraphs to minimize average edge service time
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Union of hypercubes and 3D Minkowski sums with random sizes
Discrete & Computational Geometry | 2021-04-29 | Paper |
Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
SIAM Journal on Computing | 2021-04-14 | Paper |
Competitive Analysis with a Sample and the Secretary Problem
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Output sensitive algorithms for approximate incidences and their applications
Computational Geometry | 2021-01-07 | Paper |
Output sensitive algorithms for approximate incidences and their applications
Computational Geometry | 2021-01-07 | Paper |
Restoration by path concatenation: fast recovery of MPLS paths
Distributed Computing | 2020-12-03 | Paper |
Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
Discrete & Computational Geometry | 2020-10-23 | Paper |
Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
Discrete & Computational Geometry | 2020-06-16 | Paper |
| scientific article; zbMATH DE number 7205030 (Why is no real title available?) | 2020-05-27 | Paper |
| Clustering in Hypergraphs to Minimize Average Edge Service Time | 2020-05-27 | Paper |
| Output sensitive algorithms for approximate incidences and their applications | 2020-05-27 | Paper |
Reachability oracles for directed transmission graphs
Algorithmica | 2020-04-01 | Paper |
Faster \(k\)-SAT algorithms using biased-PPSZ
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
Computational Geometry | 2019-10-25 | Paper |
A sort of an adversary
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Reach for \(A^\ast\): efficient point-to-point shortest path algorithms
2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Reporting neighbors in high-dimensional Euclidean space
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Computing the discrete Fréchet distance in subquadratic time
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications | 2019-05-10 | Paper |
| A simpler implementation and analysis of Chazelle's soft heaps | 2019-05-06 | Paper |
| scientific article; zbMATH DE number 7051297 (Why is no real title available?) | 2019-05-06 | Paper |
| Line transversals of convex polyhedra in \(\mathbb{R}^3\) | 2019-05-06 | Paper |
Adjacency labeling schemes and induced-universal graphs
SIAM Journal on Discrete Mathematics | 2019-01-16 | Paper |
Hollow heaps
ACM Transactions on Algorithms | 2018-11-12 | Paper |
Submatrix maximum queries in Monge matrices and partial Monge matrices, and their applications
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Thin heaps, thick heaps
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Kinetic and dynamic data structures for closest pair and all nearest neighbors
ACM Transactions on Algorithms | 2018-11-05 | Paper |
The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Spanners for directed transmission graphs
SIAM Journal on Computing | 2018-08-21 | Paper |
Upward max-min fairness
Journal of the ACM | 2018-08-02 | Paper |
Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Approximating the \(k\)-level in three-dimensional plane arrangements
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
\((1 + \epsilon)\)-approximate \(f\)-sensitive distance oracles
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Improved bounds for multipass pairing heaps and path-balanced binary search trees
(available as arXiv preprint) | 2018-06-22 | Paper |
| scientific article; zbMATH DE number 6876089 (Why is no real title available?) | 2018-05-29 | Paper |
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Routing in unit disk graphs
Algorithmica | 2018-04-11 | Paper |
| Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time | 2018-03-15 | Paper |
Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
(available as arXiv preprint) | 2018-03-15 | Paper |
Approximating the k-Level in Three-Dimensional Plane Arrangements
A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
Minimum-cost flows in unit-capacity networks
Theory of Computing Systems | 2018-02-01 | Paper |
| scientific article; zbMATH DE number 6829368 (Why is no real title available?) | 2018-01-24 | Paper |
Guarding a terrain by two watchtowers
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
| Spanners and Reachability Oracles for Directed Transmission Graphs | 2017-10-10 | Paper |
The amortized cost of finding the minimum
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Average distance queries through weighted samples in graphs and metric spaces: high scalability with tight statistical guarantees
(available as arXiv preprint) | 2017-08-31 | Paper |
| Minimum cost flows in graphs with unit capacities | 2017-01-24 | Paper |
Exploiting regularities in web traffic patterns for cache replacement
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Unique maximum matching algorithms
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Connection caching
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Routing in unit disk graphs
Lecture Notes in Computer Science | 2016-05-03 | Paper |
Restoration by path concatenation, fast recovery of MPLS paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing | 2016-03-04 | Paper |
Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
Discrete & Computational Geometry | 2016-02-03 | Paper |
Faster and more dynamic maximum flow by incremental breadth-first search
Algorithms - ESA 2015 | 2015-11-19 | Paper |
The Temp Secretary Problem
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Weak ε-nets and interval chains
Journal of the ACM | 2015-11-11 | Paper |
Hollow Heaps
Automata, Languages, and Programming | 2015-10-27 | Paper |
On the complexity of hub labeling (extended abstract)
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Adjacency labeling schemes and induced-universal graphs
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
| scientific article; zbMATH DE number 6472609 (Why is no real title available?) | 2015-08-14 | Paper |
| Efficient estimation algorithms for neighborhood variance and other moments | 2015-08-03 | Paper |
The CB tree: a practical concurrent self-adjusting search tree
Distributed Computing | 2015-02-23 | Paper |
Union of random minkowski sums and network vulnerability analysis
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Private coresets
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Minimal indices for predecessor search
Information and Computation | 2015-01-30 | Paper |
| scientific article; zbMATH DE number 6381708 (Why is no real title available?) | 2014-12-18 | Paper |
| Optimal dynamic vertical ray shooting in rectilinear planar subdivisions | 2014-12-18 | Paper |
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Reporting neighbors in high-dimensional Euclidean space
SIAM Journal on Computing | 2014-11-14 | Paper |
Union of random Minkowski sums and network vulnerability analysis
Discrete & Computational Geometry | 2014-11-14 | Paper |
Data structures for mergeable trees
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Finding the largest empty disk containing a query point
International Journal of Computational Geometry & Applications | 2014-08-11 | Paper |
Finding the maximal empty disk containing a query point
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Computing the discrete Fréchet distance in subquadratic time
SIAM Journal on Computing | 2014-07-30 | Paper |
Algorithms and estimators for summarization of unaggregated data streams
Journal of Computer and System Sciences | 2014-06-10 | Paper |
A kinetic triangulation scheme for moving points in the plane
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Summarizing data using bottom-\(k\) sketches
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Soft heaps simplified
SIAM Journal on Computing | 2013-11-14 | Paper |
Scheduling Subset Tests: One-Time, Continuous, and How They Relate
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
What you can do with coordinated samples
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Minimal indices for successor search (extended abstract)
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Joint cache partition and job assignment on multi-core processors
Lecture Notes in Computer Science | 2013-08-12 | Paper |
CBTree: a practical concurrent self-adjusting search tree
Lecture Notes in Computer Science | 2013-03-13 | Paper |
I/O efficient dynamic data structures for longest prefix queries
Algorithmica | 2013-03-05 | Paper |
Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
Discrete & Computational Geometry | 2012-10-15 | Paper |
Unit distances in three dimensions
Combinatorics, Probability and Computing | 2012-09-04 | Paper |
An optimal dynamic data structure for stabbing-semigroup queries
SIAM Journal on Computing | 2012-05-30 | Paper |
Envy-free makespan approximation
SIAM Journal on Computing | 2012-05-30 | Paper |
Optimal cover of points by disks in a simple polygon
SIAM Journal on Computing | 2012-03-15 | Paper |
Efficient stream sampling for variance-optimal estimation of subset sums
SIAM Journal on Computing | 2012-02-11 | Paper |
| Minimum \(s-t\) cut in undirected planar graphs when the source and the sink are close | 2012-01-23 | Paper |
A simpler linear-time recognition of circular-arc graphs
Algorithmica | 2011-11-07 | Paper |
Maximum flows by incremental breadth-first search
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Maximum flow in directed planar graphs with vertex capacities
Algorithmica | 2011-08-16 | Paper |
On lines, joints, and incidences in three dimensions
Journal of Combinatorial Theory. Series A | 2011-04-11 | Paper |
Line Transversals of Convex Polyhedra in $\mathbb{R}^3$
SIAM Journal on Computing | 2011-04-04 | Paper |
The overlay of minimization diagrams in a randomized incremental construction
Discrete & Computational Geometry | 2011-03-31 | Paper |
A kinetic triangulation scheme for moving points in the plane
Computational Geometry | 2011-03-25 | Paper |
Range minima queries with respect to a random permutation, and approximate range counting
Discrete & Computational Geometry | 2011-03-10 | Paper |
On lines and joints
Discrete & Computational Geometry | 2010-11-08 | Paper |
Labeling Dynamic XML Trees
SIAM Journal on Computing | 2010-11-04 | Paper |
Guarding a terrain by two watchtowers
Algorithmica | 2010-09-16 | Paper |
Optimal cover of points by disks in a simple polygon
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Optimal oblivious routing in polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Dynamic rectangular intersection with priorities
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Learning with attribute costs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5764800 (Why is no real title available?) | 2010-08-06 | Paper |
Meldable heaps and boolean union-find
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
| Reach for \(A^*\): shortest path algorithms with preprocessing | 2010-07-09 | Paper |
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
Discrete Applied Mathematics | 2010-04-28 | Paper |
Efficient data structures and a new randomized approach for sorting signed permutations by reversals
Combinatorial Pattern Matching | 2010-04-06 | Paper |
The greedy algorithm for edit distance with moves
Information Processing Letters | 2009-12-18 | Paper |
Maximum Flow in Directed Planar Graphs with Vertex Capacities
Lecture Notes in Computer Science | 2009-10-29 | Paper |
The greedy algorithm for shortest superstrings
Information Processing Letters | 2009-08-27 | Paper |
Linear data structures for fast ray-shooting amidst convex polyhedra
Algorithmica | 2009-08-27 | Paper |
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
SIAM Journal on Computing | 2009-08-20 | Paper |
Efficient Colored Orthogonal Range Counting
SIAM Journal on Computing | 2009-06-22 | Paper |
On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
Automata, Languages and Programming | 2009-03-12 | Paper |
| Computing the volume of the union of cubes | 2009-02-12 | Paper |
| scientific article; zbMATH DE number 5506192 (Why is no real title available?) | 2009-02-10 | Paper |
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
Journal of the ACM | 2008-12-21 | Paper |
Path Minima in Incremental Unrooted Trees
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Processing top-\(k\) queries from samples
Computer Networks | 2008-10-08 | Paper |
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
I/O Efficient Dynamic Data Structures for Longest Prefix Queries
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Most Burrows-Wheeler Based Compressors Are Not Optimal
Combinatorial Pattern Matching | 2008-06-17 | Paper |
A simpler analysis of Burrows-Wheeler-based compression
Theoretical Computer Science | 2007-12-19 | Paper |
Strong Price of Anarchy for Machine Load Balancing
Automata, Languages and Programming | 2007-11-28 | Paper |
Online Conflict‐Free Coloring for Intervals
SIAM Journal on Computing | 2007-10-22 | Paper |
A Simpler Analysis of Burrows-Wheeler Based Compression
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Finding the Position of the k-Mismatch and Approximate Tandem Repeats
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
A Simpler Linear-Time Recognition of Circular-Arc Graphs
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Addendum to ``Scalable secure storage when half the system is faulty [inform. comput. 174 (2)(2002) 203-213]
Information and Computation | 2007-07-16 | Paper |
Associative search in peer to peer networks: Harnessing latent semantics
Computer Networks | 2007-04-26 | Paper |
Spatially-decaying aggregation over a network
Journal of Computer and System Sciences | 2007-04-26 | Paper |
Compact labeling scheme for XML ancestor queries
Theory of Computing Systems | 2007-02-14 | Paper |
Kinetic and dynamic data structures for convex hulls and upper envelopes
Computational Geometry | 2006-12-14 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Compact Labeling Scheme for Ancestor Queries
SIAM Journal on Computing | 2006-06-01 | Paper |
Partial alphabetic trees
Journal of Algorithms | 2006-04-28 | Paper |
On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems
Discrete Mathematics | 2005-08-01 | Paper |
Sorting signed permutations by reversals, revisited
Journal of Computer and System Sciences | 2005-05-04 | Paper |
Performance aspects of distributed caches using TTL-based consistency
Theoretical Computer Science | 2005-04-06 | Paper |
Balanced-Replication Algorithms for Distribution Trees
SIAM Journal on Computing | 2005-02-21 | Paper |
Nearest common ancestors: a survey and a new algorithm for a distributed environment
Theory of Computing Systems | 2005-02-08 | Paper |
Purely functional, real-time deques with catenation
Journal of the ACM | 2005-01-25 | Paper |
| scientific article; zbMATH DE number 2119758 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2119640 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2119760 (Why is no real title available?) | 2004-11-29 | Paper |
Optimal oblivious routing in polynomial time
Journal of Computer and System Sciences | 2004-11-18 | Paper |
| scientific article; zbMATH DE number 2079406 (Why is no real title available?) | 2004-07-28 | Paper |
Making data structures confluently persistent
Journal of Algorithms | 2004-03-14 | Paper |
Reachability and Distance Queries via 2-Hop Labels
SIAM Journal on Computing | 2003-09-28 | Paper |
Connection caching: Model and algorithms.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
Proactive caching of DNS records: Addressing a performance bottleneck.
Computer Networks | 2003-08-13 | Paper |
| scientific article; zbMATH DE number 1947386 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1947401 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1305526 (Why is no real title available?) | 2003-05-04 | Paper |
Scalable secure storage when half the system is faulty
Information and Computation | 2003-01-14 | Paper |
Competitive analysis of the LRFU paging algorithm
Algorithmica | 2002-12-01 | Paper |
| scientific article; zbMATH DE number 1830738 (Why is no real title available?) | 2002-11-18 | Paper |
| scientific article; zbMATH DE number 1830729 (Why is no real title available?) | 2002-11-18 | Paper |
| scientific article; zbMATH DE number 1775413 (Why is no real title available?) | 2002-09-17 | Paper |
Exploiting regularities in web traffic patterns for cache replacement
Algorithmica | 2002-06-17 | Paper |
| scientific article; zbMATH DE number 1754633 (Why is no real title available?) | 2002-06-12 | Paper |
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
Mathematical Programming. Series A. Series B | 2002-06-12 | Paper |
Caching documents with variable sizes and fetching costs: an LP-based approach
Algorithmica | 2002-05-21 | Paper |
Unique maximum matching algorithms
Journal of Algorithms | 2002-04-08 | Paper |
| Making data structures confluently persistent. (Extended abstract) | 2002-01-30 | Paper |
| Compact labeling schemes for ancestor queries. (Extended abstract) | 2002-01-30 | Paper |
| Faster kinetic heaps and their use in broadcast scheduling. (Extended abstract) | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1263185 (Why is no real title available?) | 2002-01-27 | Paper |
| scientific article; zbMATH DE number 1670854 (Why is no real title available?) | 2001-12-09 | Paper |
| scientific article; zbMATH DE number 1305443 (Why is no real title available?) | 2000-11-12 | Paper |
Simple Confluently Persistent Catenable Lists
SIAM Journal on Computing | 2000-10-18 | Paper |
Bounded degree interval sandwich problems
Algorithmica | 2000-04-03 | Paper |
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
SIAM Journal on Computing | 2000-03-19 | Paper |
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1256736 (Why is no real title available?) | 1999-10-04 | Paper |
| scientific article; zbMATH DE number 1305498 (Why is no real title available?) | 1999-09-15 | Paper |
Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
SIAM Journal on Computing | 1996-12-11 | Paper |
Graph Sandwich Problems
Journal of Algorithms | 1996-05-27 | Paper |
On the complexity of DNA physical mapping
Advances in Applied Mathematics | 1994-11-23 | Paper |
The domatic number problem on some perfect graph families
Information Processing Letters | 1994-05-19 | Paper |
