Ignaz Rutter

Citée par

	Toutes	Depuis 2017
Citations	1620	1015
indice h	22	19
indice i10	48	31

240

120

180

200920102011201220132014201520162017201820192020202120228 12 32 62 93 105 147 125 138 125 230 195 198 124

Accès public

Tout afficher

56 articles

5 articles

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienAdresse e-mail validée de ac.tuwien.ac.at
Dorothea WagnerProfessor of Computer Science, Karlsruhe Institute of Technology (KIT)Adresse e-mail validée de kit.edu
Patrizio AngeliniJohn Cabot UniversityAdresse e-mail validée de dia.uniroma3.it
Giuseppe Di BattistaDipartimento di Ingegneria Università Roma TreAdresse e-mail validée de dia.uniroma3.it
Maurizio PatrignaniProfessor of Computer Science, Roma Tre UniversityAdresse e-mail validée de dia.uniroma3.it
Giordano Da LozzoRoma Tre University, ItalyAdresse e-mail validée de dia.uniroma3.it
Fabrizio FratiAssociate Professor, Roma Tre UniversityAdresse e-mail validée de dia.uniroma3.it
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaAdresse e-mail validée de kam.mff.cuni.cz
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgAdresse e-mail validée de uni-wuerzburg.de
Philipp KindermannUniversität TrierAdresse e-mail validée de uni-trier.de
Giuseppe LiottaProfessor of Computer Science, University of PerugiaAdresse e-mail validée de unipg.it
Seok-Hee HongProfessor of Computer Science, University of SydneyAdresse e-mail validée de sydney.edu.au
Michael A. BekosAssistant Professor, University of Ioannina, Ioannina, GreeceAdresse e-mail validée de uoi.gr
Stephen KobourovProfessor of Computer Science, University of ArizonaAdresse e-mail validée de cs.arizona.edu
Maria SaumellThe Czech Academy of SciencesAdresse e-mail validée de cs.cas.cz
Pavel KlavíkOrgPadAdresse e-mail validée de iuuk.mff.cuni.cz
Tomas VyskocilCharles University, Rutgers UniversityAdresse e-mail validée de cs.rutgers.edu
Yota OtachiNagoya UniversityAdresse e-mail validée de nagoya-u.jp
Der-Tsai Lee, aka D.T. LeeDistinguished Research Chair Professor, CSIE, Dept. National Taiwan UniversityAdresse e-mail validée de ieee.org
Andre SchulzProfessor of CSAdresse e-mail validée de fernuni-hagen.de

Suivre

Ignaz Rutter

University of Passau

Adresse e-mail validée de uni-passau.de - Page d'accueil

algorithms combinatorial optimization graph drawing graph algorithms computational geometry


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
Testing planarity of partially embedded graphs P Angelini, G Di Battista, F Frati, V Jelínek, J Kratochvíl, M Patrignani, ... ACM Transactions on Algorithms (TALG) 11 (4), 1-42, 2015	114*	2015
Simultaneous embedding of planar graphs T Bläsius, SG Kobourov, I Rutter arXiv preprint arXiv:1204.5853, 2012	106	2012
Simultaneous PQ-ordering with applications to constrained embedding problems T Bläsius, I Rutter ACM Transactions on Algorithms (TALG) 12 (2), 1-46, 2015	82	2015
Search-space size in contraction hierarchies R Bauer, T Columbus, I Rutter, D Wagner Theoretical Computer Science 645, 112-127, 2016	62	2016
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph P Angelini, G Di Battista, F Frati, M Patrignani, I Rutter Journal of Discrete Algorithms 14, 150-172, 2012	61*	2012
Extending partial representations of proper and unit interval graphs P Klavík, J Kratochvíl, Y Otachi, I Rutter, T Saitoh, M Saumell, T Vyskočil Algorithmica 77 (4), 1071-1104, 2017	55*	2017
A Kuratowski-type theorem for planarity of partially embedded graphs V Jelínek, J Kratochvíl, I Rutter Proceedings of the twenty-seventh annual symposium on Computational geometry …, 2011	49	2011
Evaluation of labeling strategies for rotating maps A Gemsa, M Nöllenburg, I Rutter Journal of Experimental Algorithmics (JEA) 21, 1-21, 2016	43	2016
Manhattan-geodesic embedding of planar graphs B Katz, M Krug, I Rutter, A Wolff International Symposium on Graph Drawing, 207-218, 2009	42	2009
Augmenting the connectivity of planar and geometric graphs I Rutter, A Wolff Electronic Notes in Discrete Mathematics 31, 53-56, 2008	37	2008
Gap-planar graphs SW Bae, JF Baffier, J Chun, P Eades, K Eickmeyer, L Grilli, SH Hong, ... Theoretical Computer Science 745, 36-52, 2018	32	2018
Orthogonal graph drawing with flexibility constraints T Bläsius, M Krug, I Rutter, D Wagner Algorithmica 68 (4), 859-885, 2014	32*	2014
Partial and constrained level planarity G Brückner, I Rutter Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017	30	2017
Multi-sided boundary labeling P Kindermann, B Niedermann, I Rutter, M Schaefer, A Schulz, A Wolff Algorithmica 76 (1), 225-258, 2016	28*	2016
On self-approaching and increasing-chord drawings of 3-connected planar graphs M Nöllenburg, R Prutkin, I Rutter Journal of Computational Geometry (Old Web Site) 7 (1), 47–69-47–69, 2016	28	2016
Optimal orthogonal graph drawing with convex bend costs T Bläsius, I Rutter, D Wagner ACM Transactions on Algorithms (TALG) 12 (3), 1-32, 2016	26	2016
Beyond level planarity: Cyclic, torus, and simultaneous level planarity P Angelini, G Da Lozzo, G Di Battista, F Frati, M Patrignani, I Rutter Theoretical Computer Science 804, 161-170, 2020	24*	2020
A new perspective on clustered planarity as a combinatorial embedding problem T Bläsius, I Rutter Theoretical Computer Science 609, 306-315, 2016	24	2016
Intersection-Link Representations of Graphs. P Angelini, G Da Lozzo, G Di Battista, F Frati, M Patrignani, I Rutter J. Graph Algorithms Appl. 21 (4), 731-755, 2017	23	2017
Consistent labeling of rotating maps A Gemsa, M Nöllenburg, I Rutter Journal of Computational Geometry 7 (1), 308–331-308–331, 2016	23	2016

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs