piwik-script

Deutsch Intern
    Chair of Computer Science I - Algorithms, Complexity, and Knowledge-Based Systems

    Dr. Martin Fink

    Foto Fink

    Lehrstuhl für Informatik I
    Universität Würzburg
    Am Hubland
    D-97074 Würzburg

    Room E14

    Tel.: +49 (0) 931-31-82137
    Fax: +49 (0) 931-31-84600

    Email:

    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 Leibniz International Proceedings in Informatics (LIPIcs), S. Fekete, Lubiw, A. (eds.) (2016). (Vol. 51) 38:1--38:16.
       
    • Bundled Crossings in Embedded Graphs.Fink, Martin; Hershberger, John; Suri, Subhash; Verbeek, Kevin in Lecture Notes in Computer Science, E. Kranakis, Navarro, G., Chávez, E. (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ö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 (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 DrawingFink, Martin PhD thesis, Würzburg University Press. (2014).
       
    • Drawing Graphs within Restricted Area.Aulbach, Maximilian; Fink, Martin; Schuhmann, Julian; Wolff, Alexander in Lecture Notes in Computer Science, C. Duncan, Symvonis, A. (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 Lecture Notes in Computer Science, A. S. Schulz, Wagner, D. (eds.) (2014). (Vol. 8737) 87-99.
       
    • Concentric Metro Maps.Fink, Martin; Lechner, Magnus; Wolff, Alexander M. J. Roberts, Rodgers, P. (eds.) (2014).
       
    • Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation.Fink, Martin; Haunert, Jan-Henrik; Spoerhase, Joachim; Wolff, Alexander S. Fekete (ed.) (2013).
       
    • Drawing Metro Maps using Bézier Curves.Fink, Martin; Haverkort, Herman; Nöllenburg, Martin; Roberts, Maxwell; Schuhmann, Julian; Wolff, Alexander in Lecture Notes in Computer Science, W. Didimo, Patrignani, M. (eds.) (2013). (Vol. 7704) 463--474.
       
    • Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases.Fink, Martin; Pupyrev, Sergey in Lecture Notes in Computer Science, S. Wismath, Wolff, A. (eds.) (2013). (Vol. 8242) 328--339.
       
    • Ordering Metro Lines by Block Crossings.Fink, Martin; Pupyrev, Sergey in Lecture Notes in Computer Science, K. Chatterjee, Sgall, J. (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 Lecture Notes in Computer Science, S. Wismath, Wolff, A. (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é; 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 Lecture Notes in Computer Science, M. S. Rahman, Nakano, S. -ichi (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 Lecture Notes in Computer Science, M. van Kreveld, Speckmann, B. (eds.) (2012). (Vol. 7034) 441--442.
       
    • Maximum Betweenness Centrality: Approximability and Tractable Cases.Fink, Martin; Spoerhase, Joachim in Lecture Notes in Computer Science, N. Katoh, Kumar, A. (eds.) (2011). (Vol. 6552) 9--20.
       
    • Zentralitätsmaße in komplexen Netzwerken auf Basis kürzester Wege. Technical Report (Master thesis), Fink, Martin PhD thesis, Lehrstuhl für Informatik I, Universität Würzburg. (2009).
       

    Data privacy protection

    By clicking 'OK' you are leaving the web sites of the Julius-Maximilians-Universität Würzburg and will be redirected to Facebook. For information on the collection and processing of data by Facebook, refer to the social network's data privacy statement.

    Data privacy protection

    By clicking 'OK' you are leaving the web sites of the Julius-Maximilians-Universität Würzburg and will be redirected to Twitter. For information on the collection and processing of data by Facebook, refer to the social network's data privacy statement.

    Contact

    Lehrstuhl für Informatik I (Effiziente Algorithmen und wissensbasierte Systeme)
    Am Hubland
    97074 Würzburg

    Phone: +49 931 31-85054
    Email

    Find Contact

    Hubland Süd, Geb. Z8
    Hubland Süd, Geb. Z8
    Hubland Süd, Geb. M2
    Hubland Süd, Geb. M2