DiamondHelp: A Collaborative Task Guidance Framework for Complex Devices. - Charles Rich; Candace L. Sidner; Neal Lesh; Andrew Garland; Shane Booth; Markus Chimani (AAAI, 2005)

A Case Study in Large-Scale Interactive Optimization. - Markus Chimani; Neal Lesh; Michael Mitzenmacher; Candy L. Sidner; Hidetoshi Tanaka (Artificial Intelligence and Applications, 2005)

Non-planar Core Reduction of Graphs. - Carsten Gutwenger; Markus Chimani (GD, 2005)

DiamondHelp: A Collaborative Interface Framework for Networked Home Appliances. - Charles Rich; Candy L. Sidner; Neal Lesh; Andrew Garland; Shane Booth; Markus Chimani (ICDCS Workshops, 2005)

Non-planar Orthogonal Drawings with Fixed Topology. - Markus Chimani; Gunnar W. Klau; René Weiskircher (SOFSEM, 2005)

Experiments on Exact Crossing Minimization Using Column Generation. - Markus Chimani; Carsten Gutwenger; Petra Mutzel (WEA, 2006)

DiamondHelp: a new interaction design for networked home appliances. - Charles Rich; Candace L. Sidner; Neal Lesh; Andrew Garland; Shane Booth; Markus Chimani (Pers. Ubiquitous Comput., 2006)

A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks. - Markus Chimani; Maria Kandyba; Petra Mutzel (ESA, 2007)

Efficient Extraction of Multiple Kuratowski Subdivisions. - Markus Chimani; Petra Mutzel; Jens M. Schmidt (GD, 2007)

Hybrid Numerical Optimization for Combinatorial Network Problems. - Markus Chimani; Maria Kandyba; Mike Preuss (Hybrid Metaheuristics, 2007)

Algorithms for the Hypergraph and the Minor Crossing Number Problems. - Markus Chimani; Carsten Gutwenger (ISAAC, 2007)

On the Minimum Cut of Planarizations. - Markus Chimani; Carsten Gutwenger; Petra Mutzel (Electron. Notes Discret. Math., 2007)

Obtaining Optimal k-Cardinality Trees Fast. - Markus Chimani; Maria Kandyba; Ivana Ljubic; Petra Mutzel (ALENEX, 2008)

Crossing Minimization meets Simultaneous Drawing. - Markus Chimani; Michael Jünger; Michael Schulz 001 (PacificVis, 2008)

Strong Formulations for 2-Node-Connected Steiner Network Problems. - Markus Chimani; Maria Kandyba; Ivana Ljubic; Petra Mutzel (COCOA, 2008)

A New Approach to Exact Crossing Minimization. - Markus Chimani; Petra Mutzel; Immanuel M. Bomze (ESA, 2008)

Computing Maximum C-Planar Subgraphs. - Markus Chimani; Carsten Gutwenger; Mathias Jansen; Karsten Klein 001; Petra Mutzel (GD, 2008)

Approximating the Crossing Number of Apex Graphs. - Markus Chimani; Petr Hlinený; Petra Mutzel (GD, 2008)

Computing Crossing Numbers: Berechnen von Kreuzungszahlen. - Markus Chimani (Ausgezeichnete Informatikdissertationen, 2008)

Layer-Free Upward Crossing Minimization. - Markus Chimani; Carsten Gutwenger; Petra Mutzel; Hoi-Ming Wong (WEA, 2008)

A branch-and-cut approach to the crossing number problem. - Christoph Buchheim; Markus Chimani; Dietmar Ebner; Carsten Gutwenger; Michael Jünger; Gunnar W. Klau; Petra Mutzel; René Weiskircher (Discret. Optim., 2008)

Upward Planarization Layout. - Markus Chimani; Carsten Gutwenger; Petra Mutzel; Hoi-Ming Wong (GD, 2009)

Inserting a vertex into a planar graph. - Markus Chimani; Carsten Gutwenger; Petra Mutzel; Christian Wolf 004 (SODA, 2009)

Obtaining optimal k-cardinality trees fast. - Markus Chimani; Maria Kandyba; Ivana Ljubic; Petra Mutzel (ACM J. Exp. Algorithmics, 2009)

Computing crossing numbers - Markus Chimani (2009)

Algorithm Engineering: Concepts and Practice. - Markus Chimani; Karsten Klein 001 (Experimental Methods for the Analysis of Optimization Algorithms, 2010)

Exact ILP solutions for phylogenetic minimum flip problems. - Markus Chimani; Sven Rahmann; Sebastian Böcker (BCB, 2010)

Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints. - Markus Chimani; Carsten Gutwenger; Petra Mutzel; Miro Spönemann; Hoi-Ming Wong (GD, 2010)

Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut. - Immanuel M. Bomze; Markus Chimani; Michael Jünger; Ivana Ljubic; Petra Mutzel; Bernd Zey (ISAAC (1), 2010)

Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. - Petr Hlinený; Markus Chimani (SODA, 2010)

Orientation-based models for {0, 1, 2}-survivable network design: theory and practice. - Markus Chimani; Maria Kandyba; Ivana Ljubic; Petra Mutzel (Math. Program., 2010)

An SDP Approach to Multi-level Crossing Minimization. - Markus Chimani; Philipp Hungerländer; Michael Jünger; Petra Mutzel (ALENEX, 2011)

A Closer Look at the Closest String and Closest Substring Problem. - Markus Chimani; Matthias Woste; Sebastian Böcker (ALENEX, 2011)

Advances in the Planarization Method: Effective Multiple Edge Insertions. - Markus Chimani; Carsten Gutwenger (GD, 2011)

A Tighter Insertion-Based Approximation of the Crossing Number. - Markus Chimani; Petr Hlinený (ICALP (1), 2011)

Contraction-Based Steiner Tree Approximations in Practice. - Markus Chimani; Matthias Woste (ISAAC, 2011)

How Not to Characterize Planar-Emulable Graphs. - Markus Chimani; Martin Derka; Petr Hlinený; Matej Klusácek (IWOCA, 2011)

Improved Steiner Tree Algorithms for Bounded Treewidth. - Markus Chimani; Petra Mutzel; Bernd Zey (IWOCA, 2011)

Facets in the Crossing Number Polytope. - Markus Chimani (SIAM J. Discret. Math., 2011)

Shrinking the Search Space for Clustered Planarity. - Markus Chimani; Karsten Klein 001 (GD, 2012)

Upward Planarity Testing via SAT. - Markus Chimani; Robert Zeranski (GD, 2012)

Approximating Spanning Trees with Few Branches. - Markus Chimani; Joachim Spoerhase (WAOA, 2012)

Fast alignment of fragmentation trees. - Franziska Hufsky; Kai Dührkop; Florian Rasche; Markus Chimani; Sebastian Böcker (Bioinform., 2012)

Vertex insertion approximates the crossing number of apex graphs. - Markus Chimani; Petr Hlinený; Petra Mutzel (Eur. J. Comb., 2012)

Upward Planarity Testing: A Computational Study. - Markus Chimani; Robert Zeranski (GD, 2013)

Crossing number additivity over edge cuts. - Drago Bokal; Markus Chimani; Jesús Leaños (Eur. J. Comb., 2013)

2-InterConnected Facility Location: Specification, Complexity, and Exact Solutions. - Markus Chimani; Maria Kandyba; Maren Martens (Electron. Notes Discret. Math., 2013)

Exact Approaches to Multilevel Vertical Orderings. - Markus Chimani; Philipp Hungerländer (INFORMS J. Comput., 2013)

Multi-level Verticality Optimization: Concept, Strategies, and Drawing Scheme. - Markus Chimani; Philipp Hungerländer (J. Graph Algorithms Appl., 2013)

Crossings and Planarization. - Christoph Buchheim; Markus Chimani; Carsten Gutwenger; Michael Jünger; Petra Mutzel (Handbook of Graph Drawing and Visualization, 2013)

The Open Graph Drawing Framework (OGDF). - Markus Chimani; Carsten Gutwenger; Michael Jünger; Gunnar W. Klau; Karsten Klein 001; Petra Mutzel (Handbook of Graph Drawing and Visualization, 2013)

An Exact Approach to Upward Crossing Minimization. - Markus Chimani; Robert Zeranski (ALENEX, 2014)

Advances on Testing C-Planarity of Embedded Flat Clustered Graphs. - Markus Chimani; Giuseppe Di Battista; Fabrizio Frati; Karsten Klein 001 (GD, 2014)

How to eat a graph: computing selection sequences for the continuous generalization of road networks. - Markus Chimani; Thomas C. van Dijk; Jan-Henrik Haunert (SIGSPATIAL/GIS, 2014)

Steiner Tree 1.39-Approximation in Practice. - Stephan Beyer; Markus Chimani (MEMICS, 2014)

Computing the Stretch of an Embedded Graph. - Sergio Cabello; Markus Chimani; Petr Hlinený (SIAM J. Discret. Math., 2014)

The Influence of Preprocessing on Steiner Tree Approximations. - Stephan Beyer; Markus Chimani (COCOA, 2015)

Speedy Colorful Subtrees. - W. Timothy J. White; Stephan Beyer; Kai Dührkop; Markus Chimani; Sebastian Böcker (COCOON, 2015)

2-Layer Fan-Planarity: From Caterpillar to Stegosaurus. - Carla Binucci; Markus Chimani; Walter Didimo; Martin Gronemann; Karsten Klein 001; Jan Kratochvíl; Fabrizio Montecchiani; Ioannis G. Tollis (GD, 2015)

Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees. - Markus Chimani; Joachim Spoerhase (STACS, 2015)

Upward Planarity Testing in Practice: SAT Formulations and Comparative Study. - Markus Chimani; Robert Zeranski (ACM J. Exp. Algorithmics, 2015)

Hypergraph and Minor Crossing Number Problems. - Markus Chimani; Carsten Gutwenger (J. Graph Algorithms Appl., 2015)

Inserting Multiple Edges into a Planar Graph. - Markus Chimani; Petr Hlinený (SoCG, 2016)

An ILP-based Proof System for the Crossing Number Problem. - Markus Chimani; Tilo Wiedera (ESA, 2016)

Placing Arrows in Directed Graph Drawings. - Carla Binucci; Markus Chimani; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani (GD, 2016)

A Note on the Practicality of Maximal Planar Subgraph Algorithms. - Markus Chimani; Karsten Klein 001; Tilo Wiedera (GD, 2016)

Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem. - Markus Chimani; Ivo Hedtke; Tilo Wiedera (IWOCA, 2016)

A Practical Method for the Minimum Genus of a Graph: Models and Experiments. - Stephan Beyer; Markus Chimani; Ivo Hedtke; Michal Kotrbcík (SEA, 2016)

Planarisation and Crossing Minimisation. - Markus Chimani (Encyclopedia of Algorithms, 2016)

Planar L-Drawings of Directed Graphs. - Steven Chaplick; Markus Chimani; Sabine Cornelsen; Giordano Da Lozzo; Martin Nöllenburg; Maurizio Patrignani; Ioannis G. Tollis; Alexander Wolff 001 (GD, 2017)

Crossing Number for Graphs with Bounded Pathwidth. - Therese Biedl; Markus Chimani; Martin Derka; Petra Mutzel (ISAAC, 2017)

On the Maximum Crossing Number. - Markus Chimani; Stefan Felsner; Stephen G. Kobourov; Torsten Ueckerdt; Pavel Valtr 001; Alexander Wolff 001 (IWOCA, 2017)

Predictive Traffic Engineering with 2-Segment Routing Considering Requirements of a Carrier IP Network. - Timmy Schüller; Nils Aschenbruck; Markus Chimani; Martin Horneffer; Stefan Schnitter (LCN, 2017)

Traffic engineering using segment routing and considering requirements of a carrier IP network. - Timmy Schüller; Nils Aschenbruck; Markus Chimani; Martin Horneffer; Stefan Schnitter (Networking, 2017)

Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus. - Carla Binucci; Markus Chimani; Walter Didimo; Martin Gronemann; Karsten Klein 001; Jan Kratochvíl; Fabrizio Montecchiani; Ioannis G. Tollis (J. Graph Algorithms Appl., 2017)

Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast. - Markus Chimani; Tilo Wiedera (ESA, 2018)

Crossing Numbers and Stress of Random Graphs. - Markus Chimani; Hanna Döring; Matthias Reitzner (GD, 2018)

On the Practical Irrelevance of Metrics on Segment Routing Traffic Engineering optimization. - Timmy Schüller; Nils Aschenbruck; Markus Chimani; Martin Horneffer (LCN, 2018)

Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. - Markus Chimani; Ivo Hedtke; Tilo Wiedera (SEA, 2018)

Stronger ILPs for the Graph Genus Problem. - Markus Chimani; Tilo Wiedera (ESA, 2019)

Crossing Numbers of Beyond-Planar Graphs. - Markus Chimani; Philipp Kindermann; Fabrizio Montecchiani; Pavel Valtr 001 (GD, 2019)

Computing Stable Demers Cartograms. - Soeren Nickel; Max Sondag; Wouter Meulemans; Markus Chimani; Stephen G. Kobourov; Jaakko Peltonen; Martin Nöllenburg (GD, 2019)

Failure Resilient Traffic Engineering Using Segment Routing. - Timmy Schüller; Nils Aschenbruck; Markus Chimani; Martin Horneffer (LCN, 2019)

Cut Polytopes of Minor-free Graphs. - Markus Chimani; Martina Juhnke-Kubitzke; Alexander Nover; Tim Römer (CoRR, 2019)

Strong Steiner Tree Approximations in Practice. - Stephan Beyer; Markus Chimani (ACM J. Exp. Algorithmics, 2019)

Approximating Multiobjective Shortest Path in Practice. - Fritz Bökler; Markus Chimani (ALENEX, 2020)

A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs. - Stephan Beyer; Markus Chimani; Joachim Spoerhase (COCOON, 2020)

An Experimental Study of ILP Formulations for the Longest Induced Path Problem. - Fritz Bökler; Markus Chimani; Mirko H. Wagner; Tilo Wiedera (ISCO, 2020)

On the Bond Polytope. - Markus Chimani; Martina Juhnke-Kubitzke; Alexander Nover (CoRR, 2020)

Toroidal grid minors and stretch in embedded graphs. - Markus Chimani; Petr Hlinený; Gelasio Salazar (J. Comb. Theory, Ser. B, 2020)

Maximum Cut Parameterized by Crossing Number. - Markus Chimani; Christine Dahn; Martina Juhnke-Kubitzke; Nils M. Kriege; Petra Mutzel; Alexander Nover (J. Graph Algorithms Appl., 2020)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics. - Markus Chimani; Max Ilsen; Tilo Wiedera (GD, 2021)

Approximating Multistage Matching Problems. - Markus Chimani; Niklas Troost; Tilo Wiedera (IWOCA, 2021)

A General Approach to Approximate Multistage Subgraph Problems. - Markus Chimani; Niklas Troost; Tilo Wiedera (CoRR, 2021)

Failure Resiliency With Only a Few Tunnels - Enabling Segment Routing for Traffic Engineering. - Timmy Schüller; Nils Aschenbruck; Markus Chimani; Martin Horneffer (IEEE/ACM Trans. Netw., 2021)

Spanner Approximations in Practice. - Markus Chimani; Finn Stutzenstein (ESA, 2022)

Properties of Large 2-Crossing-Critical Graphs. - Drago Bokal; Markus Chimani; Alexander Nover; Jöran Schierbaum; Tobias Stolzmann; Mirko H. Wagner; Tilo Wiedera (J. Graph Algorithms Appl., 2022)

On the rectangular knapsack problem. - Fritz Bökler; Markus Chimani; Mirko H. Wagner (Math. Methods Oper. Res., 2022)

Capacity-Preserving Subgraphs of Directed Flow Networks. - Markus Chimani; Max Ilsen (IWOCA, 2023)

A general approximation for multistage subgraph problems. - Markus Chimani; Niklas Troost; Tilo Wiedera (LAGOS, 2023)

Green Traffic Engineering by Line Card Minimization. - Daniel Otten; Max Ilsen; Markus Chimani; Nils Aschenbruck (LCN, 2023)

Multistage Shortest Path: Instances and Practical Evaluation. - Markus Chimani; Niklas Troost (SAND, 2023)

Proceedings of the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023). - Michael A. Bekos; Markus Chimani (CoRR, 2023)

Exact Minimum Weight Spanners via Column Generation. - Fritz Bökler; Markus Chimani; Henning Jasper; Mirko H. Wagner (ESA, 2024)

The Price of Upwardness. - Patrizio Angelini; Therese Biedl; Markus Chimani; Sabine Cornelsen; Giordano Da Lozzo; Seok-Hee Hong 001; Giuseppe Liotta; Maurizio Patrignani; Sergey Pupyrev; Ignaz Rutter; Alexander Wolff 001 (GD, 2024)

Crossing Numbers of Beyond Planar Graphs Re-Revisited: A Framework Approach. - Markus Chimani; Torben Donzelmann; Nick Kloster; Melissa Koch; Jan-Jakob Völlering; Mirko H. Wagner (GD, 2024)

Graph-Drawing Supported Identification of Influential Students at Schools (Poster Abstract). - Markus Chimani; Lea Kröger; Juliane Liedtke; Jonah Mevert; Maor Shani; Maarten van Zalk (GD, 2024)

A Systematic Approach to Crossing Numbers of Cartesian Products with Paths. - Zayed Asiri; Ryan Burdett; Markus Chimani; Michael Haythorpe; Alex Newcombe; Mirko H. Wagner (CoRR, 2024)

On the Dominant of the Multicut Polytope. - Markus Chimani; Martina Juhnke; Alexander Nover (Discret. Comput. Geom., 2024)

Guest Editors' Foreword. - Michael A. Bekos; Markus Chimani (J. Graph Algorithms Appl., 2024)

Simple Approximations for General Spanner Problems. - Fritz Bökler; Markus Chimani; Henning Jasper (WAOA, 2025)

The Price of Upwardness. - Patrizio Angelini; Therese Biedl; Markus Chimani; Sabine Cornelsen; Giordano Da Lozzo; Seok-Hee Hong 001; Giuseppe Liotta; Maurizio Patrignani; Sergey Pupyrev; Ignaz Rutter (Discret. Math. Theor. Comput. Sci., 2025)

Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms. - Markus Chimani; Max Ilsen (Acta Informatica, 2025)

Traffic-Oblivious Multi-Commodity Flow Network Design. - Markus Chimani; Max Ilsen (CoRR, 2025)

On the Connected Blocks Polytope. - Justus Bruckamp; Markus Chimani; Martina Juhnke (Discret. Comput. Geom., 2025)

Correction: Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms. - Markus Chimani; Max Ilsen (Acta Informatica, 2025)