Publications

@inproceedings{DBLP:conf/isaac/0001FGP23,

title = {Substring Complexity in Sublinear Space},

author = {Giulia Bernardini and Gabriele Fici and Pawel Gawrychowski and Solon P. Pissis},

doi = {10.4230/LIPICS.ISAAC.2023.12},

year  = {2023},

date = {2023-01-01},

booktitle = {34th International Symposium on Algorithms and Computation, (ISAAC)},

volume = {283},

pages = {12:1--12:19},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/latin/0001GPSSZ22,

title = {Elastic-Degenerate String Matching with 1 Error},

author = {Giulia Bernardini and Estéban Gabory and Solon P. Pissis and Leen Stougie and Michelle Sweering and Wiktor Zuba},

url = {https://arxiv.org/abs/2209.01095},

doi = {10.1007/978-3-031-20624-5_2},

year  = {2022},

date = {2022-01-01},

urldate = {2022-01-01},

booktitle = {Theoretical Informatics - 15th Latin American Symposium (LATIN)},

volume = {13568},

pages = {20--37},

publisher = {Springer},

series = {Lecture Notes in Computer Science},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/cpm/0001CLPSS22,

title = {Making de Bruijn Graphs Eulerian},

author = {Giulia Bernardini and Huiping Chen and Grigorios Loukides and Solon P. Pissis and Leen Stougie and Michelle Sweering},

url = {https://drops.dagstuhl.de/opus/volltexte/2022/16139/pdf/LIPIcs-CPM-2022-12.pdf},

doi = {10.4230/LIPIcs.CPM.2022.12},

year  = {2022},

date = {2022-01-01},

urldate = {2022-01-01},

booktitle = {33rd Annual Symposium on Combinatorial Pattern Matching (CPM)},

volume = {223},

pages = {12:1--12:18},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/cpm/0001CGGLPPS22,

title = {On Strings Having the Same Length- k Substrings},

author = {Giulia Bernardini and Alessio Conte and Estéban Gabory and Roberto Grossi and Grigorios Loukides and Solon P. Pissis and Giulia Punzi and Michelle Sweering},

url = {https://kclpure.kcl.ac.uk/portal/en/publications/on-strings-having-the-same-lengthk-substrings(e3c80eea-43bd-4bdf-b2a2-5a327268df48).html},

doi = {10.4230/LIPIcs.CPM.2022.16},

year  = {2022},

date = {2022-01-01},

urldate = {2022-01-01},

booktitle = {33rd Annual Symposium on Combinatorial Pattern Matching (CPM)},

volume = {223},

pages = {16:1--16:17},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/wabi/BernardiniIJS22,

title = {Reconstructing Phylogenetic Networks via Cherry Picking and Machine  Learning},

author = {Giulia Bernardini and Leo Iersel and Esther Julien and Leen Stougie},

url = {https://drops.dagstuhl.de/opus/volltexte/2022/17050/},

doi = {10.4230/LIPIcs.WABI.2022.16},

year  = {2022},

date = {2022-01-01},

urldate = {2022-01-01},

booktitle = {22nd International Workshop on Algorithms in Bioinformatics (WABI)},

volume = {242},

pages = {16:1--16:22},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:journals/corr/abs-2205-12850,

title = {A Universal Error Measure for Input Predictions Applied to Online  Graph Problems},

author = {Giulia Bernardini and Alexander Lindermayr and Alberto Marchetti-Spaccamela and Nicole Megow and Leen Stougie and Michelle Sweering},

url = {https://arxiv.org/abs/2205.12850},

year  = {2022},

date = {2022-01-01},

urldate = {2022-01-01},

booktitle = {36th Conference on Neural Information Processing Systems (NeurIPS)},

series = {Advances in Neural Information Processing Systems},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/cpm/0001MPSS21,

title = {Constructing Strings Avoiding Forbidden Substrings},

author = {Giulia Bernardini and Alberto Marchetti-Spaccamela and Solon P. Pissis and Leen Stougie and Michelle Sweering},

url = {https://arts.units.it/handle/11368/3019995},

doi = {10.4230/LIPIcs.CPM.2021.9},

year  = {2021},

date = {2021-01-01},

urldate = {2021-01-01},

booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM)},

volume = {191},

pages = {9:1--9:18},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/wads/BernardiniBG21,

title = {Incomplete Directed Perfect Phylogeny in Linear Time},

author = {Giulia Bernardini and Paola Bonizzoni and Pawel Gawrychowski},

url = {https://arxiv.org/abs/2010.05644},

doi = {10.1007/978-3-030-83508-8_13},

year  = {2021},

date = {2021-01-01},

urldate = {2021-01-01},

booktitle = {Algorithms and Data Structures - 17th International Symposium (WADS)},

volume = {12808},

pages = {172--185},

publisher = {Springer},

series = {Lecture Notes in Computer Science},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/alenex/0001CFLP20,

title = {Reverse-Safe Data Structures for Text Indexing},

author = {Giulia Bernardini and Huiping Chen and Gabriele Fici and Grigorios Loukides and Solon P. Pissis},

url = {https://epubs.siam.org/doi/10.1137/1.9781611976007.16},

doi = {10.1137/1.9781611976007.16},

year  = {2020},

date = {2020-01-01},

urldate = {2020-01-01},

booktitle = {Symposium on Algorithm Engineering and Experiments 

 (ALENEX)},

pages = {199--213},

publisher = {SIAM},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/cpm/0001BG20,

title = {On Two Measures of Distance Between Fully-Labelled Trees},

author = {Giulia Bernardini and Paola Bonizzoni and Pawel Gawrychowski},

url = {https://arxiv.org/abs/2002.05600},

doi = {10.4230/LIPIcs.CPM.2020.6},

year  = {2020},

date = {2020-01-01},

urldate = {2020-01-01},

booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM)},

volume = {161},

pages = {6:1--6:16},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}