| 2013 | ||
|---|---|---|
| j16 | Drago Bokal, Markus Chimani, Jesús Leaños: Crossing number additivity over edge cuts. Eur. J. Comb. 34(6): 1010-1018 (2013) | |
| 2012 | ||
| j15 | Franziska Hufsky, Kai Dührkop, Florian Rasche, Markus Chimani, Sebastian Böcker: Fast alignment of fragmentation trees. Bioinformatics 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) | |
| c33 | Markus Chimani, Karsten Klein: Shrinking the Search Space for Clustered Planarity. Graph Drawing 2012: 90-101 | |
| c32 | ||
| 2011 | ||
| j11 | Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel: An SDP approach to multi-level crossing minimization. ACM Journal of Experimental 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 | ||
| c31 | Markus Chimani, Matthias Woste, Sebastian Böcker: A Closer Look at the Closest String and Closest Substring Problem. ALENEX 2011: 13-24 | |
| c30 | Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel: An SDP Approach to Multi-level Crossing Minimization. ALENEX 2011: 116-126 | |
| c29 | Markus Chimani, Carsten Gutwenger: Advances in the Planarization Method: Effective Multiple Edge Insertions. Graph Drawing 2011: 87-98 | |
| c28 | Markus Chimani, Petr Hlinený: A Tighter Insertion-Based Approximation of the Crossing Number. ICALP (1) 2011: 122-134 | |
| c27 | Markus Chimani, Matthias Woste: Contraction-Based Steiner Tree Approximations in Practice. ISAAC 2011: 40-49 | |
| c26 | Markus Chimani, Martin Derka, Petr Hlinený, Matej Klusácek: How Not to Characterize Planar-Emulable Graphs. IWOCA 2011: 106-120 | |
| c25 | Markus Chimani, Petra Mutzel, Bernd Zey: Improved Steiner Tree Algorithms for Bounded Treewidth. IWOCA 2011: 374-386 | |
| 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) | |
| 2010 | ||
| j8 | Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong: Layer-free upward crossing minimization. ACM Journal of Experimental 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) | |
| c24 | Markus Chimani, Sven Rahmann, Sebastian Böcker: Exact ILP solutions for phylogenetic minimum flip problems. BCB 2010: 147-153 | |
| c23 | Markus Chimani, Carsten Gutwenger, Petra Mutzel, Miro Spönemann, Hoi-Ming Wong: Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints. Graph Drawing 2010: 141-152 | |
| c22 | 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 | |
| c21 | Petr Hlinený, Markus Chimani: Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. SODA 2010: 918-927 | |
| 2009 | ||
| j6 | Markus Chimani, Carsten Gutwenger: Non-planar core reduction of graphs. Discrete Mathematics 309(7): 1838-1855 (2009) | |
| j5 | Markus Chimani, Carsten Gutwenger, Petra Mutzel: Experiments on exact crossing minimization using column generation. ACM Journal of Experimental Algorithmics 14 (2009) | |
| j4 | Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel: Obtaining optimal k-cardinality trees fast. ACM Journal of Experimental Algorithmics 14 (2009) | |
| c20 | Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong: Upward Planarization Layout. Graph Drawing 2009: 94-106 | |
| c19 | Markus Chimani, Carsten Gutwenger, Petra Mutzel, Christian Wolf: Inserting a vertex into a planar graph. SODA 2009: 375-383 | |
| 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. Discrete Optimization 5(2): 373-388 (2008) | |
| c18 | Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel: Obtaining Optimal k-Cardinality Trees Fast. ALENEX 2008: 27-36 | |
| c17 | Markus Chimani, Michael Jünger, Michael Schulz: Crossing Minimization meets Simultaneous Drawing. PacificVis 2008: 33-40 | |
| c16 | Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel: Strong Formulations for 2-Node-Connected Steiner Network Problems. COCOA 2008: 190-200 | |
| c15 | Markus Chimani, Petra Mutzel, Immanuel M. Bomze: A New Approach to Exact Crossing Minimization. ESA 2008: 284-296 | |
| c14 | Markus Chimani, Carsten Gutwenger, Mathias Jansen, Karsten Klein, Petra Mutzel: Computing Maximum C-Planar Subgraphs. Graph Drawing 2008: 114-120 | |
| c13 | Markus Chimani, Petr Hlinený, Petra Mutzel: Approximating the Crossing Number of Apex Graphs. Graph Drawing 2008: 432-434 | |
| c12 | ||
| c11 | Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong: Layer-Free Upward Crossing Minimization. WEA 2008: 55-68 | |
| 2007 | ||
| j2 | Markus Chimani, Carsten Gutwenger, Petra Mutzel: On the Minimum Cut of Planarizations. Electronic Notes in Discrete Mathematics 28: 177-184 (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. Graph Drawing 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 | ||
| j1 | Charles Rich, Candace L. Sidner, Neal Lesh, Andrew Garland, Shane Booth, Markus Chimani: DiamondHelp: a new interaction design for networked home appliances. Personal and Ubiquitous Computing 10(2-3): 187-190 (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 | ||
| 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 | |
Data released under the ODC-BY 1.0 license — See also our legal information page