Barnaby Martin

640 total citations
39 papers, 148 citations indexed

About

Barnaby Martin is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Barnaby Martin has authored 39 papers receiving a total of 148 indexed citations (citations by other indexed papers that have themselves been cited), including 34 papers in Computational Theory and Mathematics, 11 papers in Computer Networks and Communications and 8 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Barnaby Martin's work include Advanced Graph Theory Research (29 papers), Complexity and Algorithms in Graphs (14 papers) and semigroups and automata theory (13 papers). Barnaby Martin is often cited by papers focused on Advanced Graph Theory Research (29 papers), Complexity and Algorithms in Graphs (14 papers) and semigroups and automata theory (13 papers). Barnaby Martin collaborates with scholars based in United Kingdom, France and Germany. Barnaby Martin's co-authors include Manuel Bodirsky, Daniël Paulusma, Stefan Szeider, Jan Kára, Taolue Chen, Franco Raimondi, Hubie Chen, Erik Jan van Leeuwen, Pascal Ochem and Petr A. Golovach and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Barnaby Martin

35 papers receiving 142 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Barnaby Martin United Kingdom	7	119	56	36	30	16	39	148
Dimitrios M. Thilikos France	7	127 1.1×	36 0.6×	18 0.5×	43 1.4×	18 1.1×	25	149
Pål Grønås Drange Norway	5	135 1.1×	57 1.0×	16 0.4×	11 0.4×	13 0.8×	9	157
Petar Marković Serbia	9	210 1.8×	89 1.6×	45 1.3×	30 1.0×	25 1.6×	24	241
Markus Sortland Dregi Norway	3	104 0.9×	42 0.8×	15 0.4×	8 0.3×	13 0.8×	4	124
Fahad Panolan India	7	183 1.5×	75 1.3×	14 0.4×	31 1.0×	7 0.4×	57	205
Alexander Langer Germany	9	122 1.0×	50 0.9×	20 0.6×	16 0.5×	3 0.2×	16	152
Mamadou Moustapha Kanté France	7	115 1.0×	29 0.5×	10 0.3×	20 0.7×	23 1.4×	19	121
Piotr Micek Poland	8	137 1.2×	25 0.4×	25 0.7×	54 1.8×	18 1.1×	41	152
Édouard Bonnet France	6	62 0.5×	15 0.3×	15 0.4×	19 0.6×	9 0.6×	27	82
Aline Parreau France	7	121 1.0×	29 0.5×	27 0.8×	44 1.5×	25 1.6×	25	151

Countries citing papers authored by Barnaby Martin

Since Specialization

Citations

This map shows the geographic impact of Barnaby Martin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Barnaby Martin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Barnaby Martin more than expected).

Fields of papers citing papers by Barnaby Martin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Barnaby Martin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Barnaby Martin. The network helps show where Barnaby Martin may publish in the future.

Co-authorship network of co-authors of Barnaby Martin

This figure shows the co-authorship network connecting the top 25 collaborators of Barnaby Martin. A scholar is included among the top collaborators of Barnaby Martin based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Barnaby Martin. Barnaby Martin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Johnson, Matthew, et al.. (2025). Complexity Framework for Forbidden Subgraphs I: The Framework. Algorithmica. 87(3). 429–464.

Bodirsky, Manuel, et al.. (2024). Complexity Classification Transfer for CSPs via Algebraic Products. SIAM Journal on Computing. 53(5). 1293–1353. 1 indexed citations

Larose, Benoît, et al.. (2022). QCSP on Reflexive Tournaments. ACM Transactions on Computational Logic. 23(3). 1–22.

Golovach, Petr A., et al.. (2022). Partitioning H-free graphs of bounded diameter. Theoretical Computer Science. 930. 37–52. 1 indexed citations

Martin, Barnaby, et al.. (2022). The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation. ACM Transactions on Computational Logic. 24(1). 1–26. 1 indexed citations

Golovach, Petr A., et al.. (2021). Partitioning H-Free Graphs of Bounded Diameter. arXiv (Cornell University). 2 indexed citations

Kern, Walter, et al.. (2021). Disjoint paths and connected subgraphs for H-free graphs. Theoretical Computer Science. 898. 59–68. 2 indexed citations

Martin, Barnaby, et al.. (2017). The complexity of quantified constraints.. arXiv (Cornell University). 1 indexed citations

Glaßer, Christian, Peter Jönsson, & Barnaby Martin. (2017). Circuit satisfiability and constraint satisfaction around Skolem Arithmetic. Theoretical Computer Science. 703. 18–36. 3 indexed citations

10.

Martin, Barnaby, et al.. (2017). The packing chromatic number of the infinite square lattice is between 13 and 15. Discrete Applied Mathematics. 225. 136–142. 16 indexed citations

11.

Bodirsky, Manuel, et al.. (2015). Distance constraint satisfaction problems. Information and Computation. 247. 87–105. 2 indexed citations

12.

Martin, Barnaby, et al.. (2015). Constraint Satisfaction with Counting Quantifiers. SIAM Journal on Discrete Mathematics. 29(2). 1065–1113. 1 indexed citations

13.

Martin, Barnaby, et al.. (2015). Quantified Constraints and Containment Problems. Logical Methods in Computer Science. Volume 11, Issue 3. 4 indexed citations

14.

Martin, Barnaby & Daniël Paulusma. (2014). The computational complexity of disconnected cut and 2K2-partition. Journal of Combinatorial Theory Series B. 111. 17–37. 5 indexed citations

15.

Bodirsky, Manuel, Jan Kára, & Barnaby Martin. (2012). The complexity of surjective homomorphism problems—a survey. Discrete Applied Mathematics. 160(12). 1680–1690. 18 indexed citations

16.

Martin, Barnaby, et al.. (2012). On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction. Logical Methods in Computer Science. 8(3). 8 indexed citations

17.

Martin, Barnaby, et al.. (2011). The limits of tractability in Resolution-based propositional proof systems. Annals of Pure and Applied Logic. 163(6). 656–668.

18.

Martin, Barnaby, et al.. (2009). Tight rank lower bounds for the Sherali–Adams proof system. Theoretical Computer Science. 410(21-23). 2054–2063. 8 indexed citations

19.

Martin, Barnaby, et al.. (2007). Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution. Electronic colloquium on computational complexity. 14. 1 indexed citations

20.

Martin, Barnaby, et al.. (2007). Parameterized Proof Complexity. Durham Research Online (Durham University). 4162. 150–160. 12 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact