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

    Fabian Lipp, M. Sc.

    Teaching

    Supervised Theses

    Short CV

    • since June 2015:
      PhD scholarship holder of Cusanuswerk
    • since October 2014:
      Research assistant at Lehrstuhl für Informatik I, Universität Würzburg
    • 2008 – 2014:
      Studies of computer science at Universität Würzburg

    Scholarships and Awards

    • September 2016:
      Best Paper Award (theory-track) for Block Crossings in Storyline Visualizations on the 24th International Symposium on Graph Drawing and Network Visualization (GD'16) in Athens, together with Thomas van Dijk, Martin Fink, Norbert Fischer, Peter Markfelder, Alex Ravsky, Subhash Suri, and Alexander Wolff.
    • September 2015:
      Achieved first place in the manual category of the Graph Drawing Challenge at the 23rd International Symposium on Graph Drawing and Network Visualization (GD'15) in Los Angeles, together with Boris Klemz (FU Berlin) and Ulf Rüegg (Uni Kiel).
    • June 2015:
      Awarded Best Master Degree Award by the Institute of Computer Science, Würzburg University.
    • June 2015:
      Doctoral scholarship of Cusanuswerk.
    • September 2014:
      Achieved first place in the manual category of the Graph Drawing Challenge at the 22nd International Symposium on Graph Drawing (GD'14) in Würzburg, together with Philipp Kindermann and Wadim Reimche.
    • June 2013:
      Awarded Best Bachelor Degree Award by the Institute of Computer Science, Würzburg University.

    Projects

    Publications

    2017

    • van Dijk, T.C., Fink, M., Fischer, N., Lipp, F., Markfelder, P., Ravsky, A., Suri, S., Wolff, A.: Block Crossings in Storyline Visualizations. Journal of Graph Algorithms & Applications. 21, 873--913 (2017).
       
    • van Dijk, T.C., Lipp, F., Markfelder, P., Wolff, A.: Computing Storyline Visualizations with Few Block Crossings. In: Frati, F. and Ma, K.-L. (eds.) Proc. 25th Int. Sympos. Graph Drawing Network Vis. (GD'17). Springer-Verlag (2017).
       
    • Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: The Complexity of Drawing Graphs on Few Lines and Few Planes. In: Ellen, F., Kolokolova, A., and Sack, J.-R. (eds.) Proc. Algorithms Data Struct. Symp. (WADS'17). p. 265--276. Springer-Verlag (2017).
       

    2016

    • van Dijk, T.C., Fink, M., Fischer, N., Lipp, F., Markfelder, P., Ravsky, A., Suri, S., Wolff, A.: Block Crossings in Storyline Visualizations. In: Hu, Y. and Nöllenburg, M. (eds.) Proc. 24th Int. Sympos. Graph Drawing Network Vis. (GD'16). pp. 382-398. Springer-Verlag (2016).
       
    • Angelini, P., Chaplick, S., Cornelsen, S., Lozzo, G.D., Battista, G.D., Eades, P., Kindermann, P., Kratochvíl, J., Lipp, F., Rutter, I.: Simultaneous Orthogonal Planarity. In: Hu, Y. and Nöllenburg, M. (eds.) Proc. 24th Int. Sympos. Graph Drawing Network Vis. (GD'16). pp. 532-545. Springer (2016).
       
    • Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: Drawing Graphs on Few Lines and Few Planes. In: Hu, Y. and Nöllenburg, M. (eds.) Proc. 24th Int. Sympos. Graph Drawing Network Vis. (GD'16). pp. 166-180. Springer (2016).
       
    • Chaplick, S., Lipp, F., Park, J.-W., Wolff, A.: Obstructing Visibilities with One Obstacle. In: Hu, Y. and Nöllenburg, M. (eds.) Proceedings of the 24th Int. Symp. on Graph Drawing & Network Visualization. pp. 295-308. Springer (2016).
       
    • Lipp, F., Wolff, A., Zink, J.: Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. Algorithms. 9, 53 (2016).
       

    2015

    • Chaplick, S., Kindermann, P., Lipp, F., Wolff, A.: Solving Optimization Problems on Orthogonal Ray Graphs. Proc. Japan. Conf. Discrete Comput. Geom. Graphs (JCDCG\($^2$\)'15). p. 2 pp. (2015).
       
    • Lipp, F., Wolff, A., Zink, J.: Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. In: Di Giacomo, E. and Lubiw, A. (eds.) Graph Drawing and Network Visualization. pp. 52-59. Springer International Publishing (2015).
       

    2014

    • Lipp, F.: Boundary Labeling for Annotations in Texts, http://www1.informatik.uni-wuerzburg.de/pub/theses/2014-lipp-master.pdf, (2014).
       
    • Kindermann, P., Lipp, F., Wolff, A.: Luatodonotes: Boundary Labeling for Annotations in Texts. In: Duncan, C. and Symvonis, A. (eds.) Proc. 22nd Int. Sympos. Graph Drawing (GD'14). pp. 76-88. Springer-Verlag (2014).
       

    2012

    • Lipp, F.: Computing the Flip Distance of Triangulations, http://www1.informatik.uni-wuerzburg.de/pub/theses/2012-lipp-bachelor.pdf, (2012).
       
    • Fleszar, K., Glaßer, C., Lipp, F., Reitwießner, C., Witek, M.: Structural Complexity of Multiobjective NP Search Problems. In: Fernández-Baca, D. (ed.) LATIN 2012: Theoretical Informatics. pp. 338-349. Springer Berlin Heidelberg (2012).
       
    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. M2