Deutsch Intern
Chair of Computer Science I - Algorithms and Complexity

Fink, Martin

Dr. Martin Fink

Teaching

  • lecture Graph Visualization (master course)
  • seminar Graph Visualization (bachelor/master course)
  • exercises Computational Geometry (master course)
  • excercises Graphtheoretic Concepts and Algorithms (bachelor/master course)

Research Interests

  • Graph Drawing
  • Graph Algorithms
  • Computational Geometry

 

Short CV

  • since April 2010:
    Research assistant at Lehrstuhl für Informatik I, Universität Würzburg
  • till March 2010:
    studies of computer science at Universität Würzburg

 

Publications

  • Improved Approximation Algorithms for Box Contact Representations. Bekos, Michael A.; Dijk, Thomas C.; Fink, Martin; Kindermann, Philipp; Kobourov, Stephen; Pupyrev, Sergey; Spoerhase, Joachim; Wolff, Alexander. In Algorithmica, pp. 1–19. 2016.
  • Hyperplane Separability and Convexity of Probabilistic Point Sets. Fink, Martin; Hershberger, John; Kumar, Nirman; Suri, Subhash. In Proceedings of the 32nd International Symposium on Computational Geometry (SoCG 2016), Vol. 51 of Leibniz International Proceedings in Informatics (LIPIcs), S. Fekete, A. Lubiw (eds.), pp. 38:1–38:16. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2016.
  • Bundled Crossings in Embedded Graphs. Fink, Martin; Hershberger, John; Suri, Subhash; Verbeek, Kevin. In {LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings, Vol. 9644 of Lecture Notes in Computer Science, E. Kranakis, G. Navarro, E. Ch{{á}}vez (eds.), pp. 454–468. Springer, 2016.
  • Tradeoffs between Bends and Displacement in Anchored Graph Drawing. Fink, Martin; Suri, Subhash. In Proceedings of the 27th Canadian Conference on Computational Geometry, {CCCG} 2015, Kingston, Ontario, Canada, August 10-12, 2015. Queen’s University, Ontario, Canada, 2015.
  • Ordering Metro Lines by Block Crossings. Fink, Martin; Pupyrev, Sergey; Wolff, Alexander. In Journal of Graph Algorithms and Applications, 19(1), pp. 111–153. 2015.
  • Many-to-One Boundary Labeling with Backbones. Bekos, Michael A.; Cornelsen, Sabine; Fink, Martin; Hong, Seok{-}Hee; Kaufmann, Michael; N{{ö}}llenburg, Martin; Rutter, Ignaz; Symvonis, Antonios. In Journal of Graph Algorithms and Applications, 19(3), pp. 779–816. 2015.
  • Drawing Graphs within Restricted Area. Aulbach, Maximilian; Fink, Martin; Schuhmann, Julian; Wolff, Alexander. In Proceedings of the 22nd International Symposium on Graph Drawing (GD ’14), Vol. 8871 of Lecture Notes in Computer Science, C. Duncan, A. Symvonis (eds.), pp. 367–379. Springer-Verlag, 2014.
  • Improved Approximation Algorithms for Box Contact Representations. Bekos, Michael A.; van Dijk, Thomas C.; Fink, Martin; Kindermann, Philipp; Kobourov, Stephen; Pupyrev, Sergey; Spoerhase, Joachim; Wolff, Alexander. In Proceedings of the 22nd European Symposium on Algorithms (ESA ’14), Vol. 8737 of Lecture Notes in Computer Science, A. S. Schulz, D. Wagner (eds.), pp. 87–99. Springer-Verlag, 2014.
  • Concentric Metro Maps. Fink, Martin; Lechner, Magnus; Wolff, Alexander. In Abstracts of the Schematic Mapping Workshop 2014, M. J. Roberts, P. Rodgers (eds.). 2014.
  • Crossings, Curves, and Constraints in Graph Drawing. Fink, Martin. Würzburg University Press, 2014.
  • Many-to-One Boundary Labeling with Backbones. Bekos, Michael A.; Cornelsen, Sabine; Fink, Martin; Hong, Seokhee; Kaufmann, Michael; Nöllenburg, Martin; Rutter, Ignaz; Symvonis, Antonios. In Proc. 21st Int. Sympos. Graph Drawing (GD’13), Vol. 8242 of Lecture Notes in Computer Science, S. Wismath, A. Wolff (eds.), pp. 244–255. Springer-Verlag, 2013.
  • Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases. Fink, Martin; Pupyrev, Sergey. In Proc. 21st Int. Sympos. Graph Drawing (GD’13), Vol. 8242 of Lecture Notes in Computer Science, S. Wismath, A. Wolff (eds.), pp. 328–339. Springer-Verlag, 2013.
  • Drawing Metro Maps using B{é}zier Curves. Fink, Martin; Haverkort, Herman; N{ö}llenburg, Martin; Roberts, Maxwell; Schuhmann, Julian; Wolff, Alexander. In Proc. 20th Int. Sympos. Graph Drawing (GD’12), Vol. 7704 of Lecture Notes in Computer Science, W. Didimo, M. Patrignani (eds.), pp. 463–474. Springer-Verlag, 2013.
  • Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation. Fink, Martin; Haunert, Jan-Henrik; Spoerhase, Joachim; Wolff, Alexander. In Proc. 29th Europ. Workshop Comput. Geom. (EuroCG’13), S. Fekete (ed.). Braunschweig, 2013.
  • Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation. Fink, Martin; Haunert, Jan-Henrik; Spoerhase, Joachim; Wolff, Alexander. In IEEE Transactions on Visualization and Computer Graphics, 19(12), pp. 2326–2335. IEEE Computer Society, Los Alamitos, CA, USA, 2013.
  • Ordering Metro Lines by Block Crossings. Fink, Martin; Pupyrev, Sergey. In Proc. 38th Int. Sympos. Mathematical Foundations of Computer Science (MFCS’13), Vol. 8087 of Lecture Notes in Computer Science, K. Chatterjee, J. Sgall (eds.), pp. 397–408. Springer-Verlag, 2013.
  • Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. Fink, Martin; Haunert, Jan-Henrik; Mchedlidze, Tamara; Spoerhase, Joachim; Wolff, Alexander. In Proc. Workshop Algorithms Comput. (WALCOM’12), Vol. 7157 of Lecture Notes in Computer Science, M. S. Rahman, S.- ichi Nakano (eds.), pp. 186–197. Springer-Verlag, 2012.
  • Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. Fink, Martin; Haunert, Jan-Henrik; Mchedlidze, Tamara; Spoerhase, Joachim; Wolff, Alexander. In Proc. 19th Int. Sympos. Graph Drawing (GD’11), Vol. 7034 of Lecture Notes in Computer Science, M. van Kreveld, B. Speckmann (eds.), pp. 441–442. Springer-Verlag, 2012.
  • Algorithms for Labeling Focus Regions. Fink, Martin; Haunert, Jan-Henrik; Schulz, Andr{é}; Spoerhase, Joachim; Wolff, Alexander. In IEEE Transactions on Visualization and Computer Graphics, 18(12), pp. 2583–2592. 2012.
  • Maximum Betweenness Centrality: Approximability and Tractable Cases. Fink, Martin; Spoerhase, Joachim. In Proc. Workshop Algorithms Comp. (WALCOM’11), Vol. 6552 of Lecture Notes in Computer Science, N. Katoh, A. Kumar (eds.), pp. 9–20. Springer, Berlin, Heidelberg, 2011.
  • Zentralitätsmaße in komplexen Netzwerken auf Basis kürzester Wege. Technical Report (Master thesis), . Fink, Martin. Master thesis. Lehrstuhl für Informatik I, Universität Würzburg, 2009.