팔로우
Philipp Kindermann
Philipp Kindermann
uni-trier.de의 이메일 확인됨 - 홈페이지
제목
인용
인용
연도
Recognizing and drawing IC-planar graphs
FJ Brandenburg, W Didimo, WS Evans, P Kindermann, G Liotta, ...
Theoretical Computer Science, 1-16, 2016
662016
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
302016
On monotone drawings of trees
P Kindermann, A Schulz, J Spoerhase, A Wolff
International Symposium on Graph Drawing, 488-500, 2014
242014
Multi-sided boundary labeling
P Kindermann, B Niedermann, I Rutter, M Schaefer, A Schulz, A Wolff
Algorithmica 76, 225-258, 2016
222016
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
222014
1-fan-bundle-planar drawings of graphs
P Angelini, MA Bekos, M Kaufmann, P Kindermann, T Schneck
Theoretical Computer Science 723, 23-50, 2018
212018
Experimental analysis of the accessibility of drawings with few segments
P Kindermann, W Meulemans, A Schulz
Graph Drawing and Network Visualization: 25th International Symposium, GD …, 2018
212018
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
192016
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
17*2017
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
142016
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
142016
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
132015
Lombardi Drawings of Knots and Links
P Kindermann, SG Kobourov, M Löffler, M Nöllenburg, A Schulz, ...
International Symposium on Graph Drawing and Network Visualization 10692 …, 2017
122017
Minimum rectilinear polygons for given angle sequences
WS Evans, K Fleszar, P Kindermann, N Saeedi, CS Shin, A Wolff
Computational Geometry 100, 101820, 2022
102022
Improved Approximation Algorithms for Box Contact Representations
MA Bekos, TC Dijk, M Fink, P Kindermann, S Kobourov, S Pupyrev, ...
Algorithmica, 1-19, 2016
102016
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
Graph drawing contest report
W Devanny, P Kindermann, M Löffler, I Rutter
Graph Drawing and Network Visualization: 25th International Symposium, GD …, 2018
92018
On mixed linear layouts of series-parallel graphs
P Angelini, MA Bekos, P Kindermann, T Mchedlidze
International Symposium on Graph Drawing and Network Visualization, 151-159, 2020
82020
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
82019
Splitting vertices in 2-layer graph drawings
R Ahmed, P Angelini, MA Bekos, G Di Battista, M Kaufmann, ...
IEEE Computer Graphics and Applications, 2023
72023
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20