( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Simple and Efficient Algorithm for High-Quality Line Labeling

, , , , и . Technical report, UU-CS-2001-44. #UU#, (2001)

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 Wolff

Alexander Wolff

Alexander Wolff

Alexander Wolff

Prof. Dr. Alexander Wolff Universität Würzburg

 

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

Visual Analytics for Sets over Time and Space (Dagstuhl Seminar 19192)., , и . Dagstuhl Reports, 9 (5): 31-57 (2019)Improved Approximation Algorithms for Box Contact Representations, , , , , , , и . Algorithmica, (2016)Robust gateway placement for scalable lorawan, , , , и . 2021 13th IFIP Wireless and Mobile Networking Conference (WMNC), стр. 71--78. IEEE, (2021)Computing Optimal Tangles Faster, , , , и . Proc. 35th Europ. Workshop Comput. Geom. (EuroCG'19), стр. 61:1-7. (2019)Recognizing Stick Graphs with and without Length Constraints., , , , , , и . J. Graph Algorithms Appl., 24 (4): 657-681 (2020)Unternehmensbewertung im Transformationsprozeß. Gabler-Edition Wissenschaft Dt. Univ.-Verl. u.a., Wiesbaden, (1998)The Traveling Salesman Problem Under Squared Euclidean Distances, , , , и . Proc. 27th Internat. Sympos. Theoretical Aspects Comput. Sci. (STACS'10), стр. 239--250. Nancy, (2010)A Simple Proof for the NP-Hardness of Edge Labeling. Technical report, 11/2000. #UG#, (сентября 2000)Compact Drawing of Clustered Layered Graphs, , и . Poster at 32nd Internat. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM'06), (2006)Beyond Outerplanarity, , , , и . Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD'17), Springer-Verlag, (2017)