From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Area Requirement of Visibility Representations of Trees.

G. Kant, G. Liotta, R. Tamassia, и I. Tollis. Inf. Process. Lett., 62 (2): 81-88 (1997)

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.

Two Algorithms for Finding Rectangular Duals of Planar Graphs.G. Kant, и X. He. WG, том 790 из Lecture Notes in Computer Science, стр. 396-410. Springer, (1993)Convex Grid Drawings of 3-Connected Planar Graphs.M. Chrobak, и G. Kant. Int. J. Comput. Geom. Appl., 7 (3): 211-223 (1997)On special multiples of integers.G. Kant, и J. van Leeuwen. Bulletin of the EATCS, (1990)Drawing Planar Graphs Using the Canonical Ordering.G. Kant. Algorithmica, 16 (1): 4-32 (1996)A More Compact Visibility Representation.G. Kant. WG, том 790 из Lecture Notes in Computer Science, стр. 411-424. Springer, (1993)Drawing Planar Graphs Using the lmc-Ordering (Extended Abstract)G. Kant. FOCS, стр. 101-110. IEEE Computer Society, (1992)Augmenting Outerplanar Graphs.G. Kant. J. Algorithms, 21 (1): 1-25 (1996)A new method for planar graph drawings on a grid (abstract).G. Kant. SIGACT News, 24 (1): 60 (1993)Planar Graph Augmentation Problems (Extended Abstract).G. Kant, и H. Bodlaender. WADS, том 519 из Lecture Notes in Computer Science, стр. 286-298. Springer, (1991)Triangulating Planar Graphs While Minimizing the Maximum Degree.G. Kant, и H. Bodlaender. SWAT, том 621 из Lecture Notes in Computer Science, стр. 258-271. Springer, (1992)