Author of the publication

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.

 

Other publications of authors with the same name

Approximability of average completion time scheduling on unrelated machines.. Math. Program., 161 (1-2): 135-158 (2017)Connected Feedback Vertex Set in Planar Graphs., and . WG, volume 5911 of Lecture Notes in Computer Science, page 143-153. (2009)Competitive analysis of preemptive single-machine scheduling.. Oper. Res. Lett., 38 (6): 585-588 (2010)Complexity of preemptive minsum scheduling on unrelated parallel machines.. J. Algorithms, 57 (1): 37-48 (2005)A priori TSP in the scenario model., , , and . Discret. Appl. Math., (2018)The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem.. SIAM J. Comput., 43 (1): 96-125 (2014)The generalized work function algorithm is competitive for the generalized 2-server problem. CoRR, (2011)Fixed-Order Scheduling on Parallel Machines., , , , and . IPCO, volume 11480 of Lecture Notes in Computer Science, page 88-100. Springer, (2019)Efficient Algorithms for Average Completion Time Scheduling.. IPCO, volume 6080 of Lecture Notes in Computer Science, page 411-423. Springer, (2010)On the Complexity of Master Problems., and . MFCS (2), volume 9235 of Lecture Notes in Computer Science, page 567-576. Springer, (2015)