| Publication | Date of Publication | Type |
|---|
Online two-way trading: randomization and advice
Theoretical Computer Science | 2021-01-19 | Paper |
Optimal online two-way trading with bounded number of transactions
Algorithmica | 2019-10-17 | Paper |
Optimal online two-way trading with bounded number of transactions
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Temperature aware online algorithms for minimizing flow time
Theoretical Computer Science | 2017-01-09 | Paper |
Improved randomized online scheduling of intervals and jobs
Theory of Computing Systems | 2015-02-05 | Paper |
Online scheduling of unit length jobs with commitment and penalties
Advanced Information Systems Engineering | 2014-09-15 | Paper |
Online scheduling with preemption or non-completion penalties
Journal of Scheduling | 2014-08-18 | Paper |
Temperature aware online algorithms for scheduling equal length jobs
Theoretical Computer Science | 2013-12-19 | Paper |
Temperature aware online algorithms for minimizing flow time
Lecture Notes in Computer Science | 2013-05-28 | Paper |
On-line scheduling of equal-length intervals on parallel machines
Information Processing Letters | 2012-07-20 | Paper |
Temperature aware online algorithms for scheduling equal length jobs
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
Improved competitive algorithms for online scheduling with partial job values
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Bounded delay packet scheduling in a bounded buffer
Operations Research Letters | 2010-12-20 | Paper |
Online Preemptive Scheduling with Immediate Decision or Notification and Penalties
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Temperature Aware Online Scheduling with a Low Cooling Factor
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Lower bounds on online deadline scheduling with preemption penalties
Information Processing Letters | 2010-06-09 | Paper |
Linear-time haplotype inference on pedigrees without recombinations and mating loops
SIAM Journal on Computing | 2010-01-06 | Paper |
A tight lower bound for job scheduling with cancellation
Information Processing Letters | 2009-12-18 | Paper |
Improved on-line broadcast scheduling with deadlines
Journal of Scheduling | 2009-08-28 | Paper |
Online interval scheduling: Randomized and multiprocessor cases
Journal of Combinatorial Optimization | 2009-07-13 | Paper |
Online Interval Scheduling: Randomized and Multiprocessor Cases
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
Approximation and Online Algorithms | 2009-02-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 |
Improved On-Line Broadcast Scheduling with Deadlines
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Efficient algorithms for finding a longest common increasing subsequence
Journal of Combinatorial Optimization | 2007-07-19 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees
Computational Geometry | 2005-09-02 | Paper |
ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO
International Journal of Foundations of Computer Science | 2005-08-01 | Paper |
Improved competitive algorithms for online scheduling with partial job values
Theoretical Computer Science | 2004-10-27 | Paper |
Online scheduling with partial job values: does timesharing or randomization help?
Algorithmica | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2080989 (Why is no real title available?) | 2004-08-04 | Paper |
| Approximation for minimum triangulation of convex polyhedra | 2002-07-22 | Paper |
Approximation for minimum triangulations of simplicial convex 3-polytopes
Discrete & Computational Geometry | 2002-02-07 | Paper |
