( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs

, , , , , , , и . (2022)

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.

Stephen Cochrane

Stephen Mamphey

Stephen Novak

Stephen Robinson

Stephen Wagner

 

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

Universal Lower Bounds on the Segment Number of Some Classes of Planar Graphs, , , , , , и . Proc. 38th Europ. Workshop Comput. Geom. (EuroCG'22), стр. 53:1--6. (2022)On Vertex- and Empty-Ply Proximity Drawings, , , , , , , , , и . Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD'17), том 10692 из LNCS, стр. 24--37. Cham, Springer International Publishing, (2017)Approximating the Generalized Minimum Manhattan Network Problem, , , , , и . Algorithmica, (марта 2017)Lombardi Drawings of Knots and Links, , , , , и . Journal of Computational Geometry, 10 (1): 444--476 (2019)Improved Approximation Algorithms for Box Contact Representations, , , , , , , и . Algorithmica, (2016)Lombardi Drawings of Knots and Links, , , , , и . Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD'17), том 10692 из Lecture Notes in Computer Science, стр. 113--126. Springer, (сентября 2017)On Vertex- and Empty-Ply Proximity Drawings, , , , , , , , , и . CoRR, (2017)Polylogarithmic-Overhead Piecemeal Graph Exploration., и . COLT, стр. 280-286. ACM, (1998)Drawing Planar Graphs with Circular Arcs., , , и . Discret. Comput. Geom., 25 (3): 405-418 (2001)Guest Editors' Introduction: Special Section on the IEEE Pacific Visualization Symposium 2012., , и . IEEE Trans. Vis. Comput. Graph., 19 (6): 898-899 (2013)