| Publication | Date of Publication | Type |
|---|
Minimizing total completion time and makespan for a multi-scenario bi-criteria parallel machine scheduling problem
European Journal of Operational Research | 2025-05-19 | Paper |
| A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width | 2022-12-09 | Paper |
Calibrations scheduling with arbitrary lengths and activation length
Journal of Scheduling | 2022-01-14 | Paper |
Approximating \(k\)-forest with resource augmentation: a primal-dual approach
Theoretical Computer Science | 2019-08-09 | Paper |
Speed scaling on parallel processors with migration
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
On the Complexity of Minimizing the Total Calibration Cost
Frontiers in Algorithmics | 2019-04-26 | Paper |
Parameterized power vertex cover
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2018-12-10 | Paper |
Approximating \(k\)-forest with resource augmentation: a primal-dual approach
Combinatorial Optimization and Applications | 2018-03-26 | Paper |
Throughput maximization for speed scaling with agreeable deadlines
Journal of Scheduling | 2018-02-28 | Paper |
| FPT approximation algorithm for scheduling with memory constraints | 2018-01-11 | Paper |
| Non-preemptive throughput maximization for speed-scaling with power-down | 2018-01-11 | Paper |
Throughput maximization in the speed-scaling setting
(available as arXiv preprint) | 2017-03-03 | Paper |
Parameterized power vertex cover
Lecture Notes in Computer Science | 2016-12-22 | Paper |
Clustering on \(k\)-edge-colored graphs
Discrete Applied Mathematics | 2016-11-02 | Paper |
Truthfulness for the sum of weighted completion times
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Throughput maximization in multiprocessor speed-scaling
Theoretical Computer Science | 2016-05-02 | Paper |
Min-Power Covering Problems
Algorithms and Computation | 2016-01-11 | Paper |
Throughput Maximization in Multiprocessor Speed-Scaling
Algorithms and Computation | 2015-09-11 | Paper |
Improved local search for universal facility location
Journal of Combinatorial Optimization | 2015-07-10 | Paper |
Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines
Discrete Applied Mathematics | 2014-08-26 | Paper |
Optimal data placement on networks with a constant number of clients
Theoretical Computer Science | 2014-06-06 | Paper |
Analysis and comparison of three algorithms for the vertex cover problem on large graphs with low memory capacities
Algorithmic Operations Research | 2013-12-11 | Paper |
Clustering on k-Edge-Colored Graphs
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Improved local search for universal facility location
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Throughput maximization for speed-scaling with agreeable deadlines
Lecture Notes in Computer Science | 2013-05-28 | Paper |
A new lower bound on the independence number of graphs
Discrete Applied Mathematics | 2013-04-18 | Paper |
Speed scaling on parallel processors with migration
Euro-Par 2012 Parallel Processing | 2012-11-14 | Paper |
Speed scaling on parallel processors with migration
Euro-Par 2012 Parallel Processing | 2012-11-14 | Paper |
Low complexity scheduling algorithm minimizing the energy for tasks with agreeable deadlines
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Randomized truthful algorithms for scheduling selfish tasks on parallel machines
Theoretical Computer Science | 2012-03-13 | Paper |
| Local search: complexity and approximation | 2010-12-08 | Paper |
| scientific article; zbMATH DE number 5823944 (Why is no real title available?) | 2010-12-08 | Paper |
Randomized truthful algorithms for scheduling selfish tasks on parallel machines
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Fair cost-sharing methods for the minimum spanning tree game
Information Processing Letters | 2010-01-29 | Paper |
Approximation results for a bicriteria job scheduling problem on a single machine without preemption
Information Processing Letters | 2009-12-04 | Paper |
On truthfulness and approximation for scheduling selfish tasks
Journal of Scheduling | 2009-12-02 | Paper |
On the minimum hitting set of bundles problem
Theoretical Computer Science | 2009-11-04 | Paper |
The impact of local policies on the quality of packet routing in paths, trees, and rings
Journal of Scheduling | 2009-08-28 | Paper |
How good are SPT schedules for fair optimality criteria
Annals of Operations Research | 2008-09-03 | Paper |
On the Minimum Hitting Set of Bundles Problem
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
An exponential (matching based) neighborhood for the vehicle routing problem
Journal of Combinatorial Optimization | 2008-05-13 | Paper |
A Survey of Approximation Results for Local Search Algorithms
Lecture Notes in Computer Science | 2008-03-14 | Paper |
A note on scheduling to meet two min-sum objectives
Operations Research Letters | 2007-08-27 | Paper |
Truthful algorithms for scheduling selfish tasks on parallel machines
Theoretical Computer Science | 2007-01-09 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Approximation algorithms for the bi-criteria weighted MAX-CUT problem
Discrete Applied Mathematics | 2006-08-14 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem
European Journal of Operational Research | 2005-02-09 | Paper |
Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2102230 (Why is no real title available?) | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2090586 (Why is no real title available?) | 2004-08-12 | Paper |
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
Theoretical Computer Science | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 1875417 (Why is no real title available?) | 2003-03-02 | Paper |
On the classification of NP-complete problems in terms of their correlation coefficient
Discrete Applied Mathematics | 2002-07-03 | Paper |
On the landscape ruggedness of the quadratic assignment problem
Theoretical Computer Science | 2001-08-20 | Paper |
Autocorrelation coefficient for the graph bipartitioning problem
Theoretical Computer Science | 1998-08-13 | Paper |
On the quality of local search for the quadratic assignment problem
Discrete Applied Mathematics | 1998-06-02 | Paper |
