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: 1-Planar 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 Force-Directed Graph Drawing with the Well-Separated 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 (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
- luatodonotes: LuaLaTeX-Package 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[ to top ]
-
The Stub Resolution of 1-Planar Graphs. . In WALCOM: Algorithms and Computation, Vol. 12049 of Lecture Notes in Computer Science, M. S. Rahman, K. Sadakane, W.-K. Sung (eds.), pp. 170–182. Springer, 2020.
-
Drawing Graphs on Few Lines and Few Planes. . In Journal of Computational Geometry, 11(1), pp. 433–475. 2020.
-
Machine Learning for Optical Network Security Monitoring: A Practical Perspective. . In Journal of Lightwave Technology, 38(11), pp. 2860–2871. IEEE, 2020.
2019[ to top ]
-
NOracle: Who is communicating with whom in my network?. . In SIGCOMM Posters and Demos, pp. 48–50. ACM, 2019.
-
Compact drawings of 1-planar graphs with right-angle crossings and few bends. . In Comput. Geom., 84, pp. 50–68. 2019.
2018[ to top ]
-
Bounded Stub Resolution for Some Maximal 1-Planar Graphs. . In CALDAM, Vol. 10743 of Lecture Notes in Computer Science, B. S. Panda, P. P. Goswami (eds.), pp. 214–220. Springer, 2018.
-
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. . In Graph Drawing and Network Visualization - 26th International Symposium, {GD} 2018, Barcelona, Spain, September 26-28, 2018, Proceedings, Vol. 11282 of Lecture Notes in Computer Science, T. C. Biedl, A. Kerren (eds.), pp. 137–151. Springer, 2018.
-
Computing Storyline Visualizations with Few Block Crossings. . In Proc. 25th Int. Sympos. Graph Drawing Network Vis. (GD’17), Vol. 10692 of Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.), pp. 365–378. Springer-Verlag, 2018.
-
1-Bend RAC Drawings of NIC-Planar Graphs in Quadratic Area. . In Proc. 34th Europ. Workshop Comput. Geom. (EuroCG’18), M. Korman, W. Mulzer (eds.), pp. 28:1–6. 2018.
2017[ to top ]
-
The Complexity of Drawing Graphs on Few Lines and Few Planes. . In Proc. Algorithms Data Struct. Symp. (WADS’17), Vol. 10389, F. Ellen, A. Kolokolova, J.-R. Sack (eds.), pp. 265–276. Springer-Verlag, 2017.
-
Block Crossings in Storyline Visualizations. . In Journal of Graph Algorithms & Applications, 21(5), Y. Hu; M. Nöllenburg (eds.), pp. 873–913. 2017.
2016[ to top ]
-
Obstructing Visibilities with One Obstacle. . In Proceedings of the 24th Int. Symp. on Graph Drawing & Network Visualization, Vol. 9801, Y. Hu, M. Nöllenburg (eds.), pp. 295–308. Springer, 2016.
-
Block Crossings in Storyline Visualizations. . In Proc. 24th Int. Sympos. Graph Drawing Network Vis. (GD’16), Vol. 9801 of Lecture Notes in Computer Science, Y. Hu, M. Nöllenburg (eds.), pp. 382–398. Springer-Verlag, 2016.
-
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. . In Algorithms, 9(3), p. 53. 2016.
-
Simultaneous Orthogonal Planarity. . In Proc. 24th Int. Sympos. Graph Drawing Network Vis. (GD’16), Vol. 9801, Y. Hu, M. Nöllenburg (eds.), pp. 532–545. Springer, 2016.
-
Drawing Graphs on Few Lines and Few Planes. . In Proc. 24th Int. Sympos. Graph Drawing Network Vis. (GD’16), Vol. 9801, Y. Hu, M. Nöllenburg (eds.), pp. 166–180. Springer, 2016.
2015[ to top ]
-
Solving Optimization Problems on Orthogonal Ray Graphs. . In Proc. Japan. Conf. Discrete Comput. Geom. Graphs (JCDCG\($^2$\)’15), p. 2 pp. 2015.
- [ BibTeX ]
-
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. . In Graph Drawing and Network Visualization, Vol. 9411, E. Di Giacomo, A. Lubiw (eds.), pp. 52–59. Springer International Publishing, 2015.
2014[ to top ]
-
Boundary Labeling for Annotations in Texts. . 2014.
-
Luatodonotes: Boundary Labeling for Annotations in Texts. . In Proc. 22nd Int. Sympos. Graph Drawing (GD’14), Vol. 8871 of Lecture Notes in Computer Science, C. Duncan, A. Symvonis (eds.), pp. 76–88. Springer-Verlag, 2014.
2012[ to top ]
-
Computing the Flip Distance of Triangulations. . 2012.
-
Structural Complexity of Multiobjective NP Search Problems. . In LATIN 2012: Theoretical Informatics, Vol. 7256, D. Fernández-Baca (ed.), pp. 338–349. Springer Berlin Heidelberg, 2012.