We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...
A set of points shown on the map usually represents special sites like cities or towns in a country. If the map in the interactive geographical information system (GIS) is browsed ...
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens ...
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...