| Publication | Date of Publication | Type |
|---|
| Matching nuts and bolts faster | 2023-03-21 | Paper |
Weight balancing on boundaries
(available as arXiv preprint) | 2022-05-18 | Paper |
Weight Balancing on Boundaries and Skeletons
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
| Counting circles without computing them | 2017-07-17 | Paper |
| scientific article; zbMATH DE number 6472648 (Why is no real title available?) | 2015-08-14 | Paper |
Decision trees
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Order-preserving matching
Theoretical Computer Science | 2014-03-13 | Paper |
A Survey of the Game “Lights Out!”
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Computing minimum diameter color-spanning sets is hard
Information Processing Letters | 2013-04-04 | Paper |
An algorithmic analysis of the Honey-Bee game
Theoretical Computer Science | 2012-10-11 | Paper |
A new parameterized kernelization algorithm for the planar clique cover problem
Journal of Wuhan University. Natural Science Edition | 2012-06-01 | Paper |
Edge clique partition of \(K _{4}\)-free and planar graphs
Lecture Notes in Computer Science | 2011-11-11 | Paper |
Densest \(k\)-subgraph approximation on intersection graphs
Approximation and Online Algorithms | 2011-02-15 | Paper |
| The tourist in the shopping arcade | 2010-09-22 | Paper |
Computing minimum diameter color-spanning sets
Frontiers in Algorithmics | 2010-09-07 | Paper |
Extended islands of tractability for parsimony haplotyping
Combinatorial Pattern Matching | 2010-07-26 | Paper |
| scientific article; zbMATH DE number 5734572 (Why is no real title available?) | 2010-07-09 | Paper |
Algorithms for core stability, core largeness, exactness, and extendability of flow games
Frontiers of Mathematics in China | 2010-02-26 | Paper |
On the camera placement problem
Algorithms and Computation | 2009-12-17 | Paper |
Is the World Linear?
Lecture Notes in Computer Science | 2009-11-12 | Paper |
Die another day
Theory of Computing Systems | 2009-08-06 | Paper |
Competitive Online Approximation of the Optimal Search Ratio
SIAM Journal on Computing | 2009-06-22 | Paper |
Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Approximating the Maximum Sharing Problem
Lecture Notes in Computer Science | 2009-02-17 | Paper |
On Approximating the Maximum Simple Sharing Problem
Algorithms and Computation | 2008-04-24 | Paper |
Traversing the Machining Graph
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Efficient Algorithms for k-Disjoint Paths Problems on DAGs
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Non-metric Multicommodity and Multilevel Facility Location
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Die Another Day
Lecture Notes in Computer Science | 2007-11-15 | Paper |
Approximating the minimum weight weak vertex cover
Theoretical Computer Science | 2007-01-09 | Paper |
Online maintenance of \(k\)-medians and \(k\)-covers on a line
Algorithmica | 2006-09-26 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Fun-Sort -- or the chaos of unordered binary search
Discrete Applied Mathematics | 2005-02-23 | Paper |
Balanced scheduling toward loss-free packet queuing and delay fairness
Algorithmica | 2004-12-02 | Paper |
New results for online page replication
Theoretical Computer Science | 2004-11-23 | Paper |
Traveling salesmen in the presence of competition
Theoretical Computer Science | 2004-10-27 | Paper |
Solitaire clobber
Theoretical Computer Science | 2004-10-27 | Paper |
ONLINE ROUTING IN CONVEX SUBDIVISIONS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
Tight bounds on maximal and maximum matchings
Discrete Mathematics | 2004-08-19 | Paper |
| scientific article; zbMATH DE number 2081000 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080234 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2079622 (Why is no real title available?) | 2004-07-30 | Paper |
| scientific article; zbMATH DE number 1982181 (Why is no real title available?) | 2003-09-16 | Paper |
| scientific article; zbMATH DE number 1956212 (Why is no real title available?) | 2003-07-29 | Paper |
Decision trees: Old and new results.
Information and Computation | 2003-01-14 | Paper |
Optimal robot localization in trees
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1759407 (Why is no real title available?) | 2002-10-13 | Paper |
Limited bookmark randomized online algorithms for the paging problem
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1693468 (Why is no real title available?) | 2002-01-22 | Paper |
| scientific article; zbMATH DE number 1944412 (Why is no real title available?) | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1670659 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1670537 (Why is no real title available?) | 2001-11-11 | Paper |
A strong and easily computable separation bound for arithmetic expressions involving radicals
Algorithmica | 2001-01-29 | Paper |
On-line scheduling revisited
Journal of Scheduling | 2001-01-25 | Paper |
| scientific article; zbMATH DE number 1222820 (Why is no real title available?) | 1998-11-11 | Paper |
More Efficient Parallel Totally Monotone Matrix Searching
Journal of Algorithms | 1997-11-10 | Paper |
Matching nuts and bolts faster
Information Processing Letters | 1997-02-27 | Paper |
A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME
International Journal of Foundations of Computer Science | 1996-12-11 | Paper |
A communication-randomness tradeoff for two-processor systems
Information and Computation | 1995-05-28 | Paper |
A lower bound for the worst case of bottom-up-heapsort
Information and Computation | 1993-05-16 | Paper |
Simultaneous inner and outer approximation of shapes
Algorithmica | 1993-01-17 | Paper |
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
Algorithmica | 1993-01-17 | Paper |
Communication complexity of multi-processor systems
Information Processing Letters | 1989-01-01 | Paper |
