( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
How many vertex locations can be arbitrarily chosen when drawing planar graphs?

, , и . CoRR, (2012)

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.

Domenico Di Giacomo

Domenico Di Giacomo

Giacomo Di Gesù

Giacomo Ricciarelli

Giacomo D'Antonio

 

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

Switch-Regular Upward Planar Embeddings of Trees., , , и . WALCOM, том 5942 из Lecture Notes in Computer Science, стр. 58-69. Springer, (2010)Switch-Regular Upward Planarity Testing of Directed Trees., , , и . J. Graph Algorithms Appl., 15 (5): 587-629 (2011)k-planar Placement and Packing of Δ-regular Caterpillars., , , , и . CoRR, (2023)Packing Trees into 1-Planar Graphs., , , , , , , , и . WALCOM, том 12049 из Lecture Notes in Computer Science, стр. 81-93. Springer, (2020)Fan-Planar Graphs: Combinatorial Properties and Complexity Results., , , , , и . GD, том 8871 из Lecture Notes in Computer Science, стр. 186-197. Springer, (2014)Track Drawings of Graphs with Constant Queue Number., и . GD, том 2912 из Lecture Notes in Computer Science, стр. 214-225. Springer, (2003)Orthogonal 3D Shapes of Theta Graphs., , и . GD, том 2528 из Lecture Notes in Computer Science, стр. 142-149. Springer, (2002)WhatsOnWeb: Using Graph Drawing to Search the Web., , , и . GD, том 3843 из Lecture Notes in Computer Science, стр. 480-491. Springer, (2005)Point-Set Embedding of Trees with Edge Constraints., , , , и . GD, том 4875 из Lecture Notes in Computer Science, стр. 113-124. Springer, (2007)NodeTrix Planarity Testing with Small Clusters., , , и . GD, том 10692 из Lecture Notes in Computer Science, стр. 479-491. Springer, (2017)