Philipp Kindermann

Navedeno

	Vse	Od leta 2019
Navedbe	502	357
indeks h	13	9
indeks i10	17	9

201420152016201720182019202020212022202320245 15 30 34 42 56 54 51 52 77 60

Javni dostop

Prikaži vse

28 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgPreverjeni e-poštni naslov na uni-wuerzburg.de
Michael A. BekosAssistant Professor, Department of Mathematics, University of Ioannina, GreecePreverjeni e-poštni naslov na uoi.gr
Andre SchulzProfessor of CSPreverjeni e-poštni naslov na fernuni-hagen.de
Ignaz RutterUniversity of PassauPreverjeni e-poštni naslov na uni-passau.de
Giuseppe LiottaProfessor of Computer Science, University of PerugiaPreverjeni e-poštni naslov na unipg.it
Patrizio AngeliniJohn Cabot UniversityPreverjeni e-poštni naslov na dia.uniroma3.it
Fabrizio MontecchianiAssociate Professor, University of PerugiaPreverjeni e-poštni naslov na unipg.it
Stephen KobourovProfessor of Computer Science, Technical University MunichPreverjeni e-poštni naslov na tum.de
Dr. Tamara MchedlidzeAssistant Professor at Utrecht UniversityPreverjeni e-poštni naslov na uu.nl
Steven ChaplickAssistant Professor, Maastricht UniversityPreverjeni e-poštni naslov na maastrichtuniversity.nl
Walter DidimoProfessor, University of PerugiaPreverjeni e-poštni naslov na unipg.it
Michael KaufmannProfessor of Computer Science, Tübingen UniversityPreverjeni e-poštni naslov na uni-tuebingen.de
Wouter MeulemansEindhoven University of TechnologyPreverjeni e-poštni naslov na tue.nl
Joachim SpoerhaseDepartment of Computer Science, University of Liverpool, UKPreverjeni e-poštni naslov na liverpool.ac.uk
Antonios SymvonisNational Technical U. of AthensPreverjeni e-poštni naslov na math.ntua.gr
Giuseppe Di BattistaDipartimento di Ingegneria Università Roma TrePreverjeni e-poštni naslov na dia.uniroma3.it
Johannes ZinkJulius-Maximilians-Universität WürzburgPreverjeni e-poštni naslov na uni-wuerzburg.de
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienPreverjeni e-poštni naslov na ac.tuwien.ac.at
William S. EvansUniversity of British ColumbiaPreverjeni e-poštni naslov na cs.ubc.ca
Giordano Da LozzoRoma Tre University, ItalyPreverjeni e-poštni naslov na dia.uniroma3.it

Spremljaj

Philipp Kindermann

Universität Trier

Preverjeni e-poštni naslov na uni-trier.de - Domača stran

Graph Drawing Graph Algorithms Computational Geometry


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
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	32	2016
On monotone drawings of trees P Kindermann, A Schulz, J Spoerhase, A Wolff International Symposium on Graph Drawing, 488-500, 2014	26	2014
Multi-sided boundary labeling P Kindermann, B Niedermann, I Rutter, M Schaefer, A Schulz, A Wolff Algorithmica 76, 225-258, 2016	24	2016
1-fan-bundle-planar drawings of graphs P Angelini, MA Bekos, M Kaufmann, P Kindermann, T Schneck Theoretical Computer Science 723, 23-50, 2018	22	2018
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	22	2014
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	20	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
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
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	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
Improved Approximation Algorithms for Box Contact Representations MA Bekos, TC Dijk, M Fink, P Kindermann, S Kobourov, S Pupyrev, ... Algorithmica, 1-19, 2016	11	2016
Minimum rectilinear polygons for given angle sequences WS Evans, K Fleszar, P Kindermann, N Saeedi, CS Shin, A Wolff Computational Geometry 100, 101820, 2022	10	2022
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
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
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	9	2020
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
Graph drawing contest report W Devanny, P Kindermann, M Löffler, I Rutter Graph Drawing and Network Visualization: 25th International Symposium, GD …, 2018	9	2018

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji