( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Complexity of Finding Tangles

, , , , , и . Proc. 36th European Workshop on Computational Geometry (EuroCG'20), стр. 67:1--8. (2020)

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

 

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

Computing Optimal Tangles Faster, , , , и . Proc. 35th Europ. Workshop Comput. Geom. (EuroCG'19), стр. 61:1-7. (2019)Robust gateway placement for scalable lorawan, , , , и . 2021 13th IFIP Wireless and Mobile Networking Conference (WMNC), стр. 71--78. IEEE, (2021)Recognizing Stick Graphs with and without Length Constraints., , , , , , и . J. Graph Algorithms Appl., 24 (4): 657-681 (2020)Visual Analytics for Sets over Time and Space (Dagstuhl Seminar 19192)., , и . Dagstuhl Reports, 9 (5): 31-57 (2019)Algorithms for Floor Planning with Proximity Requirements., , и . CAAD Futures, том 1465 из Communications in Computer and Information Science, стр. 151-171. Springer, (2021)Cover Contact Graphs., , , , , , , , , и 4 other автор(ы). GD, том 4875 из Lecture Notes in Computer Science, стр. 171-182. Springer, (2007)Coloring Mixed and Directional Interval Graphs., , , , , и . GD, том 13764 из Lecture Notes in Computer Science, стр. 418-431. Springer, (2022)Coloring and Recognizing Mixed Interval Graphs., , , , , и . ISAAC, том 283 из LIPIcs, стр. 36:1-36:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Improved Approximation Algorithms for Box Contact Representations, , , , , , , и . Algorithmica, (2016)Beyond Outerplanarity, , , , и . Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD'17), Springer-Verlag, (2017)