@article{ClinchGSZ24,author={Clinch, Katie and Gaspers, Serge and Saffidine, Abdallah and Zhang, Tiankuang},journal={arXiv CoRR},title={A Piecewise Approach for the Analysis of Exact Algorithms},year={2024},volume={abs/2402.10015}}
@article{GaspersL23q,author={Gaspers, Serge and Li, Jerry Zirui},journal={arXiv CoRR},title={Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems},year={2023},volume={abs/2311.08042}}
@article{GaspersL23,author={Gaspers, Serge and Lee, Edward J.},title={Faster Graph Coloring in Polynomial Space},journal={Algorithmica},volume={85},number={2},pages={584--609},year={2023},url={https://doi.org/10.1007/s00453-022-01034-7},doi={10.1007/s00453-022-01034-7}}
@article{SmithAGMGT22,author={Smith, Josh and Asghar, Hassan Jameel and Gioiosa, Gianpaolo and Mrabet, Sirine and Gaspers, Serge and Tyler, Paul},title={Making the Most of Parallel Composition in Differential Privacy},journal={Proceedings on Privacy Enhancing Technologies},volume={2022},number={1},pages={253--273},year={2022},url={https://doi.org/10.2478/popets-2022-0013},doi={10.2478/popets-2022-0013}}
@article{0001BFGHMR22,author={Aziz, Haris and Bir{\'{o}}, P{\'{e}}ter and Fleiner, Tam{\'{a}}s and Gaspers, Serge and de Haan, Ronald and Mattei, Nicholas and Rastegari, Baharak},title={Stable matching with uncertain pairwise preferences},journal={Theoretical Computer Science},volume={909},pages={1--11},year={2022},url={https://doi.org/10.1016/j.tcs.2022.01.028},doi={10.1016/j.tcs.2022.01.028}}
@article{CaselFGGS21,author={Casel, Katrin and Fernau, Henning and Gaspers, Serge and Gras, Benjamin and Schmid, Markus L.},title={On the Complexity of the Smallest Grammar Problem over Fixed Alphabets},journal={Theory of Computing Systems},volume={65},number={2},pages={344--409},year={2021},url={https://doi.org/10.1007/s00224-020-10013-w},doi={10.1007/s00224-020-10013-w}}
@article{AzizBGHMR20,author={Aziz, Haris and Bir{\'{o}}, P{\'{e}}ter and Gaspers, Serge and de Haan, Ronald and Mattei, Nicholas and Rastegari, Baharak},title={Stable Matching with Uncertain Linear Preferences},journal={Algorithmica},volume={82},number={5},pages={1410--1433},year={2020},url={https://doi.org/10.1007/s00453-019-00650-0},doi={10.1007/s00453-019-00650-0}}
AAMAS
Mechanism Design for School Choice with Soft Diversity Constraints
In Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS ’20, Auckland, New Zealand, May 9-13, 2020, 2020
@inproceedings{0001GS20,author={Aziz, Haris and Gaspers, Serge and Sun, Zhaohong},editor={Seghrouchni, Amal El Fallah and Sukthankar, Gita and An, Bo and Yorke{-}Smith, Neil},title={Mechanism Design for School Choice with Soft Diversity Constraints},booktitle={Proceedings of the 19th International Conference on Autonomous Agents
and Multiagent Systems, {AAMAS} '20, Auckland, New Zealand, May 9-13,
2020},pages={1756--1758},publisher={International Foundation for Autonomous Agents and Multiagent Systems},year={2020},url={https://dl.acm.org/doi/10.5555/3398761.3398972},doi={10.5555/3398761.3398972}}
AAMAS
Multiple Levels of Importance in Matching with Distributional Constraints: Extended Abstract
In Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS ’20, Auckland, New Zealand, May 9-13, 2020, 2020
@inproceedings{AzizGSY20,author={Aziz, Haris and Gaspers, Serge and Sun, Zhaohong and Yokoo, Makoto},editor={Seghrouchni, Amal El Fallah and Sukthankar, Gita and An, Bo and Yorke{-}Smith, Neil},title={Multiple Levels of Importance in Matching with Distributional Constraints:
Extended Abstract},booktitle={Proceedings of the 19th International Conference on Autonomous Agents
and Multiagent Systems, {AAMAS} '20, Auckland, New Zealand, May 9-13,
2020},pages={1759--1761},publisher={International Foundation for Autonomous Agents and Multiagent Systems},year={2020},url={https://dl.acm.org/doi/10.5555/3398761.3398973},doi={10.5555/3398761.3398973}}
IJCAI
Mechanism Design for School Choice with Soft Diversity Constraints
@inproceedings{0001G020,author={Aziz, Haris and Gaspers, Serge and Sun, Zhaohong},editor={Bessiere, Christian},title={Mechanism Design for School Choice with Soft Diversity Constraints},booktitle={Proceedings of the 29th International Joint Conference on
Artificial Intelligence, {IJCAI} 2020},pages={153--159},publisher={ijcai.org},year={2020},url={https://doi.org/10.24963/ijcai.2020/22},doi={10.24963/ijcai.2020/22}}
@article{GaspersGJMR19,author={Gaspers, Serge and Gudmundsson, Joachim and Jones, Mitchell and Mestre, Juli{\'{a}}n and R{\"{u}}mmele, Stefan},title={Turbocharging Treewidth Heuristics},journal={Algorithmica},volume={81},number={2},pages={439--475},year={2019},url={https://doi.org/10.1007/s00453-018-0499-1},doi={10.1007/s00453-018-0499-1}}
@article{FominGLS19,author={Fomin, Fedor V. and Gaspers, Serge and Lokshtanov, Daniel and Saurabh, Saket},title={Exact Algorithms via Monotone Local Search},journal={Journal of the {ACM}},volume={66},number={2},pages={8:1--8:23},year={2019},url={https://doi.org/10.1145/3284176},doi={10.1145/3284176}}
@article{GaspersHP19,author={Gaspers, Serge and Huang, Shenwei and Paulusma, Dani{\"{e}}l},title={Colouring square-free graphs without long induced paths},journal={Journal of Computer and System Sciences},volume={106},pages={60--79},year={2019},url={https://doi.org/10.1016/j.jcss.2019.06.002},doi={10.1016/j.jcss.2019.06.002}}
@article{GaspersH20,author={Gaspers, Serge and Huang, Shenwei},title={(\(2P_2, K_4)\)-Free Graphs are 4-Colorable},journal={{SIAM} Journal on Discrete Mathematics},volume={33},number={2},pages={1095--1120},year={2019},url={https://doi.org/10.1137/18M1205832},doi={10.1137/18M1205832}}
AAAI
Optimal Surveillance of Covert Networks by Minimizing Inverse Geodesic Length
@inproceedings{GaspersN19,author={Gaspers, Serge and Najeebullah, Kamran},title={Optimal Surveillance of Covert Networks by Minimizing Inverse Geodesic
Length},booktitle={33rd {AAAI} Conference on Artificial Intelligence, {AAAI}
2019, Honolulu, Hawaii,
USA, January 27 - February 1, 2019},pages={533--540},publisher={{AAAI} Press},year={2019},url={https://doi.org/10.1609/aaai.v33i01.3301533},doi={10.1609/aaai.v33i01.3301533}}
AAMAS
From Matching with Diversity Constraints to Matching with Regional Quotas
In Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS ’19, Montreal, QC, Canada, May 13-17, 2019, 2019
@inproceedings{0001GSW19,author={Aziz, Haris and Gaspers, Serge and Sun, Zhaohong and Walsh, Toby},editor={Elkind, Edith and Veloso, Manuela and Agmon, Noa and Taylor, Matthew E.},title={From Matching with Diversity Constraints to Matching with Regional
Quotas},booktitle={Proceedings of the 18th International Conference on Autonomous Agents
and MultiAgent Systems, {AAMAS} '19, Montreal, QC, Canada, May 13-17,
2019},pages={377--385},publisher={International Foundation for Autonomous Agents and Multiagent Systems},year={2019},url={http://dl.acm.org/citation.cfm?id=3331717}}
IJCAI
Fair Online Allocation of Perishable Goods and its Application to Electric Vehicle Charging
@inproceedings{GerdingP0GMMW19,author={Gerding, Enrico H. and Perez{-}Diaz, Alvaro and Aziz, Haris and Gaspers, Serge and Marcu, Antonia and Mattei, Nicholas and Walsh, Toby},editor={Kraus, Sarit},title={Fair Online Allocation of Perishable Goods and its Application to
Electric Vehicle Charging},booktitle={Proceedings of the 28th International Joint Conference on
Artificial Intelligence, {IJCAI} 2019, Macao, China, August 10-16,
2019},pages={5569--5575},publisher={ijcai.org},year={2019},url={https://doi.org/10.24963/ijcai.2019/773},doi={10.24963/ijcai.2019/773}}
ISAAC
Minimizing and Computing the Inverse Geodesic Length on Trees
In 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China, 2019
@inproceedings{GaspersL19,author={Gaspers, Serge and Lau, Joshua},editor={Lu, Pinyan and Zhang, Guochuan},title={Minimizing and Computing the Inverse Geodesic Length on Trees},booktitle={30th International Symposium on Algorithms and Computation, {ISAAC}
2019, December 8-11, 2019, Shanghai University of Finance and Economics,
Shanghai, China},series={LIPIcs},volume={149},pages={59:1--59:19},publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},year={2019},url={https://doi.org/10.4230/LIPIcs.ISAAC.2019.59},doi={10.4230/LIPIcs.ISAAC.2019.59}}
MFCS
Enumeration of Preferred Extensions in Almost Oriented Digraphs
@inproceedings{GaspersL20,author={Gaspers, Serge and Li, Ray},editor={Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost{-}Pieter},title={Enumeration of Preferred Extensions in Almost Oriented Digraphs},booktitle={44th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},series={LIPIcs},volume={138},pages={74:1--74:15},publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},year={2019},url={https://doi.org/10.4230/LIPIcs.MFCS.2019.74},doi={10.4230/LIPIcs.MFCS.2019.74}}
@article{AzizGMMSW18,author={Aziz, Haris and Gaspers, Serge and Mackenzie, Simon and Mattei, Nicholas and Stursberg, Paul and Walsh, Toby},title={Fixing balanced knockout and double elimination tournaments},journal={Artificial Intelligence},volume={262},pages={1--14},year={2018},url={https://doi.org/10.1016/j.artint.2018.05.002},doi={10.1016/j.artint.2018.05.002}}
@article{FinbowGMO18,author={Finbow, Stephen and Gaspers, Serge and Messinger, Margaret{-}Ellen and Ottaway, Paul},title={A note on the eternal dominating set problem},journal={International Journal of Game Theory},volume={47},number={2},pages={543--555},year={2018},url={https://doi.org/10.1007/s00182-018-0623-0},doi={10.1007/s00182-018-0623-0}}
@article{GaspersM18,author={Gaspers, Serge and Mackenzie, Simon},title={On the number of minimal separators in graphs},journal={Journal of Graph Theory},volume={87},number={4},pages={653--659},year={2018},url={https://doi.org/10.1002/jgt.22179},doi={10.1002/jgt.22179}}
@inproceedings{GaspersRST18,author={Gaspers, Serge and R{\"{u}}mmele, Stefan and Saffidine, Abdallah and Tran, Kevin},editor={McIlraith, Sheila A. and Weinberger, Kilian Q.},title={Minesweeper with Limited Moves},booktitle={32nd {AAAI} Conference on Artificial Intelligence,
(AAAI-18), New Orleans, Louisiana, USA, February
2-7, 2018},pages={860--867},publisher={{AAAI} Press},year={2018},url={https://doi.org/10.1609/aaai.v32i1.11433},doi={10.1609/aaai.v32i1.11433}}
AAMAS
Defender Stackelberg Game with Inverse Geodesic Length as Utility Metric
@inproceedings{0001GLN18,author={Aziz, Haris and Gaspers, Serge and Lee, Edward J. and Najeebullah, Kamran},editor={Andr{\'{e}}, Elisabeth and Koenig, Sven and Dastani, Mehdi and Sukthankar, Gita},title={Defender Stackelberg Game with Inverse Geodesic Length as Utility
Metric},booktitle={Proceedings of the 17th International Conference on Autonomous Agents
and MultiAgent Systems, {AAMAS} 2018, Stockholm, Sweden, July 10-15,
2018},pages={694--702},publisher={International Foundation for Autonomous Agents and Multiagent Systems
Richland, SC, {USA} / {ACM}},year={2018},url={http://dl.acm.org/citation.cfm?id=3237486}}
AAMAS
Stability and Pareto Optimality in Refugee Allocation Matchings
@inproceedings{0001CGS18,author={Aziz, Haris and Chen, Jiayin and Gaspers, Serge and Sun, Zhaohong},editor={Andr{\'{e}}, Elisabeth and Koenig, Sven and Dastani, Mehdi and Sukthankar, Gita},title={Stability and Pareto Optimality in Refugee Allocation Matchings},booktitle={Proceedings of the 17th International Conference on Autonomous Agents
and MultiAgent Systems, {AAMAS} 2018, Stockholm, Sweden, July 10-15,
2018},pages={964--972},publisher={International Foundation for Autonomous Agents and Multiagent Systems
Richland, SC, {USA} / {ACM}},year={2018},url={http://dl.acm.org/citation.cfm?id=3237842}}
@inproceedings{Abu-KhzamEGS018,author={Abu{-}Khzam, Faisal N. and Egan, Judith and Gaspers, Serge and Shaw, Alexis and Shaw, Peter},editor={Lee, Jon and Rinaldi, Giovanni and Mahjoub, Ali Ridha},title={Cluster Editing with Vertex Splitting},booktitle={Combinatorial Optimization - 5th International Symposium, {ISCO} 2018,
Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers},series={Lecture Notes in Computer Science},volume={10856},pages={1--13},publisher={Springer},year={2018},url={https://doi.org/10.1007/978-3-319-96151-4\_1},doi={10.1007/978-3-319-96151-4\_1}}
LATIN
When is Red-Blue Nonblocker Fixed-Parameter Tractable?
@inproceedings{GaspersGHR18,author={Gaspers, Serge and Gudmundsson, Joachim and Horton, Michael and R{\"{u}}mmele, Stefan},editor={Bender, Michael A. and Farach{-}Colton, Martin and Mosteiro, Miguel A.},title={When is Red-Blue Nonblocker Fixed-Parameter Tractable?},booktitle={{LATIN} 2018: Theoretical Informatics - 13th Latin American Symposium,
Buenos Aires, Argentina, April 16-19, 2018, Proceedings},series={Lecture Notes in Computer Science},volume={10807},pages={515--528},publisher={Springer},year={2018},url={https://doi.org/10.1007/978-3-319-77404-6\_38},doi={10.1007/978-3-319-77404-6\_38}}
STACS
Colouring Square-Free Graphs without Long Induced Paths
@inproceedings{GaspersHP18,author={Gaspers, Serge and Huang, Shenwei and Paulusma, Dani{\"{e}}l},editor={Niedermeier, Rolf and Vall{\'{e}}e, Brigitte},title={Colouring Square-Free Graphs without Long Induced Paths},booktitle={35th Symposium on Theoretical Aspects of Computer Science, {STACS}
2018, February 28 to March 3, 2018, Caen, France},series={LIPIcs},volume={96},pages={35:1--35:15},publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},year={2018},url={https://doi.org/10.4230/LIPIcs.STACS.2018.35},doi={10.4230/LIPIcs.STACS.2018.35}}
@article{GaspersMOSZ17,author={Gaspers, Serge and Misra, Neeldhara and Ordyniak, Sebastian and Szeider, Stefan and Zivn{\'{y}}, Stanislav},title={Backdoors into heterogeneous classes of {SAT} and {CSP}},journal={Journal of Computer and System Sciences},volume={85},pages={38--56},year={2017},url={https://doi.org/10.1016/j.jcss.2016.10.007},doi={10.1016/j.jcss.2016.10.007}}
@article{GaspersS17,author={Gaspers, Serge and Sorkin, Gregory B.},title={Separate, Measure and Conquer: Faster Polynomial-Space Algorithms
for Max 2-CSP and Counting Dominating Sets},journal={{ACM} Transactions on Algorithms},volume={13},number={4},pages={44:1--44:36},year={2017},url={https://doi.org/10.1145/3111499},doi={10.1145/3111499}}
AAMAS
Stable Matching with Uncertain Pairwise Preferences
@inproceedings{AzizBFGHMR17,author={Aziz, Haris and Bir{\'{o}}, P{\'{e}}ter and Fleiner, Tam{\'{a}}s and Gaspers, Serge and de Haan, Ronald and Mattei, Nicholas and Rastegari, Baharak},editor={Larson, Kate and Winikoff, Michael and Das, Sanmay and Durfee, Edmund H.},title={Stable Matching with Uncertain Pairwise Preferences},booktitle={Proceedings of the 16th Conference on Autonomous Agents and MultiAgent
Systems, {AAMAS} 2017, S{\~{a}}o Paulo, Brazil, May 8-12, 2017},pages={344--352},publisher={{ACM}},year={2017},url={http://dl.acm.org/citation.cfm?id=3091179}}
@inproceedings{GaspersL17,author={Gaspers, Serge and Lee, Edward J.},editor={Cao, Yixin and Chen, Jianer},title={Faster Graph Coloring in Polynomial Space},booktitle={Computing and Combinatorics - 23rd International Conference, {COCOON}
2017, Hong Kong, China, August 3-5, 2017, Proceedings},series={Lecture Notes in Computer Science},volume={10392},pages={371--383},publisher={Springer},year={2017},url={https://doi.org/10.1007/978-3-319-62389-4\_31},doi={10.1007/978-3-319-62389-4\_31}}
@inproceedings{GaspersL18,author={Gaspers, Serge and Lee, Edward J.},editor={Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},title={Exact Algorithms via Multivariate Subroutines},booktitle={44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},series={LIPIcs},volume={80},pages={69:1--69:13},publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},year={2017},url={https://doi.org/10.4230/LIPIcs.ICALP.2017.69},doi={10.4230/LIPIcs.ICALP.2017.69}}
@inproceedings{BonnetGLRS17,author={{\'{E}}douard Bonnet and Gaspers, Serge and Lambilliotte, Antonin and R{\"{u}}mmele, Stefan and Saffidine, Abdallah},editor={Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},title={The Parameterized Complexity of Positional Games},booktitle={44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},series={LIPIcs},volume={80},pages={90:1--90:14},publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},year={2017},url={https://doi.org/10.4230/LIPIcs.ICALP.2017.90},doi={10.4230/LIPIcs.ICALP.2017.90}}
IJCAI
Weakening Covert Networks by Minimizing Inverse Geodesic Length
In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, 2017
@inproceedings{0001GN17,author={Aziz, Haris and Gaspers, Serge and Najeebullah, Kamran},editor={Sierra, Carles},title={Weakening Covert Networks by Minimizing Inverse Geodesic Length},booktitle={Proceedings of the Twenty-Sixth International Joint Conference on
Artificial Intelligence, {IJCAI} 2017, Melbourne, Australia, August
19-25, 2017},pages={779--785},publisher={ijcai.org},year={2017},url={https://doi.org/10.24963/ijcai.2017/108},doi={10.24963/ijcai.2017/108}}
ISAAC
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements
@inproceedings{GaspersGMR17,author={Gaspers, Serge and Gudmundsson, Joachim and Mestre, Juli{\'{a}}n and R{\"{u}}mmele, Stefan},editor={Okamoto, Yoshio and Tokuyama, Takeshi},title={Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements},booktitle={28th International Symposium on Algorithms and Computation, {ISAAC}
2017, December 9-12, 2017, Phuket, Thailand},series={LIPIcs},volume={92},pages={37:1--37:13},publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},year={2017},url={https://doi.org/10.4230/LIPIcs.ISAAC.2017.37},doi={10.4230/LIPIcs.ISAAC.2017.37}}
In Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers, 2017
@inproceedings{GaspersH17,author={Gaspers, Serge and Huang, Shenwei},editor={Bodlaender, Hans L. and Woeginger, Gerhard J.},title={Linearly \(\chi\)-Bounding \((P_6, C_4)\)-Free Graphs},booktitle={Graph-Theoretic Concepts in Computer Science - 43rd International
Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017,
Revised Selected Papers},series={Lecture Notes in Computer Science},volume={10520},pages={263--274},publisher={Springer},year={2017},url={https://doi.org/10.1007/978-3-319-68705-6\_20},doi={10.1007/978-3-319-68705-6\_20}}
@incollection{GaspersOS17,author={Gaspers, Serge and Ordyniak, Sebastian and Szeider, Stefan},editor={Krokhin, Andrei A. and Zivn{\'{y}}, Stanislav},title={Backdoor Sets for {CSP}},booktitle={The Constraint Satisfaction Problem: Complexity and Approximability},series={Dagstuhl Follow-Ups},volume={7},pages={137--157},publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},year={2017},url={https://doi.org/10.4230/DFU.Vol7.15301.5},doi={10.4230/DFU.Vol7.15301.5}}
Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings
@proceedings{SAT2017,editor={Gaspers, Serge and Walsh, Toby},title={Theory and Applications of Satisfiability Testing - {SAT} 2017 - 20th
International Conference, Melbourne, VIC, Australia, August 28 - September
1, 2017, Proceedings},series={Lecture Notes in Computer Science},volume={10491},publisher={Springer},year={2017},url={https://doi.org/10.1007/978-3-319-66263-3},doi={10.1007/978-3-319-66263-3},isbn={978-3-319-66262-6}}
@article{GaspersORSS16,author={Gaspers, Serge and Ordyniak, Sebastian and Ramanujan, M. S. and Saurabh, Saket and Szeider, Stefan},title={Backdoors to q-Horn},journal={Algorithmica},volume={74},number={1},pages={540--557},year={2016},url={https://doi.org/10.1007/s00453-014-9958-5},doi={10.1007/s00453-014-9958-5}}
ICALP
On the Complexity of Grammar-Based Compression over Fixed Alphabets
@inproceedings{CaselFGGS16,author={Casel, Katrin and Fernau, Henning and Gaspers, Serge and Gras, Benjamin and Schmid, Markus L.},editor={Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide},title={On the Complexity of Grammar-Based Compression over Fixed Alphabets},booktitle={43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},series={LIPIcs},volume={55},pages={122:1--122:14},publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},year={2016},url={https://doi.org/10.4230/LIPIcs.ICALP.2016.122},doi={10.4230/LIPIcs.ICALP.2016.122}}
@inproceedings{AbeliukABGKMPSH16,author={Abeliuk, Andr{\'{e}}s and Aziz, Haris and Berbeglia, Gerardo and Gaspers, Serge and Kalina, Petr and Mattei, Nicholas and Peters, Dominik and Stursberg, Paul and Hentenryck, Pascal Van and Walsh, Toby},editor={Kambhampati, Subbarao},title={Interdependent Scheduling Games},booktitle={Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI} 2016, New York, NY, USA, 9-15 July
2016},pages={2--9},publisher={{IJCAI/AAAI} Press},year={2016},url={http://www.ijcai.org/Abstract/16/008}}
@inproceedings{GaspersGJMR16,author={Gaspers, Serge and Gudmundsson, Joachim and Jones, Mitchell and Mestre, Juli{\'{a}}n and R{\"{u}}mmele, Stefan},editor={Guo, Jiong and Hermelin, Danny},title={Turbocharging Treewidth Heuristics},booktitle={11th International Symposium on Parameterized and Exact Computation,
{IPEC} 2016, August 24-26, 2016, Aarhus, Denmark},series={LIPIcs},volume={63},pages={13:1--13:13},publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},year={2016},url={https://doi.org/10.4230/LIPIcs.IPEC.2016.13},doi={10.4230/LIPIcs.IPEC.2016.13}}
IPEC
On Satisfiability Problems with a Linear Structure
@inproceedings{GaspersPST16,author={Gaspers, Serge and Papadimitriou, Christos H. and S{\ae}ther, Sigve Hortemo and Telle, Jan Arne},editor={Guo, Jiong and Hermelin, Danny},title={On Satisfiability Problems with a Linear Structure},booktitle={11th International Symposium on Parameterized and Exact Computation,
{IPEC} 2016, August 24-26, 2016, Aarhus, Denmark},series={LIPIcs},volume={63},pages={14:1--14:14},publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},year={2016},url={https://doi.org/10.4230/LIPIcs.IPEC.2016.14},doi={10.4230/LIPIcs.IPEC.2016.14}}
LATIN
Faster Algorithms to Enumerate Hypergraph Transversals
@inproceedings{Cochefert0GK16,author={Cochefert, Manfred and Couturier, Jean{-}Fran{\c{c}}ois and Gaspers, Serge and Kratsch, Dieter},editor={Kranakis, Evangelos and Navarro, Gonzalo and Ch{\'{a}}vez, Edgar},title={Faster Algorithms to Enumerate Hypergraph Transversals},booktitle={{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium,
Ensenada, Mexico, April 11-15, 2016, Proceedings},series={Lecture Notes in Computer Science},volume={9644},pages={306--318},publisher={Springer},year={2016},url={https://doi.org/10.1007/978-3-662-49529-2\_23},doi={10.1007/978-3-662-49529-2\_23}}
@inproceedings{AzizBGHMR16,author={Aziz, Haris and Bir{\'{o}}, P{\'{e}}ter and Gaspers, Serge and de Haan, Ronald and Mattei, Nicholas and Rastegari, Baharak},editor={Gairing, Martin and Savani, Rahul},title={Stable Matching with Uncertain Linear Preferences},booktitle={Algorithmic Game Theory - 9th International Symposium, {SAGT} 2016,
Liverpool, UK, September 19-21, 2016. Proceedings},series={Lecture Notes in Computer Science},volume={9928},pages={195--206},publisher={Springer},year={2016},url={https://doi.org/10.1007/978-3-662-53354-3\_16},doi={10.1007/978-3-662-53354-3\_16}}
@inproceedings{FominGLS16,author={Fomin, Fedor V. and Gaspers, Serge and Lokshtanov, Daniel and Saurabh, Saket},editor={Wichs, Daniel and Mansour, Yishay},title={Exact algorithms via monotone local search},booktitle={Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},pages={764--775},publisher={{ACM}},year={2016},url={https://doi.org/10.1145/2897518.2897551},doi={10.1145/2897518.2897551}}
@incollection{Gaspers16,author={Gaspers, Serge},title={Backdoors to {SAT}},booktitle={Encyclopedia of Algorithms},pages={167--170},year={2016},url={https://doi.org/10.1007/978-1-4939-2864-4\_781},doi={10.1007/978-1-4939-2864-4\_781}}
@article{AzizGMW15,author={Aziz, Haris and Gaspers, Serge and Mackenzie, Simon and Walsh, Toby},title={Fair assignment of indivisible objects under ordinal preferences},journal={Artificial Intelligence},volume={227},pages={71--92},year={2015},url={https://doi.org/10.1016/j.artint.2015.06.002},doi={10.1016/j.artint.2015.06.002}}
@article{FratiGGM15,author={Frati, Fabrizio and Gaspers, Serge and Gudmundsson, Joachim and Mathieson, Luke},title={Augmenting Graphs to Minimize the Diameter},journal={Algorithmica},volume={72},number={4},pages={995--1010},year={2015},url={https://doi.org/10.1007/s00453-014-9886-4},doi={10.1007/s00453-014-9886-4}}
@article{BevernDFGR15,author={van Bevern, Ren{\'{e}} and Downey, Rodney G. and Fellows, Michael R. and Gaspers, Serge and Rosamond, Frances A.},title={Myhill-Nerode Methods for Hypergraphs},journal={Algorithmica},volume={73},number={4},pages={696--729},year={2015},url={https://doi.org/10.1007/s00453-015-9977-x},doi={10.1007/s00453-015-9977-x}}
@article{GaspersLSS15,author={Gaspers, Serge and Liedloff, Mathieu and Stein, Maya Jakobine and Suchan, Karol},title={Complexity of splits reconstruction for low-degree trees},journal={Discrete Applied Mathematics},volume={180},pages={89--100},year={2015},url={https://doi.org/10.1016/j.dam.2014.08.005},doi={10.1016/j.dam.2014.08.005}}
@article{AzizGMW16,author={Aziz, Haris and Gaspers, Serge and Mackenzie, Simon and Walsh, Toby},title={Two desirable fairness concepts for allocation of indivisible objects
under ordinal preferences},journal={SIGecom Exchanges},volume={14},number={2},pages={16--21},year={2015},url={https://doi.org/10.1145/2904104.2904106},doi={10.1145/2904104.2904106}}
@article{GaspersKLOS15,author={Gaspers, Serge and Koivisto, Mikko and Liedloff, Mathieu and Ordyniak, Sebastian and Szeider, Stefan},title={On finding optimal polytrees},journal={Theoretical Computer Science},volume={592},pages={49--58},year={2015},url={https://doi.org/10.1016/j.tcs.2015.05.012},doi={10.1016/j.tcs.2015.05.012}}
AAMAS
Computational Aspects of Multi-Winner Approval Voting
@inproceedings{AzizGGMMW15,author={Aziz, Haris and Gaspers, Serge and Gudmundsson, Joachim and Mackenzie, Simon and Mattei, Nicholas and Walsh, Toby},editor={Weiss, Gerhard and Yolum, Pinar and Bordini, Rafael H. and Elkind, Edith},title={Computational Aspects of Multi-Winner Approval Voting},booktitle={Proceedings of the 2015 International Conference on Autonomous Agents
and Multiagent Systems, {AAMAS} 2015, Istanbul, Turkey, May 4-8, 2015},pages={107--115},publisher={{ACM}},year={2015},url={http://dl.acm.org/citation.cfm?id=2772896}}
@inproceedings{AzizGMMNW15,author={Aziz, Haris and Gaspers, Serge and Mackenzie, Simon and Mattei, Nicholas and Narodytska, Nina and Walsh, Toby},editor={Weiss, Gerhard and Yolum, Pinar and Bordini, Rafael H. and Elkind, Edith},title={Manipulating the Probabilistic Serial Rule},booktitle={Proceedings of the 2015 International Conference on Autonomous Agents
and Multiagent Systems, {AAMAS} 2015, Istanbul, Turkey, May 4-8, 2015},pages={1451--1459},publisher={{ACM}},year={2015},url={http://dl.acm.org/citation.cfm?id=2773337}}
ICALP
Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets
@inproceedings{GaspersS15,author={Gaspers, Serge and Sorkin, Gregory B.},editor={Halld{\'{o}}rsson, Magn{\'{u}}s M. and Iwama, Kazuo and Kobayashi, Naoki and Speckmann, Bettina},title={Separate, Measure and Conquer: Faster Polynomial-Space Algorithms
for Max 2-CSP and Counting Dominating Sets},booktitle={Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},series={Lecture Notes in Computer Science},volume={9134},pages={567--579},publisher={Springer},year={2015},url={https://doi.org/10.1007/978-3-662-47672-7\_46},doi={10.1007/978-3-662-47672-7\_46}}
In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, 2015
@inproceedings{AzizGGMT15,author={Aziz, Haris and Gaspers, Serge and Gudmundsson, Joachim and Mestre, Juli{\'{a}}n and T{\"{a}}ubig, Hanjo},editor={Yang, Qiang and Wooldridge, Michael J.},title={Welfare Maximization in Fractional Hedonic Games},booktitle={Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI} 2015, Buenos Aires, Argentina, July
25-31, 2015},pages={461--467},publisher={{AAAI} Press},year={2015},url={http://ijcai.org/Abstract/15/071}}
In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, 2015
@inproceedings{AzizGMMNW16,author={Aziz, Haris and Gaspers, Serge and Mackenzie, Simon and Mattei, Nicholas and Narodytska, Nina and Walsh, Toby},editor={Yang, Qiang and Wooldridge, Michael J.},title={Equilibria Under the Probabilistic Serial Rule},booktitle={Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI} 2015, Buenos Aires, Argentina, July
25-31, 2015},pages={1105--1112},publisher={{AAAI} Press},year={2015},url={http://ijcai.org/Abstract/15/160}}
IJCAI
Online Fair Division: Analysing a Food Bank Problem
In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, 2015
@inproceedings{AleksandrovAGW15,author={Aleksandrov, Martin and Aziz, Haris and Gaspers, Serge and Walsh, Toby},editor={Yang, Qiang and Wooldridge, Michael J.},title={Online Fair Division: Analysing a Food Bank Problem},booktitle={Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI} 2015, Buenos Aires, Argentina, July
25-31, 2015},pages={2540--2546},publisher={{AAAI} Press},year={2015},url={http://ijcai.org/Abstract/15/360}}
@inproceedings{GaspersM15,author={Gaspers, Serge and Mackenzie, Simon},editor={Mayr, Ernst W.},title={On the Number of Minimal Separators in Graphs},booktitle={Graph-Theoretic Concepts in Computer Science - 41st International
Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
Papers},series={Lecture Notes in Computer Science},volume={9224},pages={116--121},publisher={Springer},year={2015},url={https://doi.org/10.1007/978-3-662-53174-7\_9},doi={10.1007/978-3-662-53174-7\_9}}
@article{GaspersS14,author={Gaspers, Serge and Szeider, Stefan},title={Guarantees and limits of preprocessing in constraint satisfaction
and reasoning},journal={Artificial Intelligence},volume={216},pages={1--19},year={2014},url={https://doi.org/10.1016/j.artint.2014.06.006},doi={10.1016/j.artint.2014.06.006}}
@inproceedings{AzizGMMSW14,author={Aziz, Haris and Gaspers, Serge and Mackenzie, Simon and Mattei, Nicholas and Stursberg, Paul and Walsh, Toby},editor={Brodley, Carla E. and Stone, Peter},title={Fixing a Balanced Knockout Tournament},booktitle={Proceedings of the 28th {AAAI} Conference on Artificial Intelligence,
July 27 -31, 2014, Qu{\'{e}}bec City, Qu{\'{e}}bec, Canada},pages={552--558},publisher={{AAAI} Press},year={2014},url={https://doi.org/10.1609/aaai.v28i1.8805},doi={10.1609/aaai.v28i1.8805}}
AAAI
Backdoors into Heterogeneous Classes of SAT and CSP
@inproceedings{GaspersMOSZ14,author={Gaspers, Serge and Misra, Neeldhara and Ordyniak, Sebastian and Szeider, Stefan and Zivn{\'{y}}, Stanislav},editor={Brodley, Carla E. and Stone, Peter},title={Backdoors into Heterogeneous Classes of {SAT} and {CSP}},booktitle={Proceedings of the 28th {AAAI} Conference on Artificial Intelligence,
July 27 -31, 2014, Qu{\'{e}}bec City, Qu{\'{e}}bec, Canada},pages={2652--2658},publisher={{AAAI} Press},year={2014},url={https://doi.org/10.1609/aaai.v28i1.9111},doi={10.1609/aaai.v28i1.9111}}
AAMAS
Possible and necessary winner problem in social polls
@inproceedings{GaspersNNW14,author={Gaspers, Serge and Naroditskiy, Victor and Narodytska, Nina and Walsh, Toby},editor={Bazzan, Ana L. C. and Huhns, Michael N. and Lomuscio, Alessio and Scerri, Paul},title={Possible and necessary winner problem in social polls},booktitle={International conference on Autonomous Agents and Multi-Agent Systems,
{AAMAS} '14, Paris, France, May 5-9, 2014},pages={613--620},publisher={{IFAAMAS/ACM}},year={2014},url={http://dl.acm.org/citation.cfm?id=2615831}}
AAMAS
Fair assignment of indivisible objects under ordinal preferences
@inproceedings{AzizGMW14,author={Aziz, Haris and Gaspers, Serge and Mackenzie, Simon and Walsh, Toby},editor={Bazzan, Ana L. C. and Huhns, Michael N. and Lomuscio, Alessio and Scerri, Paul},title={Fair assignment of indivisible objects under ordinal preferences},booktitle={International conference on Autonomous Agents and Multi-Agent Systems,
{AAMAS} '14, Paris, France, May 5-9, 2014},pages={1305--1312},publisher={{IFAAMAS/ACM}},year={2014},url={http://dl.acm.org/citation.cfm?id=2617456}}
@article{Binkele-RaibleFGL13,author={Binkele{-}Raible, Daniel and Fernau, Henning and Gaspers, Serge and Liedloff, Mathieu},title={Exact and Parameterized Algorithms for Max Internal Spanning Tree},journal={Algorithmica},volume={65},number={1},pages={95--128},year={2013},url={https://doi.org/10.1007/s00453-011-9575-5},doi={10.1007/s00453-011-9575-5}}
@article{FominGST13,author={Fomin, Fedor V. and Gaspers, Serge and Saurabh, Saket and Thomass{\'{e}}, St{\'{e}}phan},title={A linear vertex kernel for maximum internal spanning tree},journal={Journal of Computer and System Sciences},volume={79},number={1},pages={1--6},year={2013},url={https://doi.org/10.1016/j.jcss.2012.03.004},doi={10.1016/j.jcss.2012.03.004}}
@article{GaspersM13,author={Gaspers, Serge and Mnich, Matthias},title={Feedback Vertex Sets in Tournaments},journal={Journal of Graph Theory},volume={72},number={1},pages={72--89},year={2013},url={https://doi.org/10.1002/jgt.21631},doi={10.1002/jgt.21631}}
@article{FurerGK13,author={F{\"{u}}rer, Martin and Gaspers, Serge and Kasiviswanathan, Shiva Prasad},title={An exponential time 2-approximation algorithm for bandwidth},journal={Theoretical Computer Science},volume={511},pages={23--31},year={2013},url={https://doi.org/10.1016/j.tcs.2013.03.024},doi={10.1016/j.tcs.2013.03.024}}
AAAI
Ties Matter: Complexity of Manipulation when Tie-Breaking with a Random Vote
@inproceedings{AzizGMNW13,author={Aziz, Haris and Gaspers, Serge and Mattei, Nicholas and Narodytska, Nina and Walsh, Toby},editor={desJardins, Marie and Littman, Michael L.},title={Ties Matter: Complexity of Manipulation when Tie-Breaking with a Random
Vote},booktitle={Proceedings of the 27th {AAAI} Conference on Artificial
Intelligence, July 14-18, 2013, Bellevue, Washington, {USA}},pages={74--80},publisher={{AAAI} Press},year={2013},url={https://doi.org/10.1609/aaai.v27i1.8701},doi={10.1609/aaai.v27i1.8701}}
@inproceedings{GaspersKNW13,author={Gaspers, Serge and Kalinowski, Thomas and Narodytska, Nina and Walsh, Toby},editor={Gini, Maria L. and Shehory, Onn and Ito, Takayuki and Jonker, Catholijn M.},title={Coalitional manipulation for Schulze's rule},booktitle={International conference on Autonomous Agents and Multi-Agent Systems,
{AAMAS} '13, Saint Paul, MN, USA, May 6-10, 2013},pages={431--438},publisher={{IFAAMAS}},year={2013},url={http://dl.acm.org/citation.cfm?id=2484989}}
AAMAS
Possible and necessary winner problem in social polls
@inproceedings{GaspersNNW13,author={Gaspers, Serge and Naroditskiy, Victor and Narodytska, Nina and Walsh, Toby},editor={Gini, Maria L. and Shehory, Onn and Ito, Takayuki and Jonker, Catholijn M.},title={Possible and necessary winner problem in social polls},booktitle={International conference on Autonomous Agents and Multi-Agent Systems,
{AAMAS} '13, Saint Paul, MN, USA, May 6-10, 2013},pages={1131--1132},publisher={{IFAAMAS}},year={2013},url={http://dl.acm.org/citation.cfm?id=2485106}}
@inproceedings{ChuGNSW13,author={Chu, Geoffrey and Gaspers, Serge and Narodytska, Nina and Schutt, Andreas and Walsh, Toby},editor={Rossi, Francesca},title={On the Complexity of Global Scheduling Constraints under Structural
Restrictions},booktitle={{IJCAI} 2013, Proceedings of the 23rd International Joint Conference
on Artificial Intelligence, Beijing, China, August 3-9, 2013},pages={503--509},publisher={{IJCAI/AAAI}},year={2013},url={http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6878}}
@inproceedings{BevernFGR13,author={van Bevern, Ren{\'{e}} and Fellows, Michael R. and Gaspers, Serge and Rosamond, Frances A.},editor={Cai, Leizhen and Cheng, Siu{-}Wing and Lam, Tak Wah},title={Myhill-Nerode Methods for Hypergraphs},booktitle={Algorithms and Computation - 24th International Symposium, {ISAAC}
2013, Hong Kong, China, December 16-18, 2013, Proceedings},series={Lecture Notes in Computer Science},volume={8283},pages={372--382},publisher={Springer},year={2013},url={https://doi.org/10.1007/978-3-642-45030-3\_35},doi={10.1007/978-3-642-45030-3\_35}}
@inproceedings{FratiGGM13,author={Frati, Fabrizio and Gaspers, Serge and Gudmundsson, Joachim and Mathieson, Luke},editor={Cai, Leizhen and Cheng, Siu{-}Wing and Lam, Tak Wah},title={Augmenting Graphs to Minimize the Diameter},booktitle={Algorithms and Computation - 24th International Symposium, {ISAAC}
2013, Hong Kong, China, December 16-18, 2013, Proceedings},series={Lecture Notes in Computer Science},volume={8283},pages={383--393},publisher={Springer},year={2013},url={https://doi.org/10.1007/978-3-642-45030-3\_36},doi={10.1007/978-3-642-45030-3\_36}}
@inproceedings{GaspersORSS13,author={Gaspers, Serge and Ordyniak, Sebastian and Ramanujan, M. S. and Saurabh, Saket and Szeider, Stefan},editor={Portier, Natacha and Wilke, Thomas},title={Backdoors to q-Horn},booktitle={30th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},series={LIPIcs},volume={20},pages={67--79},publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},year={2013},url={https://doi.org/10.4230/LIPIcs.STACS.2013.67},doi={10.4230/LIPIcs.STACS.2013.67}}
@article{GaspersKL12,author={Gaspers, Serge and Kratsch, Dieter and Liedloff, Mathieu},title={On Independent Sets and Bicliques in Graphs},journal={Algorithmica},volume={62},number={3-4},pages={637--658},year={2012},url={https://doi.org/10.1007/s00453-010-9474-1},doi={10.1007/s00453-010-9474-1}}
@article{GaspersS12,author={Gaspers, Serge and Sorkin, Gregory B.},title={A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything
in between},journal={Journal of Computer and System Sciences},volume={78},number={1},pages={305--335},year={2012},url={https://doi.org/10.1016/j.jcss.2011.05.010},doi={10.1016/j.jcss.2011.05.010}}
@article{FellowsGR12,author={Fellows, Michael R. and Gaspers, Serge and Rosamond, Frances A.},title={Parameterizing by the Number of Numbers},journal={Theory of Computing Systems},volume={50},number={4},pages={675--693},year={2012},url={https://doi.org/10.1007/s00224-011-9367-y},doi={10.1007/s00224-011-9367-y}}
@inproceedings{GaspersS16,author={Gaspers, Serge and Szeider, Stefan},editor={Bodlaender, Hans L. and Downey, Rod and Fomin, Fedor V. and Marx, D{\'{a}}niel},title={Backdoors to Satisfaction},booktitle={The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated
to Michael R. Fellows on the Occasion of His 60th Birthday},series={Lecture Notes in Computer Science},volume={7370},pages={287--317},publisher={Springer},year={2012},url={https://doi.org/10.1007/978-3-642-30891-8\_15},doi={10.1007/978-3-642-30891-8\_15}}
@inproceedings{GaspersKOSS12,author={Gaspers, Serge and Kim, Eun Jung and Ordyniak, Sebastian and Saurabh, Saket and Szeider, Stefan},editor={Hoffmann, J{\"{o}}rg and Selman, Bart},title={Don't Be Strict in Local Search!},booktitle={Proceedings of the 26th {AAAI} Conference on Artificial Intelligence,
July 22-26, 2012, Toronto, Ontario, Canada},pages={486--492},publisher={{AAAI} Press},year={2012},url={https://doi.org/10.1609/aaai.v26i1.8128},doi={10.1609/aaai.v26i1.8128}}
@inproceedings{GaspersKLOS12,author={Gaspers, Serge and Koivisto, Mikko and Liedloff, Mathieu and Ordyniak, Sebastian and Szeider, Stefan},editor={Hoffmann, J{\"{o}}rg and Selman, Bart},title={On Finding Optimal Polytrees},booktitle={Proceedings of the 26th {AAAI} Conference on Artificial Intelligence,
July 22-26, 2012, Toronto, Ontario, Canada},pages={750--756},publisher={{AAAI} Press},year={2012},url={https://doi.org/10.1609/aaai.v26i1.8217},doi={10.1609/aaai.v26i1.8217}}
@inproceedings{GaspersS18,author={Gaspers, Serge and Szeider, Stefan},editor={Czumaj, Artur and Mehlhorn, Kurt and Pitts, Andrew M. and Wattenhofer, Roger},title={Backdoors to Acyclic {SAT}},booktitle={Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},series={Lecture Notes in Computer Science},volume={7391},pages={363--374},publisher={Springer},year={2012},url={https://doi.org/10.1007/978-3-642-31594-7\_31},doi={10.1007/978-3-642-31594-7\_31}}
@inproceedings{FominGGSSLVV12,author={Fomin, Fedor V. and Gaspers, Serge and Golovach, Petr A. and Suchan, Karol and Szeider, Stefan and van Leeuwen, Erik Jan and Vatshelle, Martin and Villanger, Yngve},editor={Fern{\'{a}}ndez{-}Baca, David},title={k-Gap Interval Graphs},booktitle={{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
Arequipa, Peru, April 16-20, 2012. Proceedings},series={Lecture Notes in Computer Science},volume={7256},pages={350--361},publisher={Springer},year={2012},url={https://doi.org/10.1007/978-3-642-29344-3\_30},doi={10.1007/978-3-642-29344-3\_30}}
@inproceedings{GaspersS19,author={Gaspers, Serge and Szeider, Stefan},editor={Cimatti, Alessandro and Sebastiani, Roberto},title={Strong Backdoors to Nested Satisfiability},booktitle={Theory and Applications of Satisfiability Testing - {SAT} 2012 - 15th
International Conference, Trento, Italy, June 17-20, 2012. Proceedings},series={Lecture Notes in Computer Science},volume={7317},pages={72--85},publisher={Springer},year={2012},url={https://doi.org/10.1007/978-3-642-31612-8\_7},doi={10.1007/978-3-642-31612-8\_7}}
@article{BessyFGPPST11,author={Bessy, St{\'{e}}phane and Fomin, Fedor V. and Gaspers, Serge and Paul, Christophe and Perez, Anthony and Saurabh, Saket and Thomass{\'{e}}, St{\'{e}}phan},title={Kernels for feedback arc set in tournaments},journal={Journal of Computer and System Sciences},volume={77},number={6},pages={1071--1078},year={2011},url={https://doi.org/10.1016/j.jcss.2010.10.001},doi={10.1016/j.jcss.2010.10.001}}
@incollection{FellowsGR11,author={Fellows, Michael R. and Gaspers, Serge and Rosamond, Frances A.},editor={Blum, Edward K. and Aho, Alfred V.},title={Multivariate Complexity Theory},booktitle={Computer Science, The Hardware, Software and Heart of It},pages={269--293},publisher={Springer},year={2011},url={https://doi.org/10.1007/978-1-4614-1168-0\_13},doi={10.1007/978-1-4614-1168-0\_13}}
In Principles and Practice of Constraint Programming - CP 2011 - 17th International Conference, CP 2011, Perugia, Italy, September 12-16, 2011. Proceedings, 2011
@inproceedings{GaspersS11,techrep={https://eccc.weizmann.ac.il/report/2011/071},author={Gaspers, Serge and Szeider, Stefan},editor={Lee, Jimmy Ho{-}Man},title={The Parameterized Complexity of Local Consistency},booktitle={Principles and Practice of Constraint Programming - {CP} 2011 - 17th
International Conference, {CP} 2011, Perugia, Italy, September 12-16,
2011. Proceedings},series={Lecture Notes in Computer Science},volume={6876},pages={302--316},publisher={Springer},year={2011},url={https://doi.org/10.1007/978-3-642-23786-7\_24},doi={10.1007/978-3-642-23786-7\_24}}
@inproceedings{GaspersS20,author={Gaspers, Serge and Szeider, Stefan},editor={Walsh, Toby},title={Kernels for Global Constraints},booktitle={{IJCAI} 2011, Proceedings of the 22nd International Joint Conference
on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22,
2011},pages={540--545},publisher={{IJCAI/AAAI}},year={2011},url={https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-098},doi={10.5591/978-1-57735-516-8/IJCAI11-098}}
WG
Complexity of Splits Reconstruction for Low-Degree Trees
In Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers, 2011
@inproceedings{GaspersLSS11,author={Gaspers, Serge and Liedloff, Mathieu and Stein, Maya and Suchan, Karol},editor={Kolman, Petr and Kratochv{\'{\i}}l, Jan},title={Complexity of Splits Reconstruction for Low-Degree Trees},booktitle={Graph-Theoretic Concepts in Computer Science - 37th International
Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24,
2011. Revised Papers},series={Lecture Notes in Computer Science},volume={6986},pages={167--178},publisher={Springer},year={2011},url={https://doi.org/10.1007/978-3-642-25870-1\_16},doi={10.1007/978-3-642-25870-1\_16}}
@book{0024903,author={Gaspers, Serge},title={Exponential Time Algorithms - Structures, Measures, and Bounds},publisher={{VDM}},year={2010},isbn={978-3-639-21825-1}}
@article{GaspersMNP10,author={Gaspers, Serge and Messinger, Margaret{-}Ellen and Nowakowski, Richard J. and Pralat, Pawel},title={Parallel cleaning of a network with brushes},journal={Discrete Applied Mathematics},volume={158},number={5},pages={467--478},year={2010},url={https://doi.org/10.1016/j.dam.2009.11.003},doi={10.1016/j.dam.2009.11.003}}
@article{FominGGKS10,author={Fomin, Fedor V. and Gaspers, Serge and Golovach, Petr A. and Kratsch, Dieter and Saurabh, Saket},title={Parameterized algorithm for eternal vertex cover},journal={Information Processing Letters},volume={110},number={16},pages={702--706},year={2010},url={https://doi.org/10.1016/j.ipl.2010.05.029},doi={10.1016/j.ipl.2010.05.029}}
@article{Binkele-RaibleFGL10,author={Binkele{-}Raible, Daniel and Fernau, Henning and Gaspers, Serge and Liedloff, Mathieu},title={Exact exponential-time algorithms for finding bicliques},journal={Information Processing Letters},volume={111},number={2},pages={64--67},year={2010},url={https://doi.org/10.1016/j.ipl.2010.10.020},doi={10.1016/j.ipl.2010.10.020}}
@article{FominGKLS10,author={Fomin, Fedor V. and Gaspers, Serge and Kratsch, Dieter and Liedloff, Mathieu and Saurabh, Saket},title={Iterative compression and exact algorithms},journal={Theoretical Computer Science},volume={411},number={7-9},pages={1045--1053},year={2010},url={https://doi.org/10.1016/j.tcs.2009.11.012},doi={10.1016/j.tcs.2009.11.012}}
@inproceedings{GaspersM10,author={Gaspers, Serge and Mnich, Matthias},editor={de Berg, Mark and Meyer, Ulrich},title={Feedback Vertex Sets in Tournaments},booktitle={Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {I}},series={Lecture Notes in Computer Science},volume={6346},pages={267--277},publisher={Springer},year={2010},url={https://doi.org/10.1007/978-3-642-15775-2\_23},doi={10.1007/978-3-642-15775-2\_23}}
@inproceedings{FellowsGR10,author={Fellows, Michael R. and Gaspers, Serge and Rosamond, Frances A.},editor={Raman, Venkatesh and Saurabh, Saket},title={Parameterizing by the Number of Numbers},booktitle={Parameterized and Exact Computation - 5th International Symposium,
{IPEC} 2010, Chennai, India, December 13-15, 2010. Proceedings},series={Lecture Notes in Computer Science},volume={6478},pages={123--134},publisher={Springer},year={2010},url={https://doi.org/10.1007/978-3-642-17493-3\_13},doi={10.1007/978-3-642-17493-3\_13}}
@article{FominGSS09,techrep={http://www.ii.uib.no/publikasjoner/texrap/pdf/2006-337.pdf},author={Fomin, Fedor V. and Gaspers, Serge and Saurabh, Saket and Stepanov, Alexey A.},title={On Two Techniques of Combining Branching and Treewidth},journal={Algorithmica},volume={54},number={2},pages={181--207},year={2009},url={https://doi.org/10.1007/s00453-007-9133-3},doi={10.1007/s00453-007-9133-3}}
@article{GaspersMNP09,author={Gaspers, Serge and Messinger, Margaret{-}Ellen and Nowakowski, Richard J. and Pralat, Pawel},title={Clean the graph before you draw it!},journal={Information Processing Letters},volume={109},number={10},pages={463--467},year={2009},url={https://doi.org/10.1016/j.ipl.2009.01.003},doi={10.1016/j.ipl.2009.01.003}}
@article{GaspersKLT09,author={Gaspers, Serge and Kratsch, Dieter and Liedloff, Mathieu and Todinca, Ioan},title={Exponential time algorithms for the minimum dominating set problem
on some graph classes},journal={{ACM} Transactions on Algorithms},volume={6},number={1},pages={9:1--9:21},year={2009},url={https://doi.org/10.1145/1644015.1644024},doi={10.1145/1644015.1644024}}
CTW
Exact Exponential-Time Algorithms for Finding Bicliques in a Graph
@inproceedings{FernauGKLR09,author={Fernau, Henning and Gaspers, Serge and Kratsch, Dieter and Liedloff, Mathieu and Raible, Daniel},editor={Cafieri, Sonia and Mucherino, Antonio and Nannicini, Giacomo and Tarissan, Fabien and Liberti, Leo},title={Exact Exponential-Time Algorithms for Finding Bicliques in a Graph},booktitle={Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial
Optimization, {CTW} 2009, Paris, France, June 2-4 2009},pages={205--209},year={2009},url={http://www.lix.polytechnique.fr/ctw09/ctw09-proceedings.pdf\#page=217}}
In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, December 15-17, 2009, IIT Kanpur, India, 2009
@inproceedings{BessyFGPPST09,author={Bessy, St{\'{e}}phane and Fomin, Fedor V. and Gaspers, Serge and Paul, Christophe and Perez, Anthony and Saurabh, Saket and Thomass{\'{e}}, St{\'{e}}phan},editor={Kannan, Ravi and Kumar, K. Narayan},title={Kernels for Feedback Arc Set In Tournaments},booktitle={{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2009, December 15-17, 2009,
{IIT} Kanpur, India},series={LIPIcs},volume={4},pages={37--47},publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},year={2009},url={https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2305},doi={10.4230/LIPIcs.FSTTCS.2009.2305}}
ISAAC
A Linear Vertex Kernel for Maximum Internal Spanning Tree
@inproceedings{FominGST09,author={Fomin, Fedor V. and Gaspers, Serge and Saurabh, Saket and Thomass{\'{e}}, St{\'{e}}phan},editor={Dong, Yingfei and Du, Ding{-}Zhu and Ibarra, Oscar H.},title={A Linear Vertex Kernel for Maximum Internal Spanning Tree},booktitle={Algorithms and Computation, 20th International Symposium, {ISAAC}
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},series={Lecture Notes in Computer Science},volume={5878},pages={275--282},publisher={Springer},year={2009},url={https://doi.org/10.1007/978-3-642-10631-6\_29},doi={10.1007/978-3-642-10631-6\_29}}
IPEC
An Exponential Time 2-Approximation Algorithm for Bandwidth
In Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, 2009
@inproceedings{FurerGK09,author={F{\"{u}}rer, Martin and Gaspers, Serge and Kasiviswanathan, Shiva Prasad},editor={Chen, Jianer and Fomin, Fedor V.},title={An Exponential Time 2-Approximation Algorithm for Bandwidth},booktitle={Parameterized and Exact Computation, 4th International Workshop, {IWPEC}
2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
Papers},series={Lecture Notes in Computer Science},volume={5917},pages={173--184},publisher={Springer},year={2009},url={https://doi.org/10.1007/978-3-642-11269-0\_14},doi={10.1007/978-3-642-11269-0\_14}}
SODA
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
@inproceedings{GaspersS09,author={Gaspers, Serge and Sorkin, Gregory B.},editor={Mathieu, Claire},title={A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything
in between},booktitle={Proceedings of the 20th Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},pages={606--615},publisher={{SIAM}},year={2009},url={https://doi.org/10.1137/1.9781611973068.67},doi={10.1137/1.9781611973068.67}}
WG
Exact and Parameterized Algorithms for Max Internal Spanning Tree
@inproceedings{FernauGR09,author={Fernau, Henning and Gaspers, Serge and Raible, Daniel},editor={Paul, Christophe and Habib, Michel},title={Exact and Parameterized Algorithms for Max Internal Spanning Tree},booktitle={Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},series={Lecture Notes in Computer Science},volume={5911},pages={100--111},year={2009},url={https://doi.org/10.1007/978-3-642-11409-0\_9},doi={10.1007/978-3-642-11409-0\_9}}
@phdthesis{Gaspers08,author={Gaspers, Serge},school={University of Bergen, Norway},title={Exponential Time Algorithms: Structures, Measures, and Bounds},year={2008},url={http://hdl.handle.net/1956/3436}}
@article{FominGPR08,author={Fomin, Fedor V. and Gaspers, Serge and Pyatkin, Artem V. and Razgon, Igor},title={On the Minimum Feedback Vertex Set Problem: Exact and Enumeration
Algorithms},journal={Algorithmica},volume={52},number={2},pages={293--307},year={2008},url={https://doi.org/10.1007/s00453-007-9152-0},doi={10.1007/s00453-007-9152-0}}
@inproceedings{FominGKLS08,author={Fomin, Fedor V. and Gaspers, Serge and Kratsch, Dieter and Liedloff, Mathieu and Saurabh, Saket},editor={Ochmanski, Edward and Tyszkiewicz, Jerzy},title={Iterative Compression and Exact Algorithms},booktitle={Mathematical Foundations of Computer Science 2008, 33rd International
Symposium, {MFCS} 2008, Torun, Poland, August 25-29, 2008, Proceedings},series={Lecture Notes in Computer Science},volume={5162},pages={335--346},publisher={Springer},year={2008},url={https://doi.org/10.1007/978-3-540-85238-4\_27},doi={10.1007/978-3-540-85238-4\_27}}
TAMC
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree
@inproceedings{GaspersSS08,author={Gaspers, Serge and Saurabh, Saket and Stepanov, Alexey A.},editor={Agrawal, Manindra and Du, Ding{-}Zhu and Duan, Zhenhua and Li, Angsheng},title={A Moderately Exponential Time Algorithm for Full Degree Spanning Tree},booktitle={Theory and Applications of Models of Computation, 5th International
Conference, {TAMC} 2008, Xi'an, China, April 25-29, 2008. Proceedings},series={Lecture Notes in Computer Science},volume={4978},pages={479--489},publisher={Springer},year={2008},url={https://doi.org/10.1007/978-3-540-79228-4\_42},doi={10.1007/978-3-540-79228-4\_42}}
@inproceedings{GaspersKL08,author={Gaspers, Serge and Kratsch, Dieter and Liedloff, Mathieu},editor={Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Dani{\"{e}}l},title={On Independent Sets and Bicliques in Graphs},booktitle={Graph-Theoretic Concepts in Computer Science, 34th International Workshop,
{WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers},series={Lecture Notes in Computer Science},volume={5344},pages={171--182},year={2008},url={https://doi.org/10.1007/978-3-540-92248-3\_16},doi={10.1007/978-3-540-92248-3\_16}}
2007
COCOON
Improved Exact Algorithms for Counting 3- and 4-Colorings
@inproceedings{FominGS07,author={Fomin, Fedor V. and Gaspers, Serge and Saurabh, Saket},editor={Lin, Guohui},title={Improved Exact Algorithms for Counting 3- and 4-Colorings},booktitle={Computing and Combinatorics, 13th Annual International Conference,
{COCOON} 2007, Banff, Canada, July 16-19, 2007, Proceedings},series={Lecture Notes in Computer Science},volume={4598},pages={65--74},publisher={Springer},year={2007},url={https://doi.org/10.1007/978-3-540-73545-8\_9},doi={10.1007/978-3-540-73545-8\_9}}
@inproceedings{FominGS06,author={Fomin, Fedor V. and Gaspers, Serge and Saurabh, Saket},editor={Asano, Tetsuo},title={Branching and Treewidth Based Exact Algorithms},booktitle={Algorithms and Computation, 17th International Symposium, {ISAAC}
2006, Kolkata, India, December 18-20, 2006, Proceedings},series={Lecture Notes in Computer Science},volume={4288},pages={16--25},publisher={Springer},year={2006},url={https://doi.org/10.1007/11940128\_4},doi={10.1007/11940128\_4}}
IPEC
Finding a Minimum Feedback Vertex Set in Time \(O(1.7548^n)\)
@inproceedings{FominGP06,techrep={http://www.ii.uib.no/publikasjoner/texrap/pdf/2006-324.pdf},author={Fomin, Fedor V. and Gaspers, Serge and Pyatkin, Artem V.},editor={Bodlaender, Hans L. and Langston, Michael A.},title={Finding a Minimum Feedback Vertex Set in Time \(O(1.7548^n)\)},booktitle={Parameterized and Exact Computation, Second International Workshop,
{IWPEC} 2006, Z{\"{u}}rich, Switzerland, September 13-15, 2006, Proceedings},series={Lecture Notes in Computer Science},volume={4169},pages={184--191},publisher={Springer},year={2006},url={https://doi.org/10.1007/11847250\_17},doi={10.1007/11847250\_17}}
SWAT
Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes
@inproceedings{GaspersKL06,techr={http://www.ii.uib.no/publikasjoner/texrap/pdf/2006-322.pdf},author={Gaspers, Serge and Kratsch, Dieter and Liedloff, Mathieu},editor={Arge, Lars and Freivalds, Rusins},title={Exponential Time Algorithms for the Minimum Dominating Set Problem
on Some Graph Classes},booktitle={Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},series={Lecture Notes in Computer Science},volume={4059},pages={148--159},publisher={Springer},year={2006},url={https://doi.org/10.1007/11785293\_16},doi={10.1007/11785293\_16}}
WG
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs
@inproceedings{GaspersL06,author={Gaspers, Serge and Liedloff, Mathieu},editor={Fomin, Fedor V.},title={A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating
Set in Graphs},booktitle={Graph-Theoretic Concepts in Computer Science, 32nd International Workshop,
{WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers},series={Lecture Notes in Computer Science},volume={4271},pages={78--89},publisher={Springer},year={2006},url={https://doi.org/10.1007/11917496\_8},doi={10.1007/11917496\_8}}
@misc{Gaspers04,author={Gaspers, Serge},howpublished={Ma\^{i}trise thesis},title={Algorithmes pour le probl\`{e}me de domination d'un graphe},year={2004}}