default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarkus Chimani
Person information
- affiliation: University of Osnabrück, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2009
[b1]Markus Chimani:
Computing crossing numbers. Dortmund University, Germany, 2009
Journal Articles
- 2023
- [j42]Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff:
Planar L-Drawings of Directed Graphs. Comput. Geom. Topol. 2(1): 7:1-7:15 (2023) - [j41]Markus Chimani, Max Ilsen
, Tilo Wiedera:
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics. J. Graph Algorithms Appl. 27(2): 71-94 (2023) - [j40]Markus Chimani, Petr Hlinený:
Inserting Multiple Edges into a Planar Graph. J. Graph Algorithms Appl. 27(6): 489-522 (2023) - 2022
- [j39]Markus Chimani, Niklas Troost, Tilo Wiedera:
Approximating Multistage Matching Problems. Algorithmica 84(8): 2135-2153 (2022) - [j38]Drago Bokal, Markus Chimani, Alexander Nover, Jöran Schierbaum, Tobias Stolzmann, Mirko H. Wagner, Tilo Wiedera:
Properties of Large 2-Crossing-Critical Graphs. J. Graph Algorithms Appl. 26(1): 111-147 (2022) - [j37]Fritz Bökler, Markus Chimani, Mirko H. Wagner:
On the rectangular knapsack problem. Math. Methods Oper. Res. 96(1): 149-160 (2022) - [j36]Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr:
Crossing numbers of beyond-planar graphs. Theor. Comput. Sci. 898: 44-49 (2022) - 2021
- [j35]Timmy Schüller, Nils Aschenbruck, Markus Chimani, Martin Horneffer:
Failure Resiliency With Only a Few Tunnels - Enabling Segment Routing for Traffic Engineering. IEEE/ACM Trans. Netw. 29(1): 262-274 (2021) - 2020
- [j34]Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel:
Crossing Number for Graphs with Bounded Pathwidth. Algorithmica 82(2): 355-384 (2020) - [j33]Markus Chimani, Petr Hlinený, Gelasio Salazar:
Toroidal grid minors and stretch in embedded graphs. J. Comb. Theory, Ser. B 140: 323-371 (2020) - [j32]Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils M. Kriege, Petra Mutzel, Alexander Nover:
Maximum Cut Parameterized by Crossing Number. J. Graph Algorithms Appl. 24(3): 155-170 (2020) - 2019
- [j31]Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein:
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs. Int. J. Found. Comput. Sci. 30(2): 197-230 (2019) - [j30]Stephan Beyer, Markus Chimani:
Strong Steiner Tree Approximations in Practice. ACM J. Exp. Algorithmics 24(1): 1.7:1-1.7:33 (2019) - [j29]Markus Chimani, Ivo Hedtke, Tilo Wiedera:
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. ACM J. Exp. Algorithmics 24(1): 2.1:1-2.1:21 (2019) - 2018
- [j28]Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff:
On the Maximum Crossing Number. J. Graph Algorithms Appl. 22(1): 67-87 (2018) - [j27]Timmy Schüller, Nils Aschenbruck, Markus Chimani, Martin Horneffer, Stefan Schnitter:
Traffic Engineering Using Segment Routing and Considering Requirements of a Carrier IP Network. IEEE/ACM Trans. Netw. 26(4): 1851-1864 (2018) - 2017
- [j26]Markus Chimani, Petr Hlinený:
A tighter insertion-based approximation of the crossing number. J. Comb. Optim. 33(4): 1183-1225 (2017) - [j25]Carla Binucci, Markus Chimani, Walter Didimo, Martin Gronemann, Karsten Klein, Jan Kratochvíl, Fabrizio Montecchiani, Ioannis G. Tollis:
Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus. J. Graph Algorithms Appl. 21(1): 81-102 (2017) - 2015
- [j24]Markus Chimani, Robert Zeranski:
Upward Planarity Testing in Practice: SAT Formulations and Comparative Study. ACM J. Exp. Algorithmics 20: 1.2:1.1-1.2:1.27 (2015) - [j23]Markus Chimani, Carsten Gutwenger:
Hypergraph and Minor Crossing Number Problems. J. Graph Algorithms Appl. 19(1): 191-222 (2015) - [j22]Markus Chimani, Joachim Spoerhase:
Approximating Spanning Trees with Few Branches. Theory Comput. Syst. 56(1): 181-196 (2015) - 2014
- [j21]Sergio Cabello, Markus Chimani, Petr Hlinený:
Computing the Stretch of an Embedded Graph. SIAM J. Discret. Math. 28(3): 1391-1401 (2014) - 2013
- [j20]Markus Chimani, Martin Derka, Petr Hlinený, Matej Klusácek:
How not to characterize planar-emulable graphs. Adv. Appl. Math. 50(1): 46-68 (2013) - [j19]Drago Bokal, Markus Chimani, Jesús Leaños:
Crossing number additivity over edge cuts. Eur. J. Comb. 34(6): 1010-1018 (2013) - [j18]Markus Chimani, Maria Kandyba, Maren Martens:
2-InterConnected Facility Location: Specification, Complexity, and Exact Solutions. Electron. Notes Discret. Math. 41: 21-28 (2013) - [j17]Markus Chimani, Philipp Hungerländer:
Exact Approaches to Multilevel Vertical Orderings. INFORMS J. Comput. 25(4): 611-624 (2013) - [j16]Markus Chimani, Philipp Hungerländer:
Multi-level Verticality Optimization: Concept, Strategies, and Drawing Scheme. J. Graph Algorithms Appl. 17(3): 329-362 (2013) - 2012
- [j15]Franziska Hufsky, Kai Dührkop, Florian Rasche, Markus Chimani, Sebastian Böcker:
Fast alignment of fragmentation trees. Bioinform. 28(12): 265-273 (2012) - [j14]Markus Chimani, Petr Hlinený, Petra Mutzel:
Vertex insertion approximates the crossing number of apex graphs. Eur. J. Comb. 33(3): 326-335 (2012) - [j13]Markus Chimani, Petra Mutzel, Bernd Zey:
Improved Steiner tree algorithms for bounded treewidth. J. Discrete Algorithms 16: 67-78 (2012) - [j12]Markus Chimani, Carsten Gutwenger:
Advances in the Planarization Method: Effective Multiple Edge Insertions. J. Graph Algorithms Appl. 16(3): 729-757 (2012) - 2011
- [j11]Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel:
An SDP approach to multi-level crossing minimization. ACM J. Exp. Algorithmics 17(1) (2011) - [j10]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong:
Upward Planarization Layout. J. Graph Algorithms Appl. 15(1): 127-155 (2011) - [j9]Markus Chimani:
Facets in the Crossing Number Polytope. SIAM J. Discret. Math. 25(1): 95-111 (2011) - 2010
- [j8]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong:
Layer-free upward crossing minimization. ACM J. Exp. Algorithmics 15 (2010) - [j7]Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
Orientation-based models for {0, 1, 2}-survivable network design: theory and practice. Math. Program. 124(1-2): 413-439 (2010) - 2009
- [j6]Markus Chimani, Carsten Gutwenger:
Non-planar core reduction of graphs. Discret. Math. 309(7): 1838-1855 (2009) - [j5]Markus Chimani, Carsten Gutwenger, Petra Mutzel:
Experiments on exact crossing minimization using column generation. ACM J. Exp. Algorithmics 14 (2009) - [j4]Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
Obtaining optimal k-cardinality trees fast. ACM J. Exp. Algorithmics 14 (2009) - 2008
- [j3]Christoph Buchheim, Markus Chimani, Dietmar Ebner, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher:
A branch-and-cut approach to the crossing number problem. Discret. Optim. 5(2): 373-388 (2008) - 2007
- [j2]Markus Chimani, Carsten Gutwenger, Petra Mutzel:
On the Minimum Cut of Planarizations. Electron. Notes Discret. Math. 28: 177-184 (2007) - 2006
- [j1]Charles Rich, Candace L. Sidner, Neal Lesh, Andrew Garland, Shane Booth, Markus Chimani:
DiamondHelp: a new interaction design for networked home appliances. Pers. Ubiquitous Comput. 10(2-3): 187-190 (2006)
Conference and Workshop Papers
- 2024
- [c75]Fritz Bökler, Markus Chimani, Henning Jasper, Mirko H. Wagner:
Exact Minimum Weight Spanners via Column Generation. ESA 2024: 30:1-30:17 - [c74]Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff:
The Price of Upwardness. GD 2024: 13:1-13:20 - [c73]Markus Chimani, Torben Donzelmann, Nick Kloster, Melissa Koch, Jan-Jakob Völlering, Mirko H. Wagner:
Crossing Numbers of Beyond Planar Graphs Re-Revisited: A Framework Approach. GD 2024: 33:1-33:17 - [c72]Markus Chimani, Lea Kröger, Juliane Liedtke, Jonah Mevert, Maor Shani, Maarten van Zalk:
Graph-Drawing Supported Identification of Influential Students at Schools (Poster Abstract). GD 2024: 44:1-44:3 - 2023
- [c71]Markus Chimani, Max Ilsen:
Capacity-Preserving Subgraphs of Directed Flow Networks. IWOCA 2023: 160-172 - [c70]Markus Chimani, Niklas Troost, Tilo Wiedera:
A general approximation for multistage subgraph problems. LAGOS 2023: 334-342 - [c69]Daniel Otten, Max Ilsen, Markus Chimani, Nils Aschenbruck:
Green Traffic Engineering by Line Card Minimization. LCN 2023: 1-8 - [c68]Markus Chimani, Niklas Troost:
Multistage Shortest Path: Instances and Practical Evaluation. SAND 2023: 14:1-14:19 - 2022
- [c67]Markus Chimani, Finn Stutzenstein:
Spanner Approximations in Practice. ESA 2022: 37:1-37:15 - 2021
- [c66]Markus Chimani, Max Ilsen, Tilo Wiedera:
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics. GD 2021: 41-56 - [c65]Markus Chimani, Niklas Troost, Tilo Wiedera:
Approximating Multistage Matching Problems. IWOCA 2021: 558-570 - 2020
- [c64]Fritz Bökler, Markus Chimani:
Approximating Multiobjective Shortest Path in Practice. ALENEX 2020: 120-133 - [c63]Stephan Beyer, Markus Chimani, Joachim Spoerhase:
A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs. COCOON 2020: 347-359 - [c62]Fritz Bökler, Markus Chimani, Mirko H. Wagner, Tilo Wiedera:
An Experimental Study of ILP Formulations for the Longest Induced Path Problem. ISCO 2020: 89-101 - 2019
- [c61]Markus Chimani, Tilo Wiedera:
Stronger ILPs for the Graph Genus Problem. ESA 2019: 30:1-30:15 - [c60]Soeren Nickel, Max Sondag, Wouter Meulemans, Markus Chimani, Stephen G. Kobourov, Jaakko Peltonen, Martin Nöllenburg:
Computing Stable Demers Cartograms. GD 2019: 46-60 - [c59]Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr:
Crossing Numbers of Beyond-Planar Graphs. GD 2019: 78-86 - [c58]Timmy Schüller, Nils Aschenbruck, Markus Chimani, Martin Horneffer:
Failure Resilient Traffic Engineering Using Segment Routing. LCN 2019: 422-429 - 2018
- [c57]Markus Chimani, Tilo Wiedera:
Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast. ESA 2018: 19:1-19:14 - [c56]Markus Chimani, Hanna Döring, Matthias Reitzner:
Crossing Numbers and Stress of Random Graphs. GD 2018: 255-268 - [c55]Timmy Schüller, Nils Aschenbruck, Markus Chimani, Martin Horneffer:
On the Practical Irrelevance of Metrics on Segment Routing Traffic Engineering optimization. LCN 2018: 640-647 - [c54]Markus Chimani, Ivo Hedtke, Tilo Wiedera:
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. SEA 2018: 22:1-22:15 - 2017
- [c53]Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff:
Planar L-Drawings of Directed Graphs. GD 2017: 465-478 - [c52]Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel:
Crossing Number for Graphs with Bounded~Pathwidth. ISAAC 2017: 13:1-13:13 - [c51]Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff:
On the Maximum Crossing Number. IWOCA 2017: 61-74 - [c50]Timmy Schüller, Nils Aschenbruck, Markus Chimani, Martin Horneffer, Stefan Schnitter:
Predictive Traffic Engineering with 2-Segment Routing Considering Requirements of a Carrier IP Network. LCN 2017: 667-675 - [c49]Timmy Schüller, Nils Aschenbruck, Markus Chimani, Martin Horneffer, Stefan Schnitter:
Traffic engineering using segment routing and considering requirements of a carrier IP network. Networking 2017: 1-9 - 2016
- [c48]Markus Chimani, Petr Hlinený:
Inserting Multiple Edges into a Planar Graph. SoCG 2016: 30:1-30:15 - [c47]Markus Chimani, Tilo Wiedera:
An ILP-based Proof System for the Crossing Number Problem. ESA 2016: 29:1-29:13 - [c46]Carla Binucci, Markus Chimani, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Placing Arrows in Directed Graph Drawings. GD 2016: 44-51 - [c45]Markus Chimani, Karsten Klein, Tilo Wiedera:
A Note on the Practicality of Maximal Planar Subgraph Algorithms. GD 2016: 357-364 - [c44]Markus Chimani, Ivo Hedtke, Tilo Wiedera:
Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem. IWOCA 2016: 334-346 - [c43]Stephan Beyer, Markus Chimani, Ivo Hedtke, Michal Kotrbcík:
A Practical Method for the Minimum Genus of a Graph: Models and Experiments. SEA 2016: 75-88 - 2015
- [c42]Stephan Beyer, Markus Chimani:
The Influence of Preprocessing on Steiner Tree Approximations. COCOA 2015: 601-616 - [c41]W. Timothy J. White, Stephan Beyer, Kai Dührkop, Markus Chimani, Sebastian Böcker:
Speedy Colorful Subtrees. COCOON 2015: 310-322 - [c40]Carla Binucci, Markus Chimani, Walter Didimo, Martin Gronemann, Karsten Klein, Jan Kratochvíl, Fabrizio Montecchiani, Ioannis G. Tollis:
2-Layer Fan-Planarity: From Caterpillar to Stegosaurus. GD 2015: 281-294 - [c39]Markus Chimani, Joachim Spoerhase:
Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees. STACS 2015: 238-248 - 2014
- [c38]Markus Chimani, Robert Zeranski:
An Exact Approach to Upward Crossing Minimization. ALENEX 2014: 73-85 - [c37]Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein:
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs. GD 2014: 416-427 - [c36]Markus Chimani, Thomas C. van Dijk, Jan-Henrik Haunert:
How to eat a graph: computing selection sequences for the continuous generalization of road networks. SIGSPATIAL/GIS 2014: 243-252 - [c35]Stephan Beyer, Markus Chimani:
Steiner Tree 1.39-Approximation in Practice. MEMICS 2014: 60-72 - 2013
- [c34]Markus Chimani, Robert Zeranski:
Upward Planarity Testing: A Computational Study. GD 2013: 13-24 - 2012
- [c33]Markus Chimani, Karsten Klein:
Shrinking the Search Space for Clustered Planarity. GD 2012: 90-101 - [c32]Markus Chimani, Robert Zeranski:
Upward Planarity Testing via SAT. GD 2012: 248-259 - [c31]Markus Chimani, Joachim Spoerhase:
Approximating Spanning Trees with Few Branches. WAOA 2012: 30-41 - 2011
- [c30]Markus Chimani, Matthias Woste, Sebastian Böcker:
A Closer Look at the Closest String and Closest Substring Problem. ALENEX 2011: 13-24 - [c29]Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel:
An SDP Approach to Multi-level Crossing Minimization. ALENEX 2011: 116-126 - [c28]Markus Chimani, Carsten Gutwenger:
Advances in the Planarization Method: Effective Multiple Edge Insertions. GD 2011: 87-98 - [c27]Markus Chimani, Petr Hlinený:
A Tighter Insertion-Based Approximation of the Crossing Number. ICALP (1) 2011: 122-134 - [c26]Markus Chimani, Matthias Woste:
Contraction-Based Steiner Tree Approximations in Practice. ISAAC 2011: 40-49 - [c25]Markus Chimani, Martin Derka, Petr Hlinený, Matej Klusácek:
How Not to Characterize Planar-Emulable Graphs. IWOCA 2011: 106-120 - [c24]Markus Chimani, Petra Mutzel, Bernd Zey:
Improved Steiner Tree Algorithms for Bounded Treewidth. IWOCA 2011: 374-386 - 2010
- [c23]Markus Chimani, Sven Rahmann, Sebastian Böcker:
Exact ILP solutions for phylogenetic minimum flip problems. BCB 2010: 147-153 - [c22]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Miro Spönemann, Hoi-Ming Wong:
Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints. GD 2010: 141-152 - [c21]Immanuel M. Bomze, Markus Chimani, Michael Jünger, Ivana Ljubic, Petra Mutzel, Bernd Zey:
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut. ISAAC (1) 2010: 427-439 - [c20]Petr Hlinený, Markus Chimani:
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. SODA 2010: 918-927 - 2009
- [c19]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong:
Upward Planarization Layout. GD 2009: 94-106 - [c18]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Christian Wolf:
Inserting a vertex into a planar graph. SODA 2009: 375-383 - 2008
- [c17]Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
Obtaining Optimal k-Cardinality Trees Fast. ALENEX 2008: 27-36 - [c16]Markus Chimani, Michael Jünger, Michael Schulz:
Crossing Minimization meets Simultaneous Drawing. PacificVis 2008: 33-40 - [c15]Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
Strong Formulations for 2-Node-Connected Steiner Network Problems. COCOA 2008: 190-200 - [c14]Markus Chimani, Petra Mutzel, Immanuel M. Bomze:
A New Approach to Exact Crossing Minimization. ESA 2008: 284-296 - [c13]Markus Chimani, Carsten Gutwenger, Mathias Jansen, Karsten Klein, Petra Mutzel:
Computing Maximum C-Planar Subgraphs. GD 2008: 114-120 - [c12]Markus Chimani, Petr Hlinený, Petra Mutzel:
Approximating the Crossing Number of Apex Graphs. GD 2008: 432-434 - [c11]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong:
Layer-Free Upward Crossing Minimization. WEA 2008: 55-68 - 2007
- [c10]Markus Chimani, Maria Kandyba, Petra Mutzel:
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks. ESA 2007: 681-692 - [c9]Markus Chimani, Petra Mutzel, Jens M. Schmidt:
Efficient Extraction of Multiple Kuratowski Subdivisions. GD 2007: 159-170 - [c8]Markus Chimani, Maria Kandyba, Mike Preuss:
Hybrid Numerical Optimization for Combinatorial Network Problems. Hybrid Metaheuristics 2007: 185-200 - [c7]Markus Chimani, Carsten Gutwenger:
Algorithms for the Hypergraph and the Minor Crossing Number Problems. ISAAC 2007: 184-195 - 2006
- [c6]Markus Chimani, Carsten Gutwenger, Petra Mutzel:
Experiments on Exact Crossing Minimization Using Column Generation. WEA 2006: 303-315 - 2005
- [c5]Charles Rich, Candace L. Sidner, Neal Lesh, Andrew Garland, Shane Booth, Markus Chimani:
DiamondHelp: A Collaborative Task Guidance Framework for Complex Devices. AAAI 2005: 1700-1701 - [c4]Markus Chimani, Neal Lesh, Michael Mitzenmacher, Candy L. Sidner, Hidetoshi Tanaka:
A Case Study in Large-Scale Interactive Optimization. Artificial Intelligence and Applications 2005: 24-29 - [c3]Carsten Gutwenger, Markus Chimani:
Non-planar Core Reduction of Graphs. GD 2005: 223-234 - [c2]Charles Rich, Candy L. Sidner, Neal Lesh, Andrew Garland, Shane Booth, Markus Chimani:
DiamondHelp: A Collaborative Interface Framework for Networked Home Appliances. ICDCS Workshops 2005: 514-519 - [c1]Markus Chimani, Gunnar W. Klau, René Weiskircher:
Non-planar Orthogonal Drawings with Fixed Topology. SOFSEM 2005: 96-105
Parts in Books or Collections
- 2010
- [p2]Markus Chimani, Karsten Klein:
Algorithm Engineering: Concepts and Practice. Experimental Methods for the Analysis of Optimization Algorithms 2010: 131-158 - 2008
- [p1]Markus Chimani:
Computing Crossing Numbers: Berechnen von Kreuzungszahlen. Ausgezeichnete Informatikdissertationen 2008: 41-50
Editorship
- 2023
- [e2]Michael A. Bekos, Markus Chimani:
Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part I. Lecture Notes in Computer Science 14465, Springer 2023, ISBN 978-3-031-49271-6 [contents] - [e1]Michael A. Bekos, Markus Chimani:
Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II. Lecture Notes in Computer Science 14466, Springer 2023, ISBN 978-3-031-49274-7 [contents]
Reference Works
- 2016
- [r3]Markus Chimani:
Planarisation and Crossing Minimisation. Encyclopedia of Algorithms 2016: 1579-1584 - 2013
- [r2]Christoph Buchheim, Markus Chimani, Carsten Gutwenger, Michael Jünger, Petra Mutzel:
Crossings and Planarization. Handbook of Graph Drawing and Visualization 2013: 43-85 - [r1]Markus Chimani, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Karsten Klein, Petra Mutzel:
The Open Graph Drawing Framework (OGDF). Handbook of Graph Drawing and Visualization 2013: 543-569
Informal and Other Publications
- 2024
- [i34]Fritz Bökler, Markus Chimani, Henning Jasper, Mirko H. Wagner:
Exact Minimum Weight Spanners via Column Generation. CoRR abs/2406.19164 (2024) - [i33]Markus Chimani, Torben Donzelmann, Nick Kloster, Melissa Koch, Jan-Jakob Völlering, Mirko H. Wagner:
Crossing Numbers of Beyond Planar Graphs Re-revisited: A Framework Approach. CoRR abs/2407.05057 (2024) - [i32]Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff:
The Price of Upwardness. CoRR abs/2409.01475 (2024) - [i31]Zayed Asiri, Ryan Burdett, Markus Chimani, Michael Haythorpe, Alex Newcombe, Mirko H. Wagner:
A Systematic Approach to Crossing Numbers of Cartesian Products with Paths. CoRR abs/2409.06755 (2024) - 2023
- [i30]Markus Chimani, Max Ilsen:
Capacity-Preserving Subgraphs of Directed Flow Networks. CoRR abs/2303.17274 (2023) - [i29]Daniel Otten, Max Ilsen, Markus Chimani, Nils Aschenbruck:
Green Traffic Engineering by Line Card Minimization. CoRR abs/2306.00726 (2023) - [i28]Michael A. Bekos, Markus Chimani:
Proceedings of the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023). CoRR abs/2309.07166 (2023) - 2021
- [i27]Markus Chimani, Finn Stutzenstein:
Spanner Approximations in Practice. CoRR abs/2107.02018 (2021) - [i26]Markus Chimani, Niklas Troost, Tilo Wiedera:
A General Approach to Approximate Multistage Subgraph Problems. CoRR abs/2107.02581 (2021) - [i25]Markus Chimani, Max Ilsen, Tilo Wiedera:
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics. CoRR abs/2108.11443 (2021) - [i24]Markus Chimani, Martina Juhnke-Kubitzke, Alexander Nover:
On the Dominant of the Multicut Polytope. CoRR abs/2112.01095 (2021) - [i23]Drago Bokal, Markus Chimani, Alexander Nover, Jöran Schierbaum, Tobias Stolzmann, Mirko H. Wagner, Tilo Wiedera:
Properties of Large 2-Crossing-Critical Graphs. CoRR abs/2112.04854 (2021) - 2020
- [i22]Markus Chimani, Niklas Troost, Tilo Wiedera:
Approximating Multistage Matching Problems. CoRR abs/2002.06887 (2020) - [i21]Markus Chimani, Fritz Bökler, Mirko H. Wagner, Tilo Wiedera:
An Experimental Study of ILP Formulations for the Longest Induced Path Problem. CoRR abs/2002.07012 (2020) - [i20]Markus Chimani, Martina Juhnke-Kubitzke, Alexander Nover:
On the Bond Polytope. CoRR abs/2012.06288 (2020) - 2019
- [i19]Markus Chimani, Martina Juhnke-Kubitzke, Alexander Nover, Tim Römer:
Cut Polytopes of Minor-free Graphs. CoRR abs/1903.01817 (2019) - [i18]Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils M. Kriege, Petra Mutzel, Alexander Nover:
Maximum Cut Parameterized by Crossing Number. CoRR abs/1903.06061 (2019) - [i17]Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr:
Crossing Numbers of Beyond-Planar Graphs. CoRR abs/1908.03153 (2019) - [i16]Soeren Nickel, Max Sondag, Wouter Meulemans, Markus Chimani, Stephen G. Kobourov, Jaakko Peltonen, Martin Nöllenburg:
Computing Stable Demers Cartograms. CoRR abs/1908.07291 (2019) - 2018
- [i15]Markus Chimani, Ivo Hedtke, Tilo Wiedera:
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. CoRR abs/1804.07143 (2018) - [i14]Markus Chimani, Tilo Wiedera:
Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast. CoRR abs/1806.08283 (2018) - [i13]Stephan Beyer, Markus Chimani, Joachim Spoerhase:
A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs. CoRR abs/1808.04651 (2018) - [i12]Markus Chimani, Hanna Döring, Matthias Reitzner:
Crossing Numbers and Stress of Random Graphs. CoRR abs/1808.07558 (2018) - 2017
- [i11]Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff:
On the Maximum Crossing Number. CoRR abs/1705.05176 (2017) - [i10]Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff:
Planar L-Drawings of Directed Graphs. CoRR abs/1708.09107 (2017) - 2016
- [i9]Markus Chimani, Karsten Klein, Tilo Wiedera:
A Note on the Practicality of Maximal Planar Subgraph Algorithms. CoRR abs/1608.07505 (2016) - [i8]Carla Binucci, Markus Chimani, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Placing Arrows in Directed Graph Drawings. CoRR abs/1608.08505 (2016) - [i7]Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel:
Crossing Number for Graphs With Bounded Pathwidth. CoRR abs/1612.03854 (2016) - 2015
- [i6]Markus Chimani, Petr Hlinený:
Inserting Multiple Edges into a Planar Graph. CoRR abs/1509.07952 (2015) - 2014
- [i5]Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein:
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs. CoRR abs/1408.2595 (2014) - [i4]Markus Chimani, Joachim Spoerhase:
Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees. CoRR abs/1409.6551 (2014) - [i3]Stephan Beyer, Markus Chimani:
Strong Steiner Tree Approximations in Practice. CoRR abs/1409.8318 (2014) - 2011
- [i2]Markus Chimani, Petr Hlinený:
A Tighter Insertion-based Approximation of the Crossing Number. CoRR abs/1104.5039 (2011) - [i1]Markus Chimani, Martin Derka, Petr Hlinený, Matej Klusácek:
How Not to Characterize Planar-emulable Graphs. CoRR abs/1107.0176 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
