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

Minimizing the total completion time in a unit-time open shop with release times., and . Oper. Res. Lett., 20 (5): 207-212 (1997)The Stock Size Problem., , , and . Operations Research, 46 (3-Supplement-3): S1-S12 (1998)Nothing New about Equiangular Polygons.. The American Mathematical Monthly, 120 (9): 849-850 (2013)An Approximation Scheme for Cake Division with a Linear Number of Cuts.. ESA, volume 2461 of Lecture Notes in Computer Science, page 896-901. Springer, (2002)Sometimes Travelling is Easy: The Master Tour Problem., , and . ESA, volume 979 of Lecture Notes in Computer Science, page 128-141. Springer, (1995)Competitive Odds and Ends., and . Online Algorithms, volume 1442 of Lecture Notes in Computer Science, page 385-394. Springer, (1996)Minimum Cost Dynamic Flows: The Series-Parallel Case., and . IPCO, volume 920 of Lecture Notes in Computer Science, page 329-343. Springer, (1995)The Travelling Salesman and the PQ-Tree., , and . IPCO, volume 1084 of Lecture Notes in Computer Science, page 490-504. Springer, (1996)On the Approximability of Average Completion Time Scheduling under Precedence Constraints.. ICALP, volume 2076 of Lecture Notes in Computer Science, page 887-897. Springer, (2001)An FPTAS for Agreeably Weighted Variance on a Single Machine.. ICALP, volume 1644 of Lecture Notes in Computer Science, page 707-716. Springer, (1999)