( en | de | ru )

 

Disambiguation of "Healy, Patrick"

Author of the publication

copydeleteadd this publication to your clipboard
The Use of Agent-Based Models As Non-Player Characters in Serious Games.

, , , , , , , and . SeGAH, page 1-8. IEEE, (2020)

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. You can also use the button next to the name to display some publications already assigned to the person.

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 Mainka

 

Other publications of authors with the same name

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