We study the following separation problem: Given n connected curves and two points s and t in the plane, compute the minimum number of curves one needs to retain so that any path ...
We study the problem of designing a data structure that reports the positions of the distinct τ-majorities within any range of an array A[1, n], without storing A. A τ-majority ...
Abstract. In the (parameterized) Ordered List Subgraph Embedding problem (p-OLSE) we are given two graphs G and H, each with a linear order defined on its vertices, a function L t...
Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, L...
The class q-Horn, introduced by Boros, Crama and Hammer in 1990, is one of the largest known classes of propositional CNF formulas for which satisfiability can be decided in poly...
Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan...
We consider the problem of Pareto-optimal route planning in public-transit networks of a whole country, a whole continent, or even the whole world. On such large networks, existin...