default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFelicia Lucke
Person information
- affiliation: University of Fribourg, Switzerland
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Felicia Lucke
, Felix Mann:
Reducing Graph Parameters by Contractions and Deletions. Algorithmica 86(3): 825-851 (2024)- [j4]Felicia Lucke, Bernard Ries:
On blockers and transversals of maximum independent sets in co-comparability graphs. Discret. Appl. Math. 356: 307-321 (2024) - [j3]Felicia Lucke, Daniël Paulusma, Bernard Ries:
Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius. Theor. Comput. Sci. 1017: 114795 (2024) - [i9]Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith:
Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs. CoRR abs/2404.11389 (2024) - 2023
- [j2]Felicia Lucke, Daniël Paulusma, Bernard Ries:
Finding Matching Cuts in H-Free Graphs. Algorithmica 85(10): 3290-3322 (2023) - [c4]Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries:
Matching Cuts in Graphs of High Girth and H-Free Graphs. ISAAC 2023: 31:1-31:16 - [c3]Felicia Lucke, Daniël Paulusma, Bernard Ries:
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. MFCS 2023: 64:1-64:15 - [i8]Felicia Lucke, Daniël Paulusma, Bernard Ries:
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. CoRR abs/2304.01099 (2023) - [i7]Felicia Lucke, Bernard Ries:
On Blockers and Transversals of Maximum Independent Sets in Co-Comparability Graphs. CoRR abs/2311.07219 (2023) - [i6]Van Bang Le, Felicia Lucke, Daniël Paulusma, Bernard Ries:
Maximizing Matching Cuts. CoRR abs/2312.12960 (2023) - 2022
- [j1]Felicia Lucke, Daniël Paulusma, Bernard Ries:
On the complexity of matching cut for graphs of bounded radius and H-free graphs. Theor. Comput. Sci. 936: 33-42 (2022) - [c2]Felicia Lucke, Daniël Paulusma, Bernard Ries:
Finding Matching Cuts in H-Free Graphs. ISAAC 2022: 22:1-22:16 - [c1]Felicia Lucke, Felix Mann:
Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number. IWOCA 2022: 412-424 - [i5]Felicia Lucke, Felix Mann:
Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number. CoRR abs/2202.08574 (2022) - [i4]Felicia Lucke, Daniël Paulusma, Bernard Ries:
On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs. CoRR abs/2204.07129 (2022) - [i3]Felicia Lucke, Daniël Paulusma, Bernard Ries:
Finding Matching Cuts in H-Free Graphs. CoRR abs/2207.07095 (2022) - [i2]Felicia Lucke, Felix Mann:
Reducing Graph Parameters by Contractions and Deletions. CoRR abs/2210.10503 (2022) - [i1]Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries:
New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching. CoRR abs/2212.12317 (2022)
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-12-10 20:45 CET 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:
