( en | de | ru )

 

Disambiguation of "Erlebach, Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
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|..
DOI: 10.1007/s00224-009-9184-8

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

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)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)Network analysis. Methodological foundations, and . Springer, Berlin; New York, (2005)Car-Sharing on a Star Network: On-Line Scheduling with k Servers., , and . STACS, volume 126 of LIPIcs, page 51:1-51:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Special Issue on Approximation and Online Algorithms., and . Theory Comput. Syst., 64 (4): 569-570 (2020)Exploration of k-edge-deficient temporal graphs., and . Acta Informatica, 59 (4): 387-407 (2022)Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty., , , , , and . ESA, volume 204 of LIPIcs, page 10:1-10:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Parameterized Temporal Exploration Problems., and . SAND, volume 221 of LIPIcs, page 15:1-15:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs., , and . COCOON (1), volume 14422 of Lecture Notes in Computer Science, page 168-181. Springer, (2023)