Ignaz Rutter
Citée par
Citée par
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
Simultaneous embedding of planar graphs
T Bläsius, SG Kobourov, I Rutter
arXiv preprint arXiv:1204.5853, 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
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
Search-space size in contraction hierarchies
R Bauer, T Columbus, I Rutter, D Wagner
Theoretical Computer Science 645, 112-127, 2016
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
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
Manhattan-geodesic embedding of planar graphs
B Katz, M Krug, I Rutter, A Wolff
International Symposium on Graph Drawing, 207-218, 2009
Augmenting the connectivity of planar and geometric graphs
I Rutter, A Wolff
Electronic Notes in Discrete Mathematics 31, 53-56, 2008
Evaluation of labeling strategies for rotating maps
A Gemsa, M Nöllenburg, I Rutter
Journal of Experimental Algorithmics (JEA) 21, 1-21, 2016
Orthogonal graph drawing with flexibility constraints
T Bläsius, M Krug, I Rutter, D Wagner
Algorithmica 68 (4), 859-885, 2014
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, 2016
Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings
T Biedl, T Bläsius, B Niedermann, M Nöllenburg, R Prutkin, I Rutter
International Symposium on Graph Drawing, 460-471, 2013
Partial and constrained level planarity
G Brückner, I Rutter
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
A new perspective on clustered planarity as a combinatorial embedding problem
T Bläsius, I Rutter
Theoretical Computer Science 609, 306-315, 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
Multi-sided boundary labeling
P Kindermann, B Niedermann, I Rutter, M Schaefer, A Schulz, A Wolff
Algorithmica 76 (1), 225-258, 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
Simultaneous embedding: Edge orderings, relative positions, cutvertices
T Bläsius, A Karrer, I Rutter
International Symposium on Graph Drawing, 220-231, 2013
Extending convex partial drawings of graphs
T Mchedlidze, M Nöllenburg, I Rutter
Algorithmica 76 (1), 47-67, 2016
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20