Serge Gaspers - RankMe

179 papers A* 24A 17B 23C 3Misc 3Journal 95Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A piecewise approach for the analysis of exact algorithms. Theor. Comput. Sci. Katie Clinch, Serge Gaspers, Zixu He, Abdallah Saffidine, Tiankuang Zhang
2026	J	`jnl`	Backdoors to satisfaction continued. Comput. Sci. Rev. Serge Gaspers, Stefan Szeider
2025	J	`jnl`	A Faster Randomized Algorithm for Vertex Cover: An Automated Approach. CoRR Katie Clinch, Serge Gaspers, Tao Zixu He, Simon Mackenzie, Tiankuang Zhang
2025	B	`conf`	A Piecewise Approach for the Analysis of Exact Algorithms. WALCOM Katie Clinch, Serge Gaspers, Zixu He, Abdallah Saffidine, Tiankuang Zhang
2025	J	`jnl`	NP-Hardness and ETH-Based Inapproximability of Communication Complexity via Relaxed Interlacing. CoRR Serge Gaspers, Tao Zixu He, Simon Mackenzie
2024	J	`jnl`	A Piecewise Approach for the Analysis of Exact Algorithms. CoRR Katie Clinch, Serge Gaspers, Abdallah Saffidine, Tiankuang Zhang
2024	Misc	`conf`	Blockchain-Enabled Private and Secure Task Allocation Framework. COMSNETS Ayda Valinezhad Orang, Ali Dorri, Serge Gaspers, Sushmita Ruj
2024	A*	`conf`	Quantum Algorithms for Graph Coloring and Other Partitioning, Covering, and Packing Problems. ICALP Serge Gaspers, Jerry Zirui Li
2024	B	`ed.`	SOFSEM 2024: Theory and Practice of Computer Science - 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19-23, 2024, Proceedings SOFSEM Henning Fernau, Serge Gaspers, Ralf Klasing
2023	J	`jnl`	Faster Graph Coloring in Polynomial Space. Algorithmica Serge Gaspers, Edward J. Lee
2023	J	`jnl`	Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems. CoRR Serge Gaspers, Jerry Zirui Li
2022	A*	`conf`	Faster Algorithms for Weak Backdoors. AAAI Serge Gaspers, Andrew Kaploun
2022	J	`jnl`	Making the Most of Parallel Composition in Differential Privacy. Proc. Priv. Enhancing Technol. Josh Smith, Hassan Jameel Asghar, Gianpaolo Gioiosa, Sirine Mrabet, Serge Gaspers, Paul Tyler
2022	J	`jnl`	Stable matching with uncertain pairwise preferences. Theor. Comput. Sci. Haris Aziz, Péter Biró, Tamás Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari
2021	J	`jnl`	Making the Most of Parallel Composition in Differential Privacy. CoRR Josh Smith, Hassan Jameel Asghar, Gianpaolo Gioiosa, Sirine Mrabet, Serge Gaspers, Paul Tyler
2021	J	`jnl`	On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. Theory Comput. Syst. Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid
2020	J	`jnl`	From Matching with Diversity Constraints to Matching with Regional Quotas. CoRR Haris Aziz, Serge Gaspers, Zhaohong Sun, Toby Walsh
2020	A	`conf`	Mechanism Design for School Choice with Soft Diversity Constraints. AAMAS Haris Aziz, Serge Gaspers, Zhaohong Sun
2020	A*	`conf`	Mechanism Design for School Choice with Soft Diversity Constraints. IJCAI Haris Aziz, Serge Gaspers, Zhaohong Sun
2020	A	`conf`	Multiple Levels of Importance in Matching with Distributional Constraints: Extended Abstract. AAMAS Haris Aziz, Serge Gaspers, Zhaohong Sun, Makoto Yokoo
2020	J	`jnl`	Stable Matching with Uncertain Linear Preferences. Algorithmica Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari
2019	J	`jnl`	(2P SIAM J. Discret. Math. Serge Gaspers, Shenwei Huang
2019	J	`jnl`	Colouring square-free graphs without long induced paths. J. Comput. Syst. Sci. Serge Gaspers, Shenwei Huang, Daniël Paulusma
2019	B	`conf`	Enumeration of Preferred Extensions in Almost Oriented Digraphs. MFCS Serge Gaspers, Ray Li
2019	J	`jnl`	Enumeration of Preferred Extensions in Almost Oriented Digraphs. CoRR Serge Gaspers, Ray Li
2019	J	`jnl`	Exact Algorithms via Monotone Local Search. J. ACM Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh
2019	A*	`conf`	Fair Online Allocation of Perishable Goods and its Application to Electric Vehicle Charging. IJCAI Enrico H. Gerding, Alvaro Perez-Diaz, Haris Aziz, Serge Gaspers, Antonia Marcu, Nicholas Mattei, Toby Walsh
2019	A	`conf`	From Matching with Diversity Constraints to Matching with Regional Quotas. AAMAS Haris Aziz, Serge Gaspers, Zhaohong Sun, Toby Walsh
2019	J	`jnl`	Linearly χ-bounding (P6, C4)-free graphs. J. Graph Theory Serge Gaspers, Shenwei Huang
2019	B	`conf`	Minimizing and Computing the Inverse Geodesic Length on Trees. ISAAC Serge Gaspers, Joshua Lau
2019	J	`jnl`	On the Parameterized Cluster Editing with Vertex Splitting Problem. CoRR Faisal N. Abu-Khzam, Judith Egan, Serge Gaspers, Alexis Shaw, Peter Shaw
2019	A*	`conf`	Optimal Surveillance of Covert Networks by Minimizing Inverse Geodesic Length. AAAI Serge Gaspers, Kamran Najeebullah
2019	J	`jnl`	Turbocharging Treewidth Heuristics. Algorithmica Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele
2018	J	`jnl`	A note on the eternal dominating set problem. Int. J. Game Theory Stephen Finbow, Serge Gaspers, Margaret-Ellen Messinger, Paul Ottaway
2018	C	`conf`	Cluster Editing with Vertex Splitting. ISCO Faisal N. Abu-Khzam, Judith Egan, Serge Gaspers, Alexis Shaw, Peter Shaw
2018	A	`conf`	Colouring Square-Free Graphs without Long Induced Paths. STACS Serge Gaspers, Shenwei Huang, Daniël Paulusma
2018	J	`jnl`	Colouring Square-Free Graphs without Long Induced Paths. CoRR Serge Gaspers, Shenwei Huang, Daniël Paulusma
2018	A	`conf`	Defender Stackelberg Game with Inverse Geodesic Length as Utility Metric. AAMAS Haris Aziz, Serge Gaspers, Edward J. Lee, Kamran Najeebullah
2018	J	`jnl`	Fixing balanced knockout and double elimination tournaments. Artif. Intell. Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Paul Stursberg, Toby Walsh
2018	A*	`conf`	Minesweeper with Limited Moves. AAAI Serge Gaspers, Stefan Rümmele, Abdallah Saffidine, Kevin Tran
2018	J	`jnl`	Minimizing and Computing the Inverse Geodesic Length on Trees. CoRR Serge Gaspers, Joshua Lau
2018	J	`jnl`	On the number of minimal separators in graphs. J. Graph Theory Serge Gaspers, Simon Mackenzie
2018	A	`conf`	Stability and Pareto Optimality in Refugee Allocation Matchings. AAMAS Haris Aziz, Jiayin Chen, Serge Gaspers, Zhaohong Sun
2018	B	`conf`	When is Red-Blue Nonblocker Fixed-Parameter Tractable? LATIN Serge Gaspers, Joachim Gudmundsson, Michael Horton, Stefan Rümmele
2017	—	`ch.`	Backdoor Sets for CSP. The Constraint Satisfaction Problem Serge Gaspers, Sebastian Ordyniak, Stefan Szeider
2017	J	`jnl`	Backdoors into heterogeneous classes of SAT and CSP. J. Comput. Syst. Sci. Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
2017	B	`conf`	Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. ISAAC Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele
2017	J	`jnl`	Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. CoRR Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele
2017	A*	`conf`	Exact Algorithms via Multivariate Subroutines. ICALP Serge Gaspers, Edward J. Lee
2017	J	`jnl`	Exact Algorithms via Multivariate Subroutines. CoRR Serge Gaspers, Edward J. Lee
2017	Misc	`conf`	Faster Graph Coloring in Polynomial Space. COCOON Serge Gaspers, Edward J. Lee
2017	J	`jnl`	Linearly $χ$-Bounding $(P_6, C_4)$-Free Graphs. CoRR Serge Gaspers, Shenwei Huang
2017	B	`conf`	Linearly \chi χ -Bounding (P_6, C_4) ( P 6 , C 4 ) -Free Graphs. WG Serge Gaspers, Shenwei Huang
2017	J	`jnl`	Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets. ACM Trans. Algorithms Serge Gaspers, Gregory B. Sorkin
2017	A	`conf`	Stable Matching with Uncertain Pairwise Preferences. AAMAS Haris Aziz, Péter Biró, Tamás Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari
2017	A*	`conf`	The Parameterized Complexity of Positional Games. ICALP Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, Abdallah Saffidine
2017	J	`jnl`	The Parameterized Complexity of Positional Games. CoRR Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, Abdallah Saffidine
2017	A	`ed.`	Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings SAT Serge Gaspers, Toby Walsh
2017	A*	`conf`	Weakening Covert Networks by Minimizing Inverse Geodesic Length. IJCAI Haris Aziz, Serge Gaspers, Kamran Najeebullah
2016	—	`ch.`	Backdoors to SAT. Encyclopedia of Algorithms Serge Gaspers
2016	J	`jnl`	Backdoors to q-Horn. Algorithmica Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider
2016	A*	`conf`	Exact algorithms via monotone local search. STOC Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh
2016	B	`conf`	Faster Algorithms to Enumerate Hypergraph Transversals. LATIN Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch
2016	J	`jnl`	Faster Graph Coloring in Polynomial Space. CoRR Serge Gaspers, Edward J. Lee
2016	A*	`conf`	Interdependent Scheduling Games. IJCAI Andrés Abeliuk, Haris Aziz, Gerardo Berbeglia, Serge Gaspers, Petr Kalina, Nicholas Mattei, Dominik Peters, Paul Stursberg, Pascal Van Hentenryck, Toby Walsh
2016	J	`jnl`	Interdependent Scheduling Games. CoRR Andrés Abeliuk, Haris Aziz, Gerardo Berbeglia, Serge Gaspers, Petr Kalina, Nicholas Mattei, Dominik Peters, Paul Stursberg, Pascal Van Hentenryck, Toby Walsh
2016	B	`conf`	On Satisfiability Problems with a Linear Structure. IPEC Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle
2016	J	`jnl`	On Satisfiability Problems with a Linear Structure. CoRR Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle
2016	A*	`conf`	On the Complexity of Grammar-Based Compression over Fixed Alphabets. ICALP Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid
2016	B	`conf`	Stable Matching with Uncertain Linear Preferences. SAGT Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari
2016	J	`jnl`	Stable Matching with Uncertain Linear Preferences. CoRR Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari
2016	B	`conf`	Turbocharging Treewidth Heuristics. IPEC Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele
2015	J	`jnl`	Augmenting Graphs to Minimize the Diameter. Algorithmica Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson
2015	J	`jnl`	Backdoors into Heterogeneous Classes of SAT and CSP. CoRR Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
2015	J	`jnl`	Complexity of splits reconstruction for low-degree trees. Discret. Appl. Math. Serge Gaspers, Mathieu Liedloff, Maya Jakobine Stein, Karol Suchan
2015	A	`conf`	Computational Aspects of Multi-Winner Approval Voting. AAMAS Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nicholas Mattei, Toby Walsh
2015	A*	`conf`	Equilibria Under the Probabilistic Serial Rule. IJCAI Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Nina Narodytska, Toby Walsh
2015	J	`jnl`	Equilibria Under the Probabilistic Serial Rule. CoRR Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Nina Narodytska, Toby Walsh
2015	J	`jnl`	Exact Algorithms via Monotone Local Search. CoRR Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh
2015	J	`jnl`	Fair assignment of indivisible objects under ordinal preferences. Artif. Intell. Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh
2015	J	`jnl`	Faster algorithms to enumerate hypergraph transversals. CoRR Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch
2015	A	`conf`	Manipulating the Probabilistic Serial Rule. AAMAS Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Nina Narodytska, Toby Walsh
2015	J	`jnl`	Manipulating the Probabilistic Serial Rule. CoRR Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Nina Narodytska, Toby Walsh
2015	J	`jnl`	Myhill-Nerode Methods for Hypergraphs. Algorithmica René van Bevern, Rodney G. Downey, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2015	J	`jnl`	On finding optimal polytrees. Theor. Comput. Sci. Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider
2015	B	`conf`	On the Number of Minimal Separators in Graphs. WG Serge Gaspers, Simon Mackenzie
2015	J	`jnl`	On the Number of Minimal Separators in Graphs. CoRR Serge Gaspers, Simon Mackenzie
2015	A*	`conf`	Online Fair Division: Analysing a Food Bank Problem. IJCAI Martin Aleksandrov, Haris Aziz, Serge Gaspers, Toby Walsh
2015	J	`jnl`	Online Fair Division: analysing a Food Bank problem. CoRR Martin Aleksandrov, Haris Aziz, Serge Gaspers, Toby Walsh
2015	—	`conf`	Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets. ICALP (1) Serge Gaspers, Gregory B. Sorkin
2015	J	`jnl`	Two desirable fairness concepts for allocation of indivisible objects under ordinal preferences. SIGecom Exch. Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh
2015	A*	`conf`	Welfare Maximization in Fractional Hedonic Games. IJCAI Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Hanjo Täubig
2014	A*	`conf`	Backdoors into Heterogeneous Classes of SAT and CSP. AAAI Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
2014	—	`conf`	Computational Aspects of Multi-Winner Approval Voting. MPREF@AAAI Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nicholas Mattei, Toby Walsh
2014	J	`jnl`	Computational Aspects of Multi-Winner Approval Voting. CoRR Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nicholas Mattei, Toby Walsh
2014	A	`conf`	Fair assignment of indivisible objects under ordinal preferences. AAMAS Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh
2014	A*	`conf`	Fixing a Balanced Knockout Tournament. AAAI Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Paul Stursberg, Toby Walsh
2014	—	`conf`	Fixing a Balanced Knockout Tournament. MPREF@AAAI Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Paul Stursberg, Toby Walsh
2014	J	`jnl`	Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning. CoRR Serge Gaspers, Stefan Szeider
2014	J	`jnl`	Guarantees and limits of preprocessing in constraint satisfaction and reasoning. Artif. Intell. Serge Gaspers, Stefan Szeider
2014	A	`conf`	Possible and necessary winner problem in social polls. AAMAS Serge Gaspers, Victor Naroditskiy, Nina Narodytska, Toby Walsh
2014	J	`jnl`	Separate, Measure and Conquer: Faster Algorithms for Max 2-CSP and Counting Dominating Sets. CoRR Serge Gaspers, Gregory B. Sorkin
2014	J	`jnl`	Strategic aspects of the probabilistic serial rule for the allocation of goods. CoRR Haris Aziz, Serge Gaspers, Nicholas Mattei, Nina Narodytska, Toby Walsh
2013	J	`jnl`	A linear vertex kernel for maximum internal spanning tree. J. Comput. Syst. Sci. Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé
2013	J	`jnl`	An exponential time 2-approximation algorithm for bandwidth. Theor. Comput. Sci. Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan
2013	B	`conf`	Augmenting Graphs to Minimize the Diameter. ISAAC Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson
2013	J	`jnl`	Augmenting graphs to minimize the diameter. CoRR Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson
2013	A	`conf`	Backdoors to q-Horn. STACS Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider
2013	J	`jnl`	Coalitional Manipulation for Schulze's Rule CoRR Serge Gaspers, Thomas Kalinowski, Nina Narodytska, Toby Walsh
2013	A	`conf`	Coalitional manipulation for Schulze's rule. AAMAS Serge Gaspers, Thomas Kalinowski, Nina Narodytska, Toby Walsh
2013	J	`jnl`	Exact and Parameterized Algorithms for Max Internal Spanning Tree. Algorithmica Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff
2013	J	`jnl`	Fair assignment of indivisible objects under ordinal preferences. CoRR Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh
2013	J	`jnl`	Feedback Vertex Sets in Tournaments. J. Graph Theory Serge Gaspers, Matthias Mnich
2013	B	`conf`	Myhill-Nerode Methods for Hypergraphs. ISAAC René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2013	A*	`conf`	On the Complexity of Global Scheduling Constraints under Structural Restrictions. IJCAI Geoffrey Chu, Serge Gaspers, Nina Narodytska, Andreas Schutt, Toby Walsh
2013	J	`jnl`	Possible and Necessary Winner Problem in Social Polls CoRR Serge Gaspers, Victor Naroditskiy, Nina Narodytska, Toby Walsh
2013	A	`conf`	Possible and necessary winner problem in social polls. AAMAS Serge Gaspers, Victor Naroditskiy, Nina Narodytska, Toby Walsh
2013	A*	`conf`	Strong Backdoors to Bounded Treewidth SAT. FOCS Serge Gaspers, Stefan Szeider
2013	A*	`conf`	Ties Matter: Complexity of Manipulation when Tie-Breaking with a Random Vote. AAAI Haris Aziz, Serge Gaspers, Nicholas Mattei, Nina Narodytska, Toby Walsh
2012	J	`jnl`	A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. Discret. Math. Theor. Comput. Sci. Serge Gaspers, Mathieu Liedloff
2012	J	`jnl`	A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. J. Comput. Syst. Sci. Serge Gaspers, Gregory B. Sorkin
2012	—	`conf`	Backdoors to Acyclic SAT. ICALP (1) Serge Gaspers, Stefan Szeider
2012	—	`conf`	Backdoors to Satisfaction. The Multivariate Algorithmic Revolution and Beyond Serge Gaspers, Stefan Szeider
2012	A*	`conf`	Don't Be Strict in Local Search! AAAI Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider
2012	J	`jnl`	Don't Be Strict in Local Search! CoRR Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider
2012	J	`jnl`	From edge-disjoint paths to independent paths CoRR Serge Gaspers
2012	J	`jnl`	How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding CoRR René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2012	J	`jnl`	On Finding Optimal Polytrees CoRR Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider
2012	A*	`conf`	On Finding Optimal Polytrees. AAAI Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider
2012	J	`jnl`	On Independent Sets and Bicliques in Graphs. Algorithmica Serge Gaspers, Dieter Kratsch, Mathieu Liedloff
2012	J	`jnl`	Parameterizing by the Number of Numbers. Theory Comput. Syst. Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2012	J	`jnl`	Strong Backdoors to Bounded Treewidth SAT CoRR Serge Gaspers, Stefan Szeider
2012	J	`jnl`	Strong Backdoors to Nested Satisfiability CoRR Serge Gaspers, Stefan Szeider
2012	A	`conf`	Strong Backdoors to Nested Satisfiability. SAT Serge Gaspers, Stefan Szeider
2012	B	`conf`	k-Gap Interval Graphs. LATIN Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger
2011	J	`jnl`	Backdoors to Acyclic SAT CoRR Serge Gaspers, Stefan Szeider
2011	J	`jnl`	Backdoors to Satisfaction CoRR Serge Gaspers, Stefan Szeider
2011	B	`conf`	Complexity of Splits Reconstruction for Low-Degree Trees. WG Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan
2011	J	`jnl`	Kernels for Global Constraints CoRR Serge Gaspers, Stefan Szeider
2011	A*	`conf`	Kernels for Global Constraints. IJCAI Serge Gaspers, Stefan Szeider
2011	J	`jnl`	Kernels for feedback arc set in tournaments. J. Comput. Syst. Sci. Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé
2011	—	`ch.`	Multivariate Complexity Theory. Computer Science, The Hardware, Software and Heart of It Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2011	A	`conf`	The Parameterized Complexity of Local Consistency. CP Serge Gaspers, Stefan Szeider
2011	J	`jnl`	The Parameterized Complexity of Local Consistency. Electron. Colloquium Comput. Complex. Serge Gaspers, Stefan Szeider
2011	J	`jnl`	k-Gap Interval Graphs CoRR Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger
2010	J	`jnl`	A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set CoRR Serge Gaspers, Mathieu Liedloff
2010	J	`jnl`	Complexity of Splits Reconstruction for Low-Degree Trees CoRR Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan
2010	J	`jnl`	Exact exponential-time algorithms for finding bicliques. Inf. Process. Lett. Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff
2010	—	`book`	Exponential Time Algorithms - Structures, Measures, and Bounds. Serge Gaspers
2010	—	`conf`	Feedback Vertex Sets in Tournaments. ESA (1) Serge Gaspers, Matthias Mnich
2010	J	`jnl`	Iterative compression and exact algorithms. Theor. Comput. Sci. Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh
2010	J	`jnl`	Parallel cleaning of a network with brushes. Discret. Appl. Math. Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski, Pawel Pralat
2010	J	`jnl`	Parameterized algorithm for eternal vertex cover. Inf. Process. Lett. Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Dieter Kratsch, Saket Saurabh
2010	J	`jnl`	Parameterizing by the Number of Numbers CoRR Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2010	B	`conf`	Parameterizing by the Number of Numbers. IPEC Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2009	J	`jnl`	A Linear Vertex Kernel for Maximum Internal Spanning Tree CoRR Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé
2009	B	`conf`	A Linear Vertex Kernel for Maximum Internal Spanning Tree. ISAAC Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé
2009	J	`jnl`	A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between CoRR Serge Gaspers, Gregory B. Sorkin
2009	A*	`conf`	A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. SODA Serge Gaspers, Gregory B. Sorkin
2009	J	`jnl`	An Exponential Time 2-Approximation Algorithm for Bandwidth CoRR Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan
2009	—	`conf`	An Exponential Time 2-Approximation Algorithm for Bandwidth. IWPEC Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan
2009	J	`jnl`	Clean the graph before you draw it! Inf. Process. Lett. Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski, Pawel Pralat
2009	C	`conf`	Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. CTW Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible
2009	B	`conf`	Exact and Parameterized Algorithms for Max Internal Spanning Tree. WG Henning Fernau, Serge Gaspers, Daniel Raible
2009	J	`jnl`	Exponential time algorithms for the minimum dominating set problem on some graph classes. ACM Trans. Algorithms Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Ioan Todinca
2009	J	`jnl`	Kernels for Feedback Arc Set In Tournaments CoRR Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé
2009	—	`conf`	Kernels for Feedback Arc Set In Tournaments. FSTTCS Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé
2009	J	`jnl`	On Feedback Vertex Sets in Tournaments CoRR Serge Gaspers, Matthias Mnich
2009	J	`jnl`	On Two Techniques of Combining Branching and Treewidth. Algorithmica Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov
2008	C	`conf`	A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. TAMC Serge Gaspers, Saket Saurabh, Alexey A. Stepanov
2008	J	`jnl`	Exact Exponential Time Algorithms for Max Internal Spanning Tree CoRR Henning Fernau, Daniel Raible, Serge Gaspers, Alexey A. Stepanov
2008	B	`conf`	Iterative Compression and Exact Algorithms. MFCS Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh
2008	B	`conf`	On Independent Sets and Bicliques in Graphs. WG Serge Gaspers, Dieter Kratsch, Mathieu Liedloff
2008	J	`jnl`	On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. Algorithmica Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, Igor Razgon
2007	Misc	`conf`	Improved Exact Algorithms for Counting 3- and 4-Colorings. COCOON Fedor V. Fomin, Serge Gaspers, Saket Saurabh
2006	B	`conf`	A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs. WG Serge Gaspers, Mathieu Liedloff
2006	B	`conf`	Branching and Treewidth Based Exact Algorithms. ISAAC Fedor V. Fomin, Serge Gaspers, Saket Saurabh
2006	—	`conf`	Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes. SWAT Serge Gaspers, Dieter Kratsch, Mathieu Liedloff
2006	—	`conf`	Finding a Minimum Feedback Vertex Set in Time IWPEC Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin