( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Strongly Monotone Drawings of Planar Graphs.

, , , , , и . CoRR, (2016)

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.

Rita Scheucher

Manfred Xaver Ferdinand Scheucher

Rupert Scheucher

Erwin Scheucher

Manfred Ruddat

 

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

On L-shaped point set embeddings of trees: first non-embeddable examples., и . J. Graph Algorithms Appl., 24 (3): 343-369 (2020)Minimal Representations of Order Types by Geometric Graphs., , , , , , , , , и 1 other автор(ы). GD, том 11904 из Lecture Notes in Computer Science, стр. 101-113. Springer, (2019)A SAT attack on higher dimensional Erdős-Szekeres numbers.. CoRR, (2021)Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles., , , , , и . CoRR, (2023)Saturation Results Around the Erdős-Szekeres Problem., , , и . SoCG, том 293 из LIPIcs, стр. 46:1-46:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)A Superlinear Lower Bound on the Number of 5-Holes., , , , , , , и . SoCG, том 77 из LIPIcs, стр. 8:1-8:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Almost-Equidistant Sets., , , , и . Graphs Comb., 36 (3): 729-754 (2020)A Note on Universal Point Sets for Planar Graphs., , и . GD, том 11904 из Lecture Notes in Computer Science, стр. 350-362. Springer, (2019)Topological Drawings Meet Classical Theorems from Convex Geometry., , , , и . GD, том 12590 из Lecture Notes in Computer Science, стр. 281-294. Springer, (2020)SAT-Based Generation of Planar Graphs., , и . SAT, том 271 из LIPIcs, стр. 14:1-14:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)