Serge Gaspers
Serge Gaspers
Professor, UNSW Sydney, Australia
Adresse e-mail validée de - Page d'accueil
Citée par
Citée par
Computational aspects of multi-winner approval voting
H Aziz, S Gaspers, J Gudmundsson, S Mackenzie, N Mattei, T Walsh
Workshops at the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014
Two Desirable Fairness Concepts for Allocation of Indivisible Objects under Ordinal Preferences
H Aziz, S Gaspers, S Mackenzie, T Walsh
ACM SIGecom Exchanges 14 (2), 16-21, 2015
Online Fair Division: analysing a Food Bank problem
M Aleksandrov, H Aziz, S Gaspers, T Walsh
24th International Joint Conference on Artificial Intelligence (IJCAI 2015 …, 2015
On the minimum feedback vertex set problem: Exact and enumeration algorithms
FV Fomin, S Gaspers, AV Pyatkin, I Razgon
Algorithmica 52 (2), 293-307, 2008
Backdoors to satisfaction
S Gaspers, S Szeider
The Multivariate Algorithmic Revolution and Beyond: Essays Dedicated to …, 2012
On two techniques of combining branching and treewidth
FV Fomin, S Gaspers, S Saurabh, AA Stepanov
Algorithmica 54 (2), 181-207, 2009
Exact algorithms via monotone local search
FV Fomin, S Gaspers, D Lokshtanov, S Saurabh
Journal of the ACM (JACM) 66 (2), 1-23, 2019
On independent sets and bicliques in graphs
S Gaspers, D Kratsch, M Liedloff
Algorithmica 62, 637-658, 2012
Kernels for Feedback Arc Set In Tournaments
S Bessy, FV Fomin, S Gaspers, C Paul, A Perez, S Saurabh, S Thomassé
Journal of Computer and System Sciences, 0
Stable matching with uncertain linear preferences
H Aziz, P Biró, S Gaspers, R De Haan, N Mattei, B Rastegari
Algorithmic Game Theory: 9th International Symposium, SAGT 2016, Liverpool …, 2016
A Linear Vertex Kernel for Maximum Internal Spanning Tree
FV Fomin, S Gaspers, S Saurabh, S Thomassé
Journal of Computer and System Sciences 79 (1), 1-6, 2013
Finding a Minimum Feedback Vertex Set in time O(1.7548^n)
FV Fomin, S Gaspers, AV Pyatkin
Parameterized and exact computation: second international workshop, IWPEC …, 2006
Exact and parameterized algorithms for max internal spanning tree
D Binkele-Raible, H Fernau, S Gaspers, M Liedloff
Algorithmica 65 (1), 95-128, 2013
Fixing a balanced knockout tournament
H Aziz, S Gaspers, S Mackenzie, N Mattei, P Stursberg, T Walsh
Proceedings of the AAAI Conference on Artificial Intelligence 28 (1), 2014
Exponential Time Algorithms: Structures, Measures, and Bounds
S Gaspers
VDM Verlag Dr. Mueller e.K., 2010
Iterative compression and exact algorithms
FV Fomin, S Gaspers, D Kratsch, M Liedloff, S Saurabh
Theoretical Computer Science 411 (7-9), 1045-1053, 2010
Backdoor sets for CSP
S Gaspers, S Ordyniak, S Szeider
Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2017
A branch-and-reduce algorithm for finding a minimum independent dominating set
S Gaspers, M Liedloff
Discrete Mathematics & Theoretical Computer Science 14 (1), 29-42, 2012
Stability and pareto optimality in refugee allocation matchings
H Aziz, J Chen, S Gaspers, Z Sun
Proceedings of the 17th International Conference on Autonomous Agents and …, 2018
Welfare maximization in fractional hedonic games
H Aziz, S Gaspers, J Gudmundsson, J Mestre, H Taubig
Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20