( en | de | ru )

 

Disambiguation of "Langerman, Stefan"

Author of the publication

copydeleteadd this publication to your clipboard
Computing the Visibility Polygon Using Few Variables.

, , , and . ISAAC, volume 7074 of Lecture Notes in Computer Science, page 70-79. Springer, (2011)

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.

Stefan Schwärzler

Graphische Modelle im natürlichsprachlichen Mensch-Maschine-Dialog. TU München, (2010)

Stefan Weiß

Deformation quantization of principal fibre bundles and classical gauge theories. Uni Freiburg, (2009)

Stefan Fröhlich

Modellbasierte Fehlererkennung und Diagnose in Echtzeit am Beispiel einer Brennstoffzelle. Uni Kassel, (2009)

Stefan Tripmaker

Verhältnis und Abgrenzung zwischen Steuerhinterziehung und Betrug. Bucerius Law School Hamburg, (2007)

Stefan Kutter

Molekularer Aufbau und Translokationsmechanismus des Cag-Typ-IV-Sekretionssystems von Helicobacter pylori. Uni München, (2009)
 

Other publications of authors with the same name

Colorful Strips., , , , , , , , and . LATIN, volume 6034 of Lecture Notes in Computer Science, page 2-13. Springer, (2010)Space-Time Trade-offs for Stack-Based Algorithms., , , , and . STACS, volume 20 of LIPIcs, page 281-292. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Cookie Clicker., , , , , and . Graphs Comb., 36 (2): 269-302 (2020)Colorful Strips., , , , , , , , and . Graphs Comb., 27 (3): 327-339 (2011)Efficient Many-To-Many Point Matching in One Dimension., , , , , , , and . Graphs Comb., 23 (Supplement-1): 169-178 (2007)Belga B-Trees., , , and . CSR, volume 11532 of Lecture Notes in Computer Science, page 93-105. Springer, (2019)Optimal Algorithms for Constrained 1-Center Problems., , and . LATIN, volume 8392 of Lecture Notes in Computer Science, page 84-95. Springer, (2014)Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles., , and . STACS, volume 2285 of Lecture Notes in Computer Science, page 250-261. Springer, (2002)Necklaces, Convolutions, and X + Y., , , , , , , and . ESA, volume 4168 of Lecture Notes in Computer Science, page 160-171. Springer, (2006)Combining Binary Search Trees, , , and . CoRR, (2013)