Vera Weil

activity

20152024

collaborators

4 papers

cs.DS2024

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center

Matthijs Ebbens, Nicole Funk, Jan Höckendorff +2

We study the $k$ -center problem in the context of individual fairness. Let $P$ be a set of $n$ points in a metric space and $r_{x}$ be the distance between $x \in P$ and its $\lceil…

cs.SI2022

Centrality Measures in multi-layer Knowledge Graphs

Jens Dörpinghaus, Vera Weil, Carsten Düing +1

Knowledge graphs play a central role for linking different data which leads to multiple layers. Thus, they are widely used in big data integration, especially for connecting data f…

cs.DM2016

A note on Reed's Conjecture about $ω$ , $Δ$ and $χ$ with respect to vertices of high degree

Vera Weil

Reed conjectured that for every graph, $χ \leq ⌈ \frac{Δ + ω + 1}{2} ⌉$ holds, where $χ$ , $ω$ and $Δ$ denote the chromatic number, clique number and maximum deg…

cs.DM2015

On bounding the difference between the maximum degree and the chromatic number by a constant

Oliver Schaudt, Vera Weil

We provide a finite forbidden induced subgraph characterization for the graph class $Υ_{k}$ , for all $k \in N_{0}$ , which is defined as follows. A graph is in $\varU…

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center

Centrality Measures in multi-layer Knowledge Graphs

A note on Reed's Conjecture about ω, Δ and χ with respect to vertices of high degree

On bounding the difference between the maximum degree and the chromatic number by a constant

A note on Reed's Conjecture about $ω$ , $Δ$ and $χ$ with respect to vertices of high degree