| 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 | 141* | 2015 |
| Simultaneous embedding of planar graphs T Bläsius, SG Kobourov, I Rutter arXiv preprint arXiv:1204.5853, 2012 | 125 | 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 | 103 | 2015 |
| Search-space size in contraction hierarchies R Bauer, T Columbus, I Rutter, D Wagner Theoretical Computer Science 645, 112-127, 2016 | 92 | 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 | 74* | 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 (4), 1071-1104, 2017 | 64* | 2017 |
| Evaluation of labeling strategies for rotating maps A Gemsa, M Nöllenburg, I Rutter Journal of Experimental Algorithmics (JEA) 21, 1-21, 2016 | 62 | 2016 |
| Gap-planar graphs SW Bae, JF Baffier, J Chun, P Eades, K Eickmeyer, L Grilli, SH Hong, ... Theoretical Computer Science 745, 36-52, 2018 | 59 | 2018 |
| 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 | 58 | 2011 |
| Consistent labeling of rotating maps A Gemsa, M Nöllenburg, I Rutter Workshop on Algorithms and Data Structures, 451-462, 2011 | 54 | 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 | 49 | 2020 |
| Simple k-planar graphs are simple (k+ 1)-quasiplanar P Angelini, MA Bekos, FJ Brandenburg, G Da Lozzo, G Di Battista, ... Journal of Combinatorial Theory, Series B 142, 1-35, 2020 | 46* | 2020 |
| Augmenting the connectivity of planar and geometric graphs I Rutter, A Wolff Journal of Graph Algorithms and Applications 16 (2), 599-628, 2012 | 46* | 2012 |
| Partial and constrained level planarity G Brückner, I Rutter Theoretical Computer Science, 115291, 2025 | 43 | 2025 |
| 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 | 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 |
| Manhattan-geodesic embedding of planar graphs B Katz, M Krug, I Rutter, A Wolff International Symposium on Graph Drawing, 207-218, 2009 | 41 | 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 | 38 | 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 |
| 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 | 35* | 2020 |
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienVerified email at ac.tuwien.ac.at
