20 citations · 62 across the 20 of their papers we have counts for
25 papers
Total Completion Time Scheduling Under Scenarios
Thomas Bosman, Martijn van Ee, Ekin Ergen +4
Scheduling jobs with given processing times on identical parallel machines so as to minimize their total completion time is one of the most basic scheduling problems. We study inte…
Constructing Phylogenetic Networks via Cherry Picking and Machine Learning
Giulia Bernardini, Leo van Iersel, Esther Julien +1
Combining a set of phylogenetic trees into a single phylogenetic network that explains all of them is a fundamental challenge in evolutionary studies. Existing methods are computat…
Elastic-Degenerate String Matching with 1 Error
Giulia Bernardini, Estéban Gabory, Solon P. Pissis +3
An elastic-degenerate string is a sequence of finite sets of strings of total length , introduced to represent a set of related DNA sequences, also known as a pangenome. The…
A Universal Error Measure for Input Predictions Applied to Online Graph Problems
Giulia Bernardini, Alexander Lindermayr, Alberto Marchetti-Spaccamela +3
We introduce a novel measure for quantifying the error in input predictions. The error is based on a minimum-cost hyperedge cover in a suitably defined hypergraph and provides a ge…
String Sanitization Under Edit Distance: Improved and Generalized
Takuya Mieno, Solon P. Pissis, Leen Stougie +1
Let be a string of length over an alphabet , be a positive integer, and be a set of length- substrings of . The ETFS problem asks us to construct…
Sampling hypergraphs with given degrees
Martin Dyer, Catherine Greenhill, Pieter Kleer +2
There is a well-known connection between hypergraphs and bipartite graphs, obtained by treating the incidence matrix of the hypergraph as the biadjacency matrix of a bipartite grap…