PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Bampis, Evripidis"

Author of the publication

copydeleteadd this publication to your clipboard
Energy-efficient scheduling and routing via randomized rounding.

, , , , and . J. Scheduling, 21 (1): 35-51 (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Bampis, Evripidis
add a person with the name Bampis, Evripidis
 

Other publications of authors with the same name

Approximation results for a bicriteria job scheduling problem on a single machine without preemption., , and . Inf. Process. Lett., 94 (1): 19-27 (2005)Approximation in Multiobjective Problems., , and . Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall/CRC, (2007)Some Models for Scheduling Parallel Programs with Communication Delays., , and . Discrete Applied Mathematics, 72 (1-2): 5-24 (1997)Introduction., and . Discrete Applied Mathematics, 154 (4): 609 (2006)On the parallel complexity of the alternating Hamiltonian cycle problem., , and . RAIRO - Operations Research, 33 (4): 421-437 (1999)On the minimum hitting set of bundles problem., , and . Theor. Comput. Sci., 410 (45): 4534-4542 (2009)Optimal Schedules for d-D Grid Graphs with Communication Delays., , and . Parallel Computing, 24 (11): 1653-1664 (1998)Impact of communications on the complexity of the parallel Gaussian Elimination., , and . Parallel Computing, 17 (1): 55-61 (1991)On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements., and . IPDPS, page 200. IEEE Computer Society, (2001)Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates., , , , , , , , , and 1 other author(s). FOCS, page 32-44. IEEE Computer Society, (1999)