Fabian Lipp

Orcid: 0000-0001-7833-0454

Affiliations:
  • Julius Maximilian University of Würzburg, Germany


According to our database1, Fabian Lipp authored at least 15 papers between 2011 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The Complexity of Drawing Graphs on Few Lines and Few Planes.
J. Graph Algorithms Appl., 2023

2021
The Stub Resolution of 1-planar Graphs.
J. Graph Algorithms Appl., 2021

Leveraging Machine Learning for Industrial Wireless Communications.
CoRR, 2021

2020
Drawing graphs on few lines and few planes.
J. Comput. Geom., 2020

2019
Compact drawings of 1-planar graphs with right-angle crossings and few bends.
Comput. Geom., 2019

NOracle: Who is communicating with whom in my network?
Proceedings of the ACM SIGCOMM 2019 Conference Posters and Demos, 2019

2018
Bounded Stub Resolution for Some Maximal 1-Planar Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

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

Computing Storyline Visualizations with Few Block Crossings.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition.
Algorithms, 2016

Obstructing Visibilities with One Obstacle.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Simultaneous Orthogonal Planarity.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

2014
Luatodonotes: Boundary Labeling for Annotations in Texts.
Proceedings of the Graph Drawing - 22nd International Symposium, 2014

2012
Structural Complexity of Multiobjective NP Search Problems.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011
The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions.
Electron. Colloquium Comput. Complex., 2011


  Loading...