default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaria Kosche
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c10]Duncan Adamson
, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
Longest Common Subsequence with Gap Constraints. WORDS 2023: 60-76- [c9]Pawel Gawrychowski, Maria Kosche, Florin Manea:
On the Number of Factors in the LZ-End Factorization. SPIRE 2023: 253-259 - [i8]Duncan Adamson, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
Longest Common Subsequence with Gap Constraints. CoRR abs/2304.05270 (2023) - 2022
- [j1]Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
Absent Subsequences in Words. Fundam. Informaticae 189(3-4): 199-240 (2022) - [c8]Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid:
Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems. ISAAC 2022: 64:1-64:18 - [c7]Maria Kosche, Tore Koß, Florin Manea, Viktoriya Pak:
Subsequences in Bounded Ranges: Matching and Analysis Problems. RP 2022: 140-159 - [c6]Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
Combinatorial Algorithms for Subsequence Matching: A Survey. NCMA 2022: 11-27 - [i7]Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid:
Subsequences With Gap Constraints: Complexity Bounds for Matching and Analysis Problems. CoRR abs/2206.13896 (2022) - [i6]Maria Kosche, Tore Koß, Florin Manea, Viktoriya Pak:
Subsequences in Bounded Ranges: Matching and Analysis Problems. CoRR abs/2207.09201 (2022) - 2021
- [c5]Sebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen, Maria Kosche:
Robust Online Algorithms for Dynamic Choosing Problems. CiE 2021: 38-49 - [c4]Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
Absent Subsequences in Words. RP 2021: 115-131 - [c3]Joel D. Day, Pamela Fleischmann, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
The Edit Distance to k-Subsequence Universality. STACS 2021: 25:1-25:19 - [c2]Pawel Gawrychowski, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
Efficiently Testing Simon's Congruence. STACS 2021: 34:1-34:18 - [i5]Sebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen, Maria Kosche:
Robust Online Algorithms for Dynamic Choosing Problems. CoRR abs/2104.09803 (2021) - [i4]Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
Absent Subsequences in Words. CoRR abs/2108.13968 (2021) - 2020
- [i3]Pawel Gawrychowski, Maria Kosche, Tore Koss, Florin Manea, Stefan Siemer:
Efficiently Testing Simon's Congruence. CoRR abs/2005.01112 (2020) - [i2]Pamela Fleischmann, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
The Edit Distance to k-Subsequence Universality. CoRR abs/2007.09192 (2020)
2010 – 2019
- 2017
- [c1]Klaus Jansen, Kim-Manuel Klein, Maria Kosche, Leon Ladewig:
Online Strip Packing with Polynomial Migration. APPROX-RANDOM 2017: 13:1-13:18 - [i1]Klaus Jansen, Kim-Manuel Klein, Maria Kosche, Leon Ladewig:
Online Strip Packing with Polynomial Migration. CoRR abs/1706.04939 (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:04 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:
