( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Drawing (Complete) Binary Tanglegrams.

, , , , , , и . Graph Drawing, том 5417 из Lecture Notes in Computer Science, стр. 324-335. Springer, (2008)

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.

Kevin Buchin

Alexander Ali Kevin

Boyd Buchin

Björn Buchin

Andrej Buchin

 

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

Detecting movement patterns using Brownian bridges., , , и . SIGSPATIAL/GIS, стр. 119-128. ACM, (2012)Flow Map Layout via Spiral Trees., , и . IEEE Trans. Vis. Comput. Graph., 17 (12): 2536-2544 (2011)Interference Minimization in Asymmetric Sensor Networks., , , , и . ALGOSENSORS, том 8847 из Lecture Notes in Computer Science, стр. 136-151. Springer, (2014)Visual exploration of migration patterns in gull data., , , , , и . Inf. Vis., (2019)Angle-Restricted Steiner Arborescences for Flow Map Layout., , и . Algorithmica, 72 (2): 656-685 (2015)Angle-Restricted Steiner Arborescences for Flow Map Layout., , и . ISAAC, том 7074 из Lecture Notes in Computer Science, стр. 250-259. Springer, (2011)Dynamic Point Labeling is Strongly PSPACE-Complete., и . Int. J. Comput. Geom. Appl., 24 (4): 373- (2014)Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability, , , , , , и . Arxiv report, (июня 2008)Available at http://arxiv.org/abs/0806.0920.Fine-grained Complexity Analysis of Two Classic TSP Variants., , , и . ACM Trans. Algorithms, 17 (1): 5:1-5:29 (2021)On the Number of Regular Edge Labelings., , и . Discret. Math. Theor. Comput. Sci., 16 (3): 215-228 (2014)