default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVera Weil
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Jens Dörpinghaus, Vera Weil, Martin W. Sommer:
Towards modeling and analysis of longitudinal social networks. Appl. Netw. Sci. 9(1): 52 (2024)- 2023
- [c9]Jens Dörpinghaus
, Vera Weil, Martin W. Sommer:
Towards modelling and analysis of longitudinal social networks. FedCSIS (Communication Papers) 2023: 81-89 - 2022
- [c8]Jens Dörpinghaus, Vera Weil, Carsten Düing, Martin W. Sommer:
Centrality Measures in multi-layer Knowledge Graphs. FedCSIS (Communication Papers) 2022: 163-170 - [c7]Jens Dörpinghaus, Vera Weil, Johanna Binnewitt:
Analyzing longitudinal Data in Knowledge Graphs utilizing shrinking pseudo-triangles. FedCSIS 2022: 323-327 - [c6]Jens Dörpinghaus, Vera Weil, Johanna Binnewitt:
Towards the Analysis of Longitudinal Data in Knowledge Graphs on Job Ads. WCO 2022: 52-70 - [i3]Jens Dörpinghaus, Vera Weil, Carsten Düing, Martin W. Sommer:
Centrality Measures in multi-layer Knowledge Graphs. CoRR abs/2203.09219 (2022) - 2021
- [c5]Jens Dörpinghaus, Sebastian Schaaf, Vera Weil, Tobias Hübenthal:
An efficient approach towards the generation and analysis of interoperable clinical data in a knowledge graph. FedCSIS 2021: 59-68
2010 – 2019
- 2019
- [c4]Jens Dörpinghaus, Carsten Düing, Vera Weil:
A Minimum Set-Cover Problem with several constraints. FedCSIS 2019: 115-122 - 2017
- [j3]Vera Weil, Oliver Schaudt:
On bounding the difference between the maximum degree and the chromatic number by a constant. Discret. Appl. Math. 231: 228-234 (2017) - 2016
- [i2]Vera Weil:
A note on Reed's Conjecture about $ω$, $Δ$ and $χ$ with respect to vertices of high degree. CoRR abs/1611.02063 (2016) - 2015
- [b1]Vera Sharon Weil:
On cliques, colorings, and the maximum degree in graphs. University of Cologne, Verlag Dr. Hut 2015 - [j2]Oliver Schaudt, Vera Weil:
On Bounding the Difference of the Maximum Degree and the Clique Number. Graphs Comb. 31(5): 1689-1702 (2015) - [i1]Oliver Schaudt, Vera Weil:
On bounding the difference between the maximum degree and the chromatic number by a constant. CoRR abs/1511.08403 (2015) - 2013
- [j1]Oliver Schaudt, Rainer Schrader, Vera Weil:
On the separability of graphs. Discret. Math. 313(6): 809-820 (2013) - 2012
- [c3]Oliver Schaudt, Rainer Schrader, Vera Weil:
On the Separability of Graphs. CTW 2012: 232-236 - [c2]Oliver Schaudt, Vera Weil:
Graphs in Which the Difference of the Maximum Clique Number and the Maximum Degree Is Bounded by a Constant. CTW 2012: 237-239 - 2010
- [c1]Vera Weil:
On Reed's Conjecture in Triangle-Free Graphs. CTW 2010: 173-175
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-04 01:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
