The definitive versions of the papers listed below are those that are published as specified. In contrast to this, the downloadable PDFs are all technical reports, preprints, or author-prepared versions of the specified paper. They are provided only for scholarly communication and not for redistribution.

• M. Chimani, T. Wiedera. Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast. 26th Annual European Symposium on Algorithms (ESA) 2018, Helsinki, Finland, to appear in LIPIcs.

• M. Chimani, I. Hedtke, T. Wiedera. Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. 17th International Symposium on Experimental Algorithms (SEA) 2018, L'Aquila, Italy, LIPIcs 103, pp. 22:1-22:15, 2018.

• T. Biedl, M. Chimani, M. Derka, P. Mutzel. Crossing Number for Graphs with Bounded Pathwidth. 28th International Symposium on Algorithms and Computation (ISAAC) 2017, Phuket, Thailand, LIPIcs 92, pp. 13:1-13:13, 2017.

• T. Schüller, N. Aschenbruck, M. Chimani, M. Horneffer, S. Schnitter. Predictive Traffic Engineering with 2-Segment Routing Considering Requirements of a Carrier IP Network. 42nd IEEE Conference on Local Computer Networks (LCN) 2017, Singapore, pp. 667-675, 2017.

• M. Chimani, S. Felsner, S. Kobourov, T. Ueckerdt, P. Valtr, A. Wolff. On the Maximum Crossing Number. 28th International Workshop on Combinatorial Algorithms (IWOCA) 2017, Newcastle, Australia, LNCS 10765, pp. 61-74, 2018.

• T. Schüller, N. Aschenbruck, M. Chimani, M. Horneffer, S. Schnitter. Traffic Engineering using Segment Routing and Considering Requirements of a Carrier IP Network. 16th IFIP Networking 2017, Stockholm, Sweden, pp. 1-9, 2017.

• M. Chimani, K. Klein, T. Wiedera. A Note on the Practicality of Maximal Planar Subgraph Algorithms. 24nd International Symposium on Graph Drawing (GD) 2016, Athens, Greece, LNCS 9801, pp. 357-364, 2016.

• C. Binucci, M. Chimani, W. Didimo, F. Montecchiani, G. Liotta. Placing Arrows in Directed Graph Drawings. 24nd International Symposium on Graph Drawing (GD) 2016, Athens, Greece, LNCS 9801, pp. 44-51, 2016.

• M. Chimani, T. Wiedera. An ILP-based Proof System for the Crossing Number Problem. 24th European Symposium of Algorithms (ESA) 2016, Aarhus, Denmark, LIPIcs 57, pp. 29:1–29:13, 2016.

• M. Chimani, I. Hedtke, T. Wiedera. Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem. 27th International Workshop on Combinatorial Algorithms (IWOCA) 2016, Helsinki, Finland, LNCS 9843, pp. 334-346, 2016.

• M. Chimani, P. Hliněný. Inserting Multiple Edges into a Planar Graph. 32nd International Symposium on Computational Geometry (SoCG) 2016, Boston, MA, USA, LIPIcs 51, pp. 30:1-30:15, 2016.

• S. Beyer, M. Chimani, I. Hedtke, M. Kotrbčík. A Practical Method for the Minimum Genus of a Graph: Models and Experiments. 15th International Symposium on Experimental Algorithms (SEA) 2016, St. Petersburg, Russia, LNCS 9685, pp. 75-88, 2016.

• S. Beyer, M. Chimani. The Influence of Preprocessing on Steiner Tree Approximations. 9th Annual International Conference on Combinatorial Optimization and Applications (COCOA) 2015, Houston, Texas, LNCS 9486, pp. 601-616, 2015.

• C. Binucci, M. Chimani, W. Didimo, M. Gronemann, K. Klein, J. Kratochvil, F. Montecchiani, I. G. Tollis. 2-Layer Fan-planarity: From Caterpillar to Stegosaurus. 23nd International Symposium on Graph Drawing (GD) 2015, Los Angeles, CA, LNCS 9411, pp. 281-294, 2015.

• T. White, S. Beyer, K. Dührkop, M. Chimani, S. Böcker. Speedy Colorful Subtrees. 21st Annual International Computing and Combinatorics Conference (COCOON) 2015, Beijing, China, LNCS 9198, pp. 310-322, 2015.

• M. Chimani, J. Spoerhase. Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees. 32nd Symposium on Theoretical Aspects of Computer Science (STACS) 2015, Munich, Germany, LIPIcs 30, pp. 238-248, 2015.

• S. Beyer, M. Chimani. Steiner Tree 1.39-Approximation in Practice. Selected papers of 9th Doc. Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS) 2014, Telč, Czech Republic, LNCS 8934, pp. 60-72, 2014.

• M. Chimani, T. C. van Dijk, J.-H. Haunert. How to Eat a Graph: Computing Selection Sequences for the Continuous Generalization of Road Networks. 22nd International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL) 2014, Dallas, Texas, ACM, pp. 243-252, 2014.

• M. Chimani, G. Di Battista, F. Frati, K. Klein. Advances on Testing C-Planarity of Embedded Flat Clustered Graphs. 22nd International Symposium on Graph Drawing (GD) 2014, Würzburg, Germany, LNCS 8871, pp. 416-427, 2014.

• M. Chimani, R. Zeranski. An Exact Approach to Upward Crossing Minimization. SIAM Workshop on Algorithm Engineering & Experiments (ALENEX) 2014, Portland, Oregon, pp. 73-85, 2014.

• M. Chimani, R. Zeranski. Upward Planarity Testing: A Computational Study. 21th International Symposium on Graph Drawing 2013, Bordeaux (GD13). LNCS, to appear.

• S. Cabello, M. Chimani, P. Hliněný. Computing the Stretch of an Embedded Graph. XV Spanish Meeting on Computational Geometry, Seville, Spain (ECG13). pp. 39-42, 2013.

• M. Chimani, M. Kandyba, M. Martens. 2-InterConnected Facility Location: Specification, Complexity, and Exact Solutions. International Network Optimization Conference 2013, Tenerife, Spain (INOC13). ENDM 41, pp. 21-28, 2013. (see also the extended version (TR))

• M. Chimani, J. Spoerhase. Approximating Spanning Trees with Few Branches. 10th Workshop on Approximation and Online Algorithms 2012, Ljubljana, Slovenia (WAOA12). LNCS 7846, pp. 30-41, 2013.

• M. Chimani, R. Zeranski. Upward Planarity via SAT. 20th International Symposium on Graph Drawing 2012, Redmond, Washington (GD12). LNCS, 7704, pp. 248-259, 2013.

• M. Chimani, K. Klein. Shrinking the Search Space for Clustered Planarity. 20th International Symposium on Graph Drawing 2012, Redmond, Washington (GD12). LNCS, 7704, pp. 90-101, 2013.

• F. Hufsky, K. Dührkop, F. Rasche, M. Chimani, S. Böcker. Fast alignment of fragmentation trees. 20th Annual International Conference on Intelligent Systems for Molecular Biology, Long Beach, California (ISMB12). In Bioinformatics 28(12), pp. i265-i273, 2012.

• M. Chimani, M. Woste. Contraction-based Steiner Tree Approximations in Practice. 22nd International Symposium on Algorithms and Computation, Yokohama (ISAAC11), LNCS 7074, pp. 40-49, Springer, 2011.

• M. Chimani, C. Gutwenger. Advances in the Planarization Method: Effective Multiple Edge Insertions. 19th International Symposium on Graph Drawing 2011, Eindhoven (GD11), LNCS 7034, pp. 87-98, Springer, 2011.

• M. Chimani, P. Mutzel, B. Zey. Improved Steiner Tree Algorithms for Bounded Treewidth. International Workshop on Combinatorial Algorithms, Victoria, Canada (IWOCA11), LNCS 7056, pp. 374-386, Springer, 2011.

• M. Chimani, M. Derka, P. Hliněný, M. Klusáček. How Not to Characterize Planar-emulable Graphs. International Workshop on Combinatorial Algorithms, Victoria, Canada (IWOCA11), LNCS 7056, pp. 106-120, Springer, 2011. (link to extended ArXiv version).

• M. Chimani, P. Hliněný. A Tighter Insertion-based Approximation of the Crossing Number. International Colloquium on Automata, Languages and Programming, Zurich (ICALP11), (Part 1), LNCS 6755, pp. 122-134, Springer, 2011. (link to extended ArXiv version).

• M. Chimani, P. Hungerländer, M. Jünger, P. Mutzel. An SDP Approach to Multi-level Crossing Minimization. SIAM Workshop on Algorithm Engineering & Experiments 2011, San Francisco (ALENEX11), pp. 116-126, SIAM, 2011. (link to published version)

• M. Chimani, M. Woste, S. Böcker. A Closer Look at the Closest String and Closest Substring Problem. SIAM Workshop on Algorithm Engineering & Experiments 2011, San Francisco (ALENEX11), pp. 13-24, SIAM, 2011. (link to published version)

• I. Bomze, M. Chimani, M. Jünger, I. Ljubic, P. Mutzel, B. Zey. Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut. 21st International Symposium on Algorithms and Computation 2010, Jeju Island, Korea (ISAAC10), LNCS 6506, pp. 427-439, Springer, 2010.

• M. Chimani, C. Gutwenger, P. Mutzel, M. Spönemann, H.-M. Wong. Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraint. 18th International Symposium on Graph Drawing 2010, Konstanz (GD10), LNCS 6502, pp. 141-152, Springer, 2011.

• M. Chimani, S. Rahmann, S. Böcker. Exact ILP Solutions for Phylogenetic Minimum Flip Problems. ACM Int'l Conference on Bioinformatics and Computational Biology 2010, Niagara Falls (ACM-BCB10), ACM, pp. 147-153, 2010.

• P. Hliněný, M. Chimani. Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. ACM-SIAM Symposium on Discrete Algorithms 2010, Austin, Texas (SODA10), pp. 918-927, SIAM, 2010.

• M. Chimani, C. Gutwenger, P. Mutzel, H.-M. Wong. Upward Planarization Layout. 17th International Symposium on Graph Drawing 2009, Chicago (GD09), LNCS 5849, pp. 94-106, Springer, 2010.

• M. Chimani, C. Gutwenger, P. Mutzel, C. Wolf. Inserting a Vertex into a Planar Graph. ACM-SIAM Symposium on Discrete Algorithms 2009, New York (SODA09), pp. 375-383, ACM Press, 2009. (link to original)

• M. Chimani, C. Gutwenger, M. Jansen, K. Klein, P. Mutzel. Computing Maximum C-Planar Subgraphs. 16th International Symposium on Graph Drawing 2008, Heraklion (GD08), LNCS 5417, pp. 114-120, Springer, 2009.

• M. Chimani, P. Mutzel, I. Bomze. A New Approach to Exact Crossing Minimization. 16th Annual European Symposium on Algorithms 2008, Karlsruhe (ESA08), LNCS 5193, pp. 284-296, Springer, 2008.

• M. Chimani, M. Kandyba, I. Ljubic, P. Mutzel. Strong Formulations for the 2-Node-Connected Steiner Network Problems. 2nd Annual International Conference on Combinatorial Optimization and Applications 2008, St. John's, Newfoundland (COCOA08), LNCS 5165, pp. 190-200, Springer, 2008. (Tech.Report: TR07-1-008, November 2007)

• M. Chimani, C. Gutwenger, P. Mutzel, H.-M. Wong. Layer-Free Upward Crossing Minimization. 7th International Workshop on Experimental Algorithms 2008, Cape Cod (WEA08), LNCS 5038, pp. 55-68, Springer, 2008.

• M. Chimani, M. Jünger, M. Schulz. Crossing Minimization meets Simultaneous Drawing. 2008 IEEE Pacific Visualization Symposium, Kyoto (PacificVis08), pp. 33-40.

• M. Chimani, M. Kandyba, I. Ljubic, P. Mutzel. Obtaining Optimal k-Cardinality Trees Fast. 10th Workshop on Algorithm Engineering & Experiments 2008, San Francisco (ALENEX08), SIAM, pp. 27-36. (link to original)

• M. Chimani, C. Gutwenger. Algorithms for the Hypergraph and the Minor Crossing Number Problems. 18th Annual International Symposium on Algorithms and Computation 2007, Sendai (ISAAC07), LNCS 4835, pp. 184-195, Springer, 2007.

• M. Chimani, P. Mutzel, J.M. Schmidt. Efficient Extraction of Multiple Kuratowski Subdivisions. 15th International Symposium on Graph Drawing 2007, Sydney (GD07), LNCS 4875, pp. 159-170, Springer, 2007. (Tech.Report TR07-1-002, June 2007)

• M. Chimani, M. Kandyba, M. Preuss. Hybrid Numerical Optimization for Combinatorial Network Problems. 4th International Workshop on Hybrid Metaheuristics 2007, Dortmund (HM07), LNCS 4771, pp. 185-200, Springer, 2007.

• M. Chimani, M. Kandyba, P. Mutzel. A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks. 15th Annual European Symposium on Algorithms 2007, Eilat (ESA07), LNCS 4698, pp. 681-692, Springer, 2007. (Tech.Report TR07-1-001, April 2007)

• M. Chimani, C. Gutwenger, P. Mutzel. Experiments on Exact Crossing Minimization using Column Generation. 5th International Workshop on Experimental Algorithms 2006, Menorca (WEA06), LNCS 4007, pp. 303-315, Springer, 2006.

• C. Gutwenger, M. Chimani. Non-Planar Core Reduction of Graphs. 13th International Symposium on Graph Drawing 2005, Limerick (GD05), LNCS 3843, pp. 223-234, Springer, 2006.

• C. Rich, C. Sidner, N. Lesh, A. Garland, S. Booth, M. Chimani. DiamondHelp: A Collaborative Interface Framework for Networked Home Appliances. IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2005) / 5th International WorkShop on Smart Appliances and Wearable Computing 2005 (IWSAWC), pp. 514-519, IEEE Computer Society Press, 2005.

• M. Chimani, N. Lesh, M. Mitzenmacher, C. Sidner, H. Tanaka. A Case Study in Large-Scale Interactive Optimization. International Conference on Artificial Intelligence and Applications 2005 (AIA05), IASTED-Proc., pp.24-29, Acta Press, Anaheim CA, 2005.

• M. Chimani, G.W. Klau, R. Weiskircher. Non-Planar Orthogonal Drawings with Fixed Topology. SOFSEM 2005: Theory and Practice of Computer Science, Liptovsky Jan, LNCS 3381, pp. 96-105, Springer, 2005.

• M. Chimani, S. Felsner, S. Kobourov, T. Ueckerdt, P. Valtr, A. Wolff. On the Maximum Crossing Number. Journal of Graph Algorithms and Applications (JGAA), Vol. 22(1), pp. 67-87, 2018.

• C. Binucci, M. Chimani, W. Didimo, M. Gronemann, K. Klein, J. Kratochvíl, F. Montecchiani, I. G. Tollis. Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus. Journal of Graph Algorithms and Applications (JGAA), Vol. 21(1), pp. 81-102, 2017.

• M. Chimani, P. Hliněný. A Tighter Insertion-Based Approximation of the Crossing Number. Journal of Combinatorial Optimization, Volume 33, pp. 1183-1225, 2017.

• M. Chimani, R. Zeranski. Upward Planarity Testing in Practice: SAT Formulations and Comparative Study. ACM Journal of Experimental Algorithmics, Volume 20(1), Article 1.2, 2015.

• M. Chimani, C. Gutwenger. Hypergraph and Minor Crossing Number Problems. Journal of Graph Algorithms and Applications (JGAA), Vol. 19(1), pp. 191-222, 2015.

• M. Chimani, J. Spoerhase. Approximating Spanning Trees with Few Branches. Theory of Computing Systems, Vol. 56(1), pp. 181-196, 2015.

• S. Cabello, M. Chimani, P. Hliněný. Computing the Stretch of an Embedded Graph. SIAM Journal on Discrete Mathematics, Vol. 28(3), pp. 1391-1401, 2014.

• M. Chimani, P. Hungerländer. Multi-level Verticality Optimization: Concept, Strategies, and Drawing Scheme. Journal of Graph Algorithms and Applications (JGAA), Vol. 17(3), pp. 329-362, 2013.

• D. Bokal, M. Chimani, J. Leaños. Crossing number additivity over edge cuts. European Journal of Combinatorics, Vol. 34(6), pp. 1010-1018, 2013.

• M. Chimani, M. Derka, P. Hliněný, M. Klusáček. How Not to Characterize Planar-emulable Graphs. Advances in Applied Mathematics, Vol. 50(1), pp. 46-68, 2013. (Link to arXiv)

• M. Chimani, P. Hungerländer. Exact Approaches to Multi-level Vertical Orderings. INFORMS Journal on Computing, Vol. 25(4), pp. 611-624, 2013.

• M. Chimani, P. Mutzel, B. Zey. Improved Steiner Tree Algorithms for Bounded Treewidth. Journal of Discrete Algorithms 16, pp. 67-78, 2012.

• F. Hufsky, K. Dührkop, F. Rasche, M. Chimani, S. Böcker. Fast alignment of fragmentation trees. Bioinformatics 28(12), pp. i265-i273, 2012.

• M. Chimani, P. Hungerländer, M. Jünger, P. Mutzel. An SDP Approach to Multi-level Crossing Minimization. ACM Journal of Experimental Algorithmics, Volume 17(3), Article 3.3, 2012.

• M. Chimani, C. Gutwenger. Advances in the Planarization Method: Effective Multiple Edge Insertions. Journal of Graph Algorithms and Applications (JGAA), Vol. 16(3), pp. 729-757, 2012.

• M. Chimani, P. Hliněný, P. Mutzel. Vertex Insertion Approximates the Crossing Number for Apex Graphs. European Journal of Combinatorics, Vol. 33, pp. 326-335, 2012. (preprint)

• M. Chimani, C. Gutwenger, P. Mutzel, H.-M. Wong. Upward Planarization Layout. Journal of Graph Algorithms and Applications (JGAA), Vol. 15(1), pp. 127-155, 2011.

• M. Chimani. Facets in the Crossing Number Polytope. SIAM Journal on Discrete Mathematics, Vol. 25(1), pp. 95-111, SIAM, 2011. (preprint)

• M. Chimani, C. Gutwenger, P. Mutzel, H.-M. Wong. Layer-Free Upward Crossing Minimization. ACM Journal of Experimental Algorithmics, Vol. 15, Art.No. 2.2, 27 pages, ACM, 2010.

• M. Chimani, M. Kandyba, I. Ljubic, P. Mutzel. Oriented-based Models for {0,1,2}-Survivable Network Design: Theory and Practice. Mathematical Programming, Series B, Vol. 124, pp. 413-439, Springer, 2010. (preprint)

• M. Chimani, C. Gutwenger, P. Mutzel. Experiments on Exact Crossing Minimization using Column Generation. ACM Journal of Experimental Algorithmics, Vol. 14(3), pp. 4.1-4.18, 2009.

• M. Chimani, M. Kandyba, I. Ljubic, P. Mutzel. Obtaining Optimal k-Cardinality Trees Fast. ACM Journal of Experimental Algorithmics, Vol. 14(2), pp. 5.1-5.23, 2009.

• M. Chimani, C. Gutwenger. Non-Planar Core Reduction of Graphs. Discrete Mathematics, Vol. 309(7), pp. 1838-1855, 2009.

• C. Buchheim, M. Chimani, D. Ebner, C. Gutwenger, M. Jünger, G.W. Klau, P. Mutzel, R. Weiskircher. A Branch-and-Cut Approach to the Crossing Number Problem. Discrete Optimization, Vol. 5(2), Special Issue in Memory of George B. Dantzig, pp. 373-388, 2008.

• M. Chimani, C. Gutwenger, P. Mutzel. On the Minimum Cut of Planarizations. Electronic Notes in Discrete Mathematics, Vol. 28, pp. 177-184, 2007. - Warning, mistake in the proof: see L. Beaudou, D. Bokal, On the Sharpness of Some Results Relating Cuts and Crossing Numbers, Electronic J. Combin. 17 (2010), R96.

• C. Rich, C. Sidner, N. Lesh, A. Garland, S. Booth, M. Chimani. DiamondHelp: A New Interaction Design for Networked Home Appliances. Personal and Ubiquitous Computing, Vol. 10(2), pp. 187-190, Springer, 2006.

• M. Chimani, Pa. Eades, Pe. Eades, S.-H. Hong, W. Huang, K. Klein, M. Marner, R.T. Smith, B.H. Thomas. People Prefer Less Stress and Fewer Crossings 22nd International Symposium on Graph Drawing 2014, Würzburg (GD14), to appear.

• M. Chimani, P. Hliněný, P. Mutzel. Approximating the Crossing Number of Apex Graphs. 16th International Symposium on Graph Drawing 2008, Heraklion (GD08), LNCS 5417, pp. 432-434, Springer, 2009.

• M. Chimani, C. Gutwenger, M. Jünger, K. Klein, P. Mutzel, M. Schulz. The Open Graph Drawing Framework. 15th International Symposium on Graph Drawing 2007, Sydney (GD07).

• C. Rich, C. Sidner, N. Lesh, A. Garland, S. Booth, M. Chimani. DiamondHelp: A New Interaction Design for Networked Home Appliances. Third International Conference on Appliance Design 2005 (3AD), Finalist of Design Competition.

• C. Rich, C. Sidner, N. Lesh, A. Garland, S. Booth, M. Chimani. DiamondHelp: A Collaborative Task Guidance Framework for Complex Devices. 20th National Conference on Artificial Intelligence; Intelligent Systems Demonstrations (AAAI 2005), pp.1700-1701, 2005.

• M. Chimani. Planarization and Crossing Minimization. In: Encyclopedia of Algorithms, 2nd edition; S. Hong. Area-Editor; Springer 2015.

• C. Buchheim, M. Chimani, C. Gutwenger, M. Jünger, P. Mutzel. Crossings and Planarization. Chapter in: Handbook of Graph Drawing and Visualization. R. Tamassia (Ed.), CRC-Press 2012. (Link to preprint of chapter)

• M. Chimani, C. Gutwenger, M. Jünger, G. Klau, K. Klein, P. Mutzel. Open Graph Drawing Framework (OGDF). Chapter in: Handbook of Graph Drawing and Visualization. R. Tamassia (Ed.), CRC-Press 2012. (Link to preprint of chapter)

• M. Chimani and K. Klein. Algorithm Engineering: Concepts and Practice. Chapter in: Experimental Methods for the Analysis of Optimization Algorithms. T. Bartz-Beielstein, M. Chiarandini, L. Paquete, M. Preuss (Eds.), Springer 2010. (Link to preprint of chapter)

• M. Chimani. Computing Crossing Numbers: Berechnen von Kreuzungszahlen. Chapter in: Ausgezeichnete Informatikdissertationen 2008. Dorothea Wagner et al., Eds. GI-Edition LNI Dissertations 9, pp. 41-50, Gesellschaft für Informatik (in German, 2009).

• P. Mutzel, M. Chimani, C. Gutwenger, K. Klein. Datenstrukturen, Algorithmen und Programmieren 2. Lecture Notes/Vorlesungsskript, TU Dortmund, since 2005 (in German, link to version 2009).

• M. Chimani, M. Kandyba, M. Martens. 2-InterConnected Facility Location: Specifications, Complexity Results, and Exact Solutions. Technical Report TR-FSUJ-CS-AE-11-00 (v.2). Algorithm Engineering Group, Computer Science, FSU Jena. March 2011. (Extended version of INOC13)

• M. Chimani, P. Hungerländer. Multi-level Verticality Optimization: Concept, Strategies, and Drawing Scheme. Technical Report TR-FSUJ-CS-AE-11-01. Algorithm Engineering Group, Computer Science, FSU Jena. June 2011.

• M. Chimani, P. Hungerländer. Exact Approaches to Multi-level Vertical Orderings. Technical Report TR-FSUJ-CS-AE-11-02. Algorithm Engineering Group, Computer Science, FSU Jena. June 2011.

• Computing Crossing Numbers. PhD Thesis, Technical University Dortmund, 2008.

• Bend-Minimal Orthogonal Drawing of Non-Planar Graphs. Diploma Thesis, Vienna University of Technology, 2004.