Barnaby Martin
-
- Limits and Structures in Graph Theory 7
-
- Advanced Graph Theory Research 29
- Complexity and Algorithms in Graphs 14
- semigroups and automata theory 13
- Graph Labeling and Dimension Problems 8
-
- Constraint Satisfaction and Optimization 11
-
- Logic, programming, and type systems 6
- Logic, Reasoning, and Knowledge 5
- Co-authors
- Manuel BodirskyDaniël PaulusmaStefan SzeiderJan KáraTaolue ChenFranco RaimondiHubie ChenErik Jan van Leeuwen
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsComputer Networks and Communications
- Journals
- Journal of the ACM (1 paper)SIAM Journal on Computing (1 paper)Theoretical Computer Science (5 papers)
- Partner nations
- United KingdomFranceGermany
In The Last Decade
Barnaby Martin
35 papers receiving 142 citations
Peers
Comparison fields: 5 of 24
- Discrete Mathematics and Combinatorics 30
- Computational Theory and Mathematics 119
- Computer Networks and Communications 56
- Geometry and Topology 16
- Computational Mathematics 1
Countries citing papers authored by Barnaby Martin
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
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
The 19 scholars most cited alongside Barnaby Martin, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2025 | 0 | |
| 2 | 2024 | 1 | |
| 3 | 2022 | 0 | |
| 4 | 2022 | 1 | |
| 5 | 2022 | 1 | |
| 6 | 2021 | 2 | |
| 7 | 2021 | 2 | |
| 8 | The complexity of quantified constraints. | 2017 | 1 |
| 9 | 2017 | 3 | |
| 10 | 2017 | 16 | |
| 11 | 2015 | 2 | |
| 12 | 2015 | 1 | |
| 13 | 2015 | 4 | |
| 14 | 2014 | 5 | |
| 15 | 2012 | 18 | |
| 16 | 2012 | 8 | |
| 17 | 2011 | 0 | |
| 18 | 2009 | 8 | |
| 19 | Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution | 2007 | 1 |
| 20 | 2007 | 12 |
About Barnaby Martin
Barnaby Martin is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Networks and Communications, having authored 39 papers that have together received 148 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (29 papers), Complexity and Algorithms in Graphs (14 papers), semigroups and automata theory (13 papers), Constraint Satisfaction and Optimization (11 papers), Graph Labeling and Dimension Problems (8 papers), Limits and Structures in Graph Theory (7 papers), Logic, programming, and type systems (6 papers) and Logic, Reasoning, and Knowledge (5 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (30 citations), Computational Theory and Mathematics (119 citations) and Computer Networks and Communications (56 citations). Barnaby Martin has collaborated with scholars based in United Kingdom, France and Germany. Frequent 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. Their work appears in journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.
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.