Mark Ortmann

According to our database1, Mark Ortmann authored at least 10 papers between 2014 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Combinatorial Algorithms for Graph Sparsification
PhD thesis, 2017

A Sparse Stress Model.
J. Graph Algorithms Appl., 2017

Efficient orbit-aware triad and quad census in directed and undirected graphs.
Appl. Netw. Sci., 2017

Faster Betweenness Centrality Updates in Evolving Networks.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Positional Dominance: Concepts and Algorithms.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016
Adaptive Disentanglement Based on Local Clustering in Small-World Network Visualization.
IEEE Trans. Vis. Comput. Graph., 2016

Quad Census Computation: Simple, Efficient, and Orbit-Aware.
Proceedings of the Advances in Network Science, 2016

2015
Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks.
J. Graph Algorithms Appl., 2015

2014
Untangling Hairballs - From 3 to 14 Degrees of Separation.
Proceedings of the Graph Drawing - 22nd International Symposium, 2014

Triangle Listing Algorithms: Back from the Diversion.
Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014


  Loading...