( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Coloring and Recognizing Mixed Interval Graphs.

, , , , , и . ISAAC, том 283 из LIPIcs, стр. 36:1-36:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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)Approximating the Generalized Minimum Manhattan Network Problem, , , , , и . Algorithmica, (марта 2017)Computing Storyline Visualizations with Few Block Crossings, , , и . Proc. 25th Int. Sympos. Graph Drawing Network Vis. (GD'17), том 10692 из Lecture Notes in Computer Science, стр. 365--378. Springer-Verlag, (2018)Planar L-Drawings of Directed Graphs, , , , , , , и . Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD'17), том 10692 из LNCS, стр. 465--478. Cham, Springer International Publishing, (2017)Beyond Outerplanarity, , , , и . Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD'17), Springer-Verlag, (2017)Planar L-Drawings of Directed Graphs, , , , , , , и . CoRR, (2017)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)