The directed Hausdorff distance between imprecise point sets (2009)
Knauer, Christian, Löffler, Maarten, Scherfenberg, Marc, Wolle, Thomas
We consider the directed Hausdorff distance between point sets in the plane, where one or both point sets consist of imprecise points. An imprecise point is modelled by a disc given by its centre and...
Notes on large angle crossing graphs (2009)
Dujmovic, Vida, Gudmundsson, Joachim, Morin, Pat, Wolle, Thomas
A graph G is an a-angle crossing (aAC) graph if every pair of crossing edges in G intersect at an angle of at least a. The concept of right angle crossing (RAC) graphs (a=Pi/2) was recently...
(met een samenvatting in het Nederlands) Proefschrift ter verkrijging van de graad van doctor aan de Universiteit Utrecht op gezag van de Rector Magnificus, Prof. Dr. W. H. Gispen, ingevolge het...
generalized geometric problems (2008)
Hans Bodlaender, Corinne Feremans, Er Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle
the minimum corridor connection problem and other
Konrad-Zuse-Zentrum fu¨r Informationstechnik Berlin (2008)
Thomas Wolle, Hans L. Bodlaender, Degree-based Treewidth, Lower Bounds, Degree-based Treewidth, ...
Abstract. Every lower bound for treewidth can be extended by taking the maximum of the lower bound over all subgraphs or minors. This extension is shown to be a very vital idea for improving...
www.cs.uu.nl A Framework for Network Reliability Problems on Graphs of Bounded Treewidth ⋆ (2008)
Abstract. In this paper, we consider problems related to the network reliability problem restricted to graphs of bounded treewidth. We consider undirected simple graphs with a rational number in [0,...
www.cs.uu.nl A Note on Edge Contraction (2008)
Thomas Wolle, Hans L. Bodlaender, Thomas Wolle, Hans L. Bodlaender
Abstract. Contracting an edge is the operation that introduces a new vertex that is adjacent to all vertices the endpoints of the contracted edge are adjacent to, and then deletes the endpoints of...
Thomas Wolle, Hans L. Bodlaender, Degree-based Treewidth, Lower Bounds, ...
Abstract. Every lower bound for treewidth can be extended by taking the maximum of the lower bound over all subgraphs or minors. This extension is shown to be a very vital idea for improving...
www.cs.uu.nl A Note on Contraction Degeneracy ⋆ (2008)
Thomas Wolle, Hans L. Bodlaender, Thomas Wolle, Hans L. Bodlaender
Abstract. The parameter contraction degeneracy — the maximum minimum degree over all minors of a graph — is a treewidth lower bound and was first defined in [3]. In experiments it was shown that...
Treewidth Lower Bounds, Hans L. Bodlaender, Thomas Wolle, Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all subgraphs of the...
Marc Benkert, Bojan Djordjevic, Joachim Gudmundsson, Thomas Wolle
Abstract. Widespread availability of location aware devices (such as GPS receivers) promotes capture of detailed movement trajectories of people, animals, vehicles and other moving objects, opening...
Journal of Graph Algorithms and Applications (2006)
Http Jgaa Info, Treewidth Lower Bounds, Hans L. Bodlaender, Thomas Wolle
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all subgraphs of the...
Reporting flock patterns (2006)
Marc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle
Abstract. Data representing moving objects is rapidly getting more available, especially in the area of wildlife GPS tracking. It is a central belief that information is hidden in large data sets in...
Reporting flock patterns (2006)
Marc Benkert, Joachim Gudmundsson, Florian Huebner, Thomas Wolle
Data representing moving objects is rapidly getting more available, especially in the area of wildlife GPS tracking. It is a central belief that information is hidden in large data sets in the form...
Reporting flock patterns (2006)
Marc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle
Abstract. Data representing moving objects is rapidly getting more available, especially in the area of wildlife GPS tracking. It is a central belief that information is hidden in large data sets in...
On the minimum corridor connection and other generalized geometric problems (2006)
Bodlaender, Hans L., Feremans, Corinne, Grigoriev, Alexander, Penninkx, Eelko, Sitters, Rene, Wolle, Thomas, ...
Computational aspects of treewidth : Lower bounds and network reliability (2005)
Good treewidth lower bounds can be used in branch-and-bound methods. The better and faster the bounds, the faster the branch-and-bound algorithm. They are also useful to estimate the running time of...
Contraction Degeneracy on Cographs (2004)
Hans L. Bodlaender, Hans L. Bodlaender, Thomas Wolle, Thomas Wolle
The contraction degeneracy of a graph G is the maximum minimum degree of G # over all minors G # of G. The corresponding decision problem is known to be NP -complete.
Thomas Wolle, Arie Koster Hans, Hans L. Bodlaender, Thomas Wolle, Hans L. Bodlaender
The parameter contraction degeneracy --- the maximum minimum degree over all minors of a graph --- is a treewidth lower bound and was first defined in [3]. In experiments it was shown that this lower...
Thomas Wolle and Hans L. Bodlaender (2004)
Thomas Wolle, Hans L. Bodlaender, Thomas Wolle, Hans L. Bodlaender
Contracting an edge is the operation that introduces a new vertex that is adjacent to all vertices the endpoints of the contracted edge are adjacent to, and then deletes the endpoints of this edge...
Thomas Wolle Hans, Hans L. Bodlaender, Degree-based Treewidth, Lower Bounds, ...
Every lower bound for treewidth can be extended by taking the maximum of the lower bound over all subgraphs or minors. This extension is shown to be a very vital idea for improving treewidth lower...
Contraction and Treewidth Lower Bounds (2004)
Hans Bodlaender Arie, Treewidth Lower Bounds, Hans L. Bodlaender, Thomas Wolle, Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all subgraphs of the...
Contraction degeneracy on cographs (2004)
Hans L. Bodlaender, Hans L. Bodlaender, Thomas Wolle, Thomas Wolle
Abstract. The contraction degeneracy of a graph G is the maximum minimum degree of G ′ over all minors G ′ of G. The corresponding decision problem is known to be NP-complete. In this paper, we...
Contraction and treewidth lower bounds (2004)
Hans L. Bodlaender, Thomas Wolle, Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all subgraphs of the...
Hans L. Bodlaender, Hans L. Bodlaender, Thomas Wolle, Thomas Wolle
Abstract. Let be given an undirected, simple graph G = (V, E). We associate to each vertex a number in [0, 1]- its reliability, i.e. the probability that it does not fail. Furthermore, let a set S V...
Hans L. Bodlaender, Hans L. Bodlaender, Thomas Wolle, Thomas Wolle
Abstract. Let be given an undirected, simple graph G = (V, E). We associate to each vertex a number in [0, 1]- its reliability, i.e. the probability that it does not fail. Furthermore, let a set S...
A Framework for Network Reliability Problems on Graphs of Bounded Treewidth (2003)
In this paper, we consider problems related to the network reliability problem restricted to graphs of bounded treewidth. We consider undirected simple graphs with a rational number in [0, 1]...