Fabian Lipp
Fabian Lipp
Verified email at uni-wuerzburg.de
Title
Cited by
Cited by
Year
The complexity of drawing graphs on few lines and few planes
S Chaplick, K Fleszar, F Lipp, A Ravsky, O Verbitsky, A Wolff
Workshop on Algorithms and Data Structures, 265-276, 2017
202017
Drawing graphs on few lines and few planes
S Chaplick, K Fleszar, F Lipp, A Ravsky, O Verbitsky, A Wolff
International Symposium on Graph Drawing and Network Visualization, 166-180, 2016
192016
Compact drawings of 1-planar graphs with right-angle crossings and few bends
S Chaplick, F Lipp, A Wolff, J Zink
Computational Geometry 84, 50-68, 2019
92019
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition
F Lipp, A Wolff, J Zink
International Symposium on Graph Drawing and Network Visualization, 52-59, 2015
92015
Machine Learning for Optical Network Security Monitoring: A Practical Perspective
M Furdek, C Natalino, F Lipp, D Hock, A Di Giglio, M Schiano
Journal of Lightwave Technology 38 (11), 2860-2871, 2020
62020
Block Crossings in Storyline Visualizations.
TC van Dijk, M Fink, N Fischer, F Lipp, P Markfelder, A Ravsky, S Suri, ...
J. Graph Algorithms Appl. 21 (5), 873-913, 2017
62017
Block Crossings in Storyline Visualizations
TC van Dijk, M Fink, N Fischer, F Lipp, P Markfelder, A Ravsky, S Suri, ...
International Symposium on Graph Drawing and Network Visualization, 382-398, 2016
62016
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition
F Lipp, A Wolff, J Zink
Algorithms 9 (3), 53, 2016
62016
The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions.
K Fleszar, C Glaßer, F Lipp, C Reitwießner, M Witek
Electronic Colloquium on Computational Complexity (ECCC) 18 (53), 165, 2011
62011
Computing storyline visualizations with few block crossings
TC van Dijk, F Lipp, P Markfelder, A Wolff
International Symposium on Graph Drawing and Network Visualization, 365-378, 2017
52017
Simultaneous Orthogonal Planarity
P Angelini, S Chaplick, S Cornelsen, G Da Lozzo, G Di Battista, P Eades, ...
International Symposium on Graph Drawing and Network Visualization, 532-545, 2016
52016
Obstructing visibilities with one obstacle
S Chaplick, F Lipp, J Park, A Wolff
International Symposium on Graph Drawing and Network Visualization, 295-308, 2016
52016
1-Bend RAC Drawings of NIC-Planar Graphs in Quadratic Area
S Chaplick, F Lipp, A Wolff, J Zink
Proc. 34th European Workshop on Computational Geometry (EuroCG’18). Berlin, 2018
42018
SIMPL: Secure IoT Management Platform
T Prantl, A Eddine Ben Yahya, A Dmitrienko, S Kounev, F Lipp, D Hock, ...
Universität Tübingen, 2020
32020
Luatodonotes: Boundary Labeling for Annotations in Texts
P Kindermann, F Lipp, A Wolff
International Symposium on Graph Drawing, 76-88, 2014
32014
Bounded Stub Resolution for Some Maximal 1-Planar Graphs
M Kaufmann, J Kratochvíl, F Lipp, F Montecchiani, C Raftopoulou, P Valtr
Conference on Algorithms and Discrete Applied Mathematics, 214-220, 2018
12018
Structural complexity of multiobjective NP search problems
K Fleszar, C Glaßer, F Lipp, C Reitwießner, M Witek
Latin American Symposium on Theoretical Informatics, 338-349, 2012
12012
Demonstration of Machine-Learning-Assisted Security Monitoring in Optical Networks
M Furdek, C Natalino, F Lipp, D Hock, N Aerts, M Schiano, A Di Giglio, ...
1*
Drawing graphs on few lines and few planes
S Chaplick, K Fleszar, F Lipp, A Ravsky, O Verbitsky, A Wolff
Journal of Computational Geometry 11 (1), 433-475, 2020
2020
The Stub Resolution of 1-Planar Graphs
M Kaufmann, J Kratochvil, F Lipp, F Montecchiani, C Raftopoulou, P Valtr
International Workshop on Algorithms and Computation, 170-182, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20