Folgen
Ignaz Rutter
Titel
Zitiert von
Zitiert von
Jahr
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
112*2015
Simultaneous embedding of planar graphs
T Bläsius, SG Kobourov, I Rutter
arXiv preprint arXiv:1204.5853, 2012
1042012
Simultaneous PQ-ordering with applications to constrained embedding problems
T Bläsius, I Rutter
ACM Transactions on Algorithms (TALG) 12 (2), 1-46, 2015
822015
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
62*2012
Search-space size in contraction hierarchies
R Bauer, T Columbus, I Rutter, D Wagner
Theoretical Computer Science 645, 112-127, 2016
562016
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
51*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
482013
Manhattan-geodesic embedding of planar graphs
B Katz, M Krug, I Rutter, A Wolff
International Symposium on Graph Drawing, 207-218, 2009
412009
Evaluation of labeling strategies for rotating maps
A Gemsa, M Nöllenburg, I Rutter
Journal of Experimental Algorithmics (JEA) 21, 1-21, 2016
402016
Augmenting the connectivity of planar and geometric graphs
I Rutter, A Wolff
Electronic Notes in Discrete Mathematics 31, 53-56, 2008
372008
Orthogonal graph drawing with flexibility constraints
T Bläsius, M Krug, I Rutter, D Wagner
Algorithmica 68 (4), 859-885, 2014
32*2014
Gap-planar graphs
SW Bae, JF Baffier, J Chun, P Eades, K Eickmeyer, L Grilli, SH Hong, ...
Theoretical Computer Science 745, 36-52, 2018
302018
Partial and constrained level planarity
G Brückner, I Rutter
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
292017
On self-approaching and increasing-chord drawings of 3-connected planar graphs
M Nöllenburg, R Prutkin, I Rutter
Journal of Computational Geometry (Old Web Site) 7 (1), 47–69-47–69, 2016
282016
Multi-sided boundary labeling
P Kindermann, B Niedermann, I Rutter, M Schaefer, A Schulz, A Wolff
Algorithmica 76 (1), 225-258, 2016
27*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
262016
A new perspective on clustered planarity as a combinatorial embedding problem
T Bläsius, I Rutter
Theoretical Computer Science 609, 306-315, 2016
242016
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
23*2020
Consistent labeling of rotating maps
A Gemsa, M Nöllenburg, I Rutter
Journal of Computational Geometry 7 (1), 308–331-308–331, 2016
232016
Simultaneous embedding: Edge orderings, relative positions, cutvertices
T Bläsius, A Karrer, I Rutter
International Symposium on Graph Drawing, 220-231, 2013
23*2013
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20