( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing.

, , и . GD, том 1353 из Lecture Notes in Computer Science, стр. 391-402. Springer, (1997)

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.

Ioannis Gavriel

Ioannis Efthimiadis

Ioannis Vardoulakis

Ioannis Sikiotis

Ioannis Simogiannis

 

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

Algorithms and Experiments Comparing Two Hierarchical Drawing Frameworks., , и . CoRR, (2020)Effective Computation of a Feedback Arc Set Using PageRank., , и . J. Graph Algorithms Appl., 27 (8): 737-757 (2023)How to Draw a Series-Parallel Digraph (Extended Abstract)., , , , и . SWAT, том 621 из Lecture Notes in Computer Science, стр. 272-283. Springer, (1992)Applications of Parameterized st-Orientations in Graph Drawing Algorithms., и . GD, том 3843 из Lecture Notes in Computer Science, стр. 355-367. Springer, (2005)Treemaps for Directed Acyclic Graphs., , и . GD, том 4875 из Lecture Notes in Computer Science, стр. 377-388. Springer, (2007)Brain Network Analyzer., , и . GD, том 5417 из Lecture Notes in Computer Science, стр. 451-452. Springer, (2008)On the Edge Label Placement Problem., и . GD, том 1190 из Lecture Notes in Computer Science, стр. 241-256. Springer, (1996)The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing., , и . GD, том 1353 из Lecture Notes in Computer Science, стр. 391-402. Springer, (1997)Labeling Algorithms., и . Handbook of Graph Drawing and Visualization, Chapman and Hall/CRC, (2013)Lower bounds and parallel algorithms for planar orthogonal grid drawings., , и . SPDP, стр. 386-393. IEEE Computer Society, (1991)