| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Eric Angel, Evripidis Bampis, Nicolas Thibault |
Randomized truthful algorithms for scheduling selfish tasks on parallel machines.  |
Theor. Comput. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis, Ioannis Milis |
On Multiprocessor Temperature-Aware Scheduling Problems. |
FAW-AAIM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Vincent Chau |
Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Christoph Dürr, Fadi Kacem, Ioannis Milis |
Speed scaling with power down scheduling for agreeable deadlines |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Fadi Kacem, Dimitrios Letsios |
Speed Scaling on Parallel Processors with Migration |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Gerasimos G. Pollatos, Vassilis Zissimopoulos |
Optimal Data Placement on Networks With Constant Number of Clients |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Nicolas Thibault |
Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Klaus Jansen (eds.) |
Approximation and Online Algorithms, 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers |
WAOA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Alexander Kononov, Giorgio Lucarelli, Ioannis Milis |
Bounded Max-colorings of Graphs. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Laurent Gourvès |
On the minimum hitting set of bundles problem. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia |
On truthfulness and approximation for scheduling selfish tasks. |
J. Scheduling |
2009 |
DBLP DOI BibTeX RDF |
Scheduling, Approximation algorithms, Game theory, Truthfulness |
| 1 | Evripidis Bampis, Alexander Kononov, Giorgio Lucarelli, Ioannis Milis |
Bounded Max-Colorings of Graphs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Evripidis Bampis, Martin Skutella (eds.) |
Approximation and Online Algorithms, 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers |
WAOA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Fanny Pascual |
An exponential (matching based) neighborhood for the vehicle routing problem. |
J. Comb. Optim. |
2008 |
DBLP DOI BibTeX RDF |
Exponential neighborhood, Local search, Matching, Vehicle routing problem |
| 1 | Eric Angel, Evripidis Bampis, Fanny Pascual |
The impact of local policies on the quality of packet routing in paths, trees, and rings. |
J. Scheduling |
2008 |
DBLP DOI BibTeX RDF |
Approximation with performance guarantee, Price of anarchy, Packet routing, Scheduling policies |
| 1 | Fabien Baille, Evripidis Bampis, Christian Laforest, Christophe Rapine |
Bicriteria scheduling for contiguous and non contiguous parallel tasks. |
Annals OR |
2008 |
DBLP DOI BibTeX RDF |
Scheduling, Parallel tasks, Bicriteria approximation |
| 1 | Eric Angel, Evripidis Bampis, Fanny Pascual |
How good are SPT schedules for fair optimality criteria. |
Annals OR |
2008 |
DBLP DOI BibTeX RDF |
SPT, Fairness measures, Approximation algorithms, Multiprocessor scheduling |
| 1 | Eric Angel, Evripidis Bampis, Laurent Gourvès |
On the Minimum Hitting Set of Bundles Problem. |
AAIM |
2008 |
DBLP DOI BibTeX RDF |
minimum hitting set, min k??sat, approximation algorithm |
| 1 | Eric Angel, Evripidis Bampis, Aleksei V. Fishkin |
A note on scheduling to meet two min-sum objectives. |
Oper. Res. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia |
On the truthfulness and the approximation for scheduling selfish tasks. |
SPAA |
2007 |
DBLP DOI BibTeX RDF |
scheduling, approximation algorithms, game theory, truthfulness |
| 1 | Eric Angel, Evripidis Bampis, Lélia Blin, Laurent Gourvès |
Fair cost-sharing methods for the minimum spanning tree game. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Fanny Pascual |
Truthful algorithms for scheduling selfish tasks on parallel machines. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Laurent Gourvès |
Approximation algorithms for the bi-criteria weighted MAX-CUT problem. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Klaus Jansen |
Introduction. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Fanny Pascual |
The Price of Approximate Stability for Scheduling Selfish Tasks on Two Links. |
Euro-Par |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Foto N. Afrati, Timos Aslanidis, Evripidis Bampis, Ioannis Milis |
Scheduling in Switching Networks with Set-Up Delays. |
J. Comb. Optim. |
2005 |
DBLP DOI BibTeX RDF |
set-up delays, scheduling, approximation algorithms, switching networks |
| 1 | Eric Angel, Evripidis Bampis, Laurent Gourvès |
Approximation results for a bicriteria job scheduling problem on a single machine without preemption. |
Inf. Process. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis |
A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem. |
European Journal of Operational Research |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Alexander Kononov |
Bicriteria approximation algorithms for scheduling problems with communications delays. |
J. Scheduling |
2005 |
DBLP DOI BibTeX RDF |
scheduling, approximability, communications delays, multicriteria optimization |
| 1 | Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis |
Scheduling trees with large communication delays on two identical processors. |
J. Scheduling |
2005 |
DBLP DOI BibTeX RDF |
two processors, scheduling, trees, makespan, communication delays |
| 1 | Eric Angel, Evripidis Bampis, Laurent Gourvès |
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault |
On-Line Bicriteria Interval Scheduling. |
Euro-Par |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Fanny Pascual |
Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines. |
WINE |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot |
(Non)-Approximability for the Multi-criteria TSP(1, 2). |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault |
On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Laurent Gourvès |
Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabien Baille, Evripidis Bampis, Christian Laforest |
A Note On Bicriteria Schedules With Optimal Approximations Ratios. |
Parallel Processing Letters |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Rodolphe Giroudeau, Alexander Kononov |
Scheduling Tasks with Small Communication Delays for Clusters of Processors. |
Annals OR |
2004 |
DBLP DOI BibTeX RDF |
scheduling, approximation algorithms, communication delays |
| 1 | Eric Angel, Evripidis Bampis, Fanny Pascual |
Traffic Grooming in a Passive Star WDM Network. |
SIROCCO |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabien Baille, Evripidis Bampis, Christian Laforest |
Maximization of the Size and the Weight of Schedules of Degradable Intervals. |
COCOON |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Alexander Kononov |
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König |
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Laurent Gourvès |
Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem. |
FCT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Alexander Kononov |
Bicriteria approximation algorithms for scheduling problems with communications. |
SPAA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis |
Scheduling Independent Multiprocessor Tasks. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
Scheduling, Approximation, Multiprocessor tasks |
| 1 | Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König |
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications. |
RAIRO - Operations Research |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Rodolphe Giroudeau |
Non-approximability Results for the Hierarchical Communication Problem with a Bounded Number of Clusters. |
Euro-Par |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Massimiliano Caramia, Jirí Fiala, Aleksei V. Fishkin, Antonio Iovanella |
Scheduling of Independent Dedicated Multiprocessor Tasks. |
ISAAC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Alexander Kononov |
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs. |
ESA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Alexander Kononov |
On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements. |
IPDPS |
2001 |
DBLP BibTeX RDF |
|
| 1 | Evripidis Bampis, Rodolphe Giroudeau, Alexander Kononov |
Scheduling tasks with small communication delays for clusters of processors. |
SPAA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
ITA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König |
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. |
Parallel Processing Letters |
2000 |
DBLP BibTeX RDF |
|
| 1 | Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis |
Scheduling Trees with Large Communication Delays on Two Identical Processors. |
Euro-Par |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König |
An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Foto N. Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon |
Scheduling to Minimize the Average Completion Time of Dedicated Tasks. |
FSTTCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Abdel Krim Amoura, Evripidis Bampis, Yannis Manoussakis, Zsolt Tuza |
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors. |
Parallel Computing |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König |
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. |
Euro-Par |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Foto N. Afrati, Evripidis Bampis, Claire Kenyon, Ioannis Milis |
Scheduling on a Constant Number of Machines. |
RANDOM-APPROX |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko |
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
average weighted completion time, scheduling, algorithm, parallel machines, approximation scheme, release dates |
| 1 | Evripidis Bampis, Charles Delorme, Jean-Claude König |
Optimal Schedules for d-D Grid Graphs with Communication Delays. |
Parallel Computing |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Abdel Krim Amoura, Evripidis Bampis, Jean-Claude König |
Scheduling Algorithms for Parallel Gaussian Elimination With Communication Costs. |
IEEE Trans. Parallel Distrib. Syst. |
1998 |
DBLP DOI BibTeX RDF |
Gaussian elimination method, scheduling, partitioning, mapping, Distributed architectures, communication delays |
| 1 | Evripidis Bampis, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis |
A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph. |
Parallel Processing Letters |
1998 |
DBLP BibTeX RDF |
|
| 1 | Evripidis Bampis, Frédéric Guinand, Denis Trystram |
Some Models for Scheduling Parallel Programs with Communication Delays. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis |
Scheduling Independent Multiprocessor Tasks. |
ESA |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Lucian Finta, Zhen Liu, Ioannis Milis, Evripidis Bampis |
Scheduling UET-UCT Series-Parallel Graphs on Two Processors. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Charles Delorme, Jean-Claude König |
Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract). |
STACS |
1996 |
DBLP DOI BibTeX RDF |
scheduling, communication, grids, DAGs |
| 1 | Evripidis Bampis, Jean-Claude König, Denis Trystram |
Optimal Parallel Execution of Complete Binary Trees and Grids Into Most Popular Interconnection Networks. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha |
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. |
J. Algorithms |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Pavol Hell, Yannis Manoussakis, Moshe Rosenfeld |
Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament. |
Combinatorics and Computer Science |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Yannis Manoussakis, Ioannis Milis |
On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem. |
Combinatorics and Computer Science |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Yannis Manoussakis, Ioannis Milis |
NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract). |
WG |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Jean-Claude König, Denis Trystram |
Optimal Parallel Execution of Complete Binary Trees and Grids into most Popular Interconnection Networks. |
PARLE |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha |
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. |
PARLE |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Jean-Claude König, Denis Trystram |
A Low Overhead Schedule for a 3D-Grid Graph. |
Parallel Processing Letters |
1992 |
DBLP BibTeX RDF |
|
| 1 | Evripidis Bampis, Jean-Claude König, Denis Trystram |
Impact of communications on the complexity of the parallel Gaussian Elimination. |
Parallel Computing |
1991 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")