( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Many-to-One Boundary Labeling with Backbones.

, , , , , , , и . J. Graph Algorithms Appl., 19 (3): 779-816 (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.

Sabine Cornelsen

Sabine Cornelsen

Jan Cornelsen

Inge Cornelsen

Hans Cornelsen

 

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

Many-to-One Boundary Labeling with Backbones, , , , , , , и . Journal of Graph Algorithms and Applications, 19 (3): 779--816 (2015)Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles., , и . GD, том 2912 из Lecture Notes in Computer Science, стр. 357-368. Springer, (2003)Treelike Comparability Graphs: Characterization, Recognition, and Applications., и . WG, том 3353 из Lecture Notes in Computer Science, стр. 46-57. Springer, (2004)Platform Assignment., и . ATMOS, том 4359 из Lecture Notes in Computer Science, стр. 233-245. Springer, (2004)Drawing Graphs on Two and Three Lines., , и . GD, том 2528 из Lecture Notes in Computer Science, стр. 31-41. Springer, (2002)Planar L-Drawings of Bimodal Graphs., , , и . GD, том 12590 из Lecture Notes in Computer Science, стр. 205-219. Springer, (2020)Drawing graphs: methods and models, и . глава Drawing clusters and hierarchies, стр. 193--227. Springer-Verlag, (2001)ISBN 3-540-42062-2.Planarity of the 2-Level Cactus Model., , и . WG, том 2204 из Lecture Notes in Computer Science, стр. 91-102. Springer, (2001)Treelike comparability graphs., и . Discret. Appl. Math., 157 (8): 1711-1722 (2009)How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract)., , и . GD, том 1984 из Lecture Notes in Computer Science, стр. 103-114. Springer, (2000)