( en | de | ru )

 

Disambiguation of "Bampis, Evripidis"

Author of the publication

copydeleteadd this publication to your clipboard
Calibrations scheduling with arbitrary lengths and activation length.

, , , and . J. Sched., 24 (5): 459-467 (2021)

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.

Evripidis Papadimitriou

Ioannis Evripidis

Evripidis Stylianidis

 

Other publications of authors with the same name

Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem., , and . Theor. Comput. Sci., 310 (1-3): 135-146 (2004)Target-based computer-assisted orchestration: Complexity and approximation algorithms., , , , and . Eur. J. Oper. Res., 304 (3): 926-938 (2023)Online 2-stage Stable Matching., , and . CoRR, (2022)Scheduling Independent Multiprocessor Tasks., , , and . ESA, volume 1284 of Lecture Notes in Computer Science, page 1-12. Springer, (1997)On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem., , and . Combinatorics and Computer Science, volume 1120 of Lecture Notes in Computer Science, page 367-377. Springer, (1995)(Non)-Approximability for the Multi-criteria TSP(1, 2)., , , and . FCT, volume 3623 of Lecture Notes in Computer Science, page 329-340. Springer, (2005)Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases., , , , and . RAIRO Theor. Informatics Appl., 34 (2): 87-98 (2000)Online 2-stage Stable Matching., , and . AAMAS, page 2475-2477. ACM, (2023)Multistage Matchings., , , and . SWAT, volume 101 of LIPIcs, page 7:1-7:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Min-Power Covering Problems., , , and . ISAAC, volume 9472 of Lecture Notes in Computer Science, page 367-377. Springer, (2015)