Sledovat
Serge Gaspers
Serge Gaspers
Professor, UNSW Sydney, Australia
E-mailová adresa ověřena na: cse.unsw.edu.au - Domovská stránka
Název
Citace
Citace
Rok
Computational aspects of multi-winner approval voting
H Aziz, S Gaspers, J Gudmundsson, S Mackenzie, N Mattei, T Walsh
arXiv preprint arXiv:1407.3247, 2014
1722014
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
145*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
1302008
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
1292015
Backdoors to satisfaction
S Gaspers, S Szeider
The Multivariate Algorithmic Revolution and Beyond: Essays Dedicated to …, 2012
120*2012
On two techniques of combining branching and treewidth
FV Fomin, S Gaspers, S Saurabh, AA Stepanov
Algorithmica 54 (2), 181-207, 2009
1132009
On independent sets and bicliques in graphs
S Gaspers, D Kratsch, M Liedloff
Algorithmica 62, 637-658, 2012
73*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
71*
Exact algorithms via monotone local search
FV Fomin, S Gaspers, D Lokshtanov, S Saurabh
Journal of the ACM (JACM) 66 (2), 1-23, 2019
692019
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
64*2006
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
63*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
63*2013
Exact and parameterized algorithms for max internal spanning tree
D Binkele-Raible, H Fernau, S Gaspers, M Liedloff
Algorithmica 65 (1), 95-128, 2013
60*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
57*2014
Iterative compression and exact algorithms
FV Fomin, S Gaspers, D Kratsch, M Liedloff, S Saurabh
Theoretical Computer Science 411 (7-9), 1045-1053, 2010
542010
Exponential Time Algorithms: Structures, Measures, and Bounds
S Gaspers
VDM Verlag Dr. Mueller e.K., 2010
54*2010
Backdoor sets for CSP
S Gaspers, S Ordyniak, S Szeider
Dagstuhl Follow-Ups 7, 2017
49*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
46*2012
Augmenting graphs to minimize the diameter
F Frati, S Gaspers, J Gudmundsson, L Mathieson
Algorithmica 72, 995-1010, 2015
442015
Feedback vertex sets in tournaments
S Gaspers, M Mnich
Journal of Graph Theory 72 (1), 72-89, 2013
432013
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20