Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Schlipf, Lena
43  Ergebnisse:
Personensuche X
?
1

The Thickness of Fan-Planar Graphs is At Most Three:

, In: Lecture Notes in Computer Science; Graph Drawing and Network Visualization,
Cheong, Otfried ; Pfister, Maximilian ; Schlipf, Lena - p. 247-260 , 2023
Link: https://doi.org/10.1007/..
 
?
2

Weakly and Strongly Fan-Planar Graphs:

, In: Lecture Notes in Computer Science; Graph Drawing and Network Visualization,
Cheong, Otfried ; Förster, Henry ; Katheder, Julia.. - p. 53-68 , 2023
Link: https://doi.org/10.1007/..
 
?
3

On the 2-Layer Window Width Minimization Problem:

, In: Lecture Notes in Computer Science; SOFSEM 2023: Theory and Practice of Computer Science,
Bekos, Michael A. ; Förster, Henry ; Kaufmann, Michael... - p. 209-221 , 2023
Link: https://doi.org/10.1007/..
 
?
4

One-Bend Drawings of Outerplanar Graphs Inside Simple Polyg..:

, In: Lecture Notes in Computer Science; Graph Drawing and Network Visualization,
Angelini, Patrizio ; Kindermann, Philipp ; Löffler, Andre.. - p. 184-192 , 2021
Link: https://doi.org/10.1007/..
 
?
5

Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes..:

Kindermann, Philipp ; Montecchiani, Fabrizio ; Schlipf, Lena.
Journal of Graph Algorithms and Applications.  25 (2021)  1 - p. 1-28 , 2021
Link: https://doi.org/10.7155/..
 
?
6

Augmenting Geometric Graphs with Matchings:

, In: Lecture Notes in Computer Science; Graph Drawing and Network Visualization,
Pilz, Alexander ; Rollin, Jonathan ; Schlipf, Lena. - p. 490-504 , 2020
Link: https://doi.org/10.1007/..
 
?
7

Convexity-increasing morphs of planar graphs:

Kleist, Linda ; Klemz, Boris ; Lubiw, Anna...
Computational Geometry.  84 (2019)  - p. 69-88 , 2019
Link: https://doi.org/10.1016/..
 
?
8

On Romeo and Juliet problems: Minimizing distance-to-sight:

Ahn, Hee-Kap ; Oh, Eunjin ; Schlipf, Lena..
Computational Geometry.  84 (2019)  - p. 12-21 , 2019
Link: https://doi.org/10.1016/..
 
?
9

Simple computation of st-edge- and st-numberings from ear d..:

Schlipf, Lena ; Schmidt, Jens M.
Information Processing Letters.  145 (2019)  - p. 58-63 , 2019
Link: https://doi.org/10.1016/..
 
?
10

Edge-Orders:

Schlipf, Lena ; Schmidt, Jens M.
Algorithmica.  81 (2018)  5 - p. 1881-1900 , 2018
Link: https://doi.org/10.1007/..
 
?
11

Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes..:

, In: Lecture Notes in Computer Science; Graph Drawing and Network Visualization,
Kindermann, Philipp ; Montecchiani, Fabrizio ; Schlipf, Lena. - p. 152-166 , 2018
Link: https://doi.org/10.1007/..
 
?
12

Convexity-Increasing Morphs of Planar Graphs:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Kleist, Linda ; Klemz, Boris ; Lubiw, Anna... - p. 318-330 , 2018
Link: https://doi.org/10.1007/..
 
?
13

Finding largest rectangles in convex polygons:

Cabello, Sergio ; Cheong, Otfried ; Knauer, Christian.
Computational Geometry.  51 (2016)  - p. 67-74 , 2016
Link: https://doi.org/10.1016/..
 
?
14

Convex transversals:

Arkin, Esther M. ; Dieckmann, Claudia ; Knauer, Christian...
Computational Geometry.  47 (2014)  2 - p. 224-239 , 2014
Link: https://doi.org/10.1016/..
 
?
15

Covering and piercing disks with two centers:

Ahn, Hee-Kap ; Kim, Sang-Sub ; Knauer, Christian...
Computational Geometry.  46 (2013)  3 - p. 253-262 , 2013
Link: https://doi.org/10.1016/..
 
1-15