The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Evripidis Bampis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  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. [Citation Graph (0, 0)][DBLP]
    Combinatorics and Computer Science, 1995, pp:67-73 [Conf]
  2. Evripidis Bampis, Yannis Manoussakis, Ioannis Milis
    On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorics and Computer Science, 1995, pp:367-377 [Conf]
  3. Fabien Baille, Evripidis Bampis, Christian Laforest
    Maximization of the Size and the Weight of Schedules of Degradable Intervals. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:219-228 [Conf]
  4. Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault
    On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:308-317 [Conf]
  5. Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis
    Scheduling Independent Multiprocessor Tasks. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:1-12 [Conf]
  6. Eric Angel, Evripidis Bampis, Alexander Kononov
    A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:194-205 [Conf]
  7. Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault
    On-Line Bicriteria Interval Scheduling. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2005, pp:312-322 [Conf]
  8. Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis
    Scheduling Trees with Large Communication Delays on Two Identical Processors. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2000, pp:288-295 [Conf]
  9. Eric Angel, Evripidis Bampis, Rodolphe Giroudeau
    Non-approximability Results for the Hierarchical Communication Problem with a Bounded Number of Clusters. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2002, pp:217-224 [Conf]
  10. Eric Angel, Evripidis Bampis, Fanny Pascual
    The Price of Approximate Stability for Scheduling Selfish Tasks on Two Links. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2006, pp:157-166 [Conf]
  11. Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
    Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1999, pp:369-372 [Conf]
  12. Eric Angel, Evripidis Bampis, Laurent Gourvès
    Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:39-48 [Conf]
  13. Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot
    (Non)-Approximability for the Multi-criteria TSP(1, 2). [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:329-340 [Conf]
  14. 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. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:32-44 [Conf]
  15. Foto N. Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon
    Scheduling to Minimize the Average Completion Time of Dedicated Tasks. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:454-464 [Conf]
  16. Evripidis Bampis, Alexander Kononov
    On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2001, pp:200- [Conf]
  17. Evripidis Bampis, Massimiliano Caramia, Jirí Fiala, Aleksei V. Fishkin, Antonio Iovanella
    Scheduling of Independent Dedicated Multiprocessor Tasks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:391-402 [Conf]
  18. Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha
    A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. [Citation Graph (0, 0)][DBLP]
    PARLE, 1993, pp:553-560 [Conf]
  19. Evripidis Bampis, Jean-Claude König, Denis Trystram
    Optimal Parallel Execution of Complete Binary Trees and Grids into most Popular Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    PARLE, 1994, pp:122-133 [Conf]
  20. Foto N. Afrati, Evripidis Bampis, Claire Kenyon, Ioannis Milis
    Scheduling on a Constant Number of Machines. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:281-287 [Conf]
  21. Eric Angel, Evripidis Bampis, Fanny Pascual
    Traffic Grooming in a Passive Star WDM Network. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:1-12 [Conf]
  22. Evripidis Bampis, Rodolphe Giroudeau, Alexander Kononov
    Scheduling tasks with small communication delays for clusters of processors. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:314-315 [Conf]
  23. Evripidis Bampis, Alexander Kononov
    Bicriteria approximation algorithms for scheduling problems with communications. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:252-253 [Conf]
  24. Evripidis Bampis, Charles Delorme, Jean-Claude König
    Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:655-666 [Conf]
  25. Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
    An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:443-454 [Conf]
  26. Eric Angel, Evripidis Bampis, Laurent Gourvès
    Approximation Algorithms for the Bi-criteria Weighted max-cut Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:331-340 [Conf]
  27. Evripidis Bampis, Yannis Manoussakis, Ioannis Milis
    NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:387-394 [Conf]
  28. Eric Angel, Evripidis Bampis, Fanny Pascual
    Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:698-707 [Conf]
  29. Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis
    Scheduling Independent Multiprocessor Tasks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:2, pp:247-261 [Journal]
  30. Evripidis Bampis, Frédéric Guinand, Denis Trystram
    Some Models for Scheduling Parallel Programs with Communication Delays. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:72, n:1-2, pp:5-24 [Journal]
  31. Evripidis Bampis, Klaus Jansen
    Introduction. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:4, pp:609- [Journal]
  32. Eric Angel, Evripidis Bampis, Laurent Gourvès
    Approximation algorithms for the bi-criteria weighted MAX-CUT problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:12, pp:1685-1692 [Journal]
  33. Eric Angel, Evripidis Bampis, Laurent Gourvès
    Approximation results for a bicriteria job scheduling problem on a single machine without preemption. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:94, n:1, pp:19-27 [Journal]
  34. Eric Angel, Evripidis Bampis, Lélia Blin, Laurent Gourvès
    Fair cost-sharing methods for the minimum spanning tree game. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:1, pp:29-35 [Journal]
  35. 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. [Citation Graph (0, 0)][DBLP]
    ITA, 2000, v:34, n:2, pp:87-98 [Journal]
  36. Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha
    A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:3, pp:432-440 [Journal]
  37. Foto N. Afrati, Timos Aslanidis, Evripidis Bampis, Ioannis Milis
    Scheduling in Switching Networks with Set-Up Delays. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:9, n:1, pp:49-57 [Journal]
  38. Eric Angel, Evripidis Bampis, Aleksei V. Fishkin
    A note on scheduling to meet two min-sum objectives. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:69-73 [Journal]
  39. Evripidis Bampis, Charles Delorme, Jean-Claude König
    Optimal Schedules for d-D Grid Graphs with Communication Delays. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1998, v:24, n:11, pp:1653-1664 [Journal]
  40. Evripidis Bampis, Jean-Claude König, Denis Trystram
    Impact of communications on the complexity of the parallel Gaussian Elimination. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1991, v:17, n:1, pp:55-61 [Journal]
  41. Abdel Krim Amoura, Evripidis Bampis, Yannis Manoussakis, Zsolt Tuza
    A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1999, v:25, n:1, pp:49-61 [Journal]
  42. Fabien Baille, Evripidis Bampis, Christian Laforest
    A Note On Bicriteria Schedules With Optimal Approximations Ratios. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2004, v:14, n:2, pp:315-323 [Journal]
  43. Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
    Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2000, v:10, n:1, pp:133-140 [Journal]
  44. Evripidis Bampis, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis
    A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:3, pp:399-405 [Journal]
  45. Evripidis Bampis, Jean-Claude König, Denis Trystram
    A Low Overhead Schedule for a 3D-Grid Graph. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1992, v:2, n:, pp:363-372 [Journal]
  46. Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis
    Scheduling trees with large communication delays on two identical processors. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2005, v:8, n:2, pp:179-190 [Journal]
  47. Evripidis Bampis, Alexander Kononov
    Bicriteria approximation algorithms for scheduling problems with communications delays. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2005, v:8, n:4, pp:281-294 [Journal]
  48. Eric Angel, Evripidis Bampis, Laurent Gourvès
    Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:135-146 [Journal]
  49. Eric Angel, Evripidis Bampis, Alexander Kononov
    On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:319-338 [Journal]
  50. Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
    An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1883-1895 [Journal]
  51. Evripidis Bampis, Jean-Claude König, Denis Trystram
    Optimal Parallel Execution of Complete Binary Trees and Grids Into Most Popular Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:147, n:1&2, pp:1-18 [Journal]
  52. Lucian Finta, Zhen Liu, Ioannis Milis, Evripidis Bampis
    Scheduling UET-UCT Series-Parallel Graphs on Two Processors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:162, n:2, pp:323-340 [Journal]
  53. Eric Angel, Evripidis Bampis, Fanny Pascual
    Truthful algorithms for scheduling selfish tasks on parallel machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:157-168 [Journal]
  54. Abdel Krim Amoura, Evripidis Bampis, Jean-Claude König
    Scheduling Algorithms for Parallel Gaussian Elimination With Communication Costs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:7, pp:679-686 [Journal]
  55. Eric Angel, Evripidis Bampis
    A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:162, n:1, pp:281-289 [Journal]
  56. Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia
    On the truthfulness and the approximation for scheduling selfish tasks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:196-197 [Conf]

  57. On the Minimum Hitting Set of Bundles Problem. [Citation Graph (, )][DBLP]


  58. Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines. [Citation Graph (, )][DBLP]


  59. Bounded Max-Colorings of Graphs [Citation Graph (, )][DBLP]


  60. Optimal Data Placement on Networks With Constant Number of Clients [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002