Ignaz Rutter

Navedeno

	Vse	Od leta 2018
Navedbe	1724	999
indeks h	24	17
indeks i10	48	34

220

110

165

2009201020112012201320142015201620172018201920202021202220236 9 31 51 99 109 153 122 120 147 215 189 196 186 64

Javni dostop

Prikaži vse

55 člankov

3 članki

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienPreverjeni e-poštni naslov na ac.tuwien.ac.at
Dorothea WagnerProfessor of Computer Science, Karlsruhe Institute of Technology (KIT)Preverjeni e-poštni naslov na kit.edu
Patrizio AngeliniJohn Cabot UniversityPreverjeni e-poštni naslov na dia.uniroma3.it
Giuseppe Di BattistaDipartimento di Ingegneria Università Roma TrePreverjeni e-poštni naslov na dia.uniroma3.it
Maurizio PatrignaniProfessor of Computer Science, Roma Tre UniversityPreverjeni e-poštni naslov na dia.uniroma3.it
Giordano Da LozzoRoma Tre University, ItalyPreverjeni e-poštni naslov na dia.uniroma3.it
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaPreverjeni e-poštni naslov na kam.mff.cuni.cz
Fabrizio FratiAssociate Professor, Roma Tre UniversityPreverjeni e-poštni naslov na dia.uniroma3.it
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgPreverjeni e-poštni naslov na uni-wuerzburg.de
Philipp KindermannUniversität TrierPreverjeni e-poštni naslov na uni-trier.de
Giuseppe LiottaProfessor of Computer Science, University of PerugiaPreverjeni e-poštni naslov na unipg.it
Michael A. BekosAssistant Professor, Department of Mathematics, University of Ioannina, GreecePreverjeni e-poštni naslov na uoi.gr
Seok-Hee HongProfessor of Computer Science, University of SydneyPreverjeni e-poštni naslov na sydney.edu.au
Stephen KobourovProfessor of Computer Science, University of ArizonaPreverjeni e-poštni naslov na cs.arizona.edu
Maria SaumellThe Czech Academy of SciencesPreverjeni e-poštni naslov na cs.cas.cz
Pavel KlavíkOrgPadPreverjeni e-poštni naslov na iuuk.mff.cuni.cz
Tomas VyskocilCharles University, Rutgers UniversityPreverjeni e-poštni naslov na cs.rutgers.edu
Yota OtachiNagoya UniversityPreverjeni e-poštni naslov na nagoya-u.jp
Andre SchulzProfessor of CSPreverjeni e-poštni naslov na fernuni-hagen.de
Emilio Di GiacomoAssociate Professor, University of Perugia, ItalyPreverjeni e-poštni naslov na unipg.it

Spremljaj

Ignaz Rutter

University of Passau

Preverjeni e-poštni naslov na uni-passau.de - Domača stran

algorithms combinatorial optimization graph drawing graph algorithms computational geometry


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
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	112	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	88	2015
Search-space size in contraction hierarchies R Bauer, T Columbus, I Rutter, D Wagner Theoretical Computer Science 645, 112-127, 2016	69	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, 1071-1104, 2017	53*	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	45	2016
Consistent labeling of rotating maps A Gemsa, M Nöllenburg, I Rutter Algorithms and Data Structures: 12th International Symposium, WADS 2011, New …, 2011	44	2011
Manhattan-Geodesic Embedding of Planar Graphs. B Katz, M Krug, I Rutter, A Wolff Graph drawing 5849, 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	38	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	34	2018
Orthogonal graph drawing with flexibility constraints T Bläsius, M Krug, I Rutter, D Wagner Algorithmica 68 (4), 859-885, 2014	33	2014
Partial and constrained level planarity G Brückner, I Rutter Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017	32	2017
Multi-sided boundary labeling P Kindermann, B Niedermann, I Rutter, M Schaefer, A Schulz, A Wolff Algorithmica 76, 225-258, 2016	30*	2016
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	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	28	2016
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	27	2020
A new perspective on clustered planarity as a combinatorial embedding problem T Bläsius, I Rutter Theoretical Computer Science 609, 306-315, 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	25*	2020

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji