Evripidis Bampis

Michalis Xefteris

CoRR, 2024

Parsimonious Learning-Augmented Approximations for Dense Instances of NP-hard Problems.

[BibT_eX]

[DOI]

Michalis Xefteris

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2024

2023

Online 2-stage stable matching.

[BibT_eX]

[DOI]

Paul Youssef

Discret. Appl. Math., December, 2023

Target-based computer-assisted orchestration: Complexity and approximation algorithms.

[BibT_eX]

[DOI]

Carmine-Emanuele Cella

Mila Rocco

Alexandre Teiller

Eur. J. Oper. Res., 2023

Online TSP with Known Locations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Non-Clairvoyant Makespan Minimization Scheduling with Predictions.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Online learning for min-max discrete problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

A simple rounding scheme for multistage optimization.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Multistage knapsack.

[BibT_eX]

[DOI]

Alexandre Teiller

J. Comput. Syst. Sci., 2022

Canadian Traveller Problem with Predictions.

[BibT_eX]

[DOI]

Michalis Xefteris

Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022

Scheduling with Untrusted Predictions.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

Calibrations scheduling with arbitrary lengths and activation length.

[BibT_eX]

[DOI]

J. Sched., 2021

Preface.

[BibT_eX]

[DOI]

Nicole Megow

Theory Comput. Syst., 2021

Online Multistage Subset Maximization Problems.

[BibT_eX]

[DOI]

Algorithmica, 2021

Speed Scaling with Explorable Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty.

[BibT_eX]

[DOI]

Christoph Dürr

Thomas Erlebach

Murilo Santos de Lima

Nicole Megow

Jens Schlöter

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

LP-Based Algorithms for Multistage Minimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020

Scheduling Malleable Jobs Under Topological Constraints.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020

2019

Speed scaling on parallel processors with migration.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

Mechanism Design for Maximum Vectors.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Energy-efficient scheduling and routing via randomized rounding.

[BibT_eX]

[DOI]

J. Sched., 2018

Parameterized Power Vertex Cover.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2018

Multistage Matchings.

[BibT_eX]

[DOI]

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Scheduling under Uncertainty: A Query-based Approach.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Fair Resource Allocation Over Time.

[BibT_eX]

[DOI]

Sasa Mladenovic

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017

Scheduling on power-heterogeneous processors.

[BibT_eX]

[DOI]

Inf. Comput., 2017

On the Complexity of Minimizing the Total Calibration Cost.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

2016

Throughput maximization in multiprocessor speed-scaling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Throughput maximization for speed scaling with agreeable deadlines.

[BibT_eX]

[DOI]

J. Sched., 2016

Speed Scaling for Maximum Lateness.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2016

Clustering on k-edge-colored graphs.

[BibT_eX]

[DOI]

Emmanouil Pountourakis

Discret. Appl. Math., 2016

Algorithmic Issues in Energy-Efficient Computation.

[BibT_eX]

[DOI]

Proceedings of the Discrete Optimization and Operations Research, 2016

Truthfulness for the Sum of Weighted Completion Times.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Green scheduling, flows and matchings.

[BibT_eX]

[DOI]

Dimitrios Letsios

Theor. Comput. Sci., 2015

From preemptive to non-preemptive speed-scaling scheduling.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Minimizing Total Calibration Cost.

[BibT_eX]

[DOI]

CoRR, 2015

Min-Power Covering Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Non-preemptive Throughput Maximization for Speed-Scaling with Power-Down.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2015: Parallel Processing, 2015

2014

Optimal data placement on networks with a constant number of clients.

[BibT_eX]

[DOI]

Gerasimos G. Pollatos

Theor. Comput. Sci., 2014

Spectrum Assignment in Optical Networks: A Multiprocessor Scheduling Perspective.

[BibT_eX]

[DOI]

JOCN, 2014

Bounded max-colorings of graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Throughput Maximization in the Speed-Scaling Setting.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

A note on multiprocessor speed scaling with precedence constraints.

[BibT_eX]

[DOI]

Dimitrios Letsios

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

The spectrum assigment (SA) problem in optical networks: A multiprocesor scheduling perspective.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Optical Network Design and Modeling, 2014

Speed-Scaling with No Preemptions.

[BibT_eX]

[DOI]

Dimitrios Letsios

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Energy Efficient Scheduling of MapReduce Jobs.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2014 Parallel Processing, 2014

How the number of strategies impacts the likelihood of equilibria in random graphical games.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013

On multiprocessor temperature-aware scheduling problems.

[BibT_eX]

[DOI]

J. Sched., 2013

Energy Minimization via a Primal-Dual Algorithm for a Convex Program.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

A study on the stability and efficiency of graphical games with unbounded treewidth.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

2012

Randomized truthful algorithms for scheduling selfish tasks on parallel machines.

[BibT_eX]

[DOI]

Nicolas Thibault

Theor. Comput. Sci., 2012

Speed scaling with power down scheduling for agreeable deadlines.

[BibT_eX]

[DOI]

Sustain. Comput. Informatics Syst., 2012

Improved Approximation Algorithms for the Non-preemptive Speed-scaling Problem

[BibT_eX]

[DOI]

Ioannis Nemparis

CoRR, 2012

Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Energy Aware Scheduling for Unrelated Parallel Machines.

[BibT_eX]

[DOI]

Fadi Kacem

Proceedings of the 2012 IEEE International Conference on Green Computing and Communications, 2012

2009

On the minimum hitting set of bundles problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On truthfulness and approximation for scheduling selfish tasks.

[BibT_eX]

[DOI]

J. Sched., 2009

2008

The impact of local policies on the quality of packet routing in paths, trees, and rings.

[BibT_eX]

[DOI]

J. Sched., 2008

An exponential (matching based) neighborhood for the vehicle routing problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2008

Bicriteria scheduling for contiguous and non contiguous parallel tasks.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2008

How good are SPT schedules for fair optimality criteria.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2008

2007

Approximation in Multiobjective Problems.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Algorithmic Game Theory and Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

A note on scheduling to meet two min-sum objectives.

[BibT_eX]

[DOI]

Aleksei V. Fishkin

Oper. Res. Lett., 2007

2006

Truthful algorithms for scheduling selfish tasks on parallel machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Fair cost-sharing methods for the minimum spanning tree game.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Introduction.

[BibT_eX]

[DOI]

Klaus Jansen

Discret. Appl. Math., 2006

Approximation algorithms for the bi-criteria weighted MAX-CUT problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

The Price of Approximate Stability for Scheduling Selfish Tasks on Two Links.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

2005

Bicriteria approximation algorithms for scheduling problems with communications delays.

[BibT_eX]

[DOI]

J. Sched., 2005

Scheduling trees with large communication delays on two identical processors.

[BibT_eX]

[DOI]

J. Sched., 2005

Scheduling in Switching Networks with Set-Up Delays.

[BibT_eX]

[DOI]

J. Comb. Optim., 2005

Approximation results for a bicriteria job scheduling problem on a single machine without preemption.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2005

(Non)-Approximability for the Multi-criteria <i>TSP</i>(1, 2).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

On-Line Bicriteria Interval Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

A Note On Bicriteria Schedules With Optimal Approximations Ratios.

[BibT_eX]

[DOI]

Fabien Baille

Christian Laforest

Parallel Process. Lett., 2004

Scheduling Tasks with Small Communication Delays for Clusters of Processors.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2004

Traffic Grooming in a Passive Star WDM Network.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2004

Maximization of the Size and the Weight of Schedules of Degradable Intervals.

[BibT_eX]

[DOI]

Fabien Baille

Christian Laforest

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

A Dynasearch Neighborhood for the Bicriteria Traveling Salesman Problem.

[BibT_eX]

[DOI]

Proceedings of the Metaheuristics for Multiobjective Optimisation, 2004

2003

An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Bicriteria approximation algorithms for scheduling problems with communications.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

2002

On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2002

Scheduling Independent Multiprocessor Tasks.

[BibT_eX]

[DOI]

Algorithmica, 2002

Scheduling of Independent Dedicated Multiprocessor Tasks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Non-approximability Results for the Hierarchical Communication Problem with a Bounded Number of Clusters.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2002, 2002

2001

On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements.

[BibT_eX]

[DOI]

Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

2000

Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2000

Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases.

[BibT_eX]

[DOI]

Aristotelis Giannakos

Alexander V. Karzanov

RAIRO Theor. Informatics Appl., 2000

Scheduling to Minimize the Average Completion Time of Dedicated Tasks.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1999

On the parallel complexity of the alternating Hamiltonian cycle problem.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 1999

The complexity of short schedules for uet bipartite graphs.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 1999

A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors.

[BibT_eX]

[DOI]

Parallel Comput., 1999

Scheduling on a Constant Number of Machines.

[BibT_eX]

[DOI]

Proceedings of the Randomization, 1999

Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998

Scheduling Algorithms for Parallel Gaussian Elimination With Communication Costs.

[BibT_eX]

[DOI]

Abdel Krim Amoura

IEEE Trans. Parallel Distributed Syst., 1998

A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph.

[BibT_eX]

[DOI]

Alexander V. Karzanov

Parallel Process. Lett., 1998

Optimal Schedules for d-D Grid Graphs with Communication Delays.

[BibT_eX]

[DOI]

Charles Delorme

Parallel Comput., 1998

1997

Some Models for Scheduling Parallel Programs with Communication Delays.

[BibT_eX]

[DOI]

Frédéric Guinand

Discret. Appl. Math., 1997

1996

Scheduling UET-UCT Series-Parallel Graphs on Two Processors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract).

[BibT_eX]

[DOI]

Charles Delorme

Proceedings of the STACS 96, 1996

1995

Optimal Parallel Execution of Complete Binary Trees and Grids Into Most Popular Interconnection Networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments.

[BibT_eX]

[DOI]

J. Algorithms, 1995

Efficient Algorithms for the Parallel Gaussian Elimination on Distributed Memory Machines.

[BibT_eX]

Abdel Krim Amoura

Proceedings of the Parallel Computing: State-of-the-Art and Perspectives, 1995

Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics and Computer Science, 1995

1994

NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

1992

A Low Overhead Schedule for a 3D-Grid Graph.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1992

1991

Impact of communications on the complexity of the parallel Gaussian Elimination.

[BibT_eX]

[DOI]