| Publication | Date of Publication | Type |
|---|
| The power of amortization on scheduling with explorable uncertainty | 2024-07-19 | Paper |
Independent Sets in Restricted Line of Sight Networks
Algorithms for Sensor Systems | 2022-12-09 | Paper |
Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs
Theory of Computing Systems | 2021-09-28 | Paper |
Non-preemptive scheduling in a smart grid model and its implications on machine minimization
Algorithmica | 2020-11-11 | Paper |
Randomized probe selection algorithm for microarray design
Journal of Theoretical Biology | 2020-11-11 | Paper |
Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs
Approximation and Online Algorithms | 2020-08-24 | Paper |
Profit maximization in flex-grid all-optical networks
Theory of Computing Systems | 2020-02-27 | Paper |
Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel
(available as arXiv preprint) | 2020-01-30 | Paper |
Dynamic programming optimization in line of sight networks
Information and Computation | 2020-01-17 | Paper |
Complexity and online algorithms for minimum skyline coloring of intervals
Theoretical Computer Science | 2019-08-09 | Paper |
Station assignment with reallocation
Algorithmica | 2019-03-11 | Paper |
| Station assignment with applications to sensing | 2018-10-17 | Paper |
| The impact of landscape sparsification on modelling and analysis of the invasion process | 2018-08-13 | Paper |
| Optimal nonpreemptive scheduling in a smart grid model | 2018-04-19 | Paper |
Complexity and online algorithms for minimum skyline coloring of intervals
Combinatorial Optimization and Applications | 2018-03-26 | Paper |
Fault tolerant scheduling of tasks of two sizes under resource augmentation
Journal of Scheduling | 2018-02-28 | Paper |
Scheduling for electricity cost in a smart grid
Journal of Scheduling | 2018-02-28 | Paper |
Hardness and approximation of the asynchronous border minimization problem
Discrete Applied Mathematics | 2017-12-06 | Paper |
Online regenerator placement
Theory of Computing Systems | 2017-10-12 | Paper |
Online regenerator placement
Theory of Computing Systems | 2017-10-12 | Paper |
On-line maximum matching in complete multi-partite graphs with an application to optical networks
Discrete Applied Mathematics | 2015-12-10 | Paper |
Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
Journal of Combinatorial Optimization | 2015-05-11 | Paper |
| scientific article; zbMATH DE number 6381709 (Why is no real title available?) | 2014-12-18 | Paper |
Optimizing busy time on parallel machines
Theoretical Computer Science | 2014-12-02 | Paper |
Online optimization of busy time on parallel machines
Theoretical Computer Science | 2014-12-02 | Paper |
Optimizing throughput and energy in online deadline scheduling
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Improved multi-processor scheduling for flow time and energy
Journal of Scheduling | 2014-02-05 | Paper |
Profit maximization in flex-grid all-optical networks
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
Theoretical Computer Science | 2013-12-11 | Paper |
Scheduling for electricity cost in smart grid
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
| Aggressive online deadline scheduling | 2013-08-30 | Paper |
Online speed scaling based on active job count to minimize flow plus energy
Algorithmica | 2013-08-05 | Paper |
Online multi-dimensional dynamic bin packing of unit-fraction items
Lecture Notes in Computer Science | 2013-06-07 | Paper |
An \(\frac{8}{3}\) lower bound for online dynamic bin packing
Algorithms and Computation | 2013-03-21 | Paper |
Online makespan scheduling of linear deteriorating jobs on parallel machines
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Online optimization of busy time on parallel machines. (Extended abstract)
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Hardness and approximation of the asynchronous border minimization problem (extended abstract)
Lecture Notes in Computer Science | 2012-07-16 | Paper |
A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time
Information Processing Letters | 2012-03-09 | Paper |
Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Deadline scheduling and power management for speed bounded processors
Theoretical Computer Science | 2010-10-11 | Paper |
Optimal on-line colorings for minimizing the number of ADMs in optical networks
Journal of Discrete Algorithms | 2010-05-25 | Paper |
Competitive multi-dimensional dynamic bin packing via L-shape bin packing
Approximation and Online Algorithms | 2010-05-11 | Paper |
On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Improved on-line broadcast scheduling with deadlines
Journal of Scheduling | 2009-08-28 | Paper |
Sleep with Guilt and Work Faster to Minimize Flow Plus Energy
Automata, Languages and Programming | 2009-07-14 | Paper |
On dynamic bin packing: An improved lower bound and resource augmentation analysis
Algorithmica | 2009-04-29 | Paper |
Dynamic bin packing of unit fractions items
Theoretical Computer Science | 2009-01-08 | Paper |
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Non-overlapping common substrings allowing mutations
Mathematics in Computer Science | 2008-09-08 | Paper |
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Energy Efficient Deadline Scheduling in Two Processor Systems
Algorithms and Computation | 2008-05-27 | Paper |
Approximating Border Length for DNA Microarray Synthesis
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Routing of single-source and multiple-source queries in static sensor networks
Journal of Discrete Algorithms | 2008-05-16 | Paper |
Online Deadline Scheduling with Bounded Energy Efficiency
Lecture Notes in Computer Science | 2007-11-13 | Paper |
On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Improved On-Line Broadcast Scheduling with Deadlines
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling
Theoretical Computer Science | 2006-09-14 | Paper |
A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
Journal of Combinatorial Optimization | 2006-08-14 | Paper |
On-line stream merging with max span and min coverage
Theory of Computing Systems | 2006-02-08 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
| scientific article; zbMATH DE number 2011846 (Why is no real title available?) | 2003-12-02 | Paper |
On-line stream merging in a general setting.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1929937 (Why is no real title available?) | 2003-06-18 | Paper |
