( en | de | ru )

 

Disambiguation of "Bekos, Michael A."

Author of the publication

copydeleteadd this publication to your clipboard
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends.

, , , and . J. Graph Algorithms Appl., 20 (1): 133-158 (2016)

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. You can also use the button next to the name to display some publications already assigned to the person.

Michael A Linseis

Michael A Meer

-Michael A Scherer

Michael A Skeide

Michael A Horn

 

Other publications of authors with the same name

Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting., , , and . WG, volume 12301 of Lecture Notes in Computer Science, page 339-351. Springer, (2020)The mixed page number of graphs., , , , and . Theor. Comput. Sci., (2022)Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity., , , and . GD, volume 11904 of Lecture Notes in Computer Science, page 253-267. Springer, (2019)On Mixed Linear Layouts of Series-Parallel Graphs., , , and . GD, volume 12590 of Lecture Notes in Computer Science, page 151-159. Springer, (2020)On the 2-Layer Window Width Minimization Problem., , , , , , and . SOFSEM, volume 13878 of Lecture Notes in Computer Science, page 209-221. Springer, (2023)Hierarchical Partial Planarity., and . WG, volume 10520 of Lecture Notes in Computer Science, page 45-58. Springer, (2017)Edge Partitions of Optimal 2-plane and 3-plane Graphs., , , , , and . WG, volume 11159 of Lecture Notes in Computer Science, page 27-39. Springer, (2018)Recognizing Map Graphs of Bounded Treewidth., , , , , and . SWAT, volume 227 of LIPIcs, page 8:1-8:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings., , and . Algorithmica, 81 (5): 2046-2071 (2019)External Labeling Techniques: A Taxonomy and Survey., , and . Comput. Graph. Forum, 38 (3): 833-860 (2019)