( en | de | ru )

 

Disambiguation of "Erlebach, Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
A New Approximation Algorithm for Labeling Weighted Points with Sliding Labels

, , , , and . Proc. 22nd European Workshop on Computational Geometry (EWCG'06), page 137--140. Delphi, (2006)

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

Call Control in Rings., , , and . ICALP, volume 2380 of Lecture Notes in Computer Science, page 788-799. Springer, (2002)A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity., and . SOFSEM, volume 12011 of Lecture Notes in Computer Science, page 64-75. Springer, (2020)Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings., , and . ISAAC, volume 123 of LIPIcs, page 64:1-64:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)An Adversarial Model for Scheduling with Testing., , , and . Algorithmica, 82 (12): 3630-3675 (2020)Complexity and online algorithms for minimum skyline coloring of intervals., , , , , and . Theor. Comput. Sci., (2019)Two Moves per Time Step Make a Difference., , , , and . ICALP, volume 132 of LIPIcs, page 141:1-141:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)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|..Conversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms., and . ICALP Satellite Workshops, page 135-146. Carleton Scientific, Waterloo, Ontario, Canada, (2000)"Green" barrier coverage with mobile sensors., , , and . Theor. Comput. Sci., (2021)Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous., , , , and . CoRR, (2023)