| Publication | Date of Publication | Type |
|---|
Online paging with heterogeneous cache slots
Algorithmica | 2025-01-24 | Paper |
Better hardness results for the minimum spanning tree congestion problem
Algorithmica | 2025-01-24 | Paper |
| A tight threshold bound for search trees with 2-way comparisons | 2024-11-12 | Paper |
| Online paging with heterogeneous cache slots | 2024-10-08 | Paper |
Classification via two-way comparisons (extended abstract)
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Better hardness results for the minimum spanning tree congestion problem
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons
ACM Transactions on Algorithms | 2023-10-31 | Paper |
A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines
SIAM Journal on Computing | 2022-11-15 | Paper |
On Huang and Wong's algorithm for generalized binary split trees
Acta Informatica | 2022-10-24 | Paper |
Better Bounds for Online Line Chasing
(available as arXiv preprint) | 2022-07-21 | Paper |
Scheduling with gaps: new models and algorithms
Journal of Scheduling | 2021-12-13 | Paper |
Information gathering in ad-hoc radio networks
Information and Computation | 2021-11-25 | Paper |
On the cost of unsuccessful searches in search trees with two-way comparisons
Information and Computation | 2021-11-25 | Paper |
New results on multi-level aggregation
Theoretical Computer Science | 2021-03-09 | Paper |
Online Algorithms for Multilevel Aggregation
Operations Research | 2020-11-04 | Paper |
Towards a theory of mixing graphs: a characterization of perfect mixability
Theoretical Computer Science | 2020-10-22 | Paper |
A waste-efficient algorithm for single-droplet sample preparation on microfluidic chips
(available as arXiv preprint) | 2020-07-22 | Paper |
Online clique clustering
Algorithmica | 2020-02-28 | Paper |
| Towards a theory of mixing graphs: a characterization of perfect mixability (extended abstract) | 2020-02-06 | Paper |
A \(\phi\)-competitive algorithm for scheduling packets with deadlines
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
| An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs | 2019-08-19 | Paper |
Better Approximation Bounds for the Joint Replenishment Problem
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Online packet scheduling with bounded delay and lookahead
Theoretical Computer Science | 2019-05-29 | Paper |
| Collecting weighted items from a dynamic queue | 2019-05-06 | Paper |
Improved online algorithms for buffer management in QoS switches
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Online packet scheduling with bounded delay and lookahead
(available as arXiv preprint) | 2018-04-19 | Paper |
Faster information gathering in ad-hoc radio tree networks
Algorithmica | 2018-04-11 | Paper |
Online algorithms for multi-level aggregation
(available as arXiv preprint) | 2018-03-02 | Paper |
Information gathering in ad-hoc radio networks with tree topology
Information and Computation | 2017-12-20 | Paper |
Competitive analysis of randomized paging algorithms
Algorithms — ESA '96 | 2017-12-05 | Paper |
A greedy approximation algorithm for minimum-gap scheduling
Journal of Scheduling | 2017-09-01 | Paper |
A simple analysis of the harmonic algorithm for two servers
Information Processing Letters | 2016-06-16 | Paper |
A better lower bound on the competitive ratio of the randomized 2-server problem
Information Processing Letters | 2016-05-26 | Paper |
Faster information gathering in ad-hoc radio tree networks
Lecture Notes in Computer Science | 2016-05-03 | Paper |
Approximation algorithms for the joint replenishment problem with deadlines
Journal of Scheduling | 2016-01-22 | Paper |
Optimal Search Trees with 2-Way Comparisons
Algorithms and Computation | 2016-01-11 | Paper |
Competitive strategies for online clique clustering
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Scheduling with gaps: new models and algorithms
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Information gathering in ad-hoc radio networks with tree topology
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
The greedy algorithm for the minimum common string partition problem
ACM Transactions on Algorithms | 2015-09-02 | Paper |
LP-rounding algorithms for the fault-tolerant facility placement problem
Journal of Discrete Algorithms | 2015-08-18 | Paper |
| The wake-up problem in multi-hop radio networks | 2015-08-03 | Paper |
A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines
Journal of Scheduling | 2015-07-28 | Paper |
Group search on the line
Lecture Notes in Computer Science | 2015-02-20 | Paper |
Polynomial-time algorithms for minimum energy scheduling
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Algorithms for placing monitors in a flow network
Algorithmica | 2014-03-25 | Paper |
Better bounds for incremental frequency allocation in bipartite graphs
Theoretical Computer Science | 2013-12-11 | Paper |
Online control message aggregation in chain networks
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Approximation algorithms for the joint replenishment problem with deadlines
Lecture Notes in Computer Science | 2013-08-06 | Paper |
A greedy approximation algorithm for minimum-gap scheduling
Lecture Notes in Computer Science | 2013-06-07 | Paper |
LP-rounding algorithms for the fault-tolerant facility placement problem (extended abstract)
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Approximation algorithms for the fault-tolerant facility placement problem
Information Processing Letters | 2013-03-28 | Paper |
Collecting weighted items from a dynamic queue
Algorithmica | 2013-03-05 | Paper |
A \(\phi\)-competitive algorithm for collecting items with increasing weights from a dynamic queue
Theoretical Computer Science | 2013-03-04 | Paper |
Caching is hard -- even in the fault model
Algorithmica | 2012-12-06 | Paper |
Tile-packing tomography is \(\mathbb{NP}\)-hard
Algorithmica | 2012-11-21 | Paper |
A low-cost memory remapping scheme for address bus protection
Journal of Parallel and Distributed Computing | 2012-03-07 | Paper |
Randomized competitive algorithms for online buffer management in the adaptive adversary model
Theoretical Computer Science | 2011-10-10 | Paper |
Two-bounded-space bin packing revisited
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Better bounds for incremental frequency allocation in bipartite graphs
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Better bounds for incremental medians
Theoretical Computer Science | 2011-02-21 | Paper |
Caching is hard -- even in the fault model
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Tile-packing tomography is \({\mathbb{NP}}\)-hard
Lecture Notes in Computer Science | 2010-07-20 | Paper |
The reverse greedy algorithm for the metric k-median problem
Information Processing Letters | 2009-12-18 | Paper |
Algorithms for testing fault-tolerance of sequenced jobs
Journal of Scheduling | 2009-12-02 | Paper |
Three results on frequency assignment in linear cellular networks
Theoretical Computer Science | 2009-12-01 | Paper |
| Improving the minimum-height grid drawings of plane graphs. | 2009-10-16 | Paper |
Algorithms for Placing Monitors in a Flow Network
Algorithmic Aspects in Information and Management | 2009-07-02 | Paper |
Three Results on Frequency Assignment in Linear Cellular Networks
Algorithmic Aspects in Information and Management | 2009-07-02 | Paper |
Randomized Algorithms for Buffer Management with 2-Bounded Delay
Approximation and Online Algorithms | 2009-02-12 | Paper |
Experimental Analysis of Scheduling Algorithms for Aggregated Links
Approximation and Online Algorithms | 2009-02-12 | Paper |
Polynomial Time Algorithms for Minimum Energy Scheduling
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Oblivious Medians Via Online Bidding
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Competitive Analysis of Scheduling Algorithms for Aggregated Links
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Competitive analysis of scheduling algorithms for aggregated links
Algorithmica | 2008-07-01 | Paper |
Incremental medians via online bidding
Algorithmica | 2008-04-23 | Paper |
Better Bounds for Incremental Medians
Approximation and Online Algorithms | 2008-02-20 | Paper |
Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
SIAM Journal on Computing | 2008-01-03 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Online competitive algorithms for maximizing weighted throughput of unit jobs
Journal of Discrete Algorithms | 2007-11-05 | Paper |
The Wake‐Up Problem in MultiHop Radio Networks
SIAM Journal on Computing | 2007-10-22 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
A note on scheduling equal-length jobs to maximize throughput
Journal of Scheduling | 2007-05-15 | Paper |
The complexity of mean flow time scheduling problems with release times
Journal of Scheduling | 2007-05-15 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
The weighted 2-server problem
Theoretical Computer Science | 2004-11-23 | Paper |
| scientific article; zbMATH DE number 2086672 (Why is no real title available?) | 2004-08-11 | Paper |
A randomized algorithm for gossiping in radio networks
Networks | 2004-03-15 | Paper |
Preemptive scheduling of equal-length jobs to maximize weighted throughput.
Operations Research Letters | 2004-03-15 | Paper |
Preemptive scheduling in overloaded systems.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
On tiling under tomographic constraints.
Theoretical Computer Science | 2003-08-17 | Paper |
More on randomized on-line algorithms for caching.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1962818 (Why is no real title available?) | 2003-08-11 | Paper |
The 3-server problem in the plane.
Theoretical Computer Science | 2003-01-21 | Paper |
More on random walks, electrical networks, and the harmonic \(k\)-server algorithm.
Information Processing Letters | 2003-01-21 | Paper |
A randomized algorithm for two servers on the line.
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1834653 (Why is no real title available?) | 2002-11-25 | Paper |
Fast broadcasting and gossiping in radio networks
Journal of Algorithms | 2002-09-30 | Paper |
| scientific article; zbMATH DE number 1796990 (Why is no real title available?) | 2002-09-05 | Paper |
Reconstructing \(hv\)-convex polyominoes from orthogonal projections
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1754640 (Why is no real title available?) | 2002-06-12 | Paper |
Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1500546 (Why is no real title available?) | 2001-06-18 | Paper |
Computing simple paths among obstacles
Computational Geometry | 2001-04-10 | Paper |
Competitive Algorithms for Relaxed List Update and Multilevel Caching
Journal of Algorithms | 2000-08-28 | Paper |
Competitive analysis of randomized paging algorithms
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1303545 (Why is no real title available?) | 2000-05-25 | Paper |
LRU is better than FIFO
Algorithmica | 1999-08-17 | Paper |
| scientific article; zbMATH DE number 1303543 (Why is no real title available?) | 1999-06-17 | Paper |
Minimum-width grid drawings of plane graphs
Computational Geometry | 1999-01-11 | Paper |
Two results on linear embeddings of complete binary trees
Theoretical Computer Science | 1997-09-22 | Paper |
Page Migration Algorithms Using Work Functions
Journal of Algorithms | 1997-08-25 | Paper |
A linear-time algorithm for drawing a planar graph on a grid
Information Processing Letters | 1997-02-28 | Paper |
| scientific article; zbMATH DE number 742965 (Why is no real title available?) | 1995-04-11 | Paper |
Generosity Helps or an 11-Competitive Algorithm for Three Servers
Journal of Algorithms | 1994-03-22 | Paper |
| scientific article; zbMATH DE number 432816 (Why is no real title available?) | 1993-10-20 | Paper |
| scientific article; zbMATH DE number 140465 (Why is no real title available?) | 1993-03-28 | Paper |
HARMONIC is 3-competitive for two servers
Theoretical Computer Science | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 65695 (Why is no real title available?) | 1992-09-27 | Paper |
On fast algorithms for two servers
Journal of Algorithms | 1992-06-28 | Paper |
Planar orientations with low out-degree and compaction of adjacency matrices
Theoretical Computer Science | 1992-06-26 | Paper |
A note on the server problem and a benevolent adversary
Information Processing Letters | 1992-06-26 | Paper |
A New Approach to the Server Problem
SIAM Journal on Discrete Mathematics | 1992-06-25 | Paper |
An Optimal On-Line Algorithm for K Servers on Trees
SIAM Journal on Computing | 1991-01-01 | Paper |
Connectivity vs. reachability
Information and Computation | 1991-01-01 | Paper |
An efficient parallel algorithm for computing a large independent set in a planar graph
Algorithmica | 1991-01-01 | Paper |
A data structure useful for finding Hamiltonian cycles
Theoretical Computer Science | 1990-01-01 | Paper |
Improved edge-coloring algorithms for planar graphs
Journal of Algorithms | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4215366 (Why is no real title available?) | 1990-01-01 | Paper |
Optimal Parallel 5-Colouring of Planar Graphs
SIAM Journal on Computing | 1989-01-01 | Paper |
Fast algorithms for edge-coloring planar graphs
Journal of Algorithms | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4076639 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4099308 (Why is no real title available?) | 1988-01-01 | Paper |
On some packing problem related to dynamic storage allocation
RAIRO - Theoretical Informatics and Applications | 1988-01-01 | Paper |
A note on random sampling
Information Processing Letters | 1988-01-01 | Paper |
k\(+1\) heads are better than k for PDAs
Journal of Computer and System Sciences | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4033664 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4047151 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4041594 (Why is no real title available?) | 1987-01-01 | Paper |
Remarks on string-matching and one-way multihead automata
Information Processing Letters | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4026835 (Why is no real title available?) | 1986-01-01 | Paper |
Finite automata and unary languages
Theoretical Computer Science | 1986-01-01 | Paper |
Hierarchies of one-way multihead automata languages
Theoretical Computer Science | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4003548 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3911746 (Why is no real title available?) | 1985-01-01 | Paper |
A characterization of reversal-bounded multipushdown machine languages
Theoretical Computer Science | 1985-01-01 | Paper |
Variations on the technique of Ďuriš and Galil
Journal of Computer and System Sciences | 1985-01-01 | Paper |
A note on bounded-reversal multipushdown machines
Information Processing Letters | 1984-01-01 | Paper |
Probabilistic Turing machines and recursively enumerable Dedekind cuts
Information Processing Letters | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3885335 (Why is no real title available?) | 1984-01-01 | Paper |
