Impact of communications on the complexity of the parallel Gaussian Elimination. - Evripidis Bampis; Jean-Claude König; Denis Trystram (Parallel Comput., 1991)

A Low Overhead Schedule for a 3D-Grid Graph. - Evripidis Bampis; Jean-Claude König; Denis Trystram (Parallel Process. Lett., 1992)

NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract). - Evripidis Bampis; Yannis Manoussakis; Ioannis Milis (WG, 1994)

Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament. - Evripidis Bampis; Pavol Hell; Yannis Manoussakis; Moshe Rosenfeld 001 (Combinatorics and Computer Science, 1995)

Efficient Algorithms for the Parallel Gaussian Elimination on Distributed Memory Machines. - Abdel Krim Amoura; Evripidis Bampis; Jean-Claude König (PARCO, 1995)

A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. - Evripidis Bampis; Mohamed El Haddad; Yannis Manoussakis; Miklos Santha (J. Algorithms, 1995)

Optimal Parallel Execution of Complete Binary Trees and Grids Into Most Popular Interconnection Networks. - Evripidis Bampis; Jean-Claude König; Denis Trystram (Theor. Comput. Sci., 1995)

Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract). - Evripidis Bampis; Charles Delorme; Jean-Claude König (STACS, 1996)

Scheduling UET-UCT Series-Parallel Graphs on Two Processors. - Lucian Finta; Zhen Liu 001; Ioannis Milis; Evripidis Bampis (Theor. Comput. Sci., 1996)

Some Models for Scheduling Parallel Programs with Communication Delays. - Evripidis Bampis; Frédéric Guinand; Denis Trystram (Discret. Appl. Math., 1997)

Optimal Schedules for d-D Grid Graphs with Communication Delays. - Evripidis Bampis; Charles Delorme; Jean-Claude König (Parallel Comput., 1998)

A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph. - Evripidis Bampis; Alexander V. Karzanov; Yannis Manoussakis; Ioannis Milis (Parallel Process. Lett., 1998)

Scheduling Algorithms for Parallel Gaussian Elimination With Communication Costs. - Abdel Krim Amoura; Evripidis Bampis; Jean-Claude König (IEEE Trans. Parallel Distributed Syst., 1998)

Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. - Foto N. Afrati; Evripidis Bampis; Chandra Chekuri; David R. Karger; Claire Kenyon; Sanjeev Khanna; Ioannis Milis; Maurice Queyranne; Martin Skutella; Clifford Stein 001; Maxim Sviridenko (FOCS, 1999)

Scheduling on a Constant Number of Machines. - Foto N. Afrati; Evripidis Bampis; Claire Kenyon; Ioannis Milis (RANDOM-APPROX, 1999)

A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors. - Abdel Krim Amoura; Evripidis Bampis; Yannis Manoussakis; Zsolt Tuza (Parallel Comput., 1999)

The complexity of short schedules for uet bipartite graphs. - Evripidis Bampis (RAIRO Oper. Res., 1999)

On the parallel complexity of the alternating Hamiltonian cycle problem. - Evripidis Bampis; Yannis Manoussakis; Ioannis Milis (RAIRO Oper. Res., 1999)

Scheduling to Minimize the Average Completion Time of Dedicated Tasks. - Foto N. Afrati; Evripidis Bampis; Aleksei V. Fishkin; Klaus Jansen; Claire Kenyon (FSTTCS, 2000)

Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases. - Evripidis Bampis; Aristotelis Giannakos; Alexander V. Karzanov; Yannis Manoussakis; Ioannis Milis (RAIRO Theor. Informatics Appl., 2000)

Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. - Evripidis Bampis; Rodolphe Giroudeau; Jean-Claude König (Parallel Process. Lett., 2000)

A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs. - Eric Angel; Evripidis Bampis; Alexander V. Kononov (ESA, 2001)

On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements. - Evripidis Bampis; Alexander V. Kononov (IPDPS, 2001)

Non-approximability Results for the Hierarchical Communication Problem with a Bounded Number of Clusters. - Eric Angel; Evripidis Bampis; Rodolphe Giroudeau (Euro-Par, 2002)

Scheduling of Independent Dedicated Multiprocessor Tasks. - Evripidis Bampis; Massimiliano Caramia; Jirí Fiala 001; Aleksei V. Fishkin; Antonio Iovanella (ISAAC, 2002)

Scheduling Independent Multiprocessor Tasks. - Abdel Krim Amoura; Evripidis Bampis; Claire Kenyon; Yannis Manoussakis (Algorithmica, 2002)

On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications. - Evripidis Bampis; Rodolphe Giroudeau; Jean-Claude König (RAIRO Oper. Res., 2002)

Bicriteria approximation algorithms for scheduling problems with communications. - Evripidis Bampis; Alexander V. Kononov (SPAA, 2003)

On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. - Eric Angel; Evripidis Bampis; Alexander V. Kononov (Theor. Comput. Sci., 2003)

An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. - Evripidis Bampis; Rodolphe Giroudeau; Jean-Claude König (Theor. Comput. Sci., 2003)

A Dynasearch Neighborhood for the Bicriteria Traveling Salesman Problem. - Eric Angel; Evripidis Bampis; Laurent Gourvès (Metaheuristics for Multiobjective Optimisation, 2004)

Maximization of the Size and the Weight of Schedules of Degradable Intervals. - Fabien Baille; Evripidis Bampis; Christian Laforest (COCOON, 2004)

Traffic Grooming in a Passive Star WDM Network. - Eric Angel; Evripidis Bampis; Fanny Pascual (SIROCCO, 2004)

Scheduling Tasks with Small Communication Delays for Clusters of Processors. - Evripidis Bampis; Rodolphe Giroudeau; Alexander V. Kononov (Ann. Oper. Res., 2004)

A Note On Bicriteria Schedules With Optimal Approximations Ratios. - Fabien Baille; Evripidis Bampis; Christian Laforest (Parallel Process. Lett., 2004)

Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem. - Eric Angel; Evripidis Bampis; Laurent Gourvès (Theor. Comput. Sci., 2004)

On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules. - Fabien Baille; Evripidis Bampis; Christian Laforest; Nicolas Thibault (COCOON, 2005)

On-Line Bicriteria Interval Scheduling. - Fabien Baille; Evripidis Bampis; Christian Laforest; Nicolas Thibault (Euro-Par, 2005)

(Non)-Approximability for the Multi-criteria TSP(1, 2). - Eric Angel; Evripidis Bampis; Laurent Gourvès; Jérôme Monnot (FCT, 2005)

A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem. - Eric Angel; Evripidis Bampis (Eur. J. Oper. Res., 2005)

Approximation results for a bicriteria job scheduling problem on a single machine without preemption. - Eric Angel; Evripidis Bampis; Laurent Gourvès (Inf. Process. Lett., 2005)

Scheduling in Switching Networks with Set-Up Delays. - Foto N. Afrati; Timos Aslanidis; Evripidis Bampis; Ioannis Milis (J. Comb. Optim., 2005)

Scheduling trees with large communication delays on two identical processors. - Foto N. Afrati; Evripidis Bampis; Lucian Finta; Ioannis Milis (J. Sched., 2005)

Bicriteria approximation algorithms for scheduling problems with communications delays. - Evripidis Bampis; Alexander V. Kononov (J. Sched., 2005)

The Price of Approximate Stability for Scheduling Selfish Tasks on Two Links. - Eric Angel; Evripidis Bampis; Fanny Pascual (Euro-Par, 2006)

Approximation algorithms for the bi-criteria weighted MAX-CUT problem. - Eric Angel; Evripidis Bampis; Laurent Gourvès (Discret. Appl. Math., 2006)

Introduction. - Evripidis Bampis; Klaus Jansen (Discret. Appl. Math., 2006)

Fair cost-sharing methods for the minimum spanning tree game. - Eric Angel; Evripidis Bampis; Lélia Blin; Laurent Gourvès (Inf. Process. Lett., 2006)

Truthful algorithms for scheduling selfish tasks on parallel machines. - Eric Angel; Evripidis Bampis; Fanny Pascual (Theor. Comput. Sci., 2006)

A note on scheduling to meet two min-sum objectives. - Eric Angel; Evripidis Bampis; Aleksei V. Fishkin (Oper. Res. Lett., 2007)

Algorithmic Game Theory and Scheduling. - Evripidis Bampis; Eric Angel; Fanny Pascual (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Approximation in Multiobjective Problems. - Laurent Gourvès; Evripidis Bampis; Eric Angel (Handbook of Approximation Algorithms and Metaheuristics, 2007)

How good are SPT schedules for fair optimality criteria. - Eric Angel; Evripidis Bampis; Fanny Pascual (Ann. Oper. Res., 2008)

Bicriteria scheduling for contiguous and non contiguous parallel tasks. - Fabien Baille; Evripidis Bampis; Christian Laforest; Christophe Rapine (Ann. Oper. Res., 2008)

An exponential (matching based) neighborhood for the vehicle routing problem. - Eric Angel; Evripidis Bampis; Fanny Pascual (J. Comb. Optim., 2008)

The impact of local policies on the quality of packet routing in paths, trees, and rings. - Eric Angel; Evripidis Bampis; Fanny Pascual (J. Sched., 2008)

On truthfulness and approximation for scheduling selfish tasks. - Eric Angel; Evripidis Bampis; Fanny Pascual; Alex-Ariel Tchetgnia (J. Sched., 2009)

On the minimum hitting set of bundles problem. - Eric Angel; Evripidis Bampis; Laurent Gourvès (Theor. Comput. Sci., 2009)

Energy Aware Scheduling for Unrelated Parallel Machines. - Eric Angel; Evripidis Bampis; Fadi Kacem (GreenCom, 2012)

Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines. - Eric Angel; Evripidis Bampis; Vincent Chau (LATIN, 2012)

Improved Approximation Algorithms for the Non-preemptive Speed-scaling Problem - Evripidis Bampis; Giorgio Lucarelli; Ioannis Nemparis (CoRR, 2012)

Speed scaling with power down scheduling for agreeable deadlines. - Evripidis Bampis; Christoph Dürr; Fadi Kacem; Ioannis Milis (Sustain. Comput. Informatics Syst., 2012)

Randomized truthful algorithms for scheduling selfish tasks on parallel machines. - Eric Angel; Evripidis Bampis; Nicolas Thibault (Theor. Comput. Sci., 2012)

A study on the stability and efficiency of graphical games with unbounded treewidth. - Anisse Ismaili; Evripidis Bampis; Nicolas Maudet; Patrice Perny (AAMAS, 2013)

Energy Minimization via a Primal-Dual Algorithm for a Convex Program. - Evripidis Bampis; Vincent Chau; Dimitrios Letsios; Giorgio Lucarelli; Ioannis Milis (SEA, 2013)

On multiprocessor temperature-aware scheduling problems. - Evripidis Bampis; Dimitrios Letsios; Giorgio Lucarelli; Evangelos Markakis; Ioannis Milis (J. Sched., 2013)

How the number of strategies impacts the likelihood of equilibria in random graphical games. - Anisse Ismaili; Evripidis Bampis; Nicolas Maudet; Patrice Perny (AAMAS, 2014)

Energy Efficient Scheduling of MapReduce Jobs. - Evripidis Bampis; Vincent Chau; Dimitrios Letsios; Giorgio Lucarelli; Ioannis Milis; Georgios Zois (Euro-Par, 2014)

Speed-Scaling with No Preemptions. - Evripidis Bampis; Dimitrios Letsios; Giorgio Lucarelli (ISAAC, 2014)

The spectrum assigment (SA) problem in optical networks: A multiprocesor scheduling perspective. - Sahar Talebi; Evripidis Bampis; Giorgio Lucarelli; Iyad A. Katib; George N. Rouskas (ONDM, 2014)

A note on multiprocessor speed scaling with precedence constraints. - Evripidis Bampis; Dimitrios Letsios; Giorgio Lucarelli (SPAA, 2014)

Throughput Maximization in the Speed-Scaling Setting. - Eric Angel; Evripidis Bampis; Vincent Chau (STACS, 2014)

Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines. - Eric Angel; Evripidis Bampis; Vincent Chau (Discret. Appl. Math., 2014)

Bounded max-colorings of graphs. - Evripidis Bampis; Alexander V. Kononov; Giorgio Lucarelli; Ioannis Milis (J. Discrete Algorithms, 2014)

Spectrum Assignment in Optical Networks: A Multiprocessor Scheduling Perspective. - Sahar Talebi; Evripidis Bampis; Giorgio Lucarelli; Iyad A. Katib; George N. Rouskas (JOCN, 2014)

Optimal data placement on networks with a constant number of clients. - Eric Angel; Evripidis Bampis; Gerasimos G. Pollatos; Vassilis Zissimopoulos (Theor. Comput. Sci., 2014)

Non-preemptive Throughput Maximization for Speed-Scaling with Power-Down. - Eric Angel; Evripidis Bampis; Vincent Chau; Kim Thang Nguyen (Euro-Par, 2015)

Min-Power Covering Problems. - Eric Angel; Evripidis Bampis; Vincent Chau; Alexander V. Kononov (ISAAC, 2015)

Minimizing Total Calibration Cost. - Eric Angel; Evripidis Bampis; Vincent Chau; Vassilis Zissimopoulos (CoRR, 2015)

From preemptive to non-preemptive speed-scaling scheduling. - Evripidis Bampis; Alexander V. Kononov; Dimitrios Letsios; Giorgio Lucarelli; Ioannis Nemparis (Discret. Appl. Math., 2015)

Green scheduling, flows and matchings. - Evripidis Bampis; Dimitrios Letsios; Giorgio Lucarelli (Theor. Comput. Sci., 2015)

Truthfulness for the Sum of Weighted Completion Times. - Eric Angel; Evripidis Bampis; Fanny Pascual; Nicolas Thibault (COCOON, 2016)

Algorithmic Issues in Energy-Efficient Computation. - Evripidis Bampis (DOOR, 2016)

Clustering on k-edge-colored graphs. - Eric Angel; Evripidis Bampis; Alexander V. Kononov; Dimitris Paparas; Emmanouil Pountourakis; Vassilis Zissimopoulos (Discret. Appl. Math., 2016)

Speed Scaling for Maximum Lateness. - Evripidis Bampis; Dimitrios Letsios; Ioannis Milis; Georgios Zois (Theory Comput. Syst., 2016)

Throughput maximization for speed scaling with agreeable deadlines. - Eric Angel; Evripidis Bampis; Vincent Chau; Dimitrios Letsios (J. Sched., 2016)

Throughput maximization in multiprocessor speed-scaling. - Eric Angel; Evripidis Bampis; Vincent Chau; Kim Thang Nguyen (Theor. Comput. Sci., 2016)

On the Complexity of Minimizing the Total Calibration Cost. - Eric Angel; Evripidis Bampis; Vincent Chau; Vassilis Zissimopoulos (FAW, 2017)

Scheduling on power-heterogeneous processors. - Susanne Albers; Evripidis Bampis; Dimitrios Letsios; Giorgio Lucarelli; Richard Stotz (Inf. Comput., 2017)

Fair Resource Allocation Over Time. - Evripidis Bampis; Bruno Escoffier; Sasa Mladenovic (AAMAS, 2018)

Scheduling under Uncertainty: A Query-based Approach. - Luciana Arantes; Evripidis Bampis; Alexander V. Kononov; Manthos Letsios; Giorgio Lucarelli; Pierre Sens 001 (IJCAI, 2018)

Multistage Matchings. - Evripidis Bampis; Bruno Escoffier; Michael Lampis; Vangelis Th. Paschos (SWAT, 2018)

Parameterized Power Vertex Cover. - Eric Angel; Evripidis Bampis; Bruno Escoffier; Michael Lampis (Discret. Math. Theor. Comput. Sci., 2018)

Energy-efficient scheduling and routing via randomized rounding. - Evripidis Bampis; Alexander V. Kononov; Dimitrios Letsios; Giorgio Lucarelli; Maxim Sviridenko (J. Sched., 2018)

Mechanism Design for Maximum Vectors. - Eric Angel; Evripidis Bampis (CoRR, 2019)

Speed scaling on parallel processors with migration. - Eric Angel; Evripidis Bampis; Fadi Kacem; Dimitrios Letsios (J. Comb. Optim., 2019)

Scheduling Malleable Jobs Under Topological Constraints. - Evripidis Bampis; Konstantinos Dogeas; Alexander V. Kononov; Giorgio Lucarelli; Fanny Pascual (IPDPS, 2020)

LP-Based Algorithms for Multistage Minimization Problems. - Evripidis Bampis; Bruno Escoffier; Alexander V. Kononov (WAOA, 2020)

Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. - Evripidis Bampis; Christoph Dürr; Thomas Erlebach; Murilo Santos de Lima; Nicole Megow; Jens Schlöter (ESA, 2021)

Speed Scaling with Explorable Uncertainty. - Evripidis Bampis; Konstantinos Dogeas; Alexander V. Kononov; Giorgio Lucarelli; Fanny Pascual (SPAA, 2021)

Online Multistage Subset Maximization Problems. - Evripidis Bampis; Bruno Escoffier; Kevin Schewior; Alexandre Teiller (Algorithmica, 2021)

Preface. - Evripidis Bampis; Nicole Megow (Theory Comput. Syst., 2021)

Calibrations scheduling with arbitrary lengths and activation length. - Eric Angel; Evripidis Bampis; Vincent Chau; Vassilis Zissimopoulos (J. Sched., 2021)

Scheduling with Untrusted Predictions. - Evripidis Bampis; Konstantinos Dogeas; Alexander V. Kononov; Giorgio Lucarelli; Fanny Pascual (IJCAI, 2022)

Canadian Traveller Problem with Predictions. - Evripidis Bampis; Bruno Escoffier; Michalis Xefteris (WAOA, 2022)

Multistage knapsack. - Evripidis Bampis; Bruno Escoffier; Alexandre Teiller (J. Comput. Syst. Sci., 2022)

A simple rounding scheme for multistage optimization. - Evripidis Bampis; Dimitris Christou; Bruno Escoffier; Alexander V. Kononov; Kim Thang Nguyen (Theor. Comput. Sci., 2022)

Online learning for min-max discrete problems. - Evripidis Bampis; Dimitris Christou; Bruno Escoffier; Kim Thang Nguyen (Theor. Comput. Sci., 2022)

Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else. - Evripidis Bampis; Bruno Escoffier; Themis Gouleakis; Niklas Hahn 001; Kostas Lakis; Golnoosh Shahkarami; Michalis Xefteris (ESA, 2023)

Non-Clairvoyant Makespan Minimization Scheduling with Predictions. - Evripidis Bampis; Alexander V. Kononov; Giorgio Lucarelli; Fanny Pascual (ISAAC, 2023)

Online TSP with Known Locations. - Evripidis Bampis; Bruno Escoffier; Niklas Hahn 001; Michalis Xefteris (WADS, 2023)

Target-based computer-assisted orchestration: Complexity and approximation algorithms. - Evripidis Bampis; Carmine-Emanuele Cella; Bruno Escoffier; Mila Rocco; Alexandre Teiller (Eur. J. Oper. Res., 2023)

Online 2-stage stable matching. - Evripidis Bampis; Bruno Escoffier; Paul Youssef (Discret. Appl. Math., 2023)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. - Evripidis Bampis; Konstantinos Dogeas; Thomas Erlebach; Nicole Megow; Jens Schlöter; Amitabh Trehan (APPROX/RANDOM, 2024)

Parsimonious Learning-Augmented Approximations for Dense Instances of NP-hard Problems. - Evripidis Bampis; Bruno Escoffier; Michalis Xefteris (ICML, 2024)

Improved FPT Approximation for Non-metric TSP. - Evripidis Bampis; Bruno Escoffier; Michalis Xefteris (CoRR, 2024)

Estimating the Electoral Consequences of Legislative Redistricting in France. - Evripidis Bampis; Thomas Ehrhard; Bruno Escoffier; Claire Mathieu; Fanny Pascual; David Saulpic (FAccT, 2025)

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems. - Evripidis Bampis; Bruno Escoffier; Dimitris Fotakis 001; Panagiotis Patsilinakos; Michalis Xefteris (CoRR, 2025)