The following pages link to Fabian Lipp (Q1725745):
Displaying 14 items.
- Faster force-directed graph drawing with the well-separated pair decomposition (Q1736822) (← links)
- The complexity of drawing graphs on few lines and few planes (Q2405289) (← links)
- Bounded stub resolution for some maximal 1-planar graphs (Q2636565) (← links)
- Structural Complexity of Multiobjective NP Search Problems (Q2894478) (← links)
- Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition (Q2959742) (← links)
- Drawing Graphs on Few Lines and Few Planes (Q2961513) (← links)
- Obstructing Visibilities with One Obstacle (Q2961523) (← links)
- Block Crossings in Storyline Visualizations (Q2961533) (← links)
- Simultaneous Orthogonal Planarity (Q2961544) (← links)
- Computing Storyline Visualizations with Few Block Crossings (Q4625125) (← links)
- Drawing graphs on few lines and few planes (Q5132649) (← links)
- Block Crossings in Storyline Visualizations (Q5367027) (← links)
- Compact drawings of 1-planar graphs with right-angle crossings and few bends (Q5915941) (← links)
- The Complexity of Drawing Graphs on Few Lines and Few Planes (Q6075709) (← links)
