Ignaz Rutter

Cited by

	All	Since 2018
Citations	1876	1135
h-index	24	18
i10-index	53	39

240

120

180

2009201020112012201320142015201620172018201920202021202220236 10 32 59 90 102 154 122 136 131 214 197 182 183 222

Public access

View all

58 articles

4 articles

available

not available

Based on funding mandates

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
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaVerified email at kam.mff.cuni.cz
Fabrizio FratiAssociate Professor, Roma Tre UniversityVerified email at dia.uniroma3.it
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 TrierVerified email at uni-trier.de
Michael A. BekosAssistant Professor, Department of Mathematics, University of Ioannina, GreeceVerified email at uoi.gr
Seok-Hee HongProfessor of Computer Science, University of SydneyVerified email at sydney.edu.au
Stephen KobourovProfessor of Computer Science, University of ArizonaVerified email at cs.arizona.edu
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
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 graph algorithms computational geometry


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	118*	2015
Simultaneous embedding of planar graphs T Bläsius, SG Kobourov, I Rutter arXiv preprint arXiv:1204.5853, 2012	116	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	96	2015
Search-space size in contraction hierarchies R Bauer, T Columbus, I Rutter, D Wagner Theoretical Computer Science 645, 112-127, 2016	71	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	66*	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, 1071-1104, 2017	56*	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	51	2011
Evaluation of labeling strategies for rotating maps A Gemsa, M Nöllenburg, I Rutter Journal of Experimental Algorithmics (JEA) 21, 1-21, 2016	48	2016
Consistent labeling of rotating maps A Gemsa, M Nöllenburg, I Rutter Algorithms and Data Structures: 12th International Symposium, WADS 2011, New …, 2011	47	2011
Manhattan-geodesic embedding of planar graphs B Katz, M Krug, I Rutter, A Wolff International Symposium on Graph Drawing, 207-218, 2009	40	2009
Augmenting the connectivity of planar and geometric graphs I Rutter, A Wolff Electronic Notes in Discrete Mathematics 31, 53-56, 2008	39	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	38	2018
Orthogonal graph drawing with flexibility constraints T Bläsius, M Krug, I Rutter, D Wagner Algorithmica 68 (4), 859-885, 2014	35*	2014
Vulnerability in social epistemic networks E Sullivan, M Sondag, I Rutter, W Meulemans, S Cunningham, ... International Journal of Philosophical Studies 28 (5), 731-753, 2020	34	2020
Partial and constrained level planarity G Brückner, I Rutter Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017	32	2017
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-47–69, 2016	32	2016
Intersection-link representations of graphs P Angelini, G Da Lozzo, G Di Battista, F Frati, M Patrignani, I Rutter Journal of Graph Algorithms and Applications 21 (4), 731-755, 2017	31	2017
Can Real Social Epistemic Networks Deliver the Wisdom of Crowds E Sullivan, M Sondag, I Rutter, S Cunningham, B Speckmann, M Alfano Oxford Studies in Experimental Philosophy Volume 3 3, 29, 2020	30	2020
Multi-sided boundary labeling P Kindermann, B Niedermann, I Rutter, M Schaefer, A Schulz, A Wolff Algorithmica 76, 225-258, 2016	30*	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	29	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

Follow

Cited by

Co-authors