Barnaby Martin

Generating author description...

All published works

Action	Title	Year	Authors
+	Complexity Framework for Forbidden Subgraphs I: The Framework	2025	Matthew Johnson Barnaby Martin Jelle J. Oostveen Sukanya Pandey Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+ PDF Chat	Complexity Classification Transfer for CSPs via Algebraic Products	2024	Manuel Bodirsky Peter Jönsson Barnaby Martin Antoine Mottet Žaneta Semanišinová
+ PDF Chat	Model-checking positive equality free logic on a fixed structure (direttissima)	2024	Manuel Bodirsky Marcin Kozik Florent Madelaine Barnaby Martin Michał Wrona
+ PDF Chat	Proof Complexity and the Binary Encoding of Combinatorial Principles	2024	Stefan Dantchev Nicola Galesi Abdul Ghani Barnaby Martin
+ PDF Chat	Graph Homomorphism, Monotone Classes and Bounded Pathwidth	2024	Tala Eagling-Vose Barnaby Martin Daniël Paulusma Mark Siggers Siani Smith
+ PDF Chat	Depth lower bounds in Stabbing Planes for combinatorial principles	2024	Stefan Dantchev Nicola Galesi Abdul Ghani Barnaby Martin
+	Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem	2024	Hans L. Bodlaender Matthew Johnson Barnaby Martin Jelle J. Oostveen Sukanya Pandey Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+	The Complexity of L(p, q)-Edge-Labelling	2023	Gaétan Berthe Barnaby Martin Daniël Paulusma Siani Smith
+ PDF Chat	Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs	2023	Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+ PDF Chat	The complete classification for quantified equality constraints	2023	Dmitriy Zhuk Barnaby Martin Michał Wrona
+	Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem	2023	Hans L. Bodlaender Matthew Johnson Barnaby Martin Jelle J. Oostveen Sukanya Pandey Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+	Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs	2023	Matthew Johnson Barnaby Martin Sukanya Pandey Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+	Few induced disjoint paths for H-free graphs	2022	Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+ PDF Chat	The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation	2022	Catarina Carvalho Florent Madelaine Barnaby Martin Dmitriy Zhuk
+ PDF Chat	QCSP Monsters and the Demise of the Chen Conjecture	2022	Dmitriy Zhuk Barnaby Martin
+ PDF Chat	Colouring generalized claw-free graphs and graphs of large girth: Bounding the diameter	2022	Barnaby Martin Daniël Paulusma Siani Smith
+	Partitioning H-free graphs of bounded diameter	2022	Christoph Brause Petr A. Golovach Barnaby Martin Daniël Paulusma Siani Smith
+ PDF Chat	Acyclic, Star, and Injective Colouring: Bounding the Diameter	2022	Christoph Brause Petr A. Golovach Barnaby Martin Pascal Ochem Daniël Paulusma Siani Smith
+ PDF Chat	QCSP on Reflexive Tournaments	2022	Benoît Larose Barnaby Martin Petar Marković Daniël Paulusma Siani Smith Stanislav Živný
+ PDF Chat	Colouring graphs of bounded diameter in the absence of small cycles	2022	Barnaby Martin Daniël Paulusma Siani Smith
+ PDF Chat	The Complexity of L(p, q)-Edge-Labelling	2022	Gaétan Berthe Barnaby Martin Daniël Paulusma Siani Smith
+	Induced Disjoint Paths and Connected Subgraphs for $H$-Free Graphs	2022	Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+	Few Induced Disjoint Paths for $H$-Free Graphs	2022	Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+	Complexity Classification Transfer for CSPs via Algebraic Products	2022	Manuel Bodirsky Peter Jönsson Barnaby Martin Antoine Mottet Žaneta Semanišinová
+	Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs	2022	Matthew Johnson Barnaby Martin Siani Smith Sukanya Pandey Daniël Paulusma Erik Jan van Leeuwen
+	Complexity Framework For Forbidden Subgraphs I: The Framework	2022	Matthew Johnson Barnaby Martin Jelle J. Oostveen Sukanya Pandey Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+	Complexity Framework for Forbidden Subgraphs II: When Hardness Is Not Preserved under Edge Subdivision	2022	Barnaby Martin Sukanya Pandey Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+ PDF Chat	Few Induced Disjoint Paths for H-Free Graphs	2022	Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+	Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs	2022	Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+ PDF Chat	The lattice and semigroup structure of multipermutations	2021	Catarina Carvalho Barnaby Martin
+ PDF Chat	Disjoint paths and connected subgraphs for H-free graphs	2021	Walter Kern Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+	Hard problems that quickly become very easy	2021	Barnaby Martin Daniël Paulusma Siani Smith
+	The lattice and semigroup structure of multipermutations	2021	Catarina Carvalho Barnaby Martin
+	Depth lower bounds in Stabbing Planes for combinatorial principles	2021	Stefan Dantchev Nicola Galesi Abdul Ghani Barnaby Martin
+ PDF Chat	Disjoint Paths and Connected Subgraphs for H-Free Graphs	2021	Walter Kern Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+ PDF Chat	Colouring Graphs of Bounded Diameter in the Absence of Small Cycles	2021	Barnaby Martin Daniël Paulusma Siani Smith
+	Acyclic, Star, and Injective Colouring: Bounding the Diameter	2021	Christoph Brause Petr A. Golovach Barnaby Martin Daniël Paulusma Siani Smith
+	Partitioning H-free graphs of bounded diameter	2021	Christoph Brause Petr A. Golovach Barnaby Martin Daniël Paulusma Siani Smith
+	Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter	2021	Barnaby Martin Daniël Paulusma Siani Smith
+	Disjoint Paths and Connected Subgraphs for H-Free Graphs	2021	Walter Kern Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+	Partitioning H-Free Graphs of Bounded Diameter	2021	Christoph Brause Petr A. Golovach Barnaby Martin Daniël Paulusma Siani Smith
+	The complete classification for quantified equality constraints	2021	Dmitriy Zhuk Barnaby Martin
+	The lattice and semigroup structure of multipermutations	2021	Catarina Carvalho Barnaby Martin
+	Colouring Graphs of Bounded Diameter in the Absence of Small Cycles	2021	Barnaby Martin Daniël Paulusma Siani Smith
+	Acyclic, Star, and Injective Colouring: Bounding the Diameter	2021	Christoph Brause Petr A. Golovach Barnaby Martin Pascal Ochem Daniël Paulusma Siani Smith
+	Depth lower bounds in Stabbing Planes for combinatorial principles	2021	Stefan Dantchev Nicola Galesi Abdul Ghani Barnaby Martin
+	The complexity of quantified constraints: collapsibility, switchability and the algebraic formulation	2021	Catarina Carvalho Florent Madelaine Barnaby Martin Dmitriy Zhuk
+	Hard Problems That Quickly Become Very Easy	2020	Barnaby Martin Daniël Paulusma Siani Smith
+ PDF Chat	QCSP monsters and the demise of the chen conjecture	2020	Dmitriy Zhuk Barnaby Martin
+	Disconnected cuts in claw-free graphs	2020	Barnaby Martin Daniël Paulusma Erik Jan van Leeuwen
+ PDF Chat	Sherali-Adams and the Binary Encoding of Combinatorial Principles	2020	Stefan Dantchev Abdul Ghani Barnaby Martin
+	Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs	2020	Jan Bok Nikola Jedličková Barnaby Martin Pascal Ochem Daniël Paulusma Siani Smith
+	Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs.	2020	Jan Bok Nikola Jedličková Barnaby Martin Daniël Paulusma Siani Smith
+	Hard Problems That Quickly Become Very Easy	2020	Barnaby Martin Daniël Paulusma Siani Smith
+	The complexity of L(p,q)-Edge-Labelling	2020	Gaétan Berthe Barnaby Martin Daniël Paulusma Siani Smith
+	Proof complexity and the binary encoding of combinatorial principles	2020	Stefan Dantchev Nicola Galesi Abdul Ghani Barnaby Martin
+	Sherali-Adams and the binary encoding of combinatorial principles	2019	Stefan Dantchev Abdul Ghani Barnaby Martin
+	Constraint Satisfaction Problems for Reducts of Homogeneous Graphs	2019	Manuel Bodirsky Barnaby Martin Michael Pinsker András Pongrácz
+	Sherali-Adams and the binary encoding of combinatorial principles	2019	Stefan Dantchev Abdul Ghani Barnaby Martin
+	QCSP monsters and the demise of the Chen Conjecture	2019	Dmitriy Zhuk Barnaby Martin
+ PDF Chat	Surjective H-Colouring over Reflexive Digraphs	2018	Benoît Larose Barnaby Martin Daniël Paulusma
+	The complexity of disjunctive linear Diophantine constraints.	2018	Manuel Bodirsky Barnaby Martin Marcello Mamino Antoine Mottet
+	Classification Transfer for Qualitative Reasoning Problems	2018	Manuel Bodirsky Peter Jönsson Barnaby Martin Antoine Mottet
+	Classification transfer for qualitative reasoning problems	2018	Barnaby Martin Peter Jönsson Manuel Bodirsky Antoine Mottet
+	Disconnected Cuts in Claw-free Graphs	2018	Barnaby Martin Daniël Paulusma Erik Jan van Leeuwen
+ PDF Chat	Surjective H-colouring: New hardness results	2018	Petr A. Golovach Matthew Johnson Barnaby Martin Daniël Paulusma Anthony Stewart
+ PDF Chat	Discrete Temporal Constraint Satisfaction Problems	2018	Manuel Bodirsky Barnaby Martin Antoine Mottet
+	The complexity of disjunctive linear Diophantine constraints	2018	Manuel Bodirsky Barnaby Martin Marcello Mamino Antoine Mottet
+	Resolution and the binary encoding of combinatorial principles	2018	Stefan Dantchev Nicola Galesi Barnaby Martin
+	On the Complexity of the Model Checking Problem	2018	Florent Madelaine Barnaby Martin
+	Disconnected Cuts in Claw-free Graphs	2018	Barnaby Martin Daniël Paulusma Erik Jan van Leeuwen
+	Classification transfer for qualitative reasoning problems	2018	Barnaby Martin Peter Jönsson Manuel Bodirsky Antoine Mottet
+	Surjective H-Colouring over Reflexive Digraphs	2017	Benoît Larose Barnaby Martin Daniël Paulusma
+	The packing chromatic number of the infinite square lattice is between 13 and 15	2017	Barnaby Martin Franco Raimondi Taolue Chen Jos Martin
+	The complexity of quantified constraints.	2017	Catarina Carvalho Barnaby Martin Dmitriy Zhuk
+	The complexity of quantified constraints using the algebraic formulation	2017	Catarina Carvalho Barnaby Martin Dmitriy Zhuk
+ PDF Chat	Surjective H-Colouring: New Hardness Results	2017	Petr A. Golovach Matthew Johnson Barnaby Martin Daniël Paulusma Anthony Stewart
+	Surjective H-Colouring over Reflexive Digraphs	2017	Benoît Larose Barnaby Martin Daniël Paulusma
+	Constraint satisfaction problems for reducts of homogeneous graphs.	2016	Manuel Bodirsky Barnaby Martin Michael Pinsker András Pongrácz
+	Constraint satisfaction problems for reducts of homogeneous graphs	2016	Manuel Bodirsky Barnaby Martin Michael Pinsker András Pongrácz
+	On the Chen Conjecture regarding the complexity of QCSPs	2016	Barnaby Martin
+	Constraint satisfaction problems for reducts of homogeneous graphs	2016	Manuel Bodirsky Barnaby Martin Michael Pinsker András Pongrácz
+	Distance constraint satisfaction problems	2015	Manuel Bodirsky Víctor Dalmau Barnaby Martin Antoine Mottet Michael Pinsker
+	The packing chromatic number of the infinite square lattice is between 13 and 15	2015	Barnaby Martin Franco Raimondi Taolue Chen Jos Martin
+ PDF Chat	From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP	2015	Catarina Carvalho Florent Madelaine Barnaby Martin
+	Constraint Satisfaction Problems over the Integers with Successor	2015	Manuel Bodirsky Barnaby Martin Antoine Mottet
+	From complexity to algebra and back: digraph classes, collapsibility and the PGP	2015	Catarina Carvalho Florent Madelaine Barnaby Martin
+	Switchability and collapsibility of Gap Algebras	2015	Barnaby Martin Dmitriy Zhuk
+ PDF Chat	Constraint Satisfaction with Counting Quantifiers	2015	Barnaby Martin Florent Madelaine Juraj Stacho
+	The packing chromatic number of the infinite square lattice is between 13 and 15	2015	Barnaby Martin Franco Raimondi Taolue Chen Jos Martin
+	From complexity to algebra and back: digraph classes, collapsibility and the PGP	2015	Catarina Carvalho Florent Madelaine Barnaby Martin
+	Discrete Temporal Constraint Satisfaction Problems	2015	Manuel Bodirsky Barnaby Martin Antoine Mottet
+	Constraint Satisfaction Problems around Skolem Arithmetic	2015	Christian Glaßer Peter Jönsson Barnaby Martin
+ PDF Chat	Constraint Satisfaction with Counting Quantifiers 2	2014	Barnaby Martin Juraj Stacho
+	QCSP on partially reflexive cycles - the wavy line of tractability	2013	Florent Madelaine Barnaby Martin
+ PDF Chat	QCSP on Partially Reflexive Cycles – The Wavy Line of Tractability	2013	Florent Madelaine Barnaby Martin
+ PDF Chat	Parameterized Resolution with Bounded Conjunction	2013	Stefan Dantchev Barnaby Martin
+	Relativisation makes contradictions harder for Resolution	2013	Stefan Dantchev Barnaby Martin
+	QCSP on partially reflexive cycles - the wavy line of tractability	2013	Florent Madelaine Barnaby Martin
+	Constraint Satisfaction with Counting Quantifiers 2	2013	Barnaby Martin Juraj Stacho
+ PDF Chat	On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction	2012	Barnaby Martin Manuel Bodirsky Martin Hils
+ PDF Chat	Finding vertex-surjective graph homomorphisms	2012	Petr A. Golovach Bernard Lidický Barnaby Martin Daniël Paulusma
+	Containment, Equivalence and Coreness from CSP to QCSP and beyond	2012	Florent Madelaine Barnaby Martin
+	The complexity of surjective homomorphism problems—a survey	2012	Manuel Bodirsky Jan Kára Barnaby Martin
+	Parameterized Resolution with bounded conjunction	2012	Stefan Dantchev Barnaby Martin
+ PDF Chat	Containment, Equivalence and Coreness from CSP to QCSP and Beyond	2012	Florent Madelaine Barnaby Martin
+	Parameterized Proof Complexity and W[1]	2012	Barnaby Martin
+ PDF Chat	The Complexity of Positive First-Order Logic without Equality	2012	Florent Madelaine Barnaby Martin
+ PDF Chat	Constraint Satisfaction with Counting Quantifiers	2012	Florent Madelaine Barnaby Martin Juraj Stacho
+	Finding Vertex-Surjective Graph Homomorphisms	2012	Petr A. Golovach Bernard Lidický Barnaby Martin Daniël Paulusma
+	Parameterized Resolution with bounded conjunction	2012	Stefan Dantchev Barnaby Martin
+	On the complexity of the model checking problem	2012	Florent Madelaine Barnaby Martin
+	Containment, Equivalence and Coreness from CSP to QCSP and beyond	2012	Florent Madelaine Barnaby Martin
+	Cutting Planes and the Parameter Cutwidth	2011	Stefan Dantchev Barnaby Martin
+ PDF Chat	Low-level dichotomy for quantified constraint satisfaction problems	2011	Barnaby Martin
+	The Computational Complexity of Disconnected Cut and 2K2-Partition	2011	Barnaby Martin Daniël Paulusma
+	QCSP on partially reflexive forests	2011	Barnaby Martin
+	Low-level dichotomy for Quantified Constraint Satisfaction Problems	2011	Barnaby Martin
+ PDF Chat	QCSP on Partially Reflexive Forests	2011	Barnaby Martin
+ PDF Chat	The Computational Complexity of Disconnected Cut and 2K 2-Partition	2011	Barnaby Martin Daniël Paulusma
+	The Complexity of Surjective Homomorphism Problems -- a Survey	2011	Manuel Bodirsky Jan Kára Barnaby Martin
+	QCSP on partially reflexive forests	2011	Barnaby Martin
+	The Computational Complexity of Disconnected Cut and 2K2-Partition	2011	Barnaby Martin Daniël Paulusma
+	Low-level dichotomy for Quantified Constraint Satisfaction Problems	2011	Barnaby Martin
+	Constraint Satisfaction with Counting Quantifiers	2011	Florent Madelaine Barnaby Martin Juraj Stacho
+ PDF Chat	On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction	2010	Manuel Bodirsky Martin Hils Barnaby Martin
+	The Lattice Structure of Sets of Surjective Hyper-Operations	2010	Barnaby Martin
+ PDF Chat	Distance Constraint Satisfaction Problems	2010	Manuel Bodirsky Víctor Dalmau Barnaby Martin Michael Pinsker
+	The complexity of positive first-order logic without equality	2010	Florent Madelaine Barnaby Martin
+ PDF Chat	The Complexity of Positive First-order Logic without Equality	2009	Florent Madelaine Barnaby Martin
+	Tight rank lower bounds for the Sherali–Adams proof system	2009	Stefan Dantchev Barnaby Martin Mark Rhodes
+	Cutting Planes and the Parameter Cutwidth	2009	Stefan Dantchev Barnaby Martin
+ PDF Chat	Quantified Constraints and Containment Problems	2008	Hubie Chen Florent Madelaine Barnaby Martin
+	Model Checking Positive Equality-free FO: Boolean Structures and Digraphs of Size Three	2008	Barnaby Martin
+	On the Complexity of a Deriviative Chess Problem	2007	Barnaby Martin
+	On the Complexity of a Derivative Chess Problem	2007	Barnaby Martin
+	Dichotomies and Duality in First-order Model Checking Problems	2006	Barnaby Martin

Common Coauthors

Coauthor	Papers Together
Daniël Paulusma	50
Siani Smith	37
Manuel Bodirsky	21
Florent Madelaine	21
Erik Jan van Leeuwen	19
Stefan Dantchev	16
Antoine Mottet	11
Dmitriy Zhuk	10
Petr A. Golovach	10
Catarina Carvalho	9
Abdul Ghani	8
Sukanya Pandey	7
Nicola Galesi	6
Michael Pinsker	6
Matthew Johnson	6
Christoph Brause	6
Peter Jönsson	6
Juraj Stacho	5
Benoît Larose	4
András Pongrácz	4
Jos Martin	3
Gaétan Berthe	3
Franco Raimondi	3
Walter Kern	3
Jelle J. Oostveen	3
Taolue Chen	3
Pascal Ochem	3
Nikola Jedličková	2
Matthew Johnson	2
Hans L. Bodlaender	2
Marcello Mamino	2
Martin Hils	2
Bernard Lidický	2
Víctor Dalmau	2
Jan Bok	2
Michał Wrona	2
Žaneta Semanišinová	2
Anthony Stewart	2
Jan Kára	2
Stanislav Živný	1
Jelle J. Oostveen	1
Tala Eagling-Vose	1
Catarina Carvalho	1
Marcin Kozik	1
Mark Rhodes	1
Petar Marković	1
Mark Siggers	1
Hubie Chen	1
Christian Glaßer	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	On the complexity of H-coloring	1990	Pavol Hell Jaroslav Nešetřil	28
+	The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)	2009	Libor Barto Marcin Kozik Todd Niven	16
+	The complexity of surjective homomorphism problems—a survey	2012	Manuel Bodirsky Jan Kára Barnaby Martin	15
+ PDF Chat	The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case	2008	Hubie Chen	14
+ PDF Chat	A Dichotomy Theorem for Nonuniform CSPs	2017	Andreĭ A. Bulatov	12
+ PDF Chat	A Proof of CSP Dichotomy Conjecture	2017	Dmitriy Zhuk	10
+	A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results	2005	Narayan Vikas	10
+	Constraint Satisfaction with Countable Homogeneous Templates	2006	Manuel Bodirsky Jaroslav Nešetřil	9
+	Computational Complexity of Compaction to Reflexive Cycles	2002	Narayan Vikas	8
+ PDF Chat	QCSP on Partially Reflexive Forests	2011	Barnaby Martin	8
+	Majority constraints have bounded pathwidth duality	2008	Víctor Dalmau Andrei Krokhin	7
+ PDF Chat	A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs	2016	Petr A. Golovach Matthew Johnson Daniël Paulusma Jian Song	7
+ PDF Chat	Quantified Constraints and Containment Problems	2008	Hubie Chen Florent Madelaine Barnaby Martin	7
+ PDF Chat	Schaefer's Theorem for Graphs	2015	Manuel Bodirsky Michael Pinsker	7
+ PDF Chat	A Proof of the CSP Dichotomy Conjecture	2020	Dmitriy Zhuk	6
+	<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.gif" display="inline" overflow="scroll"><mml:mn>2</mml:mn><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math> vertex-set partition into nonempty parts	2009	Kathryn Cook Simone Dantas Elaine M. Eschen Luérbio Faria Celina M.H. de Figueiredo Sulamita Klein	6
+ PDF Chat	Open Problems on Graph Coloring for Special Graph Classes	2016	Daniël Paulusma	6
+	Covering graphs with few complete bipartite subgraphs	2009	Herbert Fleischner Egbert Mujuni Daniël Paulusma Stefan Szeider	6
+ PDF Chat	QCSP monsters and the demise of the chen conjecture	2020	Dmitriy Zhuk Barnaby Martin	6
+	The complexity of colouring problems on dense graphs	1986	Keith Edwards	6
+ PDF Chat	Cores of Countably Categorical Structures	2007	Manuel Bodirsky	6
+ PDF Chat	Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees	2011	Petr A. Golovach Daniël Paulusma Jian Song	6
+	The P versus NP–complete dichotomy of some challenging problems in graph theory	2011	Celina M.H. de Figueiredo	6
+ PDF Chat	Model theory: an introduction	2003	David Marker	6
+	List Homomorphisms and Circular Arc Graphs	1999	Tomás Feder Pavol Hell Jing Huang	6
+	On the Complexity of the Model Checking Problem	2018	Florent Madelaine Barnaby Martin	6
+ PDF Chat	The Complexity of Positive First-order Logic without Equality	2009	Florent Madelaine Barnaby Martin	6
+ PDF Chat	Algorithms and Almost Tight Results for $$3$$ 3 -Colorability of Small Diameter Graphs	2014	George B. Mertzios Paul G. Spirakis	6
+ PDF Chat	A rendezvous of logic, complexity, and algebra	2006	Hubie Chen	5
+	A complete complexity classification of the role assignment problem	2005	Jiřı́ Fiala Daniël Paulusma	5
+ PDF Chat	Meditations on Quantified Constraint Satisfaction	2012	Hubie Chen	5
+ PDF Chat	Containment, Equivalence and Coreness from CSP to QCSP and Beyond	2012	Florent Madelaine Barnaby Martin	5
+ PDF Chat	Colouring Graphs of Bounded Diameter in the Absence of Small Cycles	2021	Barnaby Martin Daniël Paulusma Siani Smith	5
+	Edmonds polytopes and a hierarchy of combinatorial problems	1973	Vašek Chvátal	5
+	The Proof of CSP Dichotomy Conjecture.	2017	Dmitriy Zhuk	5
+	Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile	1980	Najiba Sbihi	5
+	The Complexity of Colouring by Semicomplete Digraphs	1988	Jørgen Bang‐Jensen Pavol Hell Gary MacGillivray	5
+ PDF Chat	A Characterisation of First-Order Constraint Satisfaction Problems	2007	Benoît Larose Cynthia Loten Claude Tardif	5
+ PDF Chat	Vertex Colouring and Forbidden Subgraphs ? A Survey	2004	Bert Randerath Ingo Schiermeyer	4
+ PDF Chat	On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction	2012	Barnaby Martin Manuel Bodirsky Martin Hils	4
+	A shorter model theory	1997	Wilfrid Hodges	4
+ PDF Chat	The complexity of proving that a graph is Ramsey	2016	Massimo Lauria Pavel Pudlák Vojtěch Rödl Neil Thapen	4
+	Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth	1998	Thomas Emden-Weinert Stefan Hougardy B. Kreuter	4
+ PDF Chat	Computing vertex-surjective homomorphisms to partially reflexive trees	2012	Petr A. Golovach Daniël Paulusma Jian Song	4
+	Induced disjoint paths in circular-arc graphs in linear time	2016	Petr A. Golovach Daniël Paulusma Erik Jan van Leeuwen	4
+ PDF Chat	Existence theorems for weakly symmetric operations	2008	Miklós Maróti Ralph McKenzie	4
+	Induced Disjoint Paths in Claw-Free Graphs	2015	Petr A. Golovach Daniël Paulusma Erik Jan van Leeuwen	4
+ PDF Chat	Locally constrained graph homomorphisms—structure, complexity, and applications	2008	Jiřı́ Fiala Jan Kratochvı́l	4
+	Coloring graphs without short cycles and long induced paths	2014	Petr A. Golovach Daniël Paulusma Jian Song	4
+	Detecting induced subgraphs	2009	Benjamin Lévêque David Y. Lin Frédéric Maffray Nicolas Trotignon	4