( en | de | ru )

 

Disambiguation of "Erlebach, Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
Algorithms that Access the Input via Queries.

. SOFSEM, volume 12607 of Lecture Notes in Computer Science, page 3-12. Springer, (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.

Thomas Erlebach

Thomas Erlebach

Ernst Erlebach

Axel Erlebach

Wolfgang Erlebach

 

Other publications of authors with the same name

Conversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms., and . ICALP Satellite Workshops, page 135-146. Carleton Scientific, Waterloo, Ontario, Canada, (2000)Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries., , and . STACS, volume 187 of LIPIcs, page 27:1-27:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Trimming of Graphs, with Application to Point Labeling, , , , and . #TOCS#, (2009)Appeared online at \path|http://dx.doi.org/10.1007/s00224-009-9184-8|..Correction to: Special Issue on Approximation and Online Algorithms., and . Theory Comput. Syst., 64 (4): 571 (2020)Tim Roughgarden, Selfish Routing and the Price of Anarchy, MIT Press, Cambridge, MA (2005) ISBN 0-262-18243-2, pp 196.. Oper. Res. Lett., 35 (3): 418-419 (2007)Car-sharing between two locations: Online scheduling with flexible advance bookings., , and . Discret. Appl. Math., (2022)Fundamentals, and . Network Analysis, volume 3418 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2005)Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty., , , and . ESA, volume 244 of LIPIcs, page 49:1-49:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)An Efficient Algorithm for the Fast Delivery Problem., , and . FCT, volume 11651 of Lecture Notes in Computer Science, page 171-184. Springer, (2019)Exploration of k-Edge-Deficient Temporal Graphs., and . WADS, volume 12808 of Lecture Notes in Computer Science, page 371-384. Springer, (2021)