Folgen
Serge Gaspers
Serge Gaspers
Professor, UNSW Sydney, Australia
Bestätigte E-Mail-Adresse bei cse.unsw.edu.au - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
1542014
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
1292008
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
125*2015
Backdoors to satisfaction
S Gaspers, S Szeider
The Multivariate Algorithmic Revolution and Beyond, 287-317, 2012
115*2012
On two techniques of combining branching and treewidth
FV Fomin, S Gaspers, S Saurabh, AA Stepanov
Algorithmica 54 (2), 181-207, 2009
1102009
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
1032015
On independent sets and bicliques in graphs
S Gaspers, D Kratsch, M Liedloff
Algorithmica 62 (3), 637-658, 2012
74*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
65*
Exact and parameterized algorithms for max internal spanning tree
D Binkele-Raible, H Fernau, S Gaspers, M Liedloff
Algorithmica 65 (1), 95-128, 2013
61*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
61*2006
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
58*2013
Iterative compression and exact algorithms
FV Fomin, S Gaspers, D Kratsch, M Liedloff, S Saurabh
Theoretical Computer Science 411 (7-9), 1045-1053, 2010
512010
Exponential Time Algorithms: Structures, Measures, and Bounds
S Gaspers
VDM Verlag Dr. Mueller e.K., 2010
50*2010
Exact algorithms via monotone local search
FV Fomin, S Gaspers, D Lokshtanov, S Saurabh
Journal of the ACM (JACM) 66 (2), 1-23, 2019
492019
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
48*2014
Stable matching with uncertain linear preferences
H Aziz, P Biró, S Gaspers, R Haan, N Mattei, B Rastegari
International Symposium on Algorithmic Game Theory, 195-206, 2016
44*2016
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
S Gaspers, GB Sorkin
Journal of Computer and System Sciences 78 (1), 305-335, 2012
432012
Feedback vertex sets in tournaments
S Gaspers, M Mnich
Journal of Graph Theory 72 (1), 72-89, 2013
422013
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
41*2012
Parameterizing by the number of numbers
MR Fellows, S Gaspers, FA Rosamond
Theory of Computing Systems 50 (4), 675-693, 2012
372012
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20