# Serge Gaspers

According to our database1, Serge Gaspers
• authored at least 134 papers between 2006 and 2017.
• has a "Dijkstra number"2 of four.

Book
In proceedings
Article
PhD thesis
Other

## Bibliography

2017
Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets.
ACM Trans. Algorithms, 2017

Backdoors into heterogeneous classes of SAT and CSP.
J. Comput. Syst. Sci., 2017

Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements.
CoRR, 2017

Linearly $χ$-Bounding $(P_6, C_4)$-Free Graphs.
CoRR, 2017

Exact Algorithms via Multivariate Subroutines.
CoRR, 2017

The Parameterized Complexity of Positional Games.
CoRR, 2017

Linearly \chi χ -Bounding (P_6, C_4) ( P 6 , C 4 ) -Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Weakening Covert Networks by Minimizing Inverse Geodesic Length.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Exact Algorithms via Multivariate Subroutines.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

The Parameterized Complexity of Positional Games.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Backdoor Sets for CSP.
Proceedings of the Constraint Satisfaction Problem: Complexity and Approximability, 2017

Faster Graph Coloring in Polynomial Space.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

Stable Matching with Uncertain Pairwise Preferences.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016
Backdoors to SAT.
Encyclopedia of Algorithms, 2016

On Satisfiability Problems with a Linear Structure.
CoRR, 2016

Faster Graph Coloring in Polynomial Space.
CoRR, 2016

Stable Matching with Uncertain Linear Preferences.
CoRR, 2016

Interdependent Scheduling Games.
CoRR, 2016

Backdoors to q-Horn.
Algorithmica, 2016

Exact algorithms via monotone local search.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Stable Matching with Uncertain Linear Preferences.
Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

Faster Algorithms to Enumerate Hypergraph Transversals.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

On Satisfiability Problems with a Linear Structure.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Turbocharging Treewidth Heuristics.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Interdependent Scheduling Games.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

On the Complexity of Grammar-Based Compression over Fixed Alphabets.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
On finding optimal polytrees.
Theor. Comput. Sci., 2015

Two desirable fairness concepts for allocation of indivisible objects under ordinal preferences.
SIGecom Exchanges, 2015

Complexity of splits reconstruction for low-degree trees.
Discrete Applied Mathematics, 2015

Backdoors into Heterogeneous Classes of SAT and CSP.
CoRR, 2015

On the Number of Minimal Separators in Graphs.
CoRR, 2015

Exact Algorithms via Monotone Local Search.
CoRR, 2015

Faster algorithms to enumerate hypergraph transversals.
CoRR, 2015

Equilibria Under the Probabilistic Serial Rule.
CoRR, 2015

Manipulating the Probabilistic Serial Rule.
CoRR, 2015

Online Fair Division: analysing a Food Bank problem.
CoRR, 2015

Augmenting Graphs to Minimize the Diameter.
Algorithmica, 2015

Myhill-Nerode Methods for Hypergraphs.
Algorithmica, 2015

Fair assignment of indivisible objects under ordinal preferences.
Artif. Intell., 2015

On the Number of Minimal Separators in Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Equilibria Under the Probabilistic Serial Rule.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Welfare Maximization in Fractional Hedonic Games.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Online Fair Division: Analysing a Food Bank Problem.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Manipulating the Probabilistic Serial Rule.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Computational Aspects of Multi-Winner Approval Voting.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014
Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning.
CoRR, 2014

Separate, Measure and Conquer: Faster Algorithms for Max 2-CSP and Counting Dominating Sets.
CoRR, 2014

Strategic aspects of the probabilistic serial rule for the allocation of goods.
CoRR, 2014

Computational Aspects of Multi-Winner Approval Voting.
CoRR, 2014

Guarantees and limits of preprocessing in constraint satisfaction and reasoning.
Artif. Intell., 2014

Possible and necessary winner problem in social polls.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Fair assignment of indivisible objects under ordinal preferences.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Backdoors into Heterogeneous Classes of SAT and CSP.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Fixing a Balanced Knockout Tournament.
Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

Fixing a Balanced Knockout Tournament.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Computational Aspects of Multi-Winner Approval Voting.
Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

2013
An exponential time 2-approximation algorithm for bandwidth.
Theor. Comput. Sci., 2013

Feedback Vertex Sets in Tournaments.
Journal of Graph Theory, 2013

A linear vertex kernel for maximum internal spanning tree.
J. Comput. Syst. Sci., 2013

Coalitional Manipulation for Schulze's Rule
CoRR, 2013

Possible and Necessary Winner Problem in Social Polls
CoRR, 2013

Augmenting graphs to minimize the diameter.
CoRR, 2013

Fair assignment of indivisible objects under ordinal preferences.
CoRR, 2013

Exact and Parameterized Algorithms for Max Internal Spanning Tree.
Algorithmica, 2013

Backdoors to q-Horn.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Augmenting Graphs to Minimize the Diameter.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Myhill-Nerode Methods for Hypergraphs.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

On the Complexity of Global Scheduling Constraints under Structural Restrictions.
Proceedings of the IJCAI 2013, 2013

Strong Backdoors to Bounded Treewidth SAT.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Possible and necessary winner problem in social polls.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Coalitional manipulation for Schulze's rule.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Ties Matter: Complexity of Manipulation when Tie-Breaking with a Random Vote.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Parameterizing by the Number of Numbers.
Theory Comput. Syst., 2012

A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between.
J. Comput. Syst. Sci., 2012

A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set.
Discrete Mathematics & Theoretical Computer Science, 2012

How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding
CoRR, 2012

On Finding Optimal Polytrees
CoRR, 2012

Don't Be Strict in Local Search!
CoRR, 2012

Strong Backdoors to Bounded Treewidth SAT
CoRR, 2012

From edge-disjoint paths to independent paths
CoRR, 2012

Strong Backdoors to Nested Satisfiability
CoRR, 2012

On Independent Sets and Bicliques in Graphs.
Algorithmica, 2012

Strong Backdoors to Nested Satisfiability.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

k-Gap Interval Graphs.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Backdoors to Acyclic SAT.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Backdoors to Satisfaction.
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

Don't Be Strict in Local Search!
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

On Finding Optimal Polytrees.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Kernels for feedback arc set in tournaments.
J. Comput. Syst. Sci., 2011

The Parameterized Complexity of Local Consistency.
Electronic Colloquium on Computational Complexity (ECCC), 2011

k-Gap Interval Graphs
CoRR, 2011

Backdoors to Satisfaction
CoRR, 2011

Backdoors to Acyclic SAT
CoRR, 2011

Kernels for Global Constraints
CoRR, 2011

Complexity of Splits Reconstruction for Low-Degree Trees.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Kernels for Global Constraints.
Proceedings of the IJCAI 2011, 2011

The Parameterized Complexity of Local Consistency.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

Multivariate Complexity Theory.
Proceedings of the Computer Science, The Hardware, Software and Heart of It, 2011

2010
Iterative compression and exact algorithms.
Theor. Comput. Sci., 2010

Parameterized algorithm for eternal vertex cover.
Inf. Process. Lett., 2010

Exact exponential-time algorithms for finding bicliques.
Inf. Process. Lett., 2010

Parallel cleaning of a network with brushes.
Discrete Applied Mathematics, 2010

A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set
CoRR, 2010

Parameterizing by the Number of Numbers
CoRR, 2010

Complexity of Splits Reconstruction for Low-Degree Trees
CoRR, 2010

Parameterizing by the Number of Numbers.
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

Feedback Vertex Sets in Tournaments.
Proceedings of the Algorithms, 2010

Exponential Time Algorithms - Structures, Measures, and Bounds.
VDM, ISBN: 978-3-639-21825-1, 2010

2009
Exponential time algorithms for the minimum dominating set problem on some graph classes.
ACM Trans. Algorithms, 2009

Clean the graph before you draw it!
Inf. Process. Lett., 2009

A Linear Vertex Kernel for Maximum Internal Spanning Tree
CoRR, 2009

Kernels for Feedback Arc Set In Tournaments
CoRR, 2009

A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
CoRR, 2009

An Exponential Time 2-Approximation Algorithm for Bandwidth
CoRR, 2009

On Feedback Vertex Sets in Tournaments
CoRR, 2009

On Two Techniques of Combining Branching and Treewidth.
Algorithmica, 2009

Exact and Parameterized Algorithms for Max Internal Spanning Tree.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

An Exponential Time 2-Approximation Algorithm for Bandwidth.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

A Linear Vertex Kernel for Maximum Internal Spanning Tree.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Kernels for Feedback Arc Set In Tournaments.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

Exact Exponential-Time Algorithms for Finding Bicliques in a Graph.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Exact Exponential Time Algorithms for Max Internal Spanning Tree
CoRR, 2008

On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms.
Algorithmica, 2008

On Independent Sets and Bicliques in Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

A Moderately Exponential Time Algorithm for Full Degree Spanning Tree.
Proceedings of the Theory and Applications of Models of Computation, 2008

Iterative Compression and Exact Algorithms.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007
Improved Exact Algorithms for Counting 3- and 4-Colorings.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes.
Proceedings of the Algorithm Theory, 2006

Finding a Minimum Feedback Vertex Set in Time O (1.7548n).
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Branching and Treewidth Based Exact Algorithms.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006