default search action
Serge Gaspers
Person information
- affiliation: University of New South Wales, Sydney, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c77]Ayda Valinezhad Orang, Ali Dorri, Serge Gaspers, Sushmita Ruj:
Blockchain-Enabled Private and Secure Task Allocation Framework. COMSNETS 2024: 666-670 - [c76]Serge Gaspers, Jerry Zirui Li:
Quantum Algorithms for Graph Coloring and Other Partitioning, Covering, and Packing Problems. ICALP 2024: 69:1-69:20 - [e2]Henning Fernau, Serge Gaspers, Ralf Klasing:
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. Lecture Notes in Computer Science 14519, Springer 2024, ISBN 978-3-031-52112-6 [contents] - [i51]Katie Clinch, Serge Gaspers, Abdallah Saffidine, Tiankuang Zhang:
A Piecewise Approach for the Analysis of Exact Algorithms. CoRR abs/2402.10015 (2024) - 2023
- [j40]Serge Gaspers, Edward J. Lee:
Faster Graph Coloring in Polynomial Space. Algorithmica 85(2): 584-609 (2023) - [i50]Serge Gaspers, Jerry Zirui Li:
Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems. CoRR abs/2311.08042 (2023) - 2022
- [j39]Josh Smith, Hassan Jameel Asghar, Gianpaolo Gioiosa, Sirine Mrabet, Serge Gaspers, Paul Tyler:
Making the Most of Parallel Composition in Differential Privacy. Proc. Priv. Enhancing Technol. 2022(1): 253-273 (2022) - [j38]Haris Aziz, Péter Biró, Tamás Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari:
Stable matching with uncertain pairwise preferences. Theor. Comput. Sci. 909: 1-11 (2022) - [c75]Serge Gaspers, Andrew Kaploun:
Faster Algorithms for Weak Backdoors. AAAI 2022: 3741-3748 - 2021
- [j37]Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid:
On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. Theory Comput. Syst. 65(2): 344-409 (2021) - [i49]Josh Smith, Hassan Jameel Asghar, Gianpaolo Gioiosa, Sirine Mrabet, Serge Gaspers, Paul Tyler:
Making the Most of Parallel Composition in Differential Privacy. CoRR abs/2109.09078 (2021) - 2020
- [j36]Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari:
Stable Matching with Uncertain Linear Preferences. Algorithmica 82(5): 1410-1433 (2020) - [c74]Haris Aziz, Serge Gaspers, Zhaohong Sun:
Mechanism Design for School Choice with Soft Diversity Constraints. AAMAS 2020: 1756-1758 - [c73]Haris Aziz, Serge Gaspers, Zhaohong Sun, Makoto Yokoo:
Multiple Levels of Importance in Matching with Distributional Constraints: Extended Abstract. AAMAS 2020: 1759-1761 - [c72]Haris Aziz, Serge Gaspers, Zhaohong Sun:
Mechanism Design for School Choice with Soft Diversity Constraints. IJCAI 2020: 153-159 - [i48]Haris Aziz, Serge Gaspers, Zhaohong Sun, Toby Walsh:
From Matching with Diversity Constraints to Matching with Regional Quotas. CoRR abs/2002.06748 (2020)
2010 – 2019
- 2019
- [j35]Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele:
Turbocharging Treewidth Heuristics. Algorithmica 81(2): 439-475 (2019) - [j34]Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh:
Exact Algorithms via Monotone Local Search. J. ACM 66(2): 8:1-8:23 (2019) - [j33]Serge Gaspers, Shenwei Huang, Daniël Paulusma:
Colouring square-free graphs without long induced paths. J. Comput. Syst. Sci. 106: 60-79 (2019) - [j32]Serge Gaspers, Shenwei Huang:
Linearly χ-bounding (P6, C4)-free graphs. J. Graph Theory 92(3): 322-342 (2019) - [j31]Serge Gaspers, Shenwei Huang:
(2P2, K4)-Free Graphs are 4-Colorable. SIAM J. Discret. Math. 33(2): 1095-1120 (2019) - [c71]Serge Gaspers, Kamran Najeebullah:
Optimal Surveillance of Covert Networks by Minimizing Inverse Geodesic Length. AAAI 2019: 533-540 - [c70]Haris Aziz, Serge Gaspers, Zhaohong Sun, Toby Walsh:
From Matching with Diversity Constraints to Matching with Regional Quotas. AAMAS 2019: 377-385 - [c69]Enrico H. Gerding, Alvaro Perez-Diaz, Haris Aziz, Serge Gaspers, Antonia Marcu, Nicholas Mattei, Toby Walsh:
Fair Online Allocation of Perishable Goods and its Application to Electric Vehicle Charging. IJCAI 2019: 5569-5575 - [c68]Serge Gaspers, Joshua Lau:
Minimizing and Computing the Inverse Geodesic Length on Trees. ISAAC 2019: 59:1-59:19 - [c67]Serge Gaspers, Ray Li:
Enumeration of Preferred Extensions in Almost Oriented Digraphs. MFCS 2019: 74:1-74:15 - [i47]Faisal N. Abu-Khzam, Judith Egan, Serge Gaspers, Alexis Shaw, Peter Shaw:
On the Parameterized Cluster Editing with Vertex Splitting Problem. CoRR abs/1901.00156 (2019) - [i46]Serge Gaspers, Ray Li:
Enumeration of Preferred Extensions in Almost Oriented Digraphs. CoRR abs/1907.01006 (2019) - 2018
- [j30]Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Paul Stursberg, Toby Walsh:
Fixing balanced knockout and double elimination tournaments. Artif. Intell. 262: 1-14 (2018) - [j29]Stephen Finbow, Serge Gaspers, Margaret-Ellen Messinger, Paul Ottaway:
A note on the eternal dominating set problem. Int. J. Game Theory 47(2): 543-555 (2018) - [j28]Serge Gaspers, Simon Mackenzie:
On the number of minimal separators in graphs. J. Graph Theory 87(4): 653-659 (2018) - [c66]Serge Gaspers, Stefan Rümmele, Abdallah Saffidine, Kevin Tran:
Minesweeper with Limited Moves. AAAI 2018: 860-867 - [c65]Haris Aziz, Serge Gaspers, Edward J. Lee, Kamran Najeebullah:
Defender Stackelberg Game with Inverse Geodesic Length as Utility Metric. AAMAS 2018: 694-702 - [c64]Haris Aziz, Jiayin Chen, Serge Gaspers, Zhaohong Sun:
Stability and Pareto Optimality in Refugee Allocation Matchings. AAMAS 2018: 964-972 - [c63]Faisal N. Abu-Khzam, Judith Egan, Serge Gaspers, Alexis Shaw, Peter Shaw:
Cluster Editing with Vertex Splitting. ISCO 2018: 1-13 - [c62]Serge Gaspers, Joachim Gudmundsson, Michael Horton, Stefan Rümmele:
When is Red-Blue Nonblocker Fixed-Parameter Tractable? LATIN 2018: 515-528 - [c61]Serge Gaspers, Shenwei Huang, Daniël Paulusma:
Colouring Square-Free Graphs without Long Induced Paths. STACS 2018: 35:1-35:15 - [i45]Serge Gaspers, Shenwei Huang, Daniël Paulusma:
Colouring Square-Free Graphs without Long Induced Paths. CoRR abs/1805.08270 (2018) - [i44]Serge Gaspers, Joshua Lau:
Minimizing and Computing the Inverse Geodesic Length on Trees. CoRR abs/1811.03836 (2018) - 2017
- [j27]Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný:
Backdoors into heterogeneous classes of SAT and CSP. J. Comput. Syst. Sci. 85: 38-56 (2017) - [j26]Serge Gaspers, Gregory B. Sorkin:
Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets. ACM Trans. Algorithms 13(4): 44:1-44:36 (2017) - [c60]Haris Aziz, Péter Biró, Tamás Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari:
Stable Matching with Uncertain Pairwise Preferences. AAMAS 2017: 344-352 - [c59]Serge Gaspers, Edward J. Lee:
Faster Graph Coloring in Polynomial Space. COCOON 2017: 371-383 - [c58]Serge Gaspers, Edward J. Lee:
Exact Algorithms via Multivariate Subroutines. ICALP 2017: 69:1-69:13 - [c57]Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, Abdallah Saffidine:
The Parameterized Complexity of Positional Games. ICALP 2017: 90:1-90:14 - [c56]Haris Aziz, Serge Gaspers, Kamran Najeebullah:
Weakening Covert Networks by Minimizing Inverse Geodesic Length. IJCAI 2017: 779-785 - [c55]Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele:
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. ISAAC 2017: 37:1-37:13 - [c54]Serge Gaspers, Shenwei Huang:
Linearly \chi χ -Bounding (P_6, C_4) ( P 6 , C 4 ) -Free Graphs. WG 2017: 263-274 - [p2]Serge Gaspers, Sebastian Ordyniak, Stefan Szeider:
Backdoor Sets for CSP. The Constraint Satisfaction Problem 2017: 137-157 - [e1]Serge Gaspers, 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 [contents] - [i43]Serge Gaspers, Edward J. Lee:
Exact Algorithms via Multivariate Subroutines. CoRR abs/1704.07982 (2017) - [i42]Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, Abdallah Saffidine:
The Parameterized Complexity of Positional Games. CoRR abs/1704.08536 (2017) - [i41]Serge Gaspers, Shenwei Huang:
Linearly $χ$-Bounding $(P_6, C_4)$-Free Graphs. CoRR abs/1709.09750 (2017) - [i40]Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele:
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. CoRR abs/1709.10285 (2017) - 2016
- [j25]Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider:
Backdoors to q-Horn. Algorithmica 74(1): 540-557 (2016) - [c53]Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid:
On the Complexity of Grammar-Based Compression over Fixed Alphabets. ICALP 2016: 122:1-122:14 - [c52]Andrés Abeliuk, Haris Aziz, Gerardo Berbeglia, Serge Gaspers, Petr Kalina, Nicholas Mattei, Dominik Peters, Paul Stursberg, Pascal Van Hentenryck, Toby Walsh:
Interdependent Scheduling Games. IJCAI 2016: 2-9 - [c51]Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele:
Turbocharging Treewidth Heuristics. IPEC 2016: 13:1-13:13 - [c50]Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle:
On Satisfiability Problems with a Linear Structure. IPEC 2016: 14:1-14:14 - [c49]Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch:
Faster Algorithms to Enumerate Hypergraph Transversals. LATIN 2016: 306-318 - [c48]Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari:
Stable Matching with Uncertain Linear Preferences. SAGT 2016: 195-206 - [c47]Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh:
Exact algorithms via monotone local search. STOC 2016: 764-775 - [r1]Serge Gaspers:
Backdoors to SAT. Encyclopedia of Algorithms 2016: 167-170 - [i39]Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle:
On Satisfiability Problems with a Linear Structure. CoRR abs/1602.07876 (2016) - [i38]Andrés Abeliuk, Haris Aziz, Gerardo Berbeglia, Serge Gaspers, Petr Kalina, Nicholas Mattei, Dominik Peters, Paul Stursberg, Pascal Van Hentenryck, Toby Walsh:
Interdependent Scheduling Games. CoRR abs/1605.09497 (2016) - [i37]Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari:
Stable Matching with Uncertain Linear Preferences. CoRR abs/1607.02917 (2016) - [i36]Serge Gaspers, Edward J. Lee:
Faster Graph Coloring in Polynomial Space. CoRR abs/1607.06201 (2016) - 2015
- [j24]Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh:
Fair assignment of indivisible objects under ordinal preferences. Artif. Intell. 227: 71-92 (2015) - [j23]Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson:
Augmenting Graphs to Minimize the Diameter. Algorithmica 72(4): 995-1010 (2015) - [j22]René van Bevern, Rodney G. Downey, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Myhill-Nerode Methods for Hypergraphs. Algorithmica 73(4): 696-729 (2015) - [j21]Serge Gaspers, Mathieu Liedloff, Maya Jakobine Stein, Karol Suchan:
Complexity of splits reconstruction for low-degree trees. Discret. Appl. Math. 180: 89-100 (2015) - [j20]Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh:
Two desirable fairness concepts for allocation of indivisible objects under ordinal preferences. SIGecom Exch. 14(2): 16-21 (2015) - [j19]Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider:
On finding optimal polytrees. Theor. Comput. Sci. 592: 49-58 (2015) - [c46]Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nicholas Mattei, Toby Walsh:
Computational Aspects of Multi-Winner Approval Voting. AAMAS 2015: 107-115 - [c45]Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Nina Narodytska, Toby Walsh:
Manipulating the Probabilistic Serial Rule. AAMAS 2015: 1451-1459 - [c44]Serge Gaspers, Gregory B. Sorkin:
Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets. ICALP (1) 2015: 567-579 - [c43]Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Hanjo Täubig:
Welfare Maximization in Fractional Hedonic Games. IJCAI 2015: 461-467 - [c42]Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Nina Narodytska, Toby Walsh:
Equilibria Under the Probabilistic Serial Rule. IJCAI 2015: 1105-1112 - [c41]Martin Aleksandrov, Haris Aziz, Serge Gaspers, Toby Walsh:
Online Fair Division: Analysing a Food Bank Problem. IJCAI 2015: 2540-2546 - [c40]Serge Gaspers, Simon Mackenzie:
On the Number of Minimal Separators in Graphs. WG 2015: 116-121 - [i35]Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Nina Narodytska, Toby Walsh:
Manipulating the Probabilistic Serial Rule. CoRR abs/1501.06626 (2015) - [i34]Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Nina Narodytska, Toby Walsh:
Equilibria Under the Probabilistic Serial Rule. CoRR abs/1502.04888 (2015) - [i33]Martin Aleksandrov, Haris Aziz, Serge Gaspers, Toby Walsh:
Online Fair Division: analysing a Food Bank problem. CoRR abs/1502.07571 (2015) - [i32]Serge Gaspers, Simon Mackenzie:
On the Number of Minimal Separators in Graphs. CoRR abs/1503.01203 (2015) - [i31]Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný:
Backdoors into Heterogeneous Classes of SAT and CSP. CoRR abs/1509.05725 (2015) - [i30]Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch:
Faster algorithms to enumerate hypergraph transversals. CoRR abs/1510.05093 (2015) - [i29]Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh:
Exact Algorithms via Monotone Local Search. CoRR abs/1512.01621 (2015) - 2014
- [j18]Serge Gaspers, Stefan Szeider:
Guarantees and limits of preprocessing in constraint satisfaction and reasoning. Artif. Intell. 216: 1-19 (2014) - [c39]Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nicholas Mattei, Toby Walsh:
Computational Aspects of Multi-Winner Approval Voting. MPREF@AAAI 2014 - [c38]Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Paul Stursberg, Toby Walsh:
Fixing a Balanced Knockout Tournament. AAAI 2014: 552-558 - [c37]Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Paul Stursberg, Toby Walsh:
Fixing a Balanced Knockout Tournament. MPREF@AAAI 2014 - [c36]Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný:
Backdoors into Heterogeneous Classes of SAT and CSP. AAAI 2014: 2652-2658 - [c35]Serge Gaspers, Victor Naroditskiy, Nina Narodytska, Toby Walsh:
Possible and necessary winner problem in social polls. AAMAS 2014: 613-620 - [c34]Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh:
Fair assignment of indivisible objects under ordinal preferences. AAMAS 2014: 1305-1312 - [i28]Haris Aziz, Serge Gaspers, Nicholas Mattei, Nina Narodytska, Toby Walsh:
Strategic aspects of the probabilistic serial rule for the allocation of goods. CoRR abs/1401.6523 (2014) - [i27]Serge Gaspers, Gregory B. Sorkin:
Separate, Measure and Conquer: Faster Algorithms for Max 2-CSP and Counting Dominating Sets. CoRR abs/1404.0753 (2014) - [i26]Serge Gaspers, Stefan Szeider:
Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning. CoRR abs/1406.3124 (2014) - [i25]Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nicholas Mattei, Toby Walsh:
Computational Aspects of Multi-Winner Approval Voting. CoRR abs/1407.3247 (2014) - 2013
- [j17]Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff:
Exact and Parameterized Algorithms for Max Internal Spanning Tree. Algorithmica 65(1): 95-128 (2013) - [j16]Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé:
A linear vertex kernel for maximum internal spanning tree. J. Comput. Syst. Sci. 79(1): 1-6 (2013) - [j15]Serge Gaspers, Matthias Mnich:
Feedback Vertex Sets in Tournaments. J. Graph Theory 72(1): 72-89 (2013) - [j14]Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan:
An exponential time 2-approximation algorithm for bandwidth. Theor. Comput. Sci. 511: 23-31 (2013) - [c33]Haris Aziz, Serge Gaspers, Nicholas Mattei, Nina Narodytska, Toby Walsh:
Ties Matter: Complexity of Manipulation when Tie-Breaking with a Random Vote. AAAI 2013: 74-80 - [c32]Serge Gaspers, Thomas Kalinowski, Nina Narodytska, Toby Walsh:
Coalitional manipulation for Schulze's rule. AAMAS 2013: 431-438 - [c31]Serge Gaspers, Victor Naroditskiy, Nina Narodytska, Toby Walsh:
Possible and necessary winner problem in social polls. AAMAS 2013: 1131-1132 - [c30]Serge Gaspers, Stefan Szeider:
Strong Backdoors to Bounded Treewidth SAT. FOCS 2013: 489-498 - [c29]Geoffrey Chu, Serge Gaspers, Nina Narodytska, Andreas Schutt, Toby Walsh:
On the Complexity of Global Scheduling Constraints under Structural Restrictions. IJCAI 2013: 503-509 - [c28]René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Myhill-Nerode Methods for Hypergraphs. ISAAC 2013: 372-382 - [c27]Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson:
Augmenting Graphs to Minimize the Diameter. ISAAC 2013: 383-393 - [c26]Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider:
Backdoors to q-Horn. STACS 2013: 67-79 - [i24]Serge Gaspers, Victor Naroditskiy, Nina Narodytska, Toby Walsh:
Possible and Necessary Winner Problem in Social Polls. CoRR abs/1302.1669 (2013) - [i23]Serge Gaspers, Thomas Kalinowski, Nina Narodytska, Toby Walsh:
Coalitional Manipulation for Schulze's Rule. CoRR abs/1304.0844 (2013) - [i22]Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson:
Augmenting graphs to minimize the diameter. CoRR abs/1309.5172 (2013) - [i21]Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh:
Fair assignment of indivisible objects under ordinal preferences. CoRR abs/1312.6546 (2013) - 2012
- [j13]Serge Gaspers, Dieter Kratsch, Mathieu Liedloff:
On Independent Sets and Bicliques in Graphs. Algorithmica 62(3-4): 637-658 (2012) - [j12]Serge Gaspers, Mathieu Liedloff:
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. Discret. Math. Theor. Comput. Sci. 14(1): 29-42 (2012) - [j11]Serge Gaspers, Gregory B. Sorkin:
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. J. Comput. Syst. Sci. 78(1): 305-335 (2012) - [j10]Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Parameterizing by the Number of Numbers. Theory Comput. Syst. 50(4): 675-693 (2012) - [c25]Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider:
Don't Be Strict in Local Search! AAAI 2012: 486-492 - [c24]Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider:
On Finding Optimal Polytrees. AAAI 2012: 750-756 - [c23]