Author of the publication

10261 Abstracts Collection - Algorithm Engineering.

, , , and . Algorithm Engineering, volume 10261 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)

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

The prize collecting Steiner tree problem: theory and practice., , and . SODA, page 760-769. ACM/SIAM, (2000)Fast Allocation Algorithms. SWAT (FOCS), page 144-154. IEEE Computer Society, (1972)How Easy Is Local Search? (Extended Abstract), , and . FOCS, page 39-42. IEEE Computer Society, (1985)Better approximation algorithms for bin covering., , and . SODA, page 557-566. ACM/SIAM, (2001)Data Structures for Traveling Salesmen., , , and . SODA, page 145-154. ACM/SIAM, (1993)A theoretician's guide to the experimental analysis of algorithms.. Data Structures, Near Neighbor Searches, and Methodology, volume 59 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 215-250. DIMACS/AMS, (1999)Disjoint-Path Facility Location: Theory and Practice., , , , , , , , and . ALENEX, page 60-74. SIAM, (2011)A Brief History of SIGACT News and its Editors.. SIGACT News, 27 (3): 125 (1996)Bin Packing.. Encyclopedia of Algorithms, (2016)The NP-completeness column.. ACM Trans. Algorithms, 1 (1): 160-176 (2005)