piwik-script

English Intern
    Lehrstuhl für Informatik I - Algorithmen und Komplexität

    Fink, Martin

    Dr. Martin Fink

    Lehrveranstaltungen

    Forschung

    • Graphenzeichnen
    • Graphalgorithmen
    • Algorithmische Geometrie

    Werdegang

    • seit April 2010:
      Wissenschaftlicher Mitarbeiter am Lehrstuhl für Informatik I, Universität Würzburg
    • bis März 2010:
      Studium der Informatik an der Universität Würzburg

    Veröffentlichungen

    • 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, A. Lubiw (Hrsg.) (2016). (Bd. 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, G. Navarro, E. Chávez (Hrsg.) (2016). (Bd. 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 Drawing Fink, 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, A. Symvonis (Hrsg.) (2014). (Bd. 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, D. Wagner (Hrsg.) (2014). (Bd. 8737) 87–99.
       
    • Concentric Metro Maps. Fink, Martin; Lechner, Magnus; Wolff, Alexander M. J. Roberts, P. Rodgers (Hrsg.) (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 (Hrsg.) (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, M. Patrignani (Hrsg.) (2013). (Bd. 7704) 463–474.
       
    • Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases. Fink, Martin; Pupyrev, Sergey in Lecture Notes in Computer Science, S. Wismath, A. Wolff (Hrsg.) (2013). (Bd. 8242) 328–339.
       
    • Ordering Metro Lines by Block Crossings. Fink, Martin; Pupyrev, Sergey in Lecture Notes in Computer Science, K. Chatterjee, J. Sgall (Hrsg.) (2013). (Bd. 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, A. Wolff (Hrsg.) (2013). (Bd. 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, S.- ichi Nakano (Hrsg.) (2012). (Bd. 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, B. Speckmann (Hrsg.) (2012). (Bd. 7034) 441–442.
       
    • Maximum Betweenness Centrality: Approximability and Tractable Cases. Fink, Martin; Spoerhase, Joachim in Lecture Notes in Computer Science, N. Katoh, A. Kumar (Hrsg.) (2011). (Bd. 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).