97 citations · 229 across the 33 of their papers we have counts for
6 papers · 2 filters
Graph Clustering with Surprise: Complexity and Exact Solutions
Tobias Fleck, Andrea Kappes, Dorothea Wagner
Clustering graphs based on a comparison of the number of links within clusters and the expected value of this quantity in a random graph has gained a lot of attention and popularit…
Dynamic Gomory-Hu Tree Construction -- fast and simple
Tanja Hartmann, Dorothea Wagner
A cut tree (or Gomory-Hu tree) of an undirected weighted graph G=(V,E) encodes a minimum s-t-cut for each vertex pair {s,t} \subseteq V and can be iteratively constructed by n-1 ma…
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem
Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter +1
We explore the machine-minimizing job scheduling problem, which has a rich history in the line of research, under an online setting. We consider systems with arbitrary job arrival…
Hierarchies of Predominantly Connected Communities
Michael Hamann, Tanja Hartmann, Dorothea Wagner
We consider communities whose vertices are predominantly connected, i.e., the vertices in each community are stronger connected to other community members of the same community tha…
Online Power-Managing Strategy with Hard Real-Time Guarantees
Jian-Jia Chen, Mong-Jen Kao, D. T. Lee +2
We consider the problem of online dynamic power management that provides hard real-time guarantees. In this problem, each of the given jobs is associated with an arrival time, a de…
Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch
Mong-Jen Kao, Der-Tsai Lee, Dorothea Wagner
We study the problem of how well a tree metric is able to preserve the sum of pairwise distances of an arbitrary metric. This problem is closely related to low-stretch metric embed…