default search action
Michelle Sweering
Person information
- affiliation: CWI, Amsterdam, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Giulia Bernardini, Estéban Gabory, Solon P. Pissis, Leen Stougie, Michelle Sweering, Wiktor Zuba:
Elastic-Degenerate String Matching with 1 Error or Mismatch. Theory Comput. Syst. 68(5): 1442-1467 (2024) - [j4]Huiping Chen
, Alessio Conte
On Breaking Truss-based and Core-based Communities. ACM Trans. Knowl. Discov. Data 18(6): 135:1-135:43 (2024) - [c13]Giulia Bernardini, Huiping Chen, Inge Li Gørtz
Connecting de Bruijn Graphs. CPM 2024: 6:1-6:16 - 2023
- [j3]Giulia Bernardini
Hide and Mine in Strings: Hardness, Algorithms, and Experiments. IEEE Trans. Knowl. Data Eng. 35(6): 5948-5963 (2023) - [j2]Grigorios Loukides
Bidirectional String Anchors for Improved Text Indexing and Top-$K$ Similarity Search. IEEE Trans. Knowl. Data Eng. 35(11): 11093-11111 (2023) - [c12]Estéban Gabory, Njagi Moses Mwaniki, Nadia Pisanti, Solon P. Pissis
Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications. CPM 2023: 11:1-11:20 - [c11]Eric Rivals
Convergence of the Number of Period Sets in Strings. ICALP 2023: 100:1-100:14 - [c10]Estéban Gabory, Eric Rivals, Michelle Sweering, Hilde Verbeek, Pengfei Wang:
Periodicity of Degenerate Strings. PSC 2023: 42-56 - 2022
- [c9]Giulia Bernardini
Making de Bruijn Graphs Eulerian. CPM 2022: 12:1-12:18 - [c8]Giulia Bernardini
On Strings Having the Same Length- k Substrings. CPM 2022: 16:1-16:17 - [c7]Giulia Bernardini
Elastic-Degenerate String Matching with 1 Error. LATIN 2022: 20-37 - [c6]Giulia Bernardini, Alexander Lindermayr, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie, Michelle Sweering:
A Universal Error Measure for Input Predictions Applied to Online Graph Problems. NeurIPS 2022 - [i5]Giulia Bernardini, Alexander Lindermayr, Alberto Marchetti-Spaccamela
A Universal Error Measure for Input Predictions Applied to Online Graph Problems. CoRR abs/2205.12850 (2022) - [i4]Giulia Bernardini, Estéban Gabory, Solon P. Pissis, Leen Stougie, Michelle Sweering
Elastic-Degenerate String Matching with 1 Error. CoRR abs/2209.01095 (2022) - [i3]Eric Rivals
Convergence of the number of period sets in strings. CoRR abs/2209.08926 (2022) - 2021
- [j1]Giulia Bernardini
Combinatorial Algorithms for String Sanitization. ACM Trans. Knowl. Discov. Data 15(1): 8:1-8:34 (2021) - [c5]Giulia Bernardini
Constructing Strings Avoiding Forbidden Substrings. CPM 2021: 9:1-9:18 - [c4]Takuya Mieno
String Sanitization Under Edit Distance: Improved and Generalized. CPM 2021: 19:1-19:18 - [c3]Huiping Chen
On Breaking Truss-Based Communities. KDD 2021: 117-126 - [i2]Grigorios Loukides, Solon P. Pissis, Michelle Sweering:
String Sampling with Bidirectional String Anchors. CoRR abs/2112.10376 (2021) - 2020
- [c2]Giulia Bernardini
String Sanitization Under Edit Distance. CPM 2020: 7:1-7:14 - [c1]Giulia Bernardini
Hide and Mine in Strings: Hardness and Algorithms. ICDM 2020: 924-929 - [i1]Takuya Mieno, Solon P. Pissis, Leen Stougie, Michelle Sweering:
String Sanitization Under Edit Distance: Improved and Generalized. CoRR abs/2007.08179 (2020)
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:47 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: