piwik-script

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

    • 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), Leibniz International Proceedings in Informatics (LIPIcs), S. Fekete, A. Lubiw (eds.) (2016). (Vol. 51) 38:1–38:16.
    • 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, Lecture Notes in Computer Science, E. Kranakis, G. Navarro, E. Ch{\’{a}}vez (eds.) (2016). (Vol. 9644) 454–468.
    • 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 (2016). 1–19.
    • Many-to-One Boundary Labeling with Backbones Bekos, Michael A.; Cornelsen, Sabine; Fink, Martin; Hong, Seok{-}Hee; Kaufmann, Michael; N{\"{o}}llenburg, Martin; Rutter, Ignaz; Symvonis, Antonios in Journal of Graph Algorithms and Applications (2015). 19(3) 779–816.
    • 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 (2015).
    • Ordering Metro Lines by Block Crossings Fink, Martin; Pupyrev, Sergey; Wolff, Alexander in Journal of Graph Algorithms and Applications (2015). 19(1) 111–153.
    • Crossings, Curves, and Constraints in Graph Drawing Fink, Martin PhD thesis, Würzburg University Press. (2014).
    • 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), Lecture Notes in Computer Science, C. Duncan, A. Symvonis (eds.) (2014). (Vol. 8871) 367–379.
    • 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), Lecture Notes in Computer Science, A. S. Schulz, D. Wagner (eds.) (2014). (Vol. 8737) 87–99.
    • Concentric Metro Maps Fink, Martin; Lechner, Magnus; Wolff, Alexander in Abstracts of the Schematic Mapping Workshop 2014, M. J. Roberts, P. Rodgers (eds.) (2014).
    • 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.) (2013).
    • Drawing Metro Maps using B{’e}zier Curves Fink, Martin; Haverkort, Herman; N{"o}llenburg, Martin; Roberts, Maxwell; Schuhmann, Julian; Wolff, Alexander in Proc. 20th Int. Sympos. Graph Drawing (GD’12), Lecture Notes in Computer Science, W. Didimo, M. Patrignani (eds.) (2013). (Vol. 7704) 463–474.
    • Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases Fink, Martin; Pupyrev, Sergey in Proc. 21st Int. Sympos. Graph Drawing (GD’13), Lecture Notes in Computer Science, S. Wismath, A. Wolff (eds.) (2013). (Vol. 8242) 328–339.
    • Ordering Metro Lines by Block Crossings Fink, Martin; Pupyrev, Sergey in Proc. 38th Int. Sympos. Mathematical Foundations of Computer Science (MFCS’13), Lecture Notes in Computer Science, K. Chatterjee, J. Sgall (eds.) (2013). (Vol. 8087) 397–408.
    • 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), Lecture Notes in Computer Science, S. Wismath, A. Wolff (eds.) (2013). (Vol. 8242) 244–255.
    • 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 (2013). 19(12) 2326–2335.
    • Algorithms for Labeling Focus Regions Fink, Martin; Haunert, Jan-Henrik; Schulz, Andr{’e}; Spoerhase, Joachim; Wolff, Alexander in IEEE Transactions on Visualization and Computer Graphics (2012). 18(12) 2583–2592.
    • 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), Lecture Notes in Computer Science, M. S. Rahman, S.- ichi Nakano (eds.) (2012). (Vol. 7157) 186–197.
    • 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), Lecture Notes in Computer Science, M. van Kreveld, B. Speckmann (eds.) (2012). (Vol. 7034) 441–442.
    • Maximum Betweenness Centrality: Approximability and Tractable Cases Fink, Martin; Spoerhase, Joachim in Proc. Workshop Algorithms Comp. (WALCOM’11), Lecture Notes in Computer Science, N. Katoh, A. Kumar (eds.) (2011). (Vol. 6552) 9–20.
    • Zentralitätsmaße in komplexen Netzwerken auf Basis kürzester Wege Fink, Martin PhD thesis, Lehrstuhl für Informatik I, Universität Würzburg. (2009).