Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarEvripidis Bampis
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[e6]Evripidis Bampis, Nicole Megow:
Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers. Lecture Notes in Computer Science 11926, Springer 2020, ISBN 978-3-030-39478-3 [contents]
2010 – 2019
- 2019
- [j53]Eric Angel, Evripidis Bampis, Fadi Kacem, Dimitrios Letsios
:
Speed scaling on parallel processors with migration. J. Comb. Optim. 37(4): 1266-1282 (2019) - [c64]Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller:
Online Multistage Subset Maximization Problems. ESA 2019: 11:1-11:14 - [c63]Evripidis Bampis, Bruno Escoffier, Alexandre Teiller:
Multistage Knapsack. MFCS 2019: 22:1-22:14 - [i17]Evripidis Bampis, Bruno Escoffier, Alexandre Teiller:
Multistage Knapsack. CoRR abs/1901.11260 (2019) - [i16]Eric Angel, Evripidis Bampis:
Mechanism Design for Maximum Vectors. CoRR abs/1903.09843 (2019) - [i15]Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller:
Online Multistage Subset Maximization Problems. CoRR abs/1905.04162 (2019) - [i14]Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Nguyen Kim Thang:
Online-Learning for min-max discrete problems. CoRR abs/1907.05944 (2019) - [i13]Evripidis Bampis, Bruno Escoffier, Alexander V. Kononov:
LP-based algorithms for multistage minimization problems. CoRR abs/1909.10354 (2019) - 2018
- [j52]Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis:
Parameterized Power Vertex Cover. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [j51]Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko:
Energy-efficient scheduling and routing via randomized rounding. J. Sched. 21(1): 35-51 (2018) - [c62]Evripidis Bampis, Bruno Escoffier, Sasa Mladenovic:
Fair Resource Allocation Over Time. AAMAS 2018: 766-773 - [c61]Luciana Arantes, Evripidis Bampis, Alexander V. Kononov, Manthos Letsios, Giorgio Lucarelli, Pierre Sens:
Scheduling under Uncertainty: A Query-based Approach. IJCAI 2018: 4646-4652 - [c60]Evripidis Bampis, Bruno Escoffier, Michael Lampis, Vangelis Th. Paschos:
Multistage Matchings. SWAT 2018: 7:1-7:13 - [i12]Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis:
Parameterized Power Vertex Cover. CoRR abs/1801.10476 (2018) - 2017
- [j50]Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz:
Scheduling on power-heterogeneous processors. Inf. Comput. 257: 22-33 (2017) - [c59]Eric Angel, Evripidis Bampis, Vincent Chau, Vassilis Zissimopoulos:
On the Complexity of Minimizing the Total Calibration Cost. FAW 2017: 1-12 - 2016
- [j49]Eric Angel, Evripidis Bampis, Alexander V. Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos:
Clustering on k-edge-colored graphs. Discret. Appl. Math. 211: 15-22 (2016) - [j48]Evripidis Bampis, Dimitrios Letsios, Ioannis Milis, Georgios Zois:
Speed Scaling for Maximum Lateness. Theory Comput. Syst. 58(2): 304-321 (2016) - [j47]Eric Angel, Evripidis Bampis, Vincent Chau, Dimitrios Letsios:
Throughput maximization for speed scaling with agreeable deadlines. J. Sched. 19(6): 619-625 (2016) - [j46]Eric Angel, Evripidis Bampis, Vincent Chau, Nguyen Kim Thang:
Throughput maximization in multiprocessor speed-scaling. Theor. Comput. Sci. 630: 1-12 (2016) - [c58]Eric Angel, Evripidis Bampis, Fanny Pascual, Nicolas Thibault:
Truthfulness for the Sum of Weighted Completion Times. COCOON 2016: 15-26 - [c57]Evripidis Bampis:
Algorithmic Issues in Energy-Efficient Computation. DOOR 2016: 3-14 - [c56]Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz:
Scheduling on Power-Heterogeneous Processors. LATIN 2016: 41-54 - [c55]Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis:
Parameterized Power Vertex Cover. WG 2016: 97-108 - 2015
- [j45]Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Ioannis Nemparis:
From preemptive to non-preemptive speed-scaling scheduling. Discret. Appl. Math. 181: 11-20 (2015) - [j44]Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli:
Green scheduling, flows and matchings. Theor. Comput. Sci. 579: 126-136 (2015) - [c54]Eric Angel, Evripidis Bampis, Vincent Chau, Nguyen Kim Thang:
Non-preemptive Throughput Maximization for Speed-Scaling with Power-Down. Euro-Par 2015: 171-182 - [c53]Eric Angel, Evripidis Bampis, Vincent Chau, Alexander V. Kononov:
Min-Power Covering Problems. ISAAC 2015: 367-377 - [e5]Evripidis Bampis, Ola Svensson:
Approximation and Online Algorithms - 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8952, Springer 2015, ISBN 978-3-319-18262-9 [contents] - [e4]Evripidis Bampis:
Experimental Algorithms - 14th International Symposium, SEA 2015, Paris, France, June 29 - July 1, 2015, Proceedings. Lecture Notes in Computer Science 9125, Springer 2015, ISBN 978-3-319-20085-9 [contents] - [i11]Eric Angel, Evripidis Bampis, Vincent Chau, Vassilis Zissimopoulos:
Minimizing Total Calibration Cost. CoRR abs/1507.02808 (2015) - 2014
- [j43]Eric Angel, Evripidis Bampis, Vincent Chau:
Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines. Discret. Appl. Math. 175: 1-10 (2014) - [j42]Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Ioannis Milis:
Bounded max-colorings of graphs. J. Discrete Algorithms 26: 56-68 (2014) - [j41]Eric Angel, Evripidis Bampis, Gerasimos G. Pollatos, Vassilis Zissimopoulos:
Optimal data placement on networks with a constant number of clients. Theor. Comput. Sci. 540: 82-88 (2014) - [c52]Anisse Ismaili, Evripidis Bampis, Nicolas Maudet, Patrice Perny:
How the number of strategies impacts the likelihood of equilibria in random graphical games. AAMAS 2014: 285-292 - [c51]Evripidis Bampis, Vincent Chau, Dimitrios Letsios, Giorgio Lucarelli, Ioannis Milis, Georgios Zois:
Energy Efficient Scheduling of MapReduce Jobs. Euro-Par 2014: 198-209 - [c50]Eric Angel, Evripidis Bampis, Vincent Chau, Nguyen Kim Thang:
Throughput Maximization in Multiprocessor Speed-Scaling. ISAAC 2014: 247-258 - [c49]Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli:
Speed-Scaling with No Preemptions. ISAAC 2014: 259-269 - [c48]Sahar Talebi, Evripidis Bampis, Giorgio Lucarelli, Iyad Katib, George N. Rouskas:
The spectrum assigment (SA) problem in optical networks: A multiprocesor scheduling perspective. ONDM 2014: 55-60 - [c47]Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli:
A note on multiprocessor speed scaling with precedence constraints. SPAA 2014: 138-142 - [c46]Eric Angel, Evripidis Bampis, Vincent Chau:
Throughput Maximization in the Speed-Scaling Setting. STACS 2014: 53-62 - [i10]Evripidis Bampis, Vincent Chau, Dimitrios Letsios, Giorgio Lucarelli, Ioannis Milis, Georgios Zois:
Energy Efficient Scheduling of MapReduce Jobs. CoRR abs/1402.2810 (2014) - [i9]Eric Angel, Evripidis Bampis, Vincent Chau, Nguyen Kim Thang:
Throughput Maximization in Multiprocessor Speed-Scaling. CoRR abs/1402.3782 (2014) - [i8]Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko:
Energy Efficient Scheduling and Routing via Randomized Rounding. CoRR abs/1403.4991 (2014) - [i7]Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli:
Speed-scaling with no Preemptions. CoRR abs/1407.7654 (2014) - 2013
- [j40]Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis, Ioannis Milis:
On multiprocessor temperature-aware scheduling problems. J. Sched. 16(5): 529-538 (2013) - [c45]Anisse Ismaili, Evripidis Bampis, Nicolas Maudet, Patrice Perny:
A study on the stability and efficiency of graphical games with unbounded treewidth. AAMAS 2013: 263-270 - [c44]Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Ioannis Nemparis:
From Preemptive to Non-preemptive Speed-Scaling Scheduling. COCOON 2013: 134-146 - [c43]Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko:
Energy Efficient Scheduling and Routing via Randomized Rounding. FSTTCS 2013: 449-460 - [c42]Eric Angel, Evripidis Bampis, Alexander V. Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos:
Clustering on k-Edge-Colored Graphs. MFCS 2013: 50-61 - [c41]Eric Angel, Evripidis Bampis, Vincent Chau, Dimitrios Letsios:
Throughput Maximization for Speed-Scaling with Agreeable Deadlines. TAMC 2013: 10-19 - [c40]Evripidis Bampis, Vincent Chau, Dimitrios Letsios, Giorgio Lucarelli, Ioannis Milis:
Energy Minimization via a Primal-Dual Algorithm for a Convex Program. SEA 2013: 366-377 - [i6]Eric Angel, Evripidis Bampis, Vincent Chau:
Throughput Maximization in the Speed-Scaling Setting. CoRR abs/1309.1732 (2013) - 2012
- [j39]Evripidis Bampis, Christoph Dürr, Fadi Kacem, Ioannis Milis:
Speed scaling with power down scheduling for agreeable deadlines. Sustain. Comput. Informatics Syst. 2(4): 184-189 (2012) - [j38]Eric Angel, Evripidis Bampis, Nicolas Thibault:
Randomized truthful algorithms for scheduling selfish tasks on parallel machines. Theor. Comput. Sci. 414(1): 1-8 (2012) - [c39]Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis, Ioannis Milis:
On Multiprocessor Temperature-Aware Scheduling Problems. FAW-AAIM 2012: 149-160 - [c38]Evripidis Bampis, Dimitrios Letsios, Ioannis Milis, Georgios Zois:
Speed Scaling for Maximum Lateness. COCOON 2012: 25-36 - [c37]Eric Angel, Evripidis Bampis, Fadi Kacem, Dimitrios Letsios:
Speed Scaling on Parallel Processors with Migration. Euro-Par 2012: 128-140 - [c36]Eric Angel, Evripidis Bampis, Fadi Kacem:
Energy Aware Scheduling for Unrelated Parallel Machines. GreenCom 2012: 533-540 - [c35]Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli:
Green Scheduling, Flows and Matchings. ISAAC 2012: 106-115 - [c34]Eric Angel, Evripidis Bampis, Vincent Chau:
Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines. LATIN 2012: 13-24 - [i5]Evripidis Bampis, Giorgio Lucarelli, Ioannis Nemparis:
Improved Approximation Algorithms for the Non-preemptive Speed-scaling Problem. CoRR abs/1209.6481 (2012) - 2011
- [i4]Eric Angel, Evripidis Bampis, Fadi Kacem, Dimitrios Letsios:
Speed Scaling on Parallel Processors with Migration. CoRR abs/1107.2105 (2011) - [i3]Evripidis Bampis, Christoph Dürr, Fadi Kacem, Ioannis Milis:
Speed scaling with power down scheduling for agreeable deadlines. CoRR abs/1111.3398 (2011) - 2010
- [c33]Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Ioannis Milis:
Bounded Max-colorings of Graphs. ISAAC (1) 2010: 353-365 - [c32]Eric Angel, Evripidis Bampis, Nicolas Thibault:
Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines. LATIN 2010: 38-48 - [e3]Evripidis Bampis, Klaus Jansen:
Approximation and Online Algorithms, 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers. Lecture Notes in Computer Science 5893, Springer 2010, ISBN 978-3-642-12449-5 [contents] - [i2]Eric Angel, Evripidis Bampis, Gerasimos G. Pollatos, Vassilis Zissimopoulos:
Optimal Data Placement on Networks With Constant Number of Clients. CoRR abs/1004.4420 (2010)
2000 – 2009
- 2009
- [j37]Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia:
On truthfulness and approximation for scheduling selfish tasks. J. Sched. 12(5): 437-445 (2009) - [j36]Eric Angel, Evripidis Bampis, Laurent Gourvès:
On the minimum hitting set of bundles problem. Theor. Comput. Sci. 410(45): 4534-4542 (2009) - [e2]Evripidis Bampis, Martin Skutella:
Approximation and Online Algorithms, 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers. Lecture Notes in Computer Science 5426, Springer 2009, ISBN 978-3-540-93979-5 [contents] - [i1]Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Ioannis Milis:
Bounded Max-Colorings of Graphs. CoRR abs/0904.1705 (2009) - 2008
- [j35]Eric Angel, Evripidis Bampis, Fanny Pascual:
How good are SPT schedules for fair optimality criteria. Annals OR 159(1): 53-64 (2008) - [j34]Fabien Baille, Evripidis Bampis, Christian Laforest, Christophe Rapine:
Bicriteria scheduling for contiguous and non contiguous parallel tasks. Annals OR 159(1): 97-106 (2008) - [j33]Eric Angel, Evripidis Bampis, Fanny Pascual:
An exponential (matching based) neighborhood for the vehicle routing problem. J. Comb. Optim. 15(2): 179-190 (2008) - [j32]Eric Angel, Evripidis Bampis, Fanny Pascual:
The impact of local policies on the quality of packet routing in paths, trees, and rings. J. Sched. 11(5): 311-322 (2008) - [c31]Eric Angel, Evripidis Bampis, Laurent Gourvès:
On the Minimum Hitting Set of Bundles Problem. AAIM 2008: 3-14 - 2007
- [j31]Eric Angel, Evripidis Bampis, Aleksei V. Fishkin:
A note on scheduling to meet two min-sum objectives. Oper. Res. Lett. 35(1): 69-73 (2007) - [c30]Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia:
On the truthfulness and the approximation for scheduling selfish tasks. SPAA 2007: 196-197 - [r2]Evripidis Bampis, Eric Angel, Fanny Pascual:
Algorithmic Game Theory and Scheduling. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r1]Laurent Gourvès, Evripidis Bampis, Eric Angel:
Approximation in Multiobjective Problems. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j30]Evripidis Bampis, Klaus Jansen:
Introduction. Discret. Appl. Math. 154(4): 609 (2006) - [j29]Eric Angel, Evripidis Bampis, Laurent Gourvès:
Approximation algorithms for the bi-criteria weighted MAX-CUT problem. Discret. Appl. Math. 154(12): 1685-1692 (2006) - [j28]Eric Angel, Evripidis Bampis, Lélia Blin, Laurent Gourvès:
Fair cost-sharing methods for the minimum spanning tree game. Inf. Process. Lett. 100(1): 29-35 (2006) - [j27]Eric Angel, Evripidis Bampis, Fanny Pascual:
Truthful algorithms for scheduling selfish tasks on parallel machines. Theor. Comput. Sci. 369(1-3): 157-168 (2006) - [c29]Eric Angel, Evripidis Bampis, Fanny Pascual:
The Price of Approximate Stability for Scheduling Selfish Tasks on Two Links. Euro-Par 2006: 157-166 - [e1]Evripidis Bampis, Klaus Jansen, Claire Kenyon:
Efficient Approximation and Online Algorithms - Recent Progress on Classical Combinatorial Optimization Problems and New Applications. Lecture Notes in Computer Science 3484, Springer 2006, ISBN 978-3-540-32212-2 [contents] - 2005
- [j26]Eric Angel, Evripidis Bampis:
A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem. Eur. J. Oper. Res. 162(1): 281-289 (2005) - [j25]Eric Angel, Evripidis Bampis, Laurent Gourvès:
Approximation results for a bicriteria job scheduling problem on a single machine without preemption. Inf. Process. Lett. 94(1): 19-27 (2005) - [j24]Foto N. Afrati, Timos Aslanidis, Evripidis Bampis, Ioannis Milis:
Scheduling in Switching Networks with Set-Up Delays. J. Comb. Optim. 9(1): 49-57 (2005) - [j23]Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis:
Scheduling trees with large communication delays on two identical processors. J. Sched. 8(2): 179-190 (2005) - [j22]Evripidis Bampis, Alexander V. Kononov:
Bicriteria approximation algorithms for scheduling problems with communications delays. J. Sched. 8(4): 281-294 (2005) - [c28]Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault:
On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules. COCOON 2005: 308-317 - [c27]Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault:
On-Line Bicriteria Interval Scheduling. Euro-Par 2005: 312-322 - [c26]Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot:
(Non)-Approximability for the Multi-criteria TSP(1, 2). FCT 2005: 329-340 - [c25]Eric Angel, Evripidis Bampis, Laurent Gourvès:
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem. WG 2005: 331-340 - [c24]Eric Angel, Evripidis Bampis, Fanny Pascual:
Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines. WINE 2005: 698-707 - 2004
- [j21]Evripidis Bampis, Rodolphe Giroudeau, Alexander V. Kononov:
Scheduling Tasks with Small Communication Delays for Clusters of Processors. Annals OR 129(1-4): 47-63 (2004) - [j20]Fabien Baille, Evripidis Bampis, Christian Laforest:
A Note On Bicriteria Schedules With Optimal Approximations Ratios. Parallel Process. Lett. 14(2): 315-323 (2004) - [j19]Eric Angel, Evripidis Bampis, Laurent Gourvès:
Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem. Theor. Comput. Sci. 310(1-3): 135-146 (2004) - [c23]Fabien Baille, Evripidis Bampis, Christian Laforest:
Maximization of the Size and the Weight of Schedules of Degradable Intervals. COCOON 2004: 219-228 - [c22]Eric Angel, Evripidis Bampis, Fanny Pascual:
Traffic Grooming in a Passive Star WDM Network. SIROCCO 2004: 1-12 - [p1]Eric Angel, Evripidis Bampis, Laurent Gourvès:
A Dynasearch Neighborhood for the Bicriteria Traveling Salesman Problem. Metaheuristics for Multiobjective Optimisation 2004: 153-176 - 2003
- [j18]Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König:
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. Theor. Comput. Sci. 290(3): 1883-1895 (2003) - [j17]Eric Angel, Evripidis Bampis, Alexander V. Kononov:
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. Theor. Comput. Sci. 306(1-3): 319-338 (2003) - [c21]Eric Angel, Evripidis Bampis, Laurent Gourvès:
Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem. FCT 2003: 39-48 - [c20]Evripidis Bampis, Alexander V. Kononov:
Bicriteria approximation algorithms for scheduling problems with communications. SPAA 2003: 252-253 - 2002
- [j16]Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis:
Scheduling Independent Multiprocessor Tasks. Algorithmica 32(2): 247-261 (2002) - [j15]Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König:
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications. RAIRO - Operations Research 36(1): 21-36 (2002) - [c19]Eric Angel, Evripidis Bampis, Rodolphe Giroudeau:
Non-approximability Results for the Hierarchical Communication Problem with a Bounded Number of Clusters. Euro-Par 2002: 217-224 - [c18]Evripidis Bampis, Massimiliano Caramia, Jirí Fiala, Aleksei V. Fishkin, Antonio Iovanella:
Scheduling of Independent Dedicated Multiprocessor Tasks. ISAAC 2002: 391-402 - 2001
- [c17]Eric Angel, Evripidis Bampis, Alexander V. Kononov:
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs. ESA 2001: 194-205 - [c16]Evripidis Bampis, Alexander V. Kononov:
On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements. IPDPS 2001: 200 - [c15]Evripidis Bampis, Rodolphe Giroudeau, Alexander V. Kononov:
Scheduling tasks with small communication delays for clusters of processors. SPAA 2001: 314-315 - 2000
- [j14]Evripidis Bampis, Aristotelis Giannakos, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis:
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases. RAIRO Theor. Informatics Appl. 34(2): 87-98 (2000) - [j13]Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König:
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. Parallel Process. Lett. 10(1): 133-140 (2000) - [c14]Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis:
Scheduling Trees with Large Communication Delays on Two Identical Processors. Euro-Par 2000: 288-295 - [c13]Foto N. Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon:
Scheduling to Minimize the Average Completion Time of Dedicated Tasks. FSTTCS 2000: 454-464 - [c12]Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König:
An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications. STACS 2000: 443-454
1990 – 1999
- 1999
- [j12]Abdel Krim Amoura, Evripidis Bampis, Yannis Manoussakis, Zsolt Tuza:
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors. Parallel Comput. 25(1): 49-61 (1999) - [j11]Evripidis Bampis:
The complexity of short schedules for uet bipartite graphs. RAIRO - Operations Research 33(3): 367-370 (1999) - [j10]Evripidis Bampis, Yannis Manoussakis, Ioannis Milis:
On the parallel complexity of the alternating Hamiltonian cycle problem. RAIRO - Operations Research 33(4): 421-437 (1999) - [c11]Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König:
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. Euro-Par 1999: 369-372 - [c10]