- Arlind Nocaj, Mark Ortmann, Ulrik Brandes:
Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks. J. Graph Algorithms Appl. 19(2): 595-618 (2015) - János Pach:
Every graph admits an unambiguous bold drawing. J. Graph Algorithms Appl. 19(1): 299-312 (2015) - Seth Pettie:
Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time. J. Graph Algorithms Appl. 19(1): 375-391 (2015) - R. Sundara Rajan, Paul D. Manuel, Indra Rajasingh:
Embeddings Between Hypercubes and Hypertrees. J. Graph Algorithms Appl. 19(1): 361-373 (2015) - André Schulz:
Drawing Graphs with Few Arcs. J. Graph Algorithms Appl. 19(1): 393-412 (2015) - Volker Turau, Sven Köhler:
A Distributed Algorithm for Minimum Distance-k Domination in Trees. J. Graph Algorithms Appl. 19(1): 223-242 (2015) - Guest Editors' Foreword. J. Graph Algorithms Appl. 19(2): 567-569 (2015)