- Full text PDF available (59)
- This year (6)
- Last 5 years (34)
- Last 10 years (66)
Journals and Conferences
Petra Mutzel TU Dortmund 15.
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)
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)
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)
Petra Mutzel TU Dortmund 2.
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)
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)
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)
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)