The area of computational social choice (COMSOC) analyzes collective decision problems
from an algorithmic perspective. So far, the main focus in this area lied on analyzing …

Over the last two decades, significant advances have been made in the design and analysis
of fixed-parameter algorithms for a wide variety of graphtheoretic problems. This has …

We introduce a logic called distance neighborhood logic with acyclicity and connectivity
constraints (A&C DN for short) which extends existential MSO1 with predicates for querying …

Generating diverse populations of high-quality solutions has gained interest as a promising
extension to the traditional optimization tasks. This work contributes to this line of research …

Finding diverse solutions in combinatorial problems recently has received considerable
attention (Baste et al. 2020; Fomin et al. 2020; Hanaka et al. 2021). In this paper we study …

Finding a\emph {single} best solution is the most common objective in combinatorial
optimization problems. However, such a single solution may not be applicable to real-world …

We initiate the study of the Diverse Pair of (Maximum/Perfect) Matchings problems which
given a graph $ G $ and an integer $ k $, ask whether $ G $ has two (maximum/perfect) …

Finding diverse solutions to optimization problems has been of practical interest for several
decades, and recently enjoyed increasing attention in research. While submodular …

An enumeration problem is the task of listing a set of elements without redundancies, usually
the solutions of some combinatorial problem. The enumeration of cycles in a graph …

Mathematical modeling is a standard approach to solve many real-world problems and
diversity of solutions is an important issue, emerging in applying solutions obtained from …