The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Eric Angel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. Eric Angel, Vassilis Zissimopoulos
    On the Classification of NP-complete Problems in Terms of Their Correlation Coefficient. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:261-277 [Journal]
  10. Eric Angel, Vassilis Zissimopoulos
    On the Quality of Local Search for the Quadratic Assignment Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:15-25 [Journal]
  11. 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]
  12. Eric Angel, Vassilis Zissimopoulos
    On the Hardness of the Quadratic Assignment Problem with Metaheuristics. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2002, v:8, n:4, pp:399-414 [Journal]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. Eric Angel, Vassilis Zissimopoulos
    On the landscape ruggedness of the quadratic assignment problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:159-172 [Journal]
  19. Eric Angel, Vassilis Zissimopoulos
    Autocorrelation Coefficient for the Graph Bipartitioning Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:191, n:1-2, pp:229-243 [Journal]
  20. 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]
  21. 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]
  22. 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]

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


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


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


Search in 0.004secs, Finished in 0.007secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002