팔로우
Ignaz Rutter
제목
인용
인용
연도
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
131*2015
Simultaneous embedding of planar graphs
T Bläsius, SG Kobourov, I Rutter
arXiv preprint arXiv:1204.5853, 2012
1222012
Simultaneous PQ-ordering with applications to constrained embedding problems
T Bläsius, I Rutter
ACM Transactions on Algorithms (TALG) 12 (2), 1-46, 2015
1012015
Search-space size in contraction hierarchies
R Bauer, T Columbus, I Rutter, D Wagner
Theoretical Computer Science 645, 112-127, 2016
852016
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
572016
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
542011
Gap-planar graphs
SW Bae, JF Baffier, J Chun, P Eades, K Eickmeyer, L Grilli, SH Hong, ...
Theoretical Computer Science 745, 36-52, 2018
532018
Consistent labeling of rotating maps
A Gemsa, M Nöllenburg, I Rutter
Algorithms and Data Structures: 12th International Symposium, WADS 2011, New …, 2011
512011
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
432020
Manhattan-geodesic embedding of planar graphs
B Katz, M Krug, I Rutter, A Wolff
International Symposium on Graph Drawing, 207-218, 2009
412009
Partial and constrained level planarity
G Brückner, I Rutter
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
402017
Orthogonal graph drawing with flexibility constraints
T Bläsius, M Krug, I Rutter, D Wagner
Algorithmica 68 (4), 859-885, 2014
40*2014
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
372020
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
372017
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
372016
Multi-sided boundary labeling
P Kindermann, B Niedermann, I Rutter, M Schaefer, A Schulz, A Wolff
Algorithmica 76, 225-258, 2016
34*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
30*2020
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
302016
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20