On Reed's Conjecture in Triangle-Free Graphs. - Vera Weil (CTW, 2010)

Graphs in Which the Difference of the Maximum Clique Number and the Maximum Degree Is Bounded by a Constant. - Oliver Schaudt; Vera Weil (CTW, 2012)

On the separability of graphs. - Oliver Schaudt; Rainer Schrader; Vera Weil (Discret. Math., 2013)

On Bounding the Difference of the Maximum Degree and the Clique Number. - Oliver Schaudt; Vera Weil (Graphs Comb., 2015)

On cliques, colorings, and the maximum degree in graphs. - Vera Sharon Weil (Verlag Dr. Hut, 2015)

A note on Reed's Conjecture about $ω$, $Δ$ and $χ$ with respect to vertices of high degree. - Vera Weil (CoRR, 2016)

On bounding the difference between the maximum degree and the chromatic number by a constant. - Vera Weil; Oliver Schaudt (Discret. Appl. Math., 2017)

A Minimum Set-Cover Problem with several constraints. - Jens Dörpinghaus; Carsten Düing; Vera Weil (FedCSIS, 2019)

An efficient approach towards the generation and analysis of interoperable clinical data in a knowledge graph. - Jens Dörpinghaus; Sebastian Schaaf; Vera Weil; Tobias Hübenthal (FedCSIS, 2021)

Analyzing longitudinal Data in Knowledge Graphs utilizing shrinking pseudo-triangles. - Jens Dörpinghaus; Vera Weil; Johanna Binnewitt (FedCSIS, 2022)

Centrality Measures in multi-layer Knowledge Graphs. - Jens Dörpinghaus; Vera Weil; Carsten Düing; Martin W. Sommer (FedCSIS (Communication Papers), 2022)

Towards the Analysis of Longitudinal Data in Knowledge Graphs on Job Ads. - Jens Dörpinghaus; Vera Weil; Johanna Binnewitt (WCO, 2022)

Towards modelling and analysis of longitudinal social networks. - Jens Dörpinghaus; Vera Weil; Martin W. Sommer (FedCSIS (Communication Papers), 2023)

Towards modeling and analysis of longitudinal social networks. - Jens Dörpinghaus; Vera Weil; Martin W. Sommer (Appl. Netw. Sci., 2024)

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center. - Matthijs Ebbens; Nicole Funk; Jan Höckendorff; Christian Sohler; Vera Weil (AISTATS, 2025)