| Publication | Date of Publication | Type |
|---|
| Approximation schemes for minimizing average weighted completion time with release dates | 2026-05-06 | Paper |
| Competitive query minimization for stable matching with one-sided uncertainty | 2025-10-06 | Paper |
| Non-clairvoyant makespan minimization scheduling with predictions | 2025-07-24 | Paper |
| Learning-augmented online TSP on rings, trees, flowers and (almost) everywhere else | 2025-01-06 | Paper |
| Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament | 2024-07-05 | Paper |
| On the parallel complexity of the alternating Hamiltonian cycle problem | 2024-07-05 | Paper |
Online TSP with known locations
Lecture Notes in Computer Science | 2024-01-16 | Paper |
NC algorithms for antidirected hamiltonian paths and cycles in tournaments
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Online 2-stage stable matching
Discrete Applied Mathematics | 2023-11-13 | Paper |
scientific article; zbMATH DE number 7740865 (Why is no real title available?)
(available as arXiv preprint) | 2023-09-20 | Paper |
Canadian traveller problem with predictions
Approximation and Online Algorithms | 2023-07-25 | Paper |
Target-based computer-assisted orchestration: complexity and approximation algorithms
European Journal of Operational Research | 2022-09-29 | Paper |
Online learning for min-max discrete problems
Theoretical Computer Science | 2022-08-25 | Paper |
| Multistage knapsack | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7525448 (Why is no real title available?) | 2022-05-11 | Paper |
Multistage knapsack
Journal of Computer and System Sciences | 2022-03-29 | Paper |
LP-based algorithms for multistage minimization problems
(available as arXiv preprint) | 2022-03-22 | Paper |
A simple rounding scheme for multistage optimization
Theoretical Computer Science | 2022-02-21 | Paper |
Calibrations scheduling with arbitrary lengths and activation length
Journal of Scheduling | 2022-01-14 | Paper |
Scheduling independent multiprocessor tasks
1477.68043 | 2021-12-20 | Paper |
Online multistage subset maximization problems
Algorithmica | 2021-07-26 | Paper |
Online multistage subset maximization problems
Algorithmica | 2021-07-26 | Paper |
| scientific article; zbMATH DE number 7238962 (Why is no real title available?) | 2020-08-25 | Paper |
| Correction to: approximation and online algorithms | 2020-08-24 | 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 |
Energy-efficient scheduling and routing via randomized rounding
Journal of Scheduling | 2018-11-07 | Paper |
Throughput maximization for speed scaling with agreeable deadlines
Journal of Scheduling | 2018-02-28 | Paper |
| Non-preemptive throughput maximization for speed-scaling with power-down | 2018-01-11 | Paper |
Scheduling on power-heterogeneous processors
Information and Computation | 2017-11-16 | Paper |
Optimal schedules for d-D grid graphs with communication delays
STACS 96 | 2017-11-16 | Paper |
Throughput maximization in the speed-scaling setting
(available as arXiv preprint) | 2017-03-03 | Paper |
Energy efficient scheduling and routing via randomized rounding
(available as arXiv preprint) | 2017-02-21 | 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 |
Scheduling on power-heterogeneous processors
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Throughput maximization in multiprocessor speed-scaling
Theoretical Computer Science | 2016-05-02 | Paper |
Speed scaling for maximum lateness
Theory of Computing Systems | 2016-03-09 | 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 |
Speed-scaling with no preemptions
Algorithms and Computation | 2015-09-11 | Paper |
Green scheduling, flows and matchings
Theoretical Computer Science | 2015-05-18 | Paper |
From preemptive to non-preemptive speed-scaling scheduling
Discrete Applied Mathematics | 2014-12-05 | Paper |
Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines
Discrete Applied Mathematics | 2014-08-26 | Paper |
On multiprocessor temperature-aware scheduling problems
Journal of Scheduling | 2014-08-18 | Paper |
Optimal data placement on networks with a constant number of clients
Theoretical Computer Science | 2014-06-06 | Paper |
Bounded max-colorings of graphs
Journal of Discrete Algorithms | 2014-04-28 | Paper |
Clustering on k-Edge-Colored Graphs
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
From preemptive to non-preemptive speed-scaling scheduling
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 |
Green scheduling, flows and matchings
Algorithms and Computation | 2013-03-21 | 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 |
Speed scaling for maximum lateness
Lecture Notes in Computer Science | 2012-09-25 | Paper |
On multiprocessor temperature-aware scheduling problems
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | 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 |
Bounded Max-colorings of Graphs
Algorithms and Computation | 2010-12-09 | 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 |
Bicriteria scheduling for contiguous and non contiguous parallel tasks
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 |
Scheduling trees with large communication delays on two identical processors
Journal of Scheduling | 2007-12-20 | Paper |
A note on scheduling to meet two min-sum objectives
Operations Research Letters | 2007-08-27 | Paper |
Bicriteria approximation algorithms for scheduling problems with communications delays
Journal of Scheduling | 2007-05-15 | 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 |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
Scheduling in switching networks with set-up delays
Journal of Combinatorial Optimization | 2005-05-17 | 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 |
Scheduling tasks with small communication delays for clusters of processors
Annals of Operations Research | 2004-08-10 | Paper |
| scientific article; zbMATH DE number 2080224 (Why is no real title available?) | 2004-08-04 | 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 1979516 (Why is no real title available?) | 2003-09-14 | Paper |
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.
Theoretical Computer Science | 2003-08-17 | Paper |
A PTAS for the average weighted completion time problem on unrelated machines.
Journal of Scheduling | 2003-07-27 | Paper |
| scientific article; zbMATH DE number 1875417 (Why is no real title available?) | 2003-03-02 | Paper |
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications
Theoretical Computer Science | 2003-01-21 | Paper |
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
RAIRO - Operations Research | 2002-09-30 | Paper |
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
RAIRO - Operations Research | 2002-09-30 | Paper |
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
RAIRO - Operations Research | 2002-09-30 | Paper |
Scheduling independent multiprocessor tasks
Algorithmica | 2002-03-07 | Paper |
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases
RAIRO - Theoretical Informatics and Applications | 2001-04-26 | Paper |
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases
RAIRO - Theoretical Informatics and Applications | 2001-04-26 | Paper |
On the complexity of scheduling with large communication delays
European Journal of Operational Research | 2000-11-08 | Paper |
| scientific article; zbMATH DE number 1500535 (Why is no real title available?) | 2000-09-04 | Paper |
The complexity of short schedules for uet bipartite graphs
RAIRO - Operations Research | 2000-08-24 | Paper |
The complexity of short schedules for uet bipartite graphs
RAIRO - Operations Research | 2000-08-24 | Paper |
On the parallel complexity of the alternating Hamiltonian cycle problem
RAIRO - Operations Research | 2000-08-24 | Paper |
On the parallel complexity of the alternating Hamiltonian cycle problem
RAIRO - Operations Research | 2000-08-24 | Paper |
