% csauthors.net - beta - BibTeX bibliography of Barnaby Martin
@phdthesis{phd/ethos/Martin05a,
title = {Logic, computation and constraint satisfaction.},
year = {2005},
author = {{Barnaby Martin}}
}
@inproceedings{conf/cie/MartinM06,
title = {Towards a Trichotomy for Quantified H-Coloring.},
year = {2006},
booktitle = {CiE},
author = {{Barnaby Martin} and {Florent R. Madelaine}},
publisher = {Springer},
booktitle = {Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings}
}
@article{journals/corr/abs-cs-0609022,
title = {Dichotomies and Duality in First-order Model Checking Problems},
year = {2006},
journal = {CoRR},
author = {{Barnaby Martin}}
}
@inproceedings{conf/cie/MartinM07,
title = {Hierarchies in Fragments of Monadic Strict NP.},
year = {2007},
booktitle = {CiE},
author = {{Barnaby Martin} and {Florent R. Madelaine}},
publisher = {Springer},
booktitle = {Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings}
}
@article{journals/corr/abs-cs-0701049,
title = {On the Complexity of a Derivative Chess Problem},
year = {2007},
journal = {CoRR},
author = {{Barnaby Martin}}
}
@article{journals/eccc/DantchevMS07,
title = {Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution.},
year = {2007},
journal = {Electron. Colloquium Comput. Complex.},
author = {{Stefan S. Dantchev} and {Barnaby Martin} and {Stefan Szeider}}
}
@inproceedings{conf/cie/Martin08,
title = {First-Order Model Checking Problems Parameterized by the Model.},
year = {2008},
booktitle = {CiE},
author = {{Barnaby Martin}},
publisher = {Springer},
booktitle = {Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings}
}
@article{journals/corr/abs-0808-0647,
title = {Model Checking Positive Equality-free FO: Boolean Structures and Digraphs of Size Three},
year = {2008},
journal = {CoRR},
author = {{Barnaby Martin}}
}
@inproceedings{conf/dagstuhl/MartinM09,
title = {The complexity of positive first-order logic without equality II: The four-element case.},
year = {2009},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
author = {{Barnaby Martin} and {Jos Martin}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability, 25.10. - 30.10.2009}
}
@article{journals/corr/abs-0909-5097,
title = {On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction},
year = {2009},
journal = {Log. Methods Comput. Sci.},
author = {{Manuel Bodirsky} and {Martin Hils} and {Barnaby Martin}}
}
@article{journals/tcs/DantchevMR09,
title = {Tight rank lower bounds for the Sherali-Adams proof system.},
year = {2009},
journal = {Theor. Comput. Sci.},
author = {{Stefan S. Dantchev} and {Barnaby Martin} and {Mark Nicholas Charles Rhodes}}
}
@inproceedings{conf/cp/Martin10,
title = {The Lattice Structure of Sets of Surjective Hyper-Operations.},
year = {2010},
booktitle = {CP},
author = {{Barnaby Martin}},
publisher = {Springer},
booktitle = {Principles and Practice of Constraint Programming - CP 2010 - 16th International Conference, CP 2010, St. Andrews, Scotland, UK, September 6-10, 2010. Proceedings}
}
@inproceedings{conf/mfcs/BodirskyDMP10,
title = {Distance Constraint Satisfaction Problems.},
year = {2010},
booktitle = {MFCS},
author = {{Manuel Bodirsky} and {Víctor Dalmau} and {Barnaby Martin} and {Michael Pinsker}},
publisher = {Springer},
booktitle = {Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings}
}
@inproceedings{conf/cp/Martin11,
title = {QCSP on Partially Reflexive Forests.},
year = {2011},
booktitle = {CP},
author = {{Barnaby Martin}},
publisher = {Springer},
booktitle = {Principles and Practice of Constraint Programming - CP 2011 - 17th International Conference, CP 2011, Perugia, Italy, September 12-16, 2011. Proceedings}
}
@inproceedings{conf/cp/MartinP11,
title = {The Computational Complexity of Disconnected Cut and 2K 2-Partition.},
year = {2011},
booktitle = {CP},
author = {{Barnaby Martin} and {Daniël Paulusma}},
publisher = {Springer},
booktitle = {Principles and Practice of Constraint Programming - CP 2011 - 17th International Conference, CP 2011, Perugia, Italy, September 12-16, 2011. Proceedings}
}
@inproceedings{conf/lics/MadelaineM11,
title = {A Tetrachotomy for Positive First-Order Logic without Equality.},
year = {2011},
booktitle = {LICS},
author = {{Florent R. Madelaine} and {Barnaby Martin}},
publisher = {IEEE Computer Society},
booktitle = {Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS 2011, June 21-24, 2011, Toronto, Ontario, Canada}
}
@article{journals/cc/DantchevMS11,
title = {Parameterized Proof Complexity.},
year = {2011},
journal = {Comput. Complex.},
author = {{Stefan S. Dantchev} and {Barnaby Martin} and {Stefan Szeider}}
}
@article{journals/corr/abs-1104-4779,
title = {The Computational Complexity of Disconnected Cut and 2K2-Partition},
year = {2011},
journal = {CoRR},
author = {{Barnaby Martin} and {Daniël Paulusma}}
}
@article{journals/ipl/Martin11,
title = {Low-level dichotomy for quantified constraint satisfaction problems.},
year = {2011},
journal = {Inf. Process. Lett.},
author = {{Barnaby Martin}}
}
@inproceedings{conf/cp/MadelaineM12,
title = {Containment, Equivalence and Coreness from CSP to QCSP and Beyond.},
year = {2012},
booktitle = {CP},
author = {{Florent R. Madelaine} and {Barnaby Martin}},
publisher = {Springer},
booktitle = {Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Québec City, QC, Canada, October 8-12, 2012. Proceedings}
}
@article{journals/acta/GolovachLMP12,
title = {Finding vertex-surjective graph homomorphisms.},
year = {2012},
journal = {Acta Informatica},
author = {{Petr A. Golovach} and {Bernard Lidický} and {Barnaby Martin} and {Daniël Paulusma}}
}
@article{journals/apal/DantchevM12,
title = {The limits of tractability in Resolution-based propositional proof systems.},
year = {2012},
journal = {Ann. Pure Appl. Log.},
author = {{Stefan S. Dantchev} and {Barnaby Martin}}
}
@article{journals/corr/abs-1203-5323,
title = {Parameterized Proof Complexity and W[1]},
year = {2012},
journal = {CoRR},
author = {{Barnaby Martin}}
}
@article{journals/dam/BodirskyKM12,
title = {The complexity of surjective homomorphism problems - a survey.},
year = {2012},
journal = {Discret. Appl. Math.},
author = {{Manuel Bodirsky} and {Jan Kára} and {Barnaby Martin}}
}
@article{journals/mst/DantchevM12,
title = {Cutting Planes and the Parameter Cutwidth.},
year = {2012},
journal = {Theory Comput. Syst.},
author = {{Stefan S. Dantchev} and {Barnaby Martin}}
}
@article{journals/tocl/MadelaineM12,
title = {The Complexity of Positive First-Order Logic without Equality.},
year = {2012},
journal = {ACM Trans. Comput. Log.},
author = {{Florent R. Madelaine} and {Barnaby Martin}}
}
@inproceedings{conf/csr/DantchevM13,
title = {Parameterized Resolution with Bounded Conjunction.},
year = {2013},
booktitle = {CSR},
author = {{Stefan S. Dantchev} and {Barnaby Martin}},
publisher = {Springer},
booktitle = {Computer Science - Theory and Applications - 8th International Computer Science Symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25-29, 2013. Proceedings}
}
@inproceedings{conf/csr/MadelaineM13,
title = {QCSP on Partially Reflexive Cycles - The Wavy Line of Tractability.},
year = {2013},
booktitle = {CSR},
author = {{Florent R. Madelaine} and {Barnaby Martin}},
publisher = {Springer},
booktitle = {Computer Science - Theory and Applications - 8th International Computer Science Symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25-29, 2013. Proceedings}
}
@article{journals/cc/DantchevM13,
title = {Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems.},
year = {2013},
journal = {Comput. Complex.},
author = {{Stefan S. Dantchev} and {Barnaby Martin}}
}
@article{journals/corr/abs-1304-4287,
title = {Relativisation makes contradictions harder for Resolution},
year = {2013},
journal = {CoRR},
author = {{Stefan S. Dantchev} and {Barnaby Martin}}
}
@inproceedings{conf/csr/MartinS14,
title = {Constraint Satisfaction with Counting Quantifiers 2.},
year = {2014},
booktitle = {CSR},
author = {{Barnaby Martin} and {Juraj Stacho}},
publisher = {Springer},
booktitle = {Computer Science - Theory and Applications - 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings}
}
@inproceedings{conf/icalp/DapicMM14,
title = {QCSP on Semicomplete Digraphs.},
year = {2014},
booktitle = {ICALP (1)},
author = {{Petar Dapic} and {Petar Markovic} and {Barnaby Martin}},
publisher = {Springer},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I}
}
@article{journals/apal/DantchevM14,
title = {Relativization makes contradictions harder for Resolution.},
year = {2014},
journal = {Ann. Pure Appl. Log.},
author = {{Stefan S. Dantchev} and {Barnaby Martin}}
}
@inproceedings{conf/csl/BovaM15,
title = {First-Order Queries on Finite Abelian Groups.},
year = {2015},
booktitle = {CSL},
author = {{Simone Bova} and {Barnaby Martin}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany}
}
@inproceedings{conf/icalp/BodirskyMM15,
title = {Constraint Satisfaction Problems over the Integers with Successor.},
year = {2015},
booktitle = {ICALP (1)},
author = {{Manuel Bodirsky} and {Barnaby Martin} and {Antoine Mottet}},
publisher = {Springer},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I}
}
@inproceedings{conf/lics/CarvalhoMM15,
title = {From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP.},
year = {2015},
booktitle = {LICS},
author = {{Catarina Carvalho} and {Florent R. Madelaine} and {Barnaby Martin}},
publisher = {IEEE Computer Society},
booktitle = {30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015}
}
@article{journals/corr/ChenMM13,
title = {Quantified Constraints and Containment Problems.},
year = {2015},
journal = {Log. Methods Comput. Sci.},
author = {{Hubie Chen} and {Florent R. Madelaine} and {Barnaby Martin}}
}
@article{journals/corr/GlasserJM15,
title = {Constraint Satisfaction Problems around Skolem Arithmetic.},
year = {2015},
journal = {CoRR},
author = {{Christian Glaßer} and {Peter Jonsson} and {Barnaby Martin}}
}
@article{journals/corr/MartinRCM15,
title = {The packing chromatic number of the infinite square lattice is less than or equal to 16.},
year = {2015},
journal = {CoRR},
author = {{Barnaby Martin} and {Franco Raimondi} and {Taolue Chen} and {Jos Martin}}
}
@article{journals/corr/MartinZ15,
title = {Switchability and collapsibility of Gap Algebras.},
year = {2015},
journal = {CoRR},
author = {{Barnaby Martin} and {Dmitriy Zhuk}}
}
@article{journals/jct/MartinP15,
title = {The computational complexity of disconnected cut and 2K2-partition.},
year = {2015},
journal = {J. Comb. Theory, Ser. B},
author = {{Barnaby Martin} and {Daniël Paulusma}}
}
@article{journals/siamdm/MartinMS15,
title = {Constraint Satisfaction with Counting Quantifiers.},
year = {2015},
journal = {SIAM J. Discret. Math.},
author = {{Barnaby Martin} and {Florent R. Madelaine} and {Juraj Stacho}}
}
@article{journals/corr/Martin16a,
title = {On the Chen Conjecture regarding the complexity of QCSPs.},
year = {2016},
journal = {CoRR},
author = {{Barnaby Martin}}
}
@article{journals/eatcs/Martin16,
title = {Report on BCTCS 2015.},
year = {2016},
journal = {Bull. EATCS},
author = {{Barnaby Martin}}
}
@article{journals/iandc/BodirskyDMMP16,
title = {Distance constraint satisfaction problems.},
year = {2016},
journal = {Inf. Comput.},
author = {{Manuel Bodirsky} and {Víctor Dalmau} and {Barnaby Martin} and {Antoine Mottet} and {Michael Pinsker}}
}
@incollection{conf/dagstuhl/Martin17,
title = {Quantified Constraints in Twenty Seventeen.},
year = {2017},
booktitle = {The Constraint Satisfaction Problem},
author = {{Barnaby Martin}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability}
}
@inproceedings{conf/mfcs/CarvalhoMZ17,
title = {The Complexity of Quantified Constraints Using the Algebraic Formulation.},
year = {2017},
booktitle = {MFCS},
author = {{Catarina Carvalho} and {Barnaby Martin} and {Dmitriy Zhuk}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark}
}
@article{journals/corr/CarvalhoMZ17,
title = {The complexity of quantified constraints.},
year = {2017},
journal = {CoRR},
author = {{Catarina Carvalho} and {Barnaby Martin} and {Dmitriy Zhuk}}
}
@article{journals/dam/MartinRCM17,
title = {The packing chromatic number of the infinite square lattice is between 13 and 15.},
year = {2017},
journal = {Discret. Appl. Math.},
author = {{Barnaby Martin} and {Franco Raimondi} and {Taolue Chen} and {Jos Martin}}
}
@article{journals/tcs/GlasserJM17,
title = {Circuit satisfiability and constraint satisfaction around Skolem Arithmetic.},
year = {2017},
journal = {Theor. Comput. Sci.},
author = {{Christian Glaßer} and {Peter Jonsson} and {Barnaby Martin}}
}
@article{journals/tcs/MartinPW17,
title = {The complexity of counting quantifiers on equality languages.},
year = {2017},
journal = {Theor. Comput. Sci.},
author = {{Barnaby Martin} and {András Pongrácz} and {Michal Wrona}}
}
@article{journals/tocl/DapicMM17,
title = {Quantified Constraint Satisfaction Problem on Semicomplete Digraphs.},
year = {2017},
journal = {ACM Trans. Comput. Log.},
author = {{Petar Dapic} and {Petar Markovic} and {Barnaby Martin}}
}
@inproceedings{conf/ijcai/BodirskyJMM18,
title = {Classification Transfer for Qualitative Reasoning Problems.},
year = {2018},
booktitle = {IJCAI},
author = {{Manuel Bodirsky} and {Peter Jonsson} and {Barnaby Martin} and {Antoine Mottet}},
publisher = {ijcai.org},
booktitle = {Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden.}
}
@inproceedings{conf/mfcs/BodirskyMMM18,
title = {The Complexity of Disjunctive Linear Diophantine Constraints.},
year = {2018},
booktitle = {MFCS},
author = {{Manuel Bodirsky} and {Barnaby Martin} and {Marcello Mamino} and {Antoine Mottet}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK}
}
@inproceedings{conf/mfcs/MadelaineM18,
title = {Consistency for Counting Quantifiers.},
year = {2018},
booktitle = {MFCS},
author = {{Florent R. Madelaine} and {Barnaby Martin}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK}
}
@article{journals/eccc/BeyersdorffCDM18,
title = {The Riis Complexity Gap for QBF Resolution.},
year = {2018},
journal = {Electron. Colloquium Comput. Complex.},
author = {{Olaf Beyersdorff} and {Judith Clymo} and {Stefan S. Dantchev} and {Barnaby Martin}}
}
@article{journals/eccc/DantchevGM18,
title = {Resolution and the binary encoding of combinatorial principles.},
year = {2018},
journal = {Electron. Colloquium Comput. Complex.},
author = {{Stefan S. Dantchev} and {Nicola Galesi} and {Barnaby Martin}}
}
@article{journals/jacm/BodirskyMM18,
title = {Discrete Temporal Constraint Satisfaction Problems.},
year = {2018},
journal = {J. ACM},
author = {{Manuel Bodirsky} and {Barnaby Martin} and {Antoine Mottet}}
}
@article{journals/siamcomp/MadelaineM18,
title = {On the Complexity of the Model Checking Problem.},
year = {2018},
journal = {SIAM J. Comput.},
author = {{Florent R. Madelaine} and {Barnaby Martin}}
}
@inproceedings{conf/mfcs/MartinPS19,
title = {Colouring H-Free Graphs of Bounded Diameter.},
year = {2019},
booktitle = {MFCS},
author = {{Barnaby Martin} and {Daniël Paulusma} and {Siani Smith}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany.}
}
@article{journals/computability/GolovachJMPS19,
title = {Surjective H-colouring: New hardness results.},
year = {2019},
journal = {Comput.},
author = {{Petr A. Golovach} and {Matthew Johnson 002} and {Barnaby Martin} and {Daniël Paulusma} and {Anthony Stewart}}
}
@article{journals/eatcs/JohnsonMMP19,
title = {Report on BCTCS & AlgoUK 2019.},
year = {2019},
journal = {Bull. EATCS},
author = {{Matthew Johnson 002} and {Barnaby Martin} and {George B. Mertzios} and {Daniël Paulusma}}
}
@article{journals/siamcomp/BodirskyMPP19,
title = {Constraint Satisfaction Problems for Reducts of Homogeneous Graphs.},
year = {2019},
journal = {SIAM J. Comput.},
author = {{Manuel Bodirsky} and {Barnaby Martin} and {Michael Pinsker} and {András Pongrácz}}
}
@article{journals/toct/LaroseMP19,
title = {Surjective H-Colouring over Reflexive Digraphs.},
year = {2019},
journal = {ACM Trans. Comput. Theory},
author = {{Benoît Larose} and {Barnaby Martin} and {Daniël Paulusma}}
}
@inproceedings{conf/esa/BokJMPS20,
title = {Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs.},
year = {2020},
booktitle = {ESA},
author = {{Jan Bok} and {Nikola Jedlicková} and {Barnaby Martin} and {Daniël Paulusma} and {Siani Smith}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference).}
}
@inproceedings{conf/latin/DantchevGM20,
title = {Sherali-Adams and the Binary Encoding of Combinatorial Principles.},
year = {2020},
booktitle = {LATIN},
author = {{Stefan S. Dantchev} and {Abdul Ghani 001} and {Barnaby Martin}},
publisher = {Springer},
booktitle = {LATIN 2020: Theoretical Informatics - 14th Latin American Symposium, São Paulo, Brazil, January 5-8, 2021, Proceedings}
}
@article{journals/corr/abs-2008-02138,
title = {Proof complexity and the binary encoding of combinatorial principles.},
year = {2020},
journal = {CoRR},
author = {{Stefan S. Dantchev} and {Nicola Galesi} and {Abdul Ghani 001} and {Barnaby Martin}}
}
@article{journals/jcss/MartinPL20,
title = {Disconnected cuts in claw-free graphs.},
year = {2020},
journal = {J. Comput. Syst. Sci.},
author = {{Barnaby Martin} and {Daniël Paulusma} and {Erik Jan van Leeuwen}}
}
@inproceedings{conf/csr/BokJMPS21,
title = {Injective Colouring for H-Free Graphs.},
year = {2021},
booktitle = {CSR},
author = {{Jan Bok} and {Nikola Jedlicková} and {Barnaby Martin} and {Daniël Paulusma} and {Siani Smith}},
publisher = {Springer},
booktitle = {Computer Science - Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28 - July 2, 2021, Proceedings}
}
@inproceedings{conf/isaac/BrauseGMPS21,
title = {Partitioning H-Free Graphs of Bounded Diameter.},
year = {2021},
booktitle = {ISAAC},
author = {{Christoph Brause} and {Petr A. Golovach} and {Barnaby Martin} and {Daniël Paulusma} and {Siani Smith}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan.}
}
@inproceedings{conf/iwoca/KernMPSL21,
title = {Disjoint Paths and Connected Subgraphs for H-Free Graphs.},
year = {2021},
booktitle = {IWOCA},
author = {{Walter Kern} and {Barnaby Martin} and {Daniël Paulusma} and {Siani Smith} and {Erik Jan van Leeuwen}},
publisher = {Springer},
booktitle = {Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings}
}
@inproceedings{conf/wg/BrauseGMPS21,
title = {Acyclic, Star, and Injective Colouring: Bounding the Diameter.},
year = {2021},
booktitle = {WG},
author = {{Christoph Brause} and {Petr A. Golovach} and {Barnaby Martin} and {Daniël Paulusma} and {Siani Smith}},
publisher = {Springer},
booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}
}
@article{journals/corr/abs-2104-00406,
title = {The complete classification for quantified equality constraints.},
year = {2021},
journal = {CoRR},
author = {{Dmitriy Zhuk} and {Barnaby Martin}}
}
@article{journals/eccc/DantchevGGM21,
title = {Depth lower bounds in Stabbing Planes for combinatorial principles.},
year = {2021},
journal = {Electron. Colloquium Comput. Complex.},
author = {{Stefan S. Dantchev} and {Nicola Galesi} and {Abdul Ghani 001} and {Barnaby Martin}}
}
@inproceedings{conf/iscopt/MartinPSL22,
title = {Few Induced Disjoint Paths for H-Free Graphs.},
year = {2022},
booktitle = {ISCO},
author = {{Barnaby Martin} and {Daniël Paulusma} and {Siani Smith} and {Erik Jan van Leeuwen}},
publisher = {Springer},
booktitle = {Combinatorial Optimization - 7th International Symposium, ISCO 2022, Virtual Event, May 18-20, 2022, Revised Selected Papers}
}
@article{journals/combinatorics/BrauseGMOPS22,
title = {Acyclic, Star, and Injective Colouring: Bounding the Diameter.},
year = {2022},
journal = {Electron. J. Comb.},
author = {{Christoph Brause} and {Petr A. Golovach} and {Barnaby Martin} and {Pascal Ochem} and {Daniël Paulusma} and {Siani Smith}}
}
@article{journals/constraints/MartinP22,
title = {When bounds consistency implies domain consistency for regular counting constraints.},
year = {2022},
journal = {Constraints An Int. J.},
author = {{Barnaby Martin} and {Justin Pearson}}
}
@article{journals/corr/abs-2211-03340,
title = {Complexity Classification Transfer for CSPs via Algebraic Products.},
year = {2022},
journal = {CoRR},
author = {{Manuel Bodirsky} and {Peter Jonsson} and {Barnaby Martin} and {Antoine Mottet} and {Zaneta Semanisinová}}
}
@article{journals/corr/abs-2211-12203,
title = {Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs.},
year = {2022},
journal = {CoRR},
author = {{Matthew Johnson 002} and {Barnaby Martin} and {Siani Smith} and {Sukanya Pandey} and {Daniël Paulusma} and {Erik Jan van Leeuwen}}
}
@article{journals/corr/abs-2211-12887,
title = {Complexity Framework For Forbidden Subgraphs.},
year = {2022},
journal = {CoRR},
author = {{Matthew Johnson 002} and {Barnaby Martin} and {Jelle J. Oostveen} and {Sukanya Pandey} and {Daniël Paulusma} and {Siani Smith} and {Erik Jan van Leeuwen}}
}
@article{journals/corr/abs-2211-14214,
title = {Complexity Framework for Forbidden Subgraphs: When Hardness Is Not Preserved under Edge Subdivision.},
year = {2022},
journal = {CoRR},
author = {{Barnaby Martin} and {Sukanya Pandey} and {Daniël Paulusma} and {Siani Smith} and {Erik Jan van Leeuwen}}
}
@article{journals/dam/MartinPS22,
title = {Colouring graphs of bounded diameter in the absence of small cycles.},
year = {2022},
journal = {Discret. Appl. Math.},
author = {{Barnaby Martin} and {Daniël Paulusma} and {Siani Smith}}
}
@article{journals/ijac/CarvalhoM22,
title = {The lattice and semigroup structure of multipermutations.},
year = {2022},
journal = {Int. J. Algebra Comput.},
author = {{Catarina Carvalho} and {Barnaby Martin}}
}
@article{journals/ipl/MartinPS22,
title = {Hard problems that quickly become very easy.},
year = {2022},
journal = {Inf. Process. Lett.},
author = {{Barnaby Martin} and {Daniël Paulusma} and {Siani Smith}}
}
@article{journals/jacm/ZhukM22,
title = {QCSP Monsters and the Demise of the Chen Conjecture.},
year = {2022},
journal = {J. ACM},
author = {{Dmitriy Zhuk} and {Barnaby Martin}}
}
@article{journals/tcs/BrauseGMPS22,
title = {Partitioning H-free graphs of bounded diameter.},
year = {2022},
journal = {Theor. Comput. Sci.},
author = {{Christoph Brause} and {Petr A. Golovach} and {Barnaby Martin} and {Daniël Paulusma} and {Siani Smith}}
}
@article{journals/tcs/KernMPSL22,
title = {Disjoint paths and connected subgraphs for H-free graphs.},
year = {2022},
journal = {Theor. Comput. Sci.},
author = {{Walter Kern} and {Barnaby Martin} and {Daniël Paulusma} and {Siani Smith} and {Erik Jan van Leeuwen}}
}
@article{journals/tcs/MartinPS22,
title = {Colouring generalized claw-free graphs and graphs of large girth: Bounding the diameter.},
year = {2022},
journal = {Theor. Comput. Sci.},
author = {{Barnaby Martin} and {Daniël Paulusma} and {Siani Smith}}
}
@article{journals/tocl/LaroseMMPSZ22,
title = {QCSP on Reflexive Tournaments.},
year = {2022},
journal = {ACM Trans. Comput. Log.},
author = {{Benoît Larose} and {Barnaby Martin} and {Petar Markovic} and {Daniël Paulusma} and {Siani Smith} and {Stanislav Zivný}}
}
@inproceedings{conf/mfcs/0002MPPSL23,
title = {Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs.},
year = {2023},
booktitle = {MFCS},
author = {{Matthew Johnson 002} and {Barnaby Martin} and {Sukanya Pandey} and {Daniël Paulusma} and {Siani Smith} and {Erik Jan van Leeuwen}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France}
}
@inproceedings{conf/soda/ZhukMW23,
title = {The complete classification for quantified equality constraints.},
year = {2023},
booktitle = {SODA},
author = {{Dmitriy Zhuk} and {Barnaby Martin} and {Michal Wrona}},
publisher = {SIAM},
booktitle = {Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023}
}
@article{journals/corr/abs-2305-01613,
title = {Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.},
year = {2023},
journal = {CoRR},
author = {{Hans L. Bodlaender} and {Matthew Johnson 002} and {Barnaby Martin} and {Jelle J. Oostveen} and {Sukanya Pandey} and {Daniël Paulusma} and {Siani Smith} and {Erik Jan van Leeuwen}}
}
@article{journals/tcs/MartinPSL23,
title = {Few induced disjoint paths for H-free graphs.},
year = {2023},
journal = {Theor. Comput. Sci.},
author = {{Barnaby Martin} and {Daniël Paulusma} and {Siani Smith} and {Erik Jan van Leeuwen}}
}
@article{journals/tocl/CarvalhoMMZ23,
title = {The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation.},
year = {2023},
month = {January},
journal = {ACM Trans. Comput. Log.},
author = {{Catarina Carvalho} and {Florent R. Madelaine} and {Barnaby Martin} and {Dmitriy Zhuk}}
}
@article{journals/algorithmica/MartinPSL23,
title = {Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs.},
year = {2023},
month = {September},
journal = {Algorithmica},
author = {{Barnaby Martin} and {Daniël Paulusma} and {Siani Smith} and {Erik Jan van Leeuwen}}
}
@article{journals/algorithmica/BertheMPS23,
title = {The Complexity of L(p, q)-Edge-Labelling.},
year = {2023},
month = {November},
journal = {Algorithmica},
author = {{Gaétan Berthe} and {Barnaby Martin} and {Daniël Paulusma} and {Siani Smith}}
}