Markus Chimani und Algorithms - Info zur Person

(1 - 15 von 27

)

17th International Symposium on Experimental Algorithms (SEA 2018) -...

cs.gssi.it

SEA 2018

Experimental Algorithms: 5th International Workshop, WEA 2006, ...books.google.com.au › books

books.google.com.au

Experiments on Exact Crossing Minimization Using Column Generation Markus Chimani, Carsten Gutwenger, and Petra Mutzel Department of Computer Science, ...

Experimental Algorithms: 5th International Workshop, WEA 2006, Cala...

books.google.co.uk

This book constitutes the refereed proceedings of the 5th International Workshop on Experimental and Efficient Algorithms, WEA 2006, held in Menorca, Spain,...

Experimental Methods for the Analysis of Optimization Algorithms

books.google.co.uk

Chapter 6 Algorithm Engineering: Concepts and Practice Markus Chimani and Karsten Klein Abstract Over the last years the term algorithm engineering has ...

Graph Layout Support for Model-Driven Engineering - Miro Spönemann -...

books.google.de

Markus Chimani and Carsten Gutwenger. Algorithms ... Markus Chimani, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Karsten Klein, and Petra Mutzel.

[ ] Exact Algorithms for the Maximum Planar Subgraph...

arxiv.org

Authors: Markus Chimani, Ivo Hedtke, Tilo Wiedera. (Submitted on 19 Apr 2018). Abstract: Given a graph , the NP-hard Maximum Planar Subgraph problem asks ...

Döring, Hanna - Universität Osnabrück

www.mathematik.uni-osnabrueck.de

· Crossing Numbers and Stress of Random Graphs, with Markus Chimani and Matthias Reitzner, In Proceedings 26th International Symposium, GD 2018, Barcelona, Spainavailable here Fluctuations in a general preferential attachment model via Stein's method, with Carina Betken and Marcel Ortgiese , Random Structures & algorithms,

Algorithms and Characterizations for 2-Layer Fan-planarity ...kops.uni-konstanz.de › handle

kops.uni-konstanz.de

BINUCCI, Carla, Markus CHIMANI, Walter DIDIMO, Martin GRONEMANN, Karsten KLEIN, Jan KRATOCHVÍL, Fabrizio MONTECCHIANI, ...

Improved Steiner Tree Algorithms for Bounded Treewidth | SpringerLink

link.springer.com

We propose a new algorithm that solves the Steiner tree problem on graphs with vertex set V to optimality in [equation] time, where [equation] is the graph’s...

KIT - ITI Algorithmik - Veröffentlichungen

i11www.iti.kit.edu

On the Maximum Crossing Number. Journal of Graph Algorithms and Applications, 22(1):67–87, January Joint work with Markus Chimani, Stefan Felsner, Stephen G. …

dblp: A Note on the Practicality of Maximal Planar Subgraph...

136.199.55.186

Bibliographic details on A Note on the Practicality of Maximal Planar Subgraph Algorithms.

Journal of Graph Algorithms and Applicationsjgaa.info › getPaper

jgaa.info

DOI: jgaa Multi-level Verticality Optimization: Concept, Strategies, and Drawing Scheme. Markus Chimani and Philipp Hungerländer.

staff:beyer [Theoretical Computer Science / Theoretische Informatik]

tcs.informatik.uos.de

Stephan Beyer, Markus Chimani, Ivo Hedtke, Michal Kotrbčík. A Practical Method for the Minimum Genus of a Graph: Models and Experiments. 15th International Symposium on Experimental Algorithms (SEA 2016), LNCS 9685: 75–88, Stephan Beyer, Markus Chimani.