( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An Optimal Algorithm to Compute the Inverse Beacon Attraction Region.

, , , и . SoCG, том 99 из LIPIcs, стр. 55:1-55:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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.

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 Padberg

Der Einsatz des Internets im Geographieunterricht: Meinungsbilder und Unterrichtsbeobachtungen. Uni Köln, (2009)

Stefan Pollak

Herstellung pulverförmiger Komposite aus Polybutylenterephthalat nach einem Hochdrucksprühverfahren. Uni Bochum, (2009)

Stefan Reisbacher

Funktionelle Analyse von Cryptochrom 3 aus Arabidopsis thaliana. Uni Marburg, (2009)
 

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

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams., , , , , , и . LATIN, том 3887 из Lecture Notes in Computer Science, стр. 80-92. Springer, (2006)Helly Numbers of Polyominoes., , , и . CCCG, (2011)Locked and Unlocked Chains of Planar Shapes., , , , , , , и . Discret. Comput. Geom., 44 (2): 439-462 (2010)Dynamic Trees with Almost-Optimal Access Cost., , , , и . ESA, том 112 из LIPIcs, стр. 38:1-38:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Algorithms for Efficient Filtering in Content-Based Multicast., , и . ESA, том 2161 из Lecture Notes in Computer Science, стр. 428-439. Springer, (2001)A Tight Analysis of the Maximal Matching Heuristic., , , , и . COCOON, том 3595 из Lecture Notes in Computer Science, стр. 701-709. Springer, (2005)Bichromatic compatible matchings., , , и . SoCG, стр. 267-276. ACM, (2013)On the complexity of halfspace area queries.. SCG, стр. 207-211. ACM, (2001)Triangulating and Guarding Realistic Polygons., , , , , и . CCCG, (2008)On the Shooter Location Problem.. CCCG, (2000)