( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computing upward topological book embeddings of upward planar digraphs.

, , , , и . J. Discrete Algorithms, (2015)

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 Bock

Tamara Schemtschuk

Tamara Umland

 

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

How many vertex locations can be arbitrarily chosen when drawing planar graphs?, , и . CoRR, (2012)Can an NN model plainly learn planar layouts?, и . CoRR, (2022)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)Recognizing DAGs with Page-Number 2 Is NP-complete., , , , , и . GD, том 13764 из Lecture Notes in Computer Science, стр. 361-370. Springer, (2022)Drawing Planar Graphs with Many Collinear Vertices., , , , и . GD, том 9801 из Lecture Notes in Computer Science, стр. 152-165. Springer, (2016)Embedding Four-Directional Paths on Convex Point Sets., , , , и . GD, том 8871 из Lecture Notes in Computer Science, стр. 355-366. Springer, (2014)Graph Drawing Contest Report., , и . GD, том 12868 из Lecture Notes in Computer Science, стр. 409-417. Springer, (2021)Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs., и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 882-891. Springer, (2009)