Philipp Kindermann
Philipp Kindermann
Verified email at uni-wuerzburg.de - Homepage
Title
Cited by
Cited by
Year
Recognizing and drawing IC-planar graphs
FJ Brandenburg, W Didimo, WS Evans, P Kindermann, G Liotta, ...
Theoretical Computer Science, 1-16, 2016
452016
On monotone drawings of trees
P Kindermann, A Schulz, J Spoerhase, A Wolff
International Symposium on Graph Drawing, 488-500, 2014
212014
Smooth orthogonal drawings of planar graphs
MJ Alam, MA Bekos, M Kaufmann, P Kindermann, SG Kobourov, A Wolff
Latin American Symposium on Theoretical Informatics, 144-155, 2014
182014
Multi-sided boundary labeling
P Kindermann, B Niedermann, I Rutter, M Schaefer, A Schulz, A Wolff
Algorithmica 76 (1), 225-258, 2016
132016
On the Planar Split Thickness of Graphs
D Eppstein, P Kindermann, S Kobourov, G Liotta, A Lubiw, A Maignan, ...
Latin American Symposium on Theoretical Informatics, 403-415, 2016
132016
Simultaneous drawing of planar graphs with right-angle crossings and few bends
MA Bekos, TC van Dijk, P Kindermann, A Wolff
Journal of Graph Algorithms and Applications 20 (1), 133-158, 2016
132016
Strongly Monotone Drawings of Planar Graphs
S Felsner, A Igamberdiev, P Kindermann, B Klemz, T Mchedlidze, ...
International Symposium on Computational Geometry, 37:1-37:15, 2016
132016
Drawing planar graphs with few geometric primitives
G Hültenschmidt, P Kindermann, W Meulemans, A Schulz
International Workshop on Graph-Theoretic Concepts in Computer Science, 316-329, 2017
11*2017
Two-sided boundary labeling with adjacent sides
P Kindermann, B Niedermann, I Rutter, M Schaefer, A Schulz, A Wolff
Workshop on Algorithms and Data Structures, 463-474, 2013
102013
Windrose planarity: embedding graphs with direction-constrained edges
P Angelini, G Da Lozzo, G Di Battista, V Di Donato, P Kindermann, G Rote, ...
Annual ACM-SIAM Symposium on Discrete Algorithms, 985-996, 2016
82016
Colored non-crossing Euclidean Steiner forest
S Bereg, K Fleszar, P Kindermann, S Pupyrev, J Spoerhase, A Wolff
International Symposium on Algorithms and Computation, 429-441, 2015
82015
Experimental analysis of the accessibility of drawings with few segments
P Kindermann, W Meulemans, A Schulz
International Symposium on Graph Drawing and Network Visualization, 52-64, 2017
72017
Graph drawing contest report
W Devanny, P Kindermann, M Löffler, I Rutter
International Symposium on Graph Drawing and Network Visualization, 575-582, 2017
62017
Improved Approximation Algorithms for Box Contact Representations
MA Bekos, TC Dijk, M Fink, P Kindermann, S Kobourov, S Pupyrev, ...
Algorithmica, 1-19, 2016
42016
1-fan-bundle-planar drawings of graphs
P Angelini, MA Bekos, M Kaufmann, P Kindermann, T Schneck
Theoretical Computer Science 723, 23-50, 2018
32018
Minimum Rectilinear Polygons for Given Angle Sequences
WS Evans, K Fleszar, P Kindermann, N Saeedi, CS Shin, A Wolff
Japanese Conference on Discrete and Computational Geometry and Graphs, 105-119, 2016
32016
Luatodonotes: Boundary Labeling for Annotations in Texts
P Kindermann, F Lipp, A Wolff
International Symposium on Graph Drawing, 76-88, 2014
32014
Greedy rectilinear drawings
P Angelini, MA Bekos, W Didimo, L Grilli, P Kindermann, T Mchedlidze, ...
Theoretical Computer Science 795, 375-397, 2019
22019
Crossing numbers of beyond-planar graphs
M Chimani, P Kindermann, F Montecchiani, P Valtr
International Symposium on Graph Drawing and Network Visualization, 78-86, 2019
22019
Stick graphs with length constraints
S Chaplick, P Kindermann, A Löffler, F Thiele, A Wolff, A Zaft, J Zink
International Symposium on Graph Drawing and Network Visualization, 3-17, 2019
22019
The system can't perform the operation now. Try again later.
Articles 1–20