( en | de | ru )

 

Disambiguation of "Schrezenmaier, Hendrik"

Author of the publication

copydeleteadd this publication to your clipboard
The Voronoi Diagram of Rotating Rays With applications to Floodlight Illumination.

, , , , , , and . ESA, volume 204 of LIPIcs, page 5:1-5:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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.

Gerd Schrezenmaier

Christine Schrezenmaier

Heinz-Erwin Schrezenmaier

Hendrik Vogel

The sediment record of Lake Ohrid (Albania-Macedonia): new methodological approaches, tephrostratigraphy, chronology, and inferences of past climatic and environmental changes. Uni Köln, (2009)

Hendrik Lens

Schnelle Regelung mit Ausgangsrückführung für Systeme mit Stellgrößenbeschränkungen. TU Darmstadt, (2009)
 

Other publications of authors with the same name

New Variants of Perfect Non-crossing Matchings., , and . CALDAM, volume 12601 of Lecture Notes in Computer Science, page 151-164. Springer, (2021)New variants of perfect non-crossing matchings., , and . Discret. Appl. Math., (January 2024)The Voronoi Diagram of Rotating Rays With applications to Floodlight Illumination., , , , , , and . ESA, volume 204 of LIPIcs, page 5:1-5:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A Note on Universal Point Sets for Planar Graphs., , and . GD, volume 11904 of Lecture Notes in Computer Science, page 350-362. Springer, (2019)Linear Size Universal Point Sets for Classes of Planar Graphs., , , and . SoCG, volume 258 of LIPIcs, page 31:1-31:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)A Note On Universal Point Sets for Planar Graphs., , and . CoRR, (2018)Homothetic Triangle Contact Representations.. WG, volume 10520 of Lecture Notes in Computer Science, page 425-437. Springer, (2017)The Very Best of Perfect Non-crossing Matchings., , and . CoRR, (2020)A Note on Universal Point Sets for Planar Graphs., , and . J. Graph Algorithms Appl., 24 (3): 247-267 (2020)