We resolve an open problem regarding the complexity of unweighted coalitional manipulation, namely, the complexity of Copeland -manipulation for {0, 1}. Copeland , 0 1, is an...
Piotr Faliszewski, Edith Hemaspaandra, Henning Sch...
We describe a new subdivision method to efficiently compute the topology and the arrangement of implicit planar curves. We emphasize that the output topology and arrangement are g...
We present a new interactive hybrid approach for solving multicriteria optimization problems where features of approximation methods and interactive approaches are incorporated. W...
In a previous work [26], by considering paths that are partially weighted, the generating function of Dyck paths was shown to possess a type of symmetry, called an exchange relati...
Abstract Constructing correspondencesbetween points characterizing one shape with those characterizing another is crucial to understanding what the two shapes have in common. These...