| Publication | Date of Publication | Type |
|---|
Competitive algorithms for demand response management in a smart grid
Journal of Scheduling | 2024-04-02 | Paper |
scientific article; zbMATH DE number 7765403 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-14 | Paper |
| scientific article; zbMATH DE number 7650321 (Why is no real title available?) | 2023-02-03 | Paper |
| An improved approximation algorithm for scheduling under arborescence precedence constraints | 2022-07-18 | Paper |
Tropical paths in vertex-colored graphs
Journal of Combinatorial Optimization | 2021-11-25 | Paper |
Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines
(available as arXiv preprint) | 2021-08-04 | 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 greedy algorithm for subspace approximation problem | 2020-08-25 | Paper |
| Competitive algorithms for demand response management in smart grid | 2020-02-12 | Paper |
| Maximum colorful cycles in vertex-colored graphs | 2018-11-28 | Paper |
| Maximum colorful cliques in vertex-colored graphs | 2018-10-04 | Paper |
Approximating \(k\)-forest with resource augmentation: a primal-dual approach
Combinatorial Optimization and Applications | 2018-03-26 | Paper |
Online algorithms for multi-level aggregation
(available as arXiv preprint) | 2018-03-02 | Paper |
| Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality | 2018-03-02 | Paper |
| Non-preemptive throughput maximization for speed-scaling with power-down | 2018-01-11 | Paper |
| Lagrangian duality based algorithms in online energy-efficient scheduling | 2017-10-17 | Paper |
The local-global conjecture for scheduling with non-linear cost
Journal of Scheduling | 2017-09-01 | Paper |
Throughput maximization in multiprocessor speed-scaling
Theoretical Computer Science | 2016-05-02 | Paper |
Congestion games with capacitated resources
Theory of Computing Systems | 2016-01-13 | Paper |
Improved local search for universal facility location
Journal of Combinatorial Optimization | 2015-07-10 | Paper |
Online scheduling of bounded length jobs to maximize throughput
Journal of Scheduling | 2014-02-05 | Paper |
\(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games
Theoretical Computer Science | 2014-01-09 | Paper |
Improved local search for universal facility location
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Congestion games with capacitated resources
Algorithmic Game Theory | 2013-03-13 | Paper |
Tile-packing tomography is \(\mathbb{NP}\)-hard
Algorithmica | 2012-11-21 | Paper |
Strategy-proof mechanisms for facility location games with many facilities
Algorithmic Decision Theory | 2011-10-28 | Paper |
Tile-packing tomography is \({\mathbb{NP}}\)-hard
Lecture Notes in Computer Science | 2010-07-20 | Paper |
$\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Nash Equilibria in Voronoi Games on Graphs
Algorithms – ESA 2007 | 2008-09-25 | Paper |
