Nikola S. Nikolov

Patrick Healy, Nikola S. Nikolov: Preface to GD'05 special issue. Discrete Mathematics 309(7): 1793 (2009)

Seok-Hee Hong, Nikola S. Nikolov, Alexandre Tarassov: A 2.5D Hierarchical Drawing of Directed Graphs. J. Graph Algorithms Appl. 11(2): 371-396 (2007)

Xiaoyan Fu, Seok-Hee Hong, Nikola S. Nikolov, Xiaobin Shen, Yingxin Wu, Kai Xu: Visualization and analysis of email networks. APVIS 2007: 1-8

Radoslav Andreev, Patrick Healy, Nikola S. Nikolov: Applying Ant Colony Optimization Metaheuristic to the DAG Layering Problem. IPDPS 2007: 1-9

Nikola S. Nikolov, Alexandre Tarassov: Graph layering by promotion of nodes. Discrete Applied Mathematics 154(5): 848-860 (2006)

Patrick Healy, Nikola S. Nikolov (Eds.): Graph Drawing, 13th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers. Lecture Notes in Computer Science 3843, Springer 2006, isbn 3-540-31425-3

Nikola S. Nikolov, Alexandre Tarassov, Jürgen Branke: In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes. ACM Journal of Experimental Algorithmics 10 (2005)

Seok-Hee Hong, Nikola S. Nikolov: Layered Drawings of Directed Graphs in Three Dimensions. APVIS 2005: 69-74

Wanchun Li, Peter Eades, Nikola S. Nikolov: Using Spring Algorithms to Remove Node Overlapping. APVIS 2005: 131-140

Seok-Hee Hong, Nikola S. Nikolov: Hierarchical Layouts of Directed Graphs in Three Dimensions. Graph Drawing 2005: 251-261

Adel Ahmed, Tim Dwyer, Michael Forster, Xiaoyan Fu, Joshua Wing Kei Ho, Seok-Hee Hong, Dirk Koschützki, Colin Murray, Nikola S. Nikolov, Ronnie Taib, Alexandre Tarassov, Kai Xu: GEOMI: GEOmetry for Maximum Insight. Graph Drawing 2005: 468-479

Alexandre Tarassov, Nikola S. Nikolov, Jürgen Branke: A Heuristic for Minimum-Width Graph Layering with Consideration of Dummy Nodes. WEA 2004: 570-583

Patrick Healy, Nikola S. Nikolov: A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem. Graph Drawing 2002: 98-109

Patrick Healy, Nikola S. Nikolov: Facets of the Directed Acyclic Graph Layering Polytope. WG 2002: 246-257

Patrick Healy, Nikola S. Nikolov: How to Layer a Directed Acyclic Graph. Graph Drawing 2001: 16-30