#### Filter Results:

- Full text PDF available (48)

#### Publication Year

2006

2019

- This year (20)
- Last 5 years (62)
- Last 10 years (108)

#### Publication Type

#### Co-author

#### Journals and Conferences

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… (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… (More)

- Stéphane Bessy, Fedor V. Fomin, +4 authors Stéphan Thomassé
- J. Comput. Syst. Sci.
- 2011

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… (More)

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

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… (More)

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

In this paper 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… (More)

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

Abstract
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… (More)

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

Abstract
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… (More)

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

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… (More)

The probabilistic serial (PS) rule is one of the most prominent randomized rules for the assignment problem. It is well-known for its superior fairness and welfare properties. However, PS is not… (More)

- Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh
- Theor. Comput. Sci.
- 2010

Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. The main purpose of this paper is to show that iterative compression can also be used in the design of… (More)