M. Kao, B. Katz, M. Krug, D. T. Lee, I. Rutter and D. Wagner, "The Density Maximization Problem in Graphs" in Computing and Combinatorics - 17th Annual International Conference, COCOON 2011. Proceedings , Bin Fu and Ding-Zhu Du, Eds. Springer , 2011. pp. 25-36.
DOI: 10.1007/978-3-642-22685-4_3

I. Rutter, "The Many Faces of Planarity - Matching, Augmentation, and Embedding Algorithms for Planar Graphs" in Ausgezeichnete Informatikdissertationen 2011 , Steffen Hölldobler, Eds. GI , 2011. pp. 161-170.

I. Rutter, "The many faces of planarity: matching, augmentation, and embedding algorithms for planar graphs" , Karlsruhe Institute of Technology , 2011.
DOI: 10.5445/IR/1000024304
http://digbib.ubka.uni-karlsruhe.de/volltexte/1000024304

A. Gemsa, M. Nöllenburg, T. Pajor and I. Rutter, "Automatic Generation of Route Sketches" in Graph Drawing - 18th International Symposium, GD 2010 , Ulrik Brandes and Sabine Cornelsen, Eds. Springer , 2010. pp. 391-392.
DOI: 10.1007/978-3-642-18469-7_37

I. Rutter and A. Wolff, "Computing large matchings fast" , ACM Trans. Algorithms , vol. 7 , no. 1 , pp. 1:1-1:21 , 2010.
DOI: 10.1145/1868237.1868238

B. Katz, M. Krug, A. Lochbihler, I. Rutter, G. Snelting and D. Wagner, "Gateway Decompositions for Constrained Reachability Problems" in Experimental Algorithms, 9th International Symposium, SEA 2010. Proceedings , Paola Festa, Eds. Springer , 2010. pp. 449-461.
DOI: 10.1007/978-3-642-13193-6_38

T. Bläsius, M. Krug, I. Rutter and D. Wagner, "Orthogonal Graph Drawing with Flexibility Constraints" in Graph Drawing - 18th International Symposium, GD 2010 , Ulrik Brandes and Sabine Cornelsen, Eds. Springer , 2010. pp. 92-104.
DOI: 10.1007/978-3-642-18469-7_9

P. Angelini, G. D. Battista, F. Frati, V. Jelínek, M. Patrignani and I. Rutter, "Testing Planarity of Partially Embedded Graphs" in Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010 , Moses Charikar, Eds. SIAM , 2010. pp. 202-221.
DOI: 10.1137/1.9781611973075.19

P. Angelini, G. D. Battista, F. Frati, M. Patrignani and I. Rutter, "Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree" in Combinatorial Algorithms - 21st International Workshop, IWOCA 2010 , Costas S. Iliopoulos and William F. Smyth, Eds. Springer , 2010. pp. 212-225.
DOI: 10.1007/978-3-642-19222-7_22

B. Katz, I. Rutter and G. J. Woeginger, "An Algorithmic Study of Switch Graphs" in Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009 , Christophe Paul and Michel Habib, Eds. 2009. pp. 226-237.
DOI: 10.1007/978-3-642-11409-0_20

R. Franke, I. Rutter and D. Wagner, "Computing Large Matchings in Planar Graphs with Fixed Minimum Degree" in Algorithms and Computation, 20th International Symposium, ISAAC 2009. Proceedings , Yingfei Dong and Ding-Zhu Du and Oscar H. Ibarra, Eds. Springer , 2009. pp. 872-881.
DOI: 10.1007/978-3-642-10631-6_88

B. Katz, M. Krug, I. Rutter and A. Wolff, "Manhattan-Geodesic Embedding of Planar Graphs" in Graph Drawing, 17th International Symposium, GD 2009 , David Eppstein and Emden R. Gansner, Eds. Springer , 2009. pp. 207-218.
DOI: 10.1007/978-3-642-11805-0_21

I. Rutter and A. Wolff, "Augmenting the Connectivity of Planar and Geometric Graphs" , Electron. Notes Discret. Math. , vol. 31 , pp. 53-56 , 2008.
DOI: 10.1016/j.endm.2008.06.009

I. Rutter and A. Wolff, "Computing large matchings fast" in Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008 , Shang-Hua Teng, Eds. SIAM , 2008. pp. 183-192.
http://dl.acm.org/citation.cfm?id=1347082.1347103

I. Rutter, "Schnelle Berechnung von großen Matchings" , Diplomarbeit , Universität Karlsruhe , 2007.