( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Dynamic Upward Planarity Testing of Single Source Embedded Digraphs.

, и . Comput. J., 60 (1): 45-59 (2017)

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.

Róisín Healy

Mike Healy

Patrick Pfeffer

Optimiertes Design kombinatorischer Verbindungsbibliotheken durch genetische Algorithmen und deren Bewertung anhand wissensbasierter Protein-Ligand-Bindungsprofile. Uni Marburg, (2009)

Patrick Hansen

Entwicklung eines energetischen Sanierungsmodells für den europäischen Wohngebäudesektor unter dem Aspekt der Erstellung von Szenarien für Energie- und Co_1tn2-Einsparpotenziale bis 2030. Uni Siegen, (2009)

Patrick Schreiner

 

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

Building Blocks of Upward Planar Digraphs., и . J. Graph Algorithms Appl., 11 (1): 3-44 (2007)Algorithms for multi-level graph planarity testing and layout., и . Theor. Comput. Sci., 320 (2-3): 331-344 (2004)Efficiently drawing a significant spanning tree of a directed graph., и . APVIS, стр. 53-59. IEEE Computer Society, (2007)Building Blocks of Upward Planar Digraphs., и . GD, том 3383 из Lecture Notes in Computer Science, стр. 296-306. Springer, (2004)A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs., и . GD, том 5417 из Lecture Notes in Computer Science, стр. 254-265. Springer, (2008)A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem., и . GD, том 2528 из Lecture Notes in Computer Science, стр. 98-109. Springer, (2002)Dynamic Upward Planarity Testing of Single Source Embedded Digraphs., и . Comput. J., 60 (1): 45-59 (2017)Sharp bounds on the spectral radius of Halin graphs and other k-outerplanar graphs.. CoDIT, стр. 7-12. IEEE, (2014)Table layout performance of document authoring tools., и . ACM Symposium on Document Engineering, стр. 199-202. ACM, (2010)An Experimental Analysis of Vertex Coloring Algorithms on Sparse Random Graphs., и . ICAA, том 8321 из Lecture Notes in Computer Science, стр. 174-186. Springer, (2014)