( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Universal Point Sets for Drawing Planar Graphs with Circular Arcs.

, , , , , , , и . J. Graph Algorithms Appl., 18 (3): 313-324 (2014)

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.

Tamar Mchedlidze

Gocha Mchedlidze

Tamara Schemtschuk

Tamara Umland

Tamara Löwenstein

 

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

How many vertex locations can be arbitrarily chosen when drawing planar graphs?, , и . CoRR, (2012)Network Visualization in the Humanities (Dagstuhl Seminar 18482)., , , , и . Dagstuhl Reports, 8 (11): 139-153 (2018)β-Stars or On Extending a Drawing of a Connected Subgraph., и . CoRR, (2018)Can an NN model plainly learn planar layouts?, и . CoRR, (2022)Small Universal Point Sets for k-Outerplanar Graphs., , , , , , и . Discret. Comput. Geom., 60 (2): 430-470 (2018)Aesthetic Discrimination of Graph Layouts., , и . GD, том 11282 из Lecture Notes in Computer Science, стр. 169-184. Springer, (2018)On Mixed Linear Layouts of Series-Parallel Graphs., , , и . GD, том 12590 из Lecture Notes in Computer Science, стр. 151-159. Springer, (2020)Graph Drawing Contest Report., , , и . GD, том 12590 из Lecture Notes in Computer Science, стр. 507-519. Springer, (2020)Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs., и . J. Graph Algorithms Appl., 15 (3): 373-415 (2011)Computing upward topological book embeddings of upward planar digraphs., , , , и . J. Discrete Algorithms, (2015)