Ignaz Rutter

Citeret af

	Alle	Siden 2020
Henvisninger	2209	1066
h-index	26	16
i10-indeks	62	35

260

130

195

200920102011201220132014201520162017201820192020202120222023202420256 13 37 62 91 113 154 114 141 144 228 209 186 183 241 195 48

Offentlig adgang

Se alle

71 artikler

4 artikler

tilgængelige

ikke tilgængelige

Baseret på krav i forbindelse med finansiering

Medforfattere

Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienVerificeret mail på ac.tuwien.ac.at
Dorothea WagnerProfessor of Computer Science, Karlsruhe Institute of Technology (KIT)Verificeret mail på kit.edu
Patrizio AngeliniJohn Cabot UniversityVerificeret mail på dia.uniroma3.it
Giuseppe Di BattistaDipartimento di Ingegneria Università Roma TreVerificeret mail på dia.uniroma3.it
Maurizio PatrignaniProfessor of Computer Science, Roma Tre UniversityVerificeret mail på dia.uniroma3.it
Giordano Da LozzoRoma Tre University, ItalyVerificeret mail på dia.uniroma3.it
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgVerificeret mail på uni-wuerzburg.de
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaVerificeret mail på kam.mff.cuni.cz
Fabrizio FratiFull Professor, Roma Tre UniversityVerificeret mail på dia.uniroma3.it
Giuseppe LiottaProfessor of Computer Science, University of PerugiaVerificeret mail på unipg.it
Philipp KindermannUniversität TrierVerificeret mail på uni-trier.de
Michael A. BekosAssistant Professor, Department of Mathematics, University of Ioannina, GreeceVerificeret mail på uoi.gr
Seok-Hee HongProfessor of Computer Science, University of SydneyVerificeret mail på sydney.edu.au
Stephen KobourovProfessor of Computer Science, Technical University MunichVerificeret mail på tum.de
Maria SaumellCzech Technical University in PragueVerificeret mail på cs.cas.cz
Pavel KlavíkOrgPadVerificeret mail på iuuk.mff.cuni.cz
Tomas VyskocilCharles University, Rutgers UniversityVerificeret mail på cs.rutgers.edu
Yota OtachiNagoya UniversityVerificeret mail på nagoya-u.jp
Andre SchulzProfessor of CSVerificeret mail på fernuni-hagen.de
Therese BiedlUniversity of WaterlooVerificeret mail på cs.uwaterloo.ca

Følg

Ignaz Rutter

University of Passau

Verificeret mail på uni-passau.de - Startside

algorithms combinatorial optimization graph drawing graph algorithms computational geometry


Titel Sortér efter henvisninger Sortér efter årstal Sortér efter titel	Citeret af Citeret af	År
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	133*	2015
Simultaneous embedding of planar graphs T Bläsius, SG Kobourov, I Rutter arXiv preprint arXiv:1204.5853, 2012	123	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	100	2015
Search-space size in contraction hierarchies R Bauer, T Columbus, I Rutter, D Wagner Theoretical Computer Science 645, 112-127, 2016	86	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	71*	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	59*	2017
Evaluation of labeling strategies for rotating maps A Gemsa, M Nöllenburg, I Rutter Journal of Experimental Algorithmics (JEA) 21, 1-21, 2016	57	2016
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	55	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	54	2018
Consistent labeling of rotating maps A Gemsa, M Nöllenburg, I Rutter Algorithms and Data Structures: 12th International Symposium, WADS 2011, New …, 2011	53	2011
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	43	2020
Orthogonal graph drawing with flexibility constraints T Bläsius, M Krug, I Rutter, D Wagner Algorithmica 68 (4), 859-885, 2014	41*	2014
Partial and constrained level planarity G Brückner, I Rutter Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017	40	2017
Manhattan-geodesic embedding of planar graphs B Katz, M Krug, I Rutter, A Wolff International Symposium on Graph Drawing, 207-218, 2009	40	2009
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	37	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	37	2016
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	36	2020
Multi-sided boundary labeling P Kindermann, B Niedermann, I Rutter, M Schaefer, A Schulz, A Wolff Algorithmica 76, 225-258, 2016	34*	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	32	2016
On d-regular schematization of embedded paths D Delling, A Gemsa, M Nöllenburg, T Pajor, I Rutter Computational Geometry 47 (3), 381-406, 2014	31*	2014

Systemet kan ikke foretage handlingen nu. Prøv igen senere.

Artikler 1–20

Henvisninger pr. år

Dublerede henvisninger

Flettede henvisninger

Tilføj medforfattereMedforfattere

Følg

Citeret af

Medforfattere