Ignaz Rutter

Citée par

	Toutes	Depuis 2016
Citations	1336	852
indice h	20	16
indice i10	40	30

240

120

180

20092010201120122013201420152016201720182019202020219 12 28 63 87 113 159 122 145 128 223 223 7

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
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaAdresse e-mail validée de kam.mff.cuni.cz
Fabrizio FratiAssociate Professor, Roma Tre UniversityAdresse e-mail validée de dia.uniroma3.it
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgAdresse e-mail validée de uni-wuerzburg.de
Giuseppe LiottaProfessor of Computer Science, University of PerugiaAdresse e-mail validée de unipg.it
Philipp KindermannUniversität WürzburgAdresse e-mail validée de uni-wuerzburg.de
Seok-Hee HongProfessor of Computer Science, University of SydneyAdresse e-mail validée de it.usyd.edu.au
Michael A. BekosPostdoctoral Reasearcher, Eberhard-Karls-Universität Tübingen - Department of Computer ScienceAdresse e-mail validée de informatik.uni-tuebingen.de
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 Chair Professor, Computer Science & Information Engineering, National TaiwanAdresse e-mail validée de ieee.org
Andre SchulzProfessor of CSAdresse e-mail validée de fernuni-hagen.de
Emilio Di GiacomoAssociate Professor, University of Perugia, ItalyAdresse e-mail validée de unipg.it

Ignaz Rutter

University of Passau

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

algorithms combinatorial optimization graph drawing


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	100*	2015
Simultaneous embedding of planar graphs T Bläsius, SG Kobourov, I Rutter arXiv preprint arXiv:1204.5853, 2012	97	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	77	2015
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	58*	2012
Search-space size in contraction hierarchies R Bauer, T Columbus, I Rutter, D Wagner Theoretical Computer Science 645, 112-127, 2016	45	2016
A Kuratowski-type theorem for planarity of partially embedded graphs V Jelínek, J Kratochvíl, I Rutter Computational Geometry 46 (4), 466-492, 2013	39	2013
Manhattan-geodesic embedding of planar graphs B Katz, M Krug, I Rutter, A Wolff International Symposium on Graph Drawing, 207-218, 2009	38	2009
Augmenting the connectivity of planar and geometric graphs I Rutter, A Wolff Electronic Notes in Discrete Mathematics 31, 53-56, 2008	35	2008
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	30*	2017
Evaluation of labeling strategies for rotating maps A Gemsa, M Nöllenburg, I Rutter Journal of Experimental Algorithmics (JEA) 21, 1-21, 2016	29	2016
Orthogonal graph drawing with flexibility constraints T Bläsius, M Krug, I Rutter, D Wagner Algorithmica 68 (4), 859-885, 2014	28*	2014
On self-approaching and increasing-chord drawings of 3-connected planar graphs M Nöllenburg, R Prutkin, I Rutter Journal of Computational Geometry 7 (1), 47-69, 2016	27	2016
Extending partial representations of proper and unit interval graphs P Klavık, J Kratochvıl, Y Otachi, I Rutter, T Saitoh, M Saumell, T Vyskocil SWAT, 253-264, 2014	26	2014
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
Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings T Biedl, T Bläsius, B Niedermann, M Nöllenburg, R Prutkin, I Rutter International Symposium on Graph Drawing, 460-471, 2013	24	2013
Multi-sided boundary labeling P Kindermann, B Niedermann, I Rutter, M Schaefer, A Schulz, A Wolff Algorithmica 76 (1), 225-258, 2016	22*	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	22	2016
Simultaneous embedding: Edge orderings, relative positions, cutvertices T Bläsius, A Karrer, I Rutter International Symposium on Graph Drawing, 220-231, 2013	22*	2013
Consistent labeling of rotating maps A Gemsa, M Nöllenburg, I Rutter Workshop on Algorithms and Data Structures, 451-462, 2011	22	2011
Gap-planar graphs SW Bae, JF Baffier, J Chun, P Eades, K Eickmeyer, L Grilli, SH Hong, ... Theoretical Computer Science 745, 36-52, 2018	21	2018

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

Importer un PDF

Suivre les mises à jour de cet auteur

Citée par

Coauteurs