Serge Gaspers

Cited by

	All	Since 2016
Citations	2058	1119
h-index	27	18
i10-index	54	40

260

130

195

20062007200820092010201120122013201420152016201720182019202020218 16 38 48 89 90 126 148 149 194 193 215 217 241 238 7

Co-authors

Haris AzizUNSW Sydney - Scientia Associate ProfessorVerified email at unsw.edu.au
Toby WalshProfessor, UNSW and Data61Verified email at cse.unsw.edu.au
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Mathieu Liedloffmaître de conférences HdR, université d'OrléansVerified email at univ-orleans.fr
Stefan SzeiderProfessor, Head of Algorithms and Complexity Group, TU Wien, Vienna, AustriaVerified email at szeider.net
Nicholas MatteiAssistant Professor, Tulane UniversityVerified email at tulane.edu
Dieter Kratschprofesseur d'informatique, Universite de LorraineVerified email at univ-lorraine.fr
Joachim GudmundssonUniversity of SydneyVerified email at sydney.edu.au
Simon MackenzieNICTA, UNSWVerified email at cse.unsw.edu.au
Nina NarodytskaVMware ResearchVerified email at vmware.com
Henning FernauProfessor für Informatik, Universität TrierVerified email at uni-trier.de
Sebastian OrdyniakUniversity of SheffieldVerified email at sheffield.ac.uk
Michael FellowsProfessor of Informatics, University of BergenVerified email at uib.no
Frances rosamondUniversity of Bergen, NorwayVerified email at uib.no
Gregory SorkinLondon School of Economics and Political ScienceVerified email at lse.ac.uk
Zhaohong SunUNSW SydneyVerified email at unsw.edu.au
Ronald de HaanUniversity of AmsterdamVerified email at ronalddehaan.eu
Stefan RümmeleUNSW SydneyVerified email at unsw.edu.au
Christophe PaulCNRS LIRMMVerified email at lirmm.fr

Serge Gaspers

Associate Professor, UNSW Sydney, Australia

Verified email at cse.unsw.edu.au - Homepage

Algorithms Exponential Time Algorithms Parameterized Complexity Computational Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	130	2014
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	113	2008
On two techniques of combining branching and treewidth FV Fomin, S Gaspers, S Saurabh, AA Stepanov Algorithmica 54 (2), 181-207, 2009	102	2009
Backdoors to satisfaction S Gaspers, S Szeider The Multivariate Algorithmic Revolution and Beyond, 287-317, 2012	100*	2012
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	94*	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	72	2015
On independent sets and bicliques in graphs S Gaspers, D Kratsch, M Liedloff Algorithmica 62 (3), 637-658, 2012	70*	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	63*
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	55*	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	54*	2013
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	53*	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	44	2010
Exponential Time Algorithms: Structures, Measures, and Bounds S Gaspers VDM Verlag Dr. Mueller e.K., 2010	44*	2010
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	42	2012
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	40*	2012
Feedback vertex sets in tournaments S Gaspers, M Mnich Journal of Graph Theory 72 (1), 72-89, 2013	39	2013
Exact algorithms via monotone local search FV Fomin, S Gaspers, D Lokshtanov, S Saurabh Journal of the ACM (JACM) 66 (2), 1-23, 2019	38	2019
Parameterizing by the number of numbers MR Fellows, S Gaspers, FA Rosamond Theory of Computing Systems 50 (4), 675-693, 2012	35	2012
Exponential time algorithms for the minimum dominating set problem on some graph classes S Gaspers, D Kratsch, M Liedloff, I Todinca ACM Transactions on Algorithms (TALG) 6 (1), 1-21, 2009	32	2009
Strong backdoors to bounded treewidth SAT S Gaspers, S Szeider 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 489-498, 2013	31	2013

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors