( en | de | ru )

 

Disambiguation of "Mehlhorn, Kurt"

Author of the publication

copydeleteadd this publication to your clipboard
LEDA: A Platform for Combinatorial and Geometric Computing

, and . Cambridge University Press, (Nov 28, 1999)

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.

Kurt Mehlhorn

Kurt Mehlhorn

Achim Mehlhorn

Herbert Mehlhorn

Johannes Mehlhorn

 

Other publications of authors with the same name

Towards an open online repository of P. polycephalum networks and their corresponding graph representations., , , , and . BICT, page 588. ICST/ACM, (2015)Konzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens.. GI Jahrestagung, volume 19 of Informatik-Fachberichte, page 16-22. Springer, (1979)Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs., , , and . SIAM J. Comput., 36 (2): 326-353 (2006)Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms, , and . CoRR, (2012)On the Implementation of Combinatorial Algorithms for the Linear Exchange Market.. Algorithms, Probability, Networks, and Games, volume 9295 of Lecture Notes in Computer Science, page 87-94. Springer, (2015)Physarum Can Compute Shortest Paths, , and . CoRR, (2011)From Algorithm to Program to Software Library.. Informatics, volume 2000 of Lecture Notes in Computer Science, page 268-273. Springer, (2001)Some Remarks on Boolean Sums.. MFCS, volume 74 of Lecture Notes in Computer Science, page 375-380. Springer, (1979)Improving Order with Queues., , , , , and . CoRR, (2022)Isolating real roots of real polynomials., and . ISSAC, page 247-254. ACM, (2009)