default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Ehard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Stefan Ehard, Elena Mohr, Dieter Rautenbach:
Biholes in balanced bipartite graphs. Discuss. Math. Graph Theory 43(4): 1203-1213 (2023)- 2022
- [j12]Stefan Ehard, Felix Joos:
A Short Proof of the Blow-Up Lemma for Approximate Decompositions. Comb. 42(6): 771-819 (2022) - [j11]Julien Baste, Stefan Ehard, Dieter Rautenbach:
Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - 2020
- [j10]Stefan Ehard, Elena Mohr, Dieter Rautenbach:
Low Weight Perfect Matchings. Electron. J. Comb. 27(4): 4 (2020) - [j9]Stefan Ehard, Stefan Glock, Felix Joos:
Pseudorandom hypergraph matchings. Comb. Probab. Comput. 29(6): 868-885 (2020) - [j8]Stefan Ehard, Dieter Rautenbach:
Approximating connected safe sets in weighted trees. Discret. Appl. Math. 281: 216-223 (2020) - [j7]Mitre Costa Dourado, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach:
Partial immunization of trees. Discret. Optim. 35: 100568 (2020) - [j6]Stefan Ehard, Elena Mohr:
Rainbow triangles and cliques in edge-colored graphs. Eur. J. Comb. 84 (2020) - [i4]Julien Baste, Stefan Ehard, Dieter Rautenbach:
Non-monotone target sets for threshold values restricted to 0, 1, and the vertex degree. CoRR abs/2007.03959 (2020)
2010 – 2019
- 2019
- [j5]Stéphane Bessy
, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach:
Dynamic monopolies for interval graphs with bounded thresholds. Discret. Appl. Math. 260: 256-261 (2019) - [j4]Stefan Ehard, Dieter Rautenbach:
On some tractable and hard instances for partial incentives and target set selection. Discret. Optim. 34 (2019) - [j3]Christoph Brause, Stefan Ehard, Dieter Rautenbach:
Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives. Discret. Math. 342(7): 2127-2133 (2019) - [j2]Stefan Ehard, Dieter Rautenbach:
Vaccinate your trees! Theor. Comput. Sci. 772: 46-57 (2019) - 2018
- [j1]Stefan Ehard, Felix Joos:
Paths and Cycles in Random Subgraphs of Graphs with Large Minimum Degree. Electron. J. Comb. 25(2): 2 (2018) - [i3]Stéphane Bessy, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach:
Dynamic monopolies for interval graphs with bounded thresholds. CoRR abs/1802.03935 (2018) - [i2]Stefan Ehard, Dieter Rautenbach:
On some tractable and hard instances for partial incentives and target set selection. CoRR abs/1805.10086 (2018) - 2017
- [i1]Stefan Ehard, Dieter Rautenbach:
Approximating Connected Safe Sets in Weighted Trees. CoRR abs/1711.11412 (2017)
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-04-24 23:08 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:
