Research interests

  • Algorithms and Complexity
    • exponential time algorithms
    • parameterized complexity
    • combinatorial optimization
  • Combinatorics
    • extremal combinatorics
    • graph classes
    • graph decompositions
  • Satisfiability and Constraints
    • backdoors
    • (local) consistency
    • global constraints
    • propagation
  • Applications
    • algorithmic game theory
    • computational social choice
    • preprocessing
    • resource allocation
    • scheduling

Selected publications

  • J31
    Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, and Saket Saurabh. Exact Algorithms via Monotone Local Search. J. ACM 2019. [doi] [arXiv]
  • C53
    Serge Gaspers and Edward J. Lee. Exact Algorithms via Multivariate Subroutines. ICALP 2017. [arXiv]
  • C52
    Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, and Abdallah Saffidine. The Parameterized Complexity of Positional Games. ICALP 2017. [arXiv]
  • J26
    Serge Gaspers and Gregory B. Sorkin. Separate, Measure and Conquer: Faster Algorithms for Max 2-CSP and Counting Dominating Sets. ACM Trans. Algorithms 2017. [doi] [arXiv]
  • C30
    Serge Gaspers and Stefan Szeider. Strong Backdoors to Bounded Treewidth SAT. FOCS 2013. [doi] [arXiv] [pdf]
  • J10
    Serge Gaspers and Gregory B. Sorkin. A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. Journal of Computer and System Sciences 2012. [doi] [arXiv] [pdf]
  • J3
    Fedor V. Fomin, Serge Gaspers, Saket Saurabh, and Alexey A. Stepanov. On Two Techniques of Combining Branching and Treewidth. Algorithmica 2009. [doi] [TR] [pdf]
  • J1
    Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, and Igor Razgon. On the minimum feedback vertex set problem: Exact and enumeration algorithms. Algorithmica 2008. [doi] [pdf]

You might have seen me here: