• J27
    Serge Gaspers and Simon Mackenzie. On the Number of Minimal Separators in Graphs. Journal of Graph Theory. In press, accepted 07/2017. [arXiv]
  • J26
    Serge Gaspers and Gregory B. Sorkin. Separate, Measure and Conquer: Faster Algorithms for Max 2-CSP and Counting Dominating Sets. ACM Transactions on Algorithms. In press, accepted 06/2017. [arXiv]
  • J25
    Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, and Stanislav Zivny. Backdoors into Heterogeneous Classes of SAT and CSP. Journal of Computer and System Sciences 85: 38-56, 2017. [doi] [arXiv]
  • C57
    Serge Gaspers, Joachim Gudmundsson, Julian Mestre and Stefan Rümmele. Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. ISAAC 2017: Proceedings of the 28th International Symposium on Algorithms and Computation. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, LIPIcs. In press, accepted 09/2017.
  • C56
    Serge Gaspers and Edward J. Lee. Faster Graph Coloring in Polynomial Space. COCOON 2017: Proceedings of the 23rd Annual International Computing and Combinatorics Conference. Springer LNCS 10392, pages 371-383. [doi] [arXiv]
  • C55
    Haris Aziz, Serge Gaspers, and Kamran Najeebullah. Weakening Covert Networks by Minimizing Inverse Geodesic Length. IJCAI 2017: Proceedings of the 26th International Joint Conference on Artificial Intelligence. IJCAI, pages 779-785. [doi]
  • C54
    Serge Gaspers and Shenwei Huang. Linearly χ-Bounding (P6,C4)-Free Graphs. WG 2017: Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science, Springer LNCS. In press, accepted 04/2017.
  • C53
    Serge Gaspers and Edward J. Lee. Exact Algorithms via Multivariate Subroutines. ICALP 2017: Proceedings of the 44th International Colloquium on Automata, Languages and Programming, Track A. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, LIPIcs 80, pages 69:1--69:13. [doi] [arXiv]
  • C52
    Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, and Abdallah Saffidine. The Parameterized Complexity of Positional Games. ICALP 2017: Proceedings of the 44th International Colloquium on Automata, Languages and Programming, Track A. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, LIPIcs 80, 90:1--90:14. [doi] [arXiv]
  • C51
    Haris Aziz, Péter Biró, Tamás Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei, and Baharak Rastegari. Stable Matching with Uncertain Pairwise Preferences. AAMAS 2017: Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems. ACM, pages 344-352. [url]
  • P4
    Serge Gaspers, Sebastian Ordyniak, and Stefan Szeider. Backdoor Sets for CSP. In Andrei A. Krokhin and Stanislav Zivny, editors, The Constraint Satisfaction Problem: Complexity and Approximability, Dagstuhl Follow-Ups 7, pages 137-157, 2017. [doi]
  • E1
    Serge Gaspers and Toby Walsh. Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings. Lecture Notes in Computer Science 10491, Springer 2017, ISBN 978-3-319-66262-6. [doi]
  • J24
    Serge Gaspers, Sebastian Ordyniak, M.S. Ramanujan, Saket Saurabh, and Stefan Szeider. Backdoors to q-Horn. Algorithmica 74(1): 540-557, 2016. [doi] [pdf]
  • C50
    Serge Gaspers, Christos Papadimitriou, Sigve Hortemo Sæther and Jan Arne Telle. On Satisfiability Problems with a Linear Structure. IPEC 2016: Proceedings of the 11th International Symposium on Parameterized and Exact Computation. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, LIPIcs 63, pages 14:1-14:14. [doi] [arXiv]
  • C49
    Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre and Stefan Rümmele. Turbocharging Treewidth Heuristics. IPEC 2016: Proceedings of the 11th International Symposium on Parameterized and Exact Computation. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, LIPIcs 63, pages 13:1-13:13. [doi]
  • C48
    Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, and Baharak Rastegari. Stable Matching with Uncertain Linear Preferences. SAGT 2016: Proceedings of the 9th International Symposium on Algorithmic Game Theory, Springer LNCS 9928, pages 195-206. [doi] [arXiv]
  • C47
    Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, and Markus L. Schmid. On the Complexity of Grammar-Based Compression over Fixed Alphabets. ICALP 2016: Proceedings of the 43rd International Colloquium on Automata, Languages and Programming, Track B, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, LIPIcs 55, pages 122:1-122:14. [doi] [LIPIcs]
  • C46
    Andrés Abeliuk, Haris Aziz, Gerardo Berbeglia, Serge Gaspers, Petr Kalina, Nicholas Mattei, Dominik Peters, Paul Stursberg, Pascal Van Hentenryck, and Toby Walsh. Interdependent Scheduling Games. IJCAI 2016: Proceedings of the 25th International Joint Conference on Artificial Intelligence, IJCAI/AAAI Press, pages 2-9. [url] [arXiv]
  • C45
    Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, and Saket Saurabh. Exact Algorithms via Monotone Local Search. STOC 2016: Proceedings of the 48th ACM Symposium on Theory of Computing, ACM, pages 764-775. [doi] [arXiv]
  • C44
    Manfred Cochefert, Jean-François Couturier, Serge Gaspers, and Dieter Kratsch. Faster Algorithms to Enumerate Hypergraph Transversals. LATIN 2016: Proceedings of the 12th Latin American Theoretical Informatics Symposium, Springer LNCS 9644, pages 306-318. [doi] [arXiv]
  • P3
    Serge Gaspers. Backdoors to SAT. In Ming-Yang Kao, editor, Encyclopedia of Algorithms, Springer, pages 167-170, 2016. [doi]
  • J23
    René van Bevern, Rodney G. Downey, Michael R. Fellows, Serge Gaspers, and Frances A. Rosamond. Myhill-Nerode Methods for Hypergraphs. Algorithmica 73(4): 696-729, 2015. [doi] [arXiv]
  • J22
    Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, and Stefan Szeider. On Finding Optimal Polytrees. Theoretical Computer Science 592: 49-58, 2015. [doi] [arXiv] [pdf]
  • J21
    Haris Aziz, Serge Gaspers, Simon Mackenzie, and Toby Walsh. Fair Assignment of Indivisible Objects Under Ordinal Preferences. Artificial Intelligence 227: 71-92, 2015. [doi] [pdf]
  • J20
    Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, and Luke Mathieson. Augmenting Graphs to Minimize the Diameter. Algorithmica 72(4): 995-1010, 2015. [doi] [arXiv] [pdf]
  • J19
    Serge Gaspers, Mathieu Liedloff, Maya J. Stein, and Karol Suchan. Complexity of Splits Reconstruction for Low-Degree Trees. Discrete Applied Mathematics 180: 89-100, 2015. [doi] [arXiv] [pdf]
  • C43
    Serge Gaspers and Simon Mackenzie. On the Number of Minimal Separators in Graphs. WG 2015: Proceedings of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science, Springer LNCS 9224, pages 116-121. [doi] [arXiv]
  • C42
    Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Nina Narodytska, and Toby Walsh. Equilibria Under the Probabilistic Serial Rule. IJCAI 2015: Proceedings of the 24th International Joint Conference on Artificial Intelligence, AAAI Press, pages 1105-1112. [url] [arXiv]
  • C41
    Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Julián Mestre, and Hanjo Täubig. Welfare Maximization in Fractional Hedonic Games. IJCAI 2015: Proceedings of the 24th International Joint Conference on Artificial Intelligence, AAAI Press, pages 461-467. [url] [pdf]
  • C40
    Martin Aleksandrov, Haris Aziz, Serge Gaspers, and Toby Walsh. Online Fair Division: analysing a Food Bank problem. IJCAI 2015: Proceedings of the 24th International Joint Conference on Artificial Intelligence (computational sustainability track), AAAI Press, pages 2540-2546 (Outstanding Student Paper Award). [url] [arXiv]
  • C39
    Serge Gaspers and Gregory B. Sorkin. Separate, Measure and Conquer: Faster Algorithms for Max 2-CSP and Counting Dominating Sets. ICALP 2015: Proceedings of the 42nd International Colloquium on Automata, Languages and Programming, Track A, Springer LNCS 9134, pages 567-579. [doi] [arXiv]
  • C38
    Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nick Mattei, and Toby Walsh. Computational Aspects of Multi-Winner Approval Voting. AAMAS 2015: Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems, ACM, pages 107-115. [url] [arXiv]
  • C37
    Haris Aziz, Serge Gaspers, Simon Mackenzie, Nick Mattei, Nina Narodytska, and Toby Walsh. Manipulating the Probabilistic Serial Rule. AAMAS 2015: Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems, ACM, pages 1451-1459. [url] [arXiv]
  • O3
    Haris Aziz, Serge Gaspers, Simon Mackenzie, and Toby Walsh. Two Desirable Fairness Concepts for Allocation of Indivisible Objects under Ordinal Preferences. ACM SIGECOM Exchanges, volume 14.2, 2015. [url]
  • J18
    Serge Gaspers and Stefan Szeider. Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning. Artificial Intelligence 216: 1-19, 2014. [doi] [arXiv] [pdf]
  • C36
    Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, and Stanislav Zivny. Backdoors into Heterogeneous Classes of SAT and CSP. AAAI 2014: Proceedings of the 28th AAAI Conference on Artificial Intelligence, AAAI press, pages 2652-2658. [url] [pdf]
  • C35
    Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Paul Stursberg, and Toby Walsh. Fixing a Balanced Knockout Tournament. AAAI 2014: Proceedings of the 28th AAAI Conference on Artificial Intelligence, AAAI press, pages 552-558. [url] [pdf]
  • C34
    Haris Aziz, Serge Gaspers, Simon Mackenzie, and Toby Walsh. Fair Assignment of Indivisible Objects Under Ordinal Preferences. AAMAS 2014: Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems, IFAAMAS/ACM, pages 1305-1312. [url] [arXiv] [pdf]
  • C33
    Serge Gaspers, Victor Naroditskiy, Nina Narodytska, and Toby Walsh. Possible and Necessary Winner Problem in Social Polls. AAMAS 2014: Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems, IFAAMAS/ACM, pages 613-620. [url] [arXiv] [pdf]
  • J17
    Martin Fürer, Serge Gaspers, and Shiva Prasad Kasiviswanathan. An Exponential Time 2-Approximation Algorithm for Bandwidth. Theoretical Computer Science 511: 23-31, 2013. [doi] [arXiv] [pdf]
  • J16
    Fedor V. Fomin, Serge Gaspers, Saket Saurabh, and Stéphan Thomassé. A Linear Vertex Kernel for Maximum Internal Spanning Tree. Journal of Computer and System Sciences 79(1): 1-6, 2013. [doi] [arXiv] [pdf]
  • J15
    Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, and Mathieu Liedloff. Exact and Parameterized Algorithms for Max Internal Spanning Tree. Algorithmica 65(1): 95-128, 2013. [doi] [pdf]
  • J14
    Serge Gaspers and Matthias Mnich. Feedback Vertex Sets in Tournaments. Journal of Graph Theory 72(1): 72-89, 2013. [doi] [arXiv] [pdf]
  • C32
    Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, and Luke Mathieson. Augmenting Graphs to Minimize the Diameter. ISAAC 2013: Proceedings of the 24th Annual International Symposium on Algorithms and Computation, Springer LNS 8283, pages 383-393. [doi] [arXiv] [pdf]
  • C31
    René van Bevern, Michael R. Fellows, Serge Gaspers, and Frances A. Rosamond. Myhill-Nerode Methods for Hypergraphs. ISAAC 2013: Proceedings of the 24th Annual International Symposium on Algorithms and Computation, Springer LNCS 8283, pages 372-382. [doi] [arXiv] [pdf]
  • C30
    Serge Gaspers and Stefan Szeider. Strong Backdoors to Bounded Treewidth SAT. FOCS 2013: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, pages 489-498. [doi] [arXiv] [pdf]
  • C29
    Geoffrey Chu, Serge Gaspers, Nina Narodytska, Andreas Schutt, and Toby Walsh. On the complexity of global scheduling constraints under structural restrictions. IJCAI 2013: Proceedings of the 23rd International Joint Conference on Artificial Intelligence, AAAI Press / IJCAI, pages 503-509. [url] [pdf]
  • C28
    Haris Aziz, Serge Gaspers, Nicholas Mattei, Nina Narodytska, and Toby Walsh. Ties Matter: Complexity of Manipulation when Tie-breaking with a Random Vote. AAAI 2013: Proceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI Press, pages 74-80. [url] [pdf]
  • C27
    Serge Gaspers, Victor Naroditskiy, Nina Narodytska, and Toby Walsh. Possible and Necessary Winner Problem in Social Polls (Extended Abstract). AAMAS 2013: Proceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems, IFAAMAS, pages 1131-1132. [url] [arXiv] [pdf]
  • C26
    Serge Gaspers, Thomas Kalinowski, Nina Narodytska, and Toby Walsh. Coalitional Manipulation for Schulze's Rule. AAMAS 2013: Proceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems, IFAAMAS, pages 431-438. [url] [arXiv] [pdf]
  • C25
    Serge Gaspers, Sebastian Ordyniak, M.S. Ramanujan, Saket Saurabh, and Stefan Szeider. Backdoors to q-Horn. STACS 2013: Proceedings of the 30th Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, LIPIcs 20, pages 67-79. [doi] [pdf]
  • O2
    Haris Aziz, Serge Gaspers, Nicholas Mattei, Nina Narodytska, and Toby Walsh. Algorithmic Decision Theory @ NICTA. AAAI 2013 Video Competition and IJCAI 2013 Video Competition, 2013. Received the most educational video award at IJCAI 2013. [mp4]
  • J13
    Serge Gaspers and Mathieu Liedloff. A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. Discrete Mathematics & Theoretical Computer Science 14(1): 29-42, 2012. [doi] [arXiv] [pdf]
  • J12
    Michael R. Fellows, Serge Gaspers, and Frances A. Rosamond. Parameterizing by the Number of Numbers. Theory of Computing Systems 50(4): 675-693, 2012. [doi] [arXiv] [pdf]
  • J11
    Serge Gaspers, Dieter Kratsch, and Mathieu Liedloff. On Independent Sets and Bicliques in Graphs. Algorithmica 62(3): 637-658, 2012. [doi] [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 78(1): 305-335, 2012. [doi] [arXiv] [pdf]
  • C24
    Serge Gaspers and Stefan Szeider. Backdoors to Acyclic SAT. ICALP 2012: Proceedings of the 39th International Colloquium on Automata, Languages and Programming, Track A, Springer LNCS 7391, pages 363-374. [doi] [arXiv] [pdf]
  • C23
    Serge Gaspers and Stefan Szeider. Strong Backdoors to Nested Satisfiability. SAT 2012: Proceedings of the 15th International Conference on Theory and Applications of Satisfiability Testing, Springer LNCS 7317, pages 72-85. [doi] [arXiv] [pdf]
  • C22
    Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, and Stefan Szeider. On Finding Optimal Polytrees. AAAI 2012: Proceedings of the 26th AAAI Conference on Artificial Intelligence, AAAI Press, pages 750-756. [url] [arXiv] [pdf]
  • C21
    Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, and Stefan Szeider. Don't Be Strict in Local Search! AAAI 2012: Proceedings of the 26th AAAI Conference on Artificial Intelligence, AAAI Press, pages 486-492. [url] [arXiv] [pdf]
  • C20
    Fedor V. Fomin, Serge Gaspers, Petr Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, and Yngve Villanger. k-Gap Interval Graphs. LATIN 2012: Proceedings of the 10th Latin American Theoretical Informatics Symposium, Springer LNCS 7256, pages 350-361. [doi] [arXiv] [pdf]
  • P2
    Serge Gaspers and Stefan Szeider. Backdoors to Satisfaction. In Hans L. Bodlaender, Rodney G. Downey, Fedor V. Fomin, Dániel Marx, editors, The Multivariate Algorithmic Revolution and Beyond: Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday, Springer LNCS 7370, pages 287-317, 2012. [doi] [arXiv]
  • I1
    Serge Gaspers. From edge-disjoint paths to independent paths. Computing Research Repository, ArXiv Report CoRR abs/1203.4483 (2012). [arXiv]
  • J9
    Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, and Stéphan Thomassé. Kernels for Feedback Arc Set In Tournaments. Journal of Computer and System Sciences 77(6): 1071-1078, 2011. [doi] [arXiv] [pdf]
  • C19
    Serge Gaspers and Stefan Szeider. The Parameterized Complexity of Local Consistency. CP 2011: Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming, Springer LNCS 6876, pages 302-316. [doi] [ECCC] [pdf]
  • C18
    Serge Gaspers, Mathieu Liedloff, Maya J. Stein, and Karol Suchan. Complexity of Splits Reconstruction for Low-Degree Trees. WG 2011: Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science, Springer LNCS 6986, pages 167-178. [doi] [arXiv] [pdf]
  • C17
    Serge Gaspers and Stefan Szeider. Kernels for Global Constraints. IJCAI 2011: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pages 540 - 545. [doi] [arXiv] [pdf]
  • P1
    Michael R. Fellows, Serge Gaspers, and Frances Rosamond. Multivariate Complexity Theory. In Edward K. Blum and Alfred V. Aho, editors, Computer Science: The Hardware, Software and Heart of It, chapter 13, pages 269-293. Springer, December 2011. [doi]
  • B1
    Serge Gaspers. Exponential Time Algorithms: Structures, Measures, and Bounds. VDM Verlag Dr. Mueller e.K., ISBN 978-3-639-21825-1, 216 pages, February 2010. [pdf screen] [pdf print] [Amazon]
  • J8
    Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, and Mathieu Liedloff. Exact exponential-time algorithms for finding bicliques. Information Processing Letters 111(2): 64-67, 2010. [doi] [pdf]
  • J7
    Fedor V. Fomin, Serge Gaspers, Petr Golovach, Dieter Kratsch, and Saket Saurabh. Parameterized Algorithm for Eternal Vertex Cover. Information Processing Letters 110(16): 702-706, 2010. [doi] [pdf]
  • J6
    Serge Gaspers, Margaret-Ellen Messinger, Pawel Pralat, and Richard J. Nowakowski. Parallel Cleaning of a Network with Brushes. Discrete Applied Mathematics 158(5): 467-478, 2010. [doi] [pdf]
  • J5
    Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, and Saket Saurabh. Iterative Compression and Exact Algorithms. Theoretical Computer Science 411(7-9): 1045-1053, 2010. [doi] [pdf]
  • C16
    Michael R. Fellows, Serge Gaspers, and Frances A. Rosamond. Parameterizing by the Number of Numbers. IPEC 2010: Proceedings of the 5th International Symposium on Parameterized and Exact Computation (formerly IWPEC), Springer LNCS 6478, pages 123 - 134. [doi] [arXiv] [pdf]
  • C15
    Serge Gaspers and Matthias Mnich. Feedback Vertex Sets in Tournaments. ESA 2010: Proceedings of the 18th Annual European Symposium on Algorithms, Part 1, Springer LNCS 6346, pages 267 - 277. [doi] [arXiv] [pdf]
  • J4
    Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, and Ioan Todinca. Exponential time algorithms for the minimum dominating set problem on some graph classes. ACM Transactions on Algorithms 6(1): Article 9, 1-21, 2009. [doi] [pdf]
  • J3
    Fedor V. Fomin, Serge Gaspers, Saket Saurabh, and Alexey A. Stepanov. On Two Techniques of Combining Branching and Treewidth. Algorithmica 54(2): 181-207, 2009. [doi] [TR] [pdf]
  • J2
    Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski, and Pawel Pralat. Clean the Graph Before You Draw It! Information Processing Letters 109(10): 463-467, 2009. [doi] [pdf]
  • C14
    Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, and Stéphan Thomassé. Kernels for Feedback Arc Set In Tournaments. FSTTCS 2009: Proceedings of the 29th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, LIPIcs 4, pages 37 - 47. [doi] [arXiv] [pdf]
  • C13
    Fedor V. Fomin, Serge Gaspers, Saket Saurabh, and Stéphan Thomassé. A Linear Vertex Kernel for Maximum Internal Spanning Tree. ISAAC 2009: Proceedings of the 20th International Symposium on Algorithms and Computation, Springer LNCS 5878, pages 275 - 282. [doi] [arXiv] [pdf]
  • C12
    Martin Fürer, Serge Gaspers, and Shiva Prasad Kasiviswanathan. An Exponential Time 2-Approximation Algorithm for Bandwidth. IWPEC 2009: Proceedings of the 4th International Workshop on Parameterized and Exact Computation, Springer LNCS 5917, pages 173 - 184. [doi] [arXiv] [pdf]
  • C11
    Henning Fernau, Serge Gaspers, and Daniel Raible. Exact and Parameterized Algorithms for Max Internal Spanning Tree. WG 2009: Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science, Springer LNCS 5911, pages 100 - 111. [doi] [arXiv] [pdf]
  • C10
    Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, and Daniel Raible. Exact exponential-time algorithms for finding bicliques in a graph. CTW 2009: Proceedings of the 8th Cologne Twente Workshop on Graphs and Combinatorial Optimization, Ecole Polytechnique and CNAM, pages 205 - 209. [url] [pdf]
  • C9
    Serge Gaspers and Gregory B. Sorkin. A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. SODA 2009: Proceedings of the 20th annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, pages 606 - 615. [doi] [arXiv] [pdf]
  • O1
    Serge Gaspers. Measure & Conquer for Parameterized Branching Algorithms. Parameterized Complexity News: Newsletter of the Parameterized Complexity Community, September 2009. [pdf]
  • PhD
    Serge Gaspers. Exponential Time Algorithms: Structures, Measures, and Bounds. PhD thesis, December 2008, University of Bergen, Norway. Advisor: Fedor V. Fomin; Committee: Thore Husfedt, Ryan Williams, and Dag Haugland. [handle] [pdf screen] [pdf print]
  • J1
    Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, and Igor Razgon. On the minimum feedback vertex set problem: Exact and enumeration algorithms. Algorithmica 52(2): 293-307, 2008. [doi] [pdf]
  • C8
    Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, and Saket Saurabh. Iterative Compression and Exact Algorithms. MFCS 2008: Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science, Springer LNCS 5162, pages 335 - 346. [doi] [pdf]
  • C7
    Serge Gaspers, Dieter Kratsch, and Mathieu Liedloff. On Independent Sets and Bicliques in Graphs. WG 2008: Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, Springer LNCS 5344, pages 171 - 182. [doi] [pdf]
  • C6
    Serge Gaspers, Saket Saurabh, and Alexey A. Stepanov. A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. TAMC 2008: Proceedings of the 5th Annual Conference on Theory and Applications of Models of Computation, Springer LNCS 4978, pages 479 - 489. [doi] [pdf]
  • C5
    Fedor V. Fomin, Serge Gaspers, and Saket Saurabh. Improved Exact Algorithms for Counting 3- and 4-Colorings. COCOON 2007: Proceedings of the 13th Annual International Computing and Combinatorics Conference, Springer LNCS 4598, pages 65 - 74. [doi] [pdf]
  • C4
    Fedor V. Fomin, Serge Gaspers, and Saket Saurabh. Branching and Treewidth Based Exact Algorithms. ISAAC 2006: Proceedings of the 17th International Symposium on Algorithms and Computation, Springer LNCS 4288, pages 16 - 25 (Best Student Paper). [doi] [pdf]
  • C3
    Fedor V. Fomin, Serge Gaspers, and Artem V. Pyatkin. Finding a Minimum Feedback Vertex Set in time O(1.7548n). IWPEC 2006: Proceedings of the 2nd International Workshop on Parameterized and Exact Computation, Springer LNCS 4169, pages 184 - 191. [doi] [TR] [pdf]
  • C2
    Serge Gaspers and Mathieu Liedloff. A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs. WG 2006: Proceedings of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science, Springer LNCS 4271, pages 78 - 89. [doi] [arXiv] [pdf]
  • C1
    Serge Gaspers, Dieter Kratsch, and Mathieu Liedloff. Exponential time algorithms for the minimum dominating set problem on some graph classes. SWAT 2006: Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, Springer LNCS 4059, pages 148 - 159. [doi] [TR] [pdf]
  • M2
    Serge Gaspers. Algorithmes exponentiels. Master Thesis (DEA Informatique de Lorraine), June 2005, Ecole Doctorale IAEM Lorraine, (in French). Advisor: Dieter Kratsch, LITA, University of Metz (now called University of Lorraine), France. [pdf]
  • M1
    Serge Gaspers. Algorithmes pour le problème de domination d'un graphe. Maîtrise Thesis (Maîtrise Informatique), June 2004, (in French). Advisor: Dieter Kratsch, LITA, University of Metz (now called University of Lorraine), France. [pdf]
  • DUT
    Serge Gaspers. Création d'un Firewall. Mémoire de fin d'études (DUT en Informatique), June 2002, (in French). Advisor: Paul Yans, Centre Universitaire de Luxembourg (now called University of Luxembourg), Luxembourg.