Martin Fink

Affiliations:
  • University of California, Santa Barbara, USA
  • Julius Maximilian University, Würzburg, Germany


According to our database1, Martin Fink authored at least 19 papers between 2011 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Hyperplane separability and convexity of probabilistic point sets.
J. Comput. Geom., 2017

Block Crossings in Storyline Visualizations.
J. Graph Algorithms Appl., 2017

Improved Approximation Algorithms for Box Contact Representations.
Algorithmica, 2017

2016
Bundled Crossings in Embedded Graphs.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

The Bundled Crossing Number.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Boundary Labeling with Obstacles.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

Counting Convex k-gons in an Arrangement of Line Segments.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
Ordering Metro Lines by Block Crossings.
J. Graph Algorithms Appl., 2015

Many-to-One Boundary Labeling with Backbones.
J. Graph Algorithms Appl., 2015

Tradeoffs between Bends and Displacement in Anchored Graph Drawing.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
Crossings, curves, and constraints in graph drawing.
PhD thesis, 2014

Drawing Graphs within Restricted Area.
Proceedings of the Graph Drawing - 22nd International Symposium, 2014

2013
Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation.
IEEE Trans. Vis. Comput. Graph., 2013

Ordering Metro Lines by Block Crossings.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012
Algorithms for Labeling Focus Regions.
IEEE Trans. Vis. Comput. Graph., 2012

Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles.
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

Drawing Metro Maps Using Bézier Curves.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011
Maximum Betweenness Centrality: Approximability and Tractable Cases.
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011


  Loading...