#### Filter Results:

- Full text PDF available (59)

#### Publication Year

2004

2017

- This year (6)
- Last 5 years (34)
- Last 10 years (66)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Markus Chimani, Carsten Gutwenger, Michael JÃ¼nger, Gunnar W. Klau, Karsten Klein, Petra Mutzel
- Handbook of Graph Drawing and Visualization
- 2013

Petra Mutzel TU Dortmund 15.

- Markus Chimani, Maria Kandyba, Petra Mutzel
- ESA
- 2007

We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this problem can beâ€¦ (More)

- Markus Chimani, Petra Mutzel, Bernd Zey
- IWOCA
- 2011

We propose a new algorithm that solves the Steiner tree problem on graphs with vertex set V to optimality in O(B tw+2 Â· tw Â· |V |) time, where tw is the graphâ€™s treewidth and the Bell number Bk isâ€¦ (More)

- Markus Chimani, Matthias Woste, Sebastian BÃ¶cker
- ALENEX
- 2011

Let S be a set of k strings over an alphabet Î£; each string has a length between ` and n. The Closest Substring Problem (CSSP) is to find a minimal integer d (and a corresponding string t of lengthâ€¦ (More)

- Christoph Buchheim, Markus Chimani, Carsten Gutwenger, Michael JÃ¼nger, Petra Mutzel
- Handbook of Graph Drawing and Visualization
- 2013

Petra Mutzel TU Dortmund 2.

- Markus Chimani, Michael JÃ¼nger, Michael Schulz
- 2008 IEEE Pacific Visualization Symposium
- 2008

We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossing number problem,â€¦ (More)

- Petr HlinenÃ½, Markus Chimani
- SODA
- 2010

The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an <i>O(n</i> log <i>n</i>) time constant factor approximationâ€¦ (More)

- Markus Chimani, Carsten Gutwenger, Petra Mutzel
- Electronic Notes in Discrete Mathematics
- 2007

Every drawing of a non-planar graph G in the plane induces a planarization, i.e., a planar graph obtained by replacing edge crossings with dummy vertices. In this paper, we consider the relationshipâ€¦ (More)

An upward drawing of a DAG <i>G</i> is a drawing of <i>G</i> in which all arcs are drawn as curves increasing monotonically in the vertical direction. In this article, we present a new approach forâ€¦ (More)

- Charles Rich, Candace L. Sidner, Neal Lesh, Andrew Garland, Shane Booth, Markus Chimani
- 25th IEEE International Conference on Distributedâ€¦
- 2005

Ordinary people already have great difficulty using the advanced features of digitally-operated household devices, and the problem is getting worse as more customization and programming features areâ€¦ (More)