| Publication | Date of Publication | Type |
|---|
Approximation algorithms and lower bounds for graph burning
| 2025-01-14 | Paper |
Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms
Operations Research Letters | 2024-06-17 | Paper |
Graph burning and non-uniform \(k\)-centers for small treewidth
Approximation and Online Algorithms | 2023-07-25 | Paper |
A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines
SIAM Journal on Computing | 2022-11-15 | Paper |
Improved analysis of online balanced clustering
| 2022-10-19 | Paper |
On-line scheduling of parallel jobs
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
On packet scheduling with adversarial jamming and speedup
Annals of Operations Research | 2021-05-05 | 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 |
A \(\phi\)-competitive algorithm for scheduling packets with deadlines
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | 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 |
The optimal absolute ratio for online bin packing
Journal of Computer and System Sciences | 2019-05-03 | Paper |
Scheduling shared continuous resources on many-cores
Journal of Scheduling | 2018-11-07 | Paper |
Improved online algorithms for buffer management in QoS switches
ACM Transactions on Algorithms | 2018-11-05 | Paper |
On packet scheduling with adversarial jamming and speedup
Approximation and Online Algorithms | 2018-06-22 | Paper |
Online packet scheduling with bounded delay and lookahead
| 2018-04-19 | Paper |
Online algorithms for multi-level aggregation
| 2018-03-02 | Paper |
Colored bin packing: online algorithms and lower bounds
Algorithmica | 2018-02-28 | Paper |
Online bin stretching with three bins
Journal of Scheduling | 2018-02-28 | Paper |
Logarithmic price of buffer downscaling on line metrics
Theoretical Computer Science | 2017-12-20 | Paper |
Some bounds on multiparty communication complexity of pointer jumping
STACS 96 | 2017-11-16 | Paper |
A two-phase algorithm for bin stretching with stretching factor 1.5
Journal of Combinatorial Optimization | 2017-11-16 | Paper |
General caching is hard: even with small pages
Algorithmica | 2017-10-10 | Paper |
The optimal absolute ratio for online bin packing
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
scientific article; zbMATH DE number 6678949 (Why is no real title available?)
| 2017-01-30 | Paper |
A simple analysis of the harmonic algorithm for two servers
Information Processing Letters | 2016-06-16 | Paper |
A lower bound for randomized on-line multiprocessor scheduling
Information Processing Letters | 2016-05-26 | Paper |
Online scheduling of jobs with fixed start times on related machines
Algorithmica | 2016-03-23 | Paper |
Online knapsack revisited
Theory of Computing Systems | 2016-03-21 | Paper |
General caching is hard: even with small pages
Lecture Notes in Computer Science | 2016-01-11 | Paper |
Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms
Approximation and Online Algorithms | 2015-11-20 | Paper |
Better Algorithms for Online Bin Stretching
Approximation and Online Algorithms | 2015-11-20 | Paper |
Online colored bin packing
Approximation and Online Algorithms | 2015-11-20 | Paper |
The greedy algorithm for the minimum common string partition problem
ACM Transactions on Algorithms | 2015-09-02 | Paper |
A lower bound on deterministic online algorithms for scheduling on related machines without preemption
Theory of Computing Systems | 2015-05-12 | Paper |
Optimal online scheduling of parallel jobs with dependencies
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Online bin packing: old algorithms and new results
Language, Life, Limits | 2015-02-25 | Paper |
Two algorithms for general list matrix partitions
| 2014-10-13 | Paper |
Lower bounds for online makespan minimization on a small number of related machines
Journal of Scheduling | 2014-08-18 | Paper |
Optimal analysis of best fit bin packing
Automata, Languages, and Programming | 2014-07-01 | Paper |
Graph balancing: a special case of scheduling unrelated parallel machines
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 |
Online scheduling of jobs with fixed start times on related machines
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Open Problems in Throughput Scheduling
Algorithms – ESA 2012 | 2012-09-25 | Paper |
A lower bound on deterministic online algorithms for scheduling on related machines without preemption
Approximation and Online Algorithms | 2012-07-16 | Paper |
Computer-aided complexity classification of dial-a-ride problems
INFORMS Journal on Computing | 2012-06-08 | Paper |
Semi-online preemptive scheduling: one algorithm for all variants
| 2012-04-24 | Paper |
Better bounds for incremental frequency allocation in bipartite graphs
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Two-bounded-space bin packing revisited
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Single source multiroute flows and cuts on uniform capacity networks
Theory of Computing | 2011-05-24 | Paper |
Semi-online preemptive scheduling: one algorithm for all variants
Theory of Computing Systems | 2011-05-23 | Paper |
scientific article; zbMATH DE number 5764783 (Why is no real title available?)
| 2010-08-06 | Paper |
A lower bound for cake cutting
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Optimal and online preemptive scheduling on uniformly related machines
Journal of Scheduling | 2009-12-02 | 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 |
Periodic scheduling with obligatory vacations
Theoretical Computer Science | 2009-11-06 | Paper |
Three Results on Frequency Assignment in Linear Cellular Networks
Algorithmic Aspects in Information and Management | 2009-07-02 | Paper |
Preemptive online scheduling: Optimal algorithms for all speeds
Algorithmica | 2009-05-06 | Paper |
Randomized strategies for the plurality problem
Discrete Applied Mathematics | 2009-03-04 | Paper |
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines
Approximation and Online Algorithms | 2009-02-12 | Paper |
Online Scheduling of Equal-Length Jobs on Parallel Machines
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Preemptive Online Scheduling: Optimal Algorithms for All Speeds
Lecture Notes in Computer Science | 2008-03-11 | Paper |
On the complexity of cake cutting
Discrete Optimization | 2008-01-18 | Paper |
Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
SIAM Journal on Computing | 2008-01-03 | Paper |
An approximation scheme for cake division with a linear number of cuts
Combinatorica | 2007-11-12 | Paper |
Online competitive algorithms for maximizing weighted throughput of unit jobs
Journal of Discrete Algorithms | 2007-11-05 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Paging with connections: FIFO strikes again
Theoretical Computer Science | 2007-06-06 | Paper |
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
Journal of Discrete Algorithms | 2007-02-14 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
On the Nonlearnability of a Single Spiking Neuron
Neural Computation | 2006-02-08 | 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 |
Coloring graphs from lists with bounded size of their union
Journal of Graph Theory | 2005-08-01 | Paper |
The weighted 2-server problem
Theoretical Computer Science | 2004-11-23 | Paper |
It is tough to be a plumber
Theoretical Computer Science | 2004-10-27 | Paper |
Approximation schemes for scheduling on uniformly related and identical parallel machines
Algorithmica | 2004-09-22 | Paper |
scientific article; zbMATH DE number 2086672 (Why is no real title available?)
| 2004-08-11 | Paper |
Functions that have read‐twice constant width branching programs are not necessarily testable
Random Structures & Algorithms | 2004-03-29 | Paper |
Preemptive scheduling in overloaded systems.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
scientific article; zbMATH DE number 1962818 (Why is no real title available?)
| 2003-08-11 | Paper |
Off-line temporary tasks assignment.
Theoretical Computer Science | 2003-01-21 | Paper |
Communication complexity towards lower bounds on circuit depth
Computational Complexity | 2002-06-17 | Paper |
scientific article; zbMATH DE number 1754640 (Why is no real title available?)
| 2002-06-12 | Paper |
The complexity of coloring graphs without long induced paths
Acta Cybernetica | 2002-02-13 | Paper |
Ancient and new algorithms for load balancing in the \(\ell_p\) norm
Algorithmica | 2001-10-07 | Paper |
Solution of David Gale's lion and man problem
Theoretical Computer Science | 2001-08-20 | Paper |
Randomized on-line scheduling on two uniform machines
Journal of Scheduling | 2001-07-12 | Paper |
scientific article; zbMATH DE number 1500546 (Why is no real title available?)
| 2001-06-18 | Paper |
A lower bound for on-line scheduling on uniformly related machines
Operations Research Letters | 2001-04-18 | Paper |
Efficient dynamic traitor tracing
SIAM Journal on Computing | 2001-03-19 | Paper |
Semi-online scheduling with decreasing job sizes
Operations Research Letters | 2001-01-01 | Paper |
scientific article; zbMATH DE number 1305421 (Why is no real title available?)
| 2000-09-26 | Paper |
DNF tautologies with a limited number of occurrences of every variable
Theoretical Computer Science | 2000-08-21 | Paper |
Bounds on pairs of families with restricted intersections
Combinatorica | 2000-05-14 | Paper |
scientific article; zbMATH DE number 1445354 (Why is no real title available?)
| 2000-05-10 | Paper |
Lower bounds for the polynomial calculus and the Gröbner basis algorithm
Computational Complexity | 2000-03-30 | Paper |
Multiprocessor Scheduling with Rejection
SIAM Journal on Discrete Mathematics | 2000-03-19 | Paper |
scientific article; zbMATH DE number 1405790 (Why is no real title available?)
| 2000-02-23 | Paper |
scientific article; zbMATH DE number 1303584 (Why is no real title available?)
| 1999-12-07 | Paper |
Some bounds on multiparty communication complexity of pointer jumping
Computational Complexity | 1999-05-18 | Paper |
scientific article; zbMATH DE number 1241372 (Why is no real title available?)
| 1999-01-17 | Paper |
Proof complexity in algebraic systems and bounded depth Frege systems with modular counting
Computational Complexity | 1998-06-29 | Paper |
Optimal on-line scheduling of parallel jobs with dependencies
Journal of Combinatorial Optimization | 1998-04-13 | Paper |
scientific article; zbMATH DE number 1114028 (Why is no real title available?)
| 1998-03-01 | Paper |
scientific article; zbMATH DE number 981682 (Why is no real title available?)
| 1997-08-03 | Paper |
Boolean Circuits, Tensor Ranks, and Communication Complexity
SIAM Journal on Computing | 1997-05-26 | Paper |
On the computational power of DNA
Discrete Applied Mathematics | 1997-04-21 | Paper |
Randomized On-line Scheduling of Parallel Jobs
Journal of Algorithms | 1996-10-16 | Paper |
Solution of a covering problem related to labelled tournaments
| 1996-10-07 | Paper |
scientific article; zbMATH DE number 871904 (Why is no real title available?)
| 1996-09-15 | Paper |
Dynamic scheduling on parallel machines
Theoretical Computer Science | 1995-06-12 | Paper |
scientific article; zbMATH DE number 37881 (Why is no real title available?)
| 1992-06-28 | Paper |
scientific article; zbMATH DE number 37882 (Why is no real title available?)
| 1992-06-28 | Paper |
scientific article; zbMATH DE number 25645 (Why is no real title available?)
| 1992-06-27 | Paper |
scientific article; zbMATH DE number 22356 (Why is no real title available?)
| 1992-06-26 | Paper |
scientific article; zbMATH DE number 4185598 (Why is no real title available?)
| 1990-01-01 | Paper |
scientific article; zbMATH DE number 4213452 (Why is no real title available?)
| 1990-01-01 | Paper |
scientific article; zbMATH DE number 4023269 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 3987270 (Why is no real title available?)
| 1986-01-01 | Paper |
