Algorithmics Group
Prof. Dr. Ulrik Brandes

	University	Department	Algorithmics
	Members	Research	Teaching	Software

• Contact
• Personal
• Research interests
• Publications

Mark Ortmann

Contact

address University of Konstanz Department of Computer & Information Science Box 67 78457 Konstanz office PZ 1011 phone +49 7531 88-4561 email

Personal

02/2013 - 08/2013	Internship with Der-Tsai Lee, ,National Chung Hsing University, Taichung (Taiwan)
since 05/2012	Research assistant with Prof. Dr. Ulrik Brandes, Algorithmics Group, University of Konstanz
10/2006 – 03/2012	Information Engineering studies (B.Sc., M.Sc.), University of Konstanz.

Research interests

• Efficient Graph Algorithms
• Graph Drawing
• Network Analysis

Teaching

SS 2014	Assignments for lecture Big Data and Scripting (LSF entry)
WS 2013	Assignments for lecture Algorithms and Data structures (LSF entry)
	Seminar and Project Reverse engineering RSiena (LSF entry Bachelor, LSF entry Master))
WS 2012	Assignments for lecture Algorithms and Data structures (LSF entry)

Publications

[1]	Mark Ortmann, Ulrik Brandes, "Efficient orbit-aware triad and quad census in directed and undirected graphs", Applied Network Science, vol. 2, no. 1, Jun 2017, pp. 13. [bibtex] [html] [doi]
[2]	Arlind Nocaj, Mark Ortmann and Ulrik Brandes, "Adaptive Disentanglement Based on Local Clustering in Small-World Network Visualization", IEEE Transactions on Visualization and Computer Graphics, vol. 22, no. 6, June 2016, pp. 1662-1671. [bibtex] [html] [doi]
[3]	Arlind Nocaj, Mark Ortmann and Ulrik Brandes, "Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks", Journal of Graph Algorithms and Applications, 2015. [bibtex] [html] [doi]

[4]	Ulrik Brandes, Moritz Heine, Julian Müller and Mark Ortmann, "Positional Dominance: Concepts and Algorithms", in Algorithms and Discrete Applied Mathematics - Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings, D. R. Gaur, N. S. Narayanaswamy, Eds., Springer, pp. 60-71. [bibtex] [html] [doi]
[5]	Mark Ortmann, Mirza Klimenta and Ulrik Brandes, "A Sparse Stress Model", in Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, pp. 18-32 (Best Paper Award, arXiv version). [bibtex] [html] [doi]
[6]	Mark Ortmann, Ulrik Brandes, "Quad Census Computation: Simple, Efficient, and Orbit-Aware", in Advances in Network Science - 12th International Conference and School, NetSci-X 2016, Wroclaw, Poland, January 11-13, 2016, Proceedings, pp. 1-13. [bibtex] [html] [doi]
[7]	Mark Ortmann, Ulrik Brandes, "Triangle Listing Algorithms: Back from the Diversion", in 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2014, Portland, Oregon, USA, January 5, 2014, pp. 1-8. [bibtex] [html] [doi]
[8]	Arlind Nocaj, Mark Ortmann and Ulrik Brandes, "Untangling Hairballs - From 3 to 14 Degrees of Separation", in Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014, Revised Selected Papers, pp. 101-112. [bibtex] [html] [doi]