Philipp Kindermann

Citeras av

	Alla	Sedan 2020
Citat	512	309
h-index	13	8
i10-index	19	7

2014201520162017201820192020202120222023202420256 16 26 34 43 60 56 53 49 75 55 19

Offentlig åtkomst

Visa alla

30 artiklar

0 artiklar

tillgänglig

inte tillgänglig

Enligt krav från finansiärer

Medförfattare

Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgVerifierad e-postadress på uni-wuerzburg.de
Michael A. BekosAssistant Professor, Department of Mathematics, University of Ioannina, GreeceVerifierad e-postadress på uoi.gr
Andre SchulzProfessor of CSVerifierad e-postadress på fernuni-hagen.de
Ignaz RutterUniversity of PassauVerifierad e-postadress på uni-passau.de
Giuseppe LiottaProfessor of Computer Science, University of PerugiaVerifierad e-postadress på unipg.it
Patrizio AngeliniJohn Cabot UniversityVerifierad e-postadress på dia.uniroma3.it
Fabrizio MontecchianiAssociate Professor, University of PerugiaVerifierad e-postadress på unipg.it
Stephen KobourovProfessor of Computer Science, Technical University MunichVerifierad e-postadress på tum.de
Dr. Tamara MchedlidzeAssistant Professor at Utrecht UniversityVerifierad e-postadress på uu.nl
Steven ChaplickAssistant Professor, Maastricht UniversityVerifierad e-postadress på maastrichtuniversity.nl
Walter DidimoProfessor, University of PerugiaVerifierad e-postadress på unipg.it
Michael KaufmannProfessor of Computer Science, Tübingen UniversityVerifierad e-postadress på uni-tuebingen.de
Joachim SpoerhaseDepartment of Computer Science, University of Liverpool, UKVerifierad e-postadress på liverpool.ac.uk
Wouter MeulemansEindhoven University of TechnologyVerifierad e-postadress på tue.nl
Antonios SymvonisNational Technical U. of AthensVerifierad e-postadress på math.ntua.gr
Giuseppe Di BattistaDipartimento di Ingegneria Università Roma TreVerifierad e-postadress på dia.uniroma3.it
Thomas C. van DijkTU EindhovenVerifierad e-postadress på tue.nl
Johannes ZinkTechnische Universität MünchenVerifierad e-postadress på tum.de
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienVerifierad e-postadress på ac.tuwien.ac.at
William S. EvansUniversity of British ColumbiaVerifierad e-postadress på cs.ubc.ca

Följ

Philipp Kindermann

Universität Trier

Verifierad e-postadress på uni-trier.de - Startsida

Graph Drawing Graph Algorithms Computational Geometry


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
Recognizing and drawing IC-planar graphs FJ Brandenburg, W Didimo, WS Evans, P Kindermann, G Liotta, ... Theoretical Computer Science, 1-16, 2016	68	2016
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	33	2016
Multi-sided boundary labeling P Kindermann, B Niedermann, I Rutter, M Schaefer, A Schulz, A Wolff Algorithmica 76, 225-258, 2016	25	2016
On monotone drawings of trees P Kindermann, A Schulz, J Spoerhase, A Wolff International Symposium on Graph Drawing, 488-500, 2014	25	2014
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	23	2014
1-fan-bundle-planar drawings of graphs P Angelini, MA Bekos, M Kaufmann, P Kindermann, T Schneck Theoretical Computer Science 723, 23-50, 2018	21	2018
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	21	2018
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	21	2016
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
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	17	2016
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	16	2016
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	14	2017
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	13	2015
Minimum rectilinear polygons for given angle sequences WS Evans, K Fleszar, P Kindermann, N Saeedi, CS Shin, A Wolff Computational Geometry 100, 101820, 2022	11	2022
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	10	2020
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	10	2019
Graph drawing contest report W Devanny, P Kindermann, M Löffler, I Rutter Graph Drawing and Network Visualization: 25th International Symposium, GD …, 2018	10	2018
Improved Approximation Algorithms for Box Contact Representations MA Bekos, TC Dijk, M Fink, P Kindermann, S Kobourov, S Pupyrev, ... Algorithmica, 1-19, 2016	10	2016
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	10	2013
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	9*	2019

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Följ

Citeras av

Medförfattare