#### Filter Results:

- Full text PDF available (85)

#### Publication Year

2006

2017

- This year (11)
- Last 5 years (54)
- Last 10 years (83)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners. These rules are satisfaction approval voting, proportional approval voting, and reweighted approval voting. We first show that computing the winner for proportional approval voting is NP-hard, closing a long standing open problem. As none of… (More)

- Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov
- Algorithmica
- 2007

Branch & Reduce and dynamic programming on graphs of bounded treewidth are among the most common and powerful techniques used in the design of moderately exponential time exact algorithms for NP hard problems. In this paper we discuss the efficiency of simple algorithms based on combinations of these techniques. The idea behind these algorithms is very… (More)

- Serge Gaspers, Gregory B. Sorkin
- SODA
- 2009

We introduce “hybrid” Max 2-CSP formulas consisting of “simple clauses”, namely conjunctions and disjunctions of pairs of variables, and general 2-variable clauses, which can be any integer-valued functions of pairs of boolean variables. This allows an algorithm to use both efficient reductions specific to AND and OR clauses, and other powerful reductions… (More)

- Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, Igor Razgon
- Algorithmica
- 2007

We present a time $\mathcal {O}(1.7548^{n})$ algorithm finding a minimum feedback vertex set in an undirected graph on n vertices. We also prove that a graph on n vertices can contain at most 1.8638 n minimal feedback vertex sets and that there exist graphs having 105 n/10≈1.5926 n minimal feedback vertex sets.

- Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh
- Artif. Intell.
- 2014

We consider the discrete assignment problem in which agents express ordinal preferences over objects and these objects are allocated to the agents in a fair manner. We use the stochastic dominance relation between fractional or randomized allocations to systematically define varying notions of proportionality and envy-freeness for discrete assignments. The… (More)

- Stéphane Bessy, Fedor V. Fomin, +4 authors Stéphan Thomassé
- FSTTCS
- 2009

A tournament T = (V,A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, the Feedback Arc Set problem asks whether the given digraph has a set of k arcs whose removal results in an acyclic digraph. The Feedback Arc Set problem restricted to tournaments is… (More)

- Henning Fernau, Serge Gaspers, Daniel Binkele-Raible
- Algorithmica
- 2009

We consider the $\mathcal{NP}$ -hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our dynamic-programming algorithms for general and degree-bounded graphs have running times of the form $\mathcal{O}^{*}(c^{n})$ with c≤2. For graphs with bounded degree,… (More)

- Martin Aleksandrov, Haris Aziz, Serge Gaspers, Toby Walsh
- IJCAI
- 2015

We study an online model of fair division designed to capture features of a real world charity problem. We consider two simple mechanisms for this model in which agents simply declare what items they like. We analyse axiomatic properties of these mechanisms such as strategy-proofness and envy freeness. Finally, we perform a competitive analysis and compute… (More)

The probabilistic serial (PS) rule is a prominent randomized rule for assigning indivisible goods to agents. Although it is well known for its good fairness and welfare properties, it is not strategyproof. In view of this, we address several fundamental questions regarding equilibria under PS. Firstly, we show that Nash deviations under the PS rule can… (More)

- Serge Gaspers, Stefan Szeider
- The Multivariate Algorithmic Revolution and…
- 2012

A backdoor set is a set of variables of a propositional formula such that fixing the truth values of the variables in the backdoor set moves the formula into some polynomial-time decidable class. If we know a small backdoor set we can reduce the question of whether the given formula is satisfiable to the same question for one or several easy formulas that… (More)