Triangle Listing Algorithms: Back from the Diversion. - Mark Ortmann; Ulrik Brandes (ALENEX, 2014)

Untangling Hairballs - From 3 to 14 Degrees of Separation. - Arlind Nocaj; Mark Ortmann; Ulrik Brandes (GD, 2014)

Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks. - Arlind Nocaj; Mark Ortmann; Ulrik Brandes (J. Graph Algorithms Appl., 2015)

Quad Census Computation: Simple, Efficient, and Orbit-Aware. - Mark Ortmann; Ulrik Brandes (NetSci-X, 2016)

Adaptive Disentanglement Based on Local Clustering in Small-World Network Visualization. - Arlind Nocaj; Mark Ortmann; Ulrik Brandes (IEEE Trans. Vis. Comput. Graph., 2016)

Positional Dominance: Concepts and Algorithms. - Ulrik Brandes; Moritz Heine; Julian Müller 002; Mark Ortmann (CALDAM, 2017)

Faster Betweenness Centrality Updates in Evolving Networks. - Elisabetta Bergamini; Henning Meyerhenke; Mark Ortmann; Arie Slobbe (SEA, 2017)

Efficient orbit-aware triad and quad census in directed and undirected graphs. - Mark Ortmann; Ulrik Brandes (Appl. Netw. Sci., 2017)

A Sparse Stress Model. - Mark Ortmann; Mirza Klimenta; Ulrik Brandes (J. Graph Algorithms Appl., 2017)

Combinatorial Algorithms for Graph Sparsification - Mark Ortmann (2017)