Fink, Martin
Dr. Martin Fink
Lehrveranstaltungen
- Vorlesung Visualisierung von Graphen
- Seminar Visualisierung von Graphen
- Übungen zu Algorithmische Geometrie
- Übungen zu Graphentheoretische Konzepte und Algorithmen
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
-
Improved Approximation Algorithms for Box Contact Representations. . In Algorithmica, S. 1–19. 2016.
-
Hyperplane Separability and Convexity of Probabilistic Point Sets. . In Proceedings of the 32nd International Symposium on Computational Geometry (SoCG 2016), Bd. 51 von Leibniz International Proceedings in Informatics (LIPIcs), S. Fekete, A. Lubiw (Hrsg.), S. 38:1–38:16. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2016.
-
Bundled Crossings in Embedded Graphs. . In {LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings, Bd. 9644 von Lecture Notes in Computer Science, E. Kranakis, G. Navarro, E. Ch{{á}}vez (Hrsg.), S. 454–468. Springer, 2016.
-
Tradeoffs between Bends and Displacement in Anchored Graph Drawing. . 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. . In Journal of Graph Algorithms and Applications, 19(1), S. 111–153. 2015.
-
Many-to-One Boundary Labeling with Backbones. . In Journal of Graph Algorithms and Applications, 19(3), S. 779–816. 2015.
-
Drawing Graphs within Restricted Area. . In Proceedings of the 22nd International Symposium on Graph Drawing (GD ’14), Bd. 8871 von Lecture Notes in Computer Science, C. Duncan, A. Symvonis (Hrsg.), S. 367–379. Springer-Verlag, 2014.
-
Improved Approximation Algorithms for Box Contact Representations. . In Proceedings of the 22nd European Symposium on Algorithms (ESA ’14), Bd. 8737 von Lecture Notes in Computer Science, A. S. Schulz, D. Wagner (Hrsg.), S. 87–99. Springer-Verlag, 2014.
-
Concentric Metro Maps. . In Abstracts of the Schematic Mapping Workshop 2014, M. J. Roberts, P. Rodgers (Hrsg.). 2014.
-
Crossings, Curves, and Constraints in Graph Drawing. . Würzburg University Press, 2014.
-
Many-to-One Boundary Labeling with Backbones. . In Proc. 21st Int. Sympos. Graph Drawing (GD’13), Bd. 8242 von Lecture Notes in Computer Science, S. Wismath, A. Wolff (Hrsg.), S. 244–255. Springer-Verlag, 2013.
-
Drawing Metro Maps using B{é}zier Curves. . In Proc. 20th Int. Sympos. Graph Drawing (GD’12), Bd. 7704 von Lecture Notes in Computer Science, W. Didimo, M. Patrignani (Hrsg.), S. 463–474. Springer-Verlag, 2013.
-
Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation. . In Proc. 29th Europ. Workshop Comput. Geom. (EuroCG’13), S. Fekete (Hrsg.). Braunschweig, 2013.
-
Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases. . In Proc. 21st Int. Sympos. Graph Drawing (GD’13), Bd. 8242 von Lecture Notes in Computer Science, S. Wismath, A. Wolff (Hrsg.), S. 328–339. Springer-Verlag, 2013.
-
Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation. . In IEEE Transactions on Visualization and Computer Graphics, 19(12), S. 2326–2335. IEEE Computer Society, Los Alamitos, CA, USA, 2013.
-
Ordering Metro Lines by Block Crossings. . In Proc. 38th Int. Sympos. Mathematical Foundations of Computer Science (MFCS’13), Bd. 8087 von Lecture Notes in Computer Science, K. Chatterjee, J. Sgall (Hrsg.), S. 397–408. Springer-Verlag, 2013.
-
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. . In Proc. Workshop Algorithms Comput. (WALCOM’12), Bd. 7157 von Lecture Notes in Computer Science, M. S. Rahman, S.- ichi Nakano (Hrsg.), S. 186–197. Springer-Verlag, 2012.
-
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. . In Proc. 19th Int. Sympos. Graph Drawing (GD’11), Bd. 7034 von Lecture Notes in Computer Science, M. van Kreveld, B. Speckmann (Hrsg.), S. 441–442. Springer-Verlag, 2012.
-
Algorithms for Labeling Focus Regions. . In IEEE Transactions on Visualization and Computer Graphics, 18(12), S. 2583–2592. 2012.
-
Maximum Betweenness Centrality: Approximability and Tractable Cases. . In Proc. Workshop Algorithms Comp. (WALCOM’11), Bd. 6552 von Lecture Notes in Computer Science, N. Katoh, A. Kumar (Hrsg.), S. 9–20. Springer, Berlin, Heidelberg, 2011.
-
Zentralitätsmaße in komplexen Netzwerken auf Basis kürzester Wege. Technical Report (Master thesis), . . Master thesis. Lehrstuhl für Informatik I, Universität Würzburg, 2009.