( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Drawing Graphs on Few Lines and Few Planes

, , , , , и . Journal of Computational Geometry, 11 (1): 433--475 (2020)
DOI: 10.20382/jocg.v11i1a17

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.

Alexander

Alexander Auch

A phylogenetic potpourri: computational methods for analysing genome scale data. Uni Tübingen, (2010)

Alexander Stadler

Messtechnische Bestimmung und Simulation der Kernverluste in weichmagnetischen Materialien. Uni Erlangen-Nürnberg, (2009)

Alexander Blecken

A reference task model for supply chain processes of humanitarian organisations. Uni Paderborn, (2009)

Alexander Gocht

Methods in economic farm modelling. Uni Bonn, (2009)
 

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

Computing Optimal Tangles Faster, , , , и . Proc. 35th Europ. Workshop Comput. Geom. (EuroCG'19), стр. 61:1-7. (2019)Obfuscated Drawings of Planar Graphs, , , , и . CoRR, (2008)On collinear sets in straight line drawings, и . CoRR, (2008)On Collinear Sets in Straight-Line Drawings., и . WG, том 6986 из Lecture Notes in Computer Science, стр. 295-306. Springer, (2011)Bundled Crossings Revisited., , , , , и . CoRR, (2018)The Complexity of Finding Tangles, , , , , и . Proc. 36th European Workshop on Computational Geometry (EuroCG'20), стр. 67:1--8. (2020)Untangling planar graphs from a specified vertex position - Hard cases., , , , и . Discret. Appl. Math., 159 (8): 789-799 (2011)Deciding the Feasibility and Minimizing the Height of Tangles., , , , , и . CoRR, (2023)Computing Height-Optimal Tangles Faster., , , , и . GD, том 11904 из Lecture Notes in Computer Science, стр. 203-215. Springer, (2019)