Lipp, Fabian
Teaching
 Winter term 2017/2018: exercises for Algorithms and Data Structures
 Winter term 2017/2018: seminar Graph Visualization
 Summer term 2017: seminar Algorithms for Programming Contests
 Summer term 2017: exercises for Algorithmic Graph Theory
 Winter term 2016/2017: exercises for Algorithms and Data Structures
 Summer term 2016: seminar Design and Analysis of Data Structures
 Summer term 2016: exercises for Algorithmic Graph Theory
 Winter term 2015/2016: seminar Graph Visualization
 Summer term 2015: exercises for Graph Visualization
 Winter term 2014/2015: exercises for Approximation Algorithms
Supervised Theses
 Johannes Zink, master thesis: 1Planar RAC Drawings with Bends (2017)
 Bernhard Häussner, master thesis: Visual Comparison of Business Process Flowcharts (2017)
 Peter Markfelder, bachelor thesis: Optimal Drawings of Storylines using Block Crossings [in German] (2017)
 Ursula Scherm, bachelor thesis: Covering Vertices and Edges of Graphs with the Minimum Number of Lines [in German] (2016)
 Johannes Zink, bachelor thesis: Faster ForceDirected Graph Drawing with the WellSeparated Pair Decomposition [in German] (2015)
 Adrian Loy, bachelor thesis: Optimization of Cutting Schedules [in German] (2015)
 Matthias Neumann, bachelor thesis: Drawing of Networks considering Edge Lengths [in German] (2015)
Short CV
 June 2015– May 2018:
PhD scholarship holder of Cusanuswerk  October 2014 – May 2018:
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 (theorytrack) 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
 luatodonotes: LuaLaTeXPackage to insert notes alongside the text
Download and documentation: http://www.ctan.org/pkg/luatodonotes
Source code repository: https://github.com/fabianlipp/luatodonotes  Organizer of the 19th Korean Workshop on Computational Geometry (KWCG) 2016
Publications
2020

1.Kaufmann, M., Kratochvil, J., Lipp, F., Montecchiani, F., Raftopoulou, C., Valtr, P.: The Stub Resolution of 1Planar Graphs. In: Rahman, M.S., Sadakane, K., and Sung, W.K. (eds.) WALCOM: Algorithms and Computation. pp. 170–182. Springer (2020).

2.Furdek, M., Natalino, C., Lipp, F., Hock, D., Di Giglio, A., Schiano, M.: Machine Learning for Optical Network Security Monitoring: A Practical Perspective. Journal of Lightwave Technology. 38, 2860–2871 (2020).
2019

1.Chaplick, S., Lipp, F., Wolff, A., Zink, J.: Compact drawings of 1planar graphs with rightangle crossings and few bends. Comput. Geom. 84, 50–68 (2019).

2.Kalmbach, P., Hock, D., Lipp, F., Kellerer, W., Blenk, A.: NOracle: Who is communicating with whom in my network?. SIGCOMM Posters and Demos. pp. 48–50. ACM (2019).
2018

1.Chaplick, S., Lipp, F., Wolff, A., Zink, J.: 1Bend RAC Drawings of NICPlanar Graphs in Quadratic Area. In: Korman, M. and Mulzer, W. (eds.) Proc. 34th Europ. Workshop Comput. Geom. (EuroCG’18). pp. 28:1–6 (2018).

2.Kaufmann, M., Kratochvíl, J., Lipp, F., Montecchiani, F., Raftopoulou, C.N., Valtr, P.: Bounded Stub Resolution for Some Maximal 1Planar Graphs. In: Panda, B.S. and Goswami, P.P. (eds.) CALDAM. pp. 214–220. Springer (2018).

3.Chaplick, S., Lipp, F., Wolff, A., Zink, J.: Compact Drawings of 1Planar Graphs with RightAngle Crossings and Few Bends. In: Biedl, T.C. and Kerren, A. (eds.) Graph Drawing and Network Visualization  26th International Symposium, GD 2018, Barcelona, Spain, September 2628, 2018, Proceedings. pp. 137–151. Springer (2018).

4.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). pp. 365–378. SpringerVerlag (2018).
2017

1.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).

2.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). pp. 265–276. SpringerVerlag (2017).
2016

1.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).

2.Lipp, F., Wolff, A., Zink, J.: Faster ForceDirected Graph Drawing with the WellSeparated Pair Decomposition. Algorithms. 9, 53 (2016).

3.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. SpringerVerlag (2016).

4.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).

5.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).
2015

1.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).[ BibTeX ]

2.Lipp, F., Wolff, A., Zink, J.: Faster ForceDirected Graph Drawing with the WellSeparated Pair Decomposition. In: Di Giacomo, E. and Lubiw, A. (eds.) Graph Drawing and Network Visualization. pp. 52–59. Springer International Publishing (2015).
2014

1.Lipp, F.: Boundary Labeling for Annotations in Texts, http://www1.informatik.uniwuerzburg.de/pub/theses/2014lippmaster.pdf, (2014).

2.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. SpringerVerlag (2014).
2012

1.Lipp, F.: Computing the Flip Distance of Triangulations, http://www1.informatik.uniwuerzburg.de/pub/theses/2012lippbachelor.pdf, (2012).

2.Fleszar, K., Glaßer, C., Lipp, F., Reitwießner, C., Witek, M.: Structural Complexity of Multiobjective NP Search Problems. In: FernándezBaca, D. (ed.) LATIN 2012: Theoretical Informatics. pp. 338–349. Springer Berlin Heidelberg (2012).