Ignaz Rutter

Cited by

	All	Since 2016
Citations	1324	857
h-index	20	16
i10-index	40	30

240

120

180

20092010201120122013201420152016201720182019202020219 12 30 61 87 106 153 123 139 125 232 210 23

Co-authors

Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienVerified email at ac.tuwien.ac.at
Dorothea WagnerProfessor of Computer Science, Karlsruhe Institute of Technology (KIT)Verified email at kit.edu
Patrizio AngeliniJohn Cabot UniversityVerified email at dia.uniroma3.it
Giuseppe Di BattistaDipartimento di Ingegneria Università Roma TreVerified email at dia.uniroma3.it
Maurizio PatrignaniProfessor of Computer Science, Roma Tre UniversityVerified email at dia.uniroma3.it
Giordano Da LozzoRoma Tre University, ItalyVerified email at dia.uniroma3.it
Fabrizio FratiAssociate Professor, Roma Tre UniversityVerified email at dia.uniroma3.it
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaVerified email at kam.mff.cuni.cz
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgVerified email at uni-wuerzburg.de
Giuseppe LiottaProfessor of Computer Science, University of PerugiaVerified email at unipg.it
Philipp KindermannUniversität WürzburgVerified email at uni-wuerzburg.de
Seok-Hee HongProfessor of Computer Science, University of SydneyVerified email at it.usyd.edu.au
Michael A. BekosPostdoctoral Reasearcher, Eberhard-Karls-Universität Tübingen - Department of Computer ScienceVerified email at informatik.uni-tuebingen.de
Maria SaumellThe Czech Academy of SciencesVerified email at cs.cas.cz
Pavel KlavíkOrgpadVerified email at iuuk.mff.cuni.cz
Tomas VyskocilCharles University, Rutgers UniversityVerified email at cs.rutgers.edu
Yota OtachiNagoya UniversityVerified email at nagoya-u.jp
Der-Tsai Lee, aka D.T. LeeDistinguished Chair Professor, Computer Science & Information Engineering, National TaiwanVerified email at ieee.org
Andre SchulzProfessor of CSVerified email at fernuni-hagen.de
Emilio Di GiacomoAssociate Professor, University of Perugia, ItalyVerified email at unipg.it

Ignaz Rutter

University of Passau

Verified email at uni-passau.de - Homepage

algorithms combinatorial optimization graph drawing


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	99	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	75	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	57*	2012
Search-space size in contraction hierarchies R Bauer, T Columbus, I Rutter, D Wagner Theoretical Computer Science 645, 112-127, 2016	45	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 Vyskočil Algorithmica 77 (4), 1071-1104, 2017	42*	2017
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	41	2013
Manhattan-geodesic embedding of planar graphs B Katz, M Krug, I Rutter, A Wolff International Symposium on Graph Drawing, 207-218, 2009	39	2009
Augmenting the connectivity of planar and geometric graphs I Rutter, A Wolff Electronic Notes in Discrete Mathematics 31, 53-56, 2008	35	2008
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
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	25	2013
Partial and constrained level planarity G Brückner, I Rutter Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017	24	2017
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
Gap-planar graphs SW Bae, JF Baffier, J Chun, P Eades, K Eickmeyer, L Grilli, SH Hong, ... Theoretical Computer Science 745, 36-52, 2018	22	2018
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
Multi-sided boundary labeling P Kindermann, B Niedermann, I Rutter, M Schaefer, A Schulz, A Wolff Algorithmica 76 (1), 225-258, 2016	21*	2016
Beyond level planarity P Angelini, G Da Lozzo, G Di Battista, F Frati, M Patrignani, I Rutter International Symposium on Graph Drawing and Network Visualization, 482-495, 2016	20	2016

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors