( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Network analysis. Methodological foundations

, и . Springer, Berlin; New York, (2005)

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.

Thomas Erlebach

Thomas Erlebach

Ernst Erlebach

Axel Erlebach

Wolfgang Erlebach

 

Другие публикации лиц с тем же именем

Conversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms., и . ICALP Satellite Workshops, стр. 135-146. Carleton Scientific, Waterloo, Ontario, Canada, (2000)Trimming of Graphs, with Application to Point Labeling, , , , и . #TOCS#, (2009)Appeared online at \path|http://dx.doi.org/10.1007/s00224-009-9184-8|..A cop and robber game on edge-periodic temporal graphs., , , и . J. Comput. Syst. Sci., (2024)Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries., , и . STACS, том 187 из LIPIcs, стр. 27:1-27:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)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)An Efficient Algorithm for the Fast Delivery Problem., , и . FCT, том 11651 из Lecture Notes in Computer Science, стр. 171-184. Springer, (2019)Exploration of k-Edge-Deficient Temporal Graphs., и . WADS, том 12808 из Lecture Notes in Computer Science, стр. 371-384. Springer, (2021)Correction to: Special Issue on Approximation and Online Algorithms., и . Theory Comput. Syst., 64 (4): 571 (2020)Fundamentals, и . Network Analysis, том 3418 из Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2005)Car-sharing between two locations: Online scheduling with flexible advance bookings., , и . Discret. Appl. Math., (2022)