Matthew Johnson

1.5k total citations
60 papers, 567 citations indexed

About

Matthew Johnson is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Matthew Johnson has authored 60 papers receiving a total of 567 indexed citations (citations by other indexed papers that have themselves been cited), including 35 papers in Computational Theory and Mathematics, 17 papers in Computer Networks and Communications and 16 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Matthew Johnson's work include Advanced Graph Theory Research (30 papers), Limits and Structures in Graph Theory (16 papers) and Graph Labeling and Dimension Problems (13 papers). Matthew Johnson is often cited by papers focused on Advanced Graph Theory Research (30 papers), Limits and Structures in Graph Theory (16 papers) and Graph Labeling and Dimension Problems (13 papers). Matthew Johnson collaborates with scholars based in United Kingdom, United States and France. Matthew Johnson's co-authors include Jan van den Heuvel, Luis Cereceda, Daniël Paulusma, Jian Song, Petr A. Golovach, A. J. W. Hilton, Milind Tambe, Zhengyu Yin, Albert Xin Jiang and Tüomas Sandholm and has published in prestigious journals such as The American Journal of Psychology, Annals of Operations Research and Perception.

In The Last Decade

Matthew Johnson

54 papers receiving 537 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Matthew Johnson United Kingdom	12	336	150	147	109	37	60	567
Haixing Zhao China	12	162 0.5×	52 0.3×	60 0.4×	38 0.3×	5 0.1×	91	448
Enqiang Zhu China	12	223 0.7×	15 0.1×	60 0.4×	43 0.4×	8 0.2×	66	407
Kannan Balakrishnan India	12	105 0.3×	22 0.1×	28 0.2×	10 0.1×	6 0.2×	55	494
Víctor Campos Brazil	9	126 0.4×	50 0.3×	31 0.2×	23 0.2×		34	397
Hiroyoshi Miwa Japan	9	34 0.1×	4 0.0×	142 1.0×	33 0.3×	6 0.2×	58	312
Fernando J. Barros Portugal	12	121 0.4×	17 0.1×	118 0.8×	34 0.3×		62	560
Junichi Toyoda Japan	12	83 0.2×	5 0.0×	30 0.2×	205 1.9×	14 0.4×	73	478
José Luis Montaña Spain	9	115 0.3×	9 0.1×	11 0.1×	10 0.1×	1 0.0×	35	314
Mengran Xue United States	11	24 0.1×		228 1.6×	49 0.4×	10 0.3×	55	412
Volker Sorge United Kingdom	12	156 0.5×	3 0.0×	40 0.3×	8 0.1×		60	387

Countries citing papers authored by Matthew Johnson

Since Specialization

Citations

This map shows the geographic impact of Matthew Johnson'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 Matthew Johnson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Matthew Johnson more than expected).

Fields of papers citing papers by Matthew Johnson

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Matthew Johnson. 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 Matthew Johnson. The network helps show where Matthew Johnson may publish in the future.

Co-authorship network of co-authors of Matthew Johnson

This figure shows the co-authorship network connecting the top 25 collaborators of Matthew Johnson. A scholar is included among the top collaborators of Matthew Johnson 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 Matthew Johnson. Matthew Johnson 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.. (2022). Computing Weighted Subset Odd Cycle Transversals in H-free graphs. Journal of Computer and System Sciences. 128. 71–85. 1 indexed citations

Johnson, Matthew, et al.. (2022). Computing subset transversals in H-free graphs. IRIS Research product catalog (Sapienza University of Rome). 3 indexed citations

Dabrowski, Konrad K., et al.. (2020). On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. IRIS Research product catalog (Sapienza University of Rome). 6 indexed citations

Johnson, Matthew, et al.. (2017). Erdős–Ko–Rado theorems for a family of trees. Discrete Applied Mathematics. 236. 464–471. 2 indexed citations

Dabrowski, Konrad K., et al.. (2016). Colouring on Hereditary Graph Classes Closed under Complementation.. arXiv (Cornell University). 1 indexed citations

Golovach, Petr A., Matthew Johnson, Daniël Paulusma, & Jian Song. (2016). A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs. Journal of Graph Theory. 84(4). 331–363. 59 indexed citations

Johnson, Matthew, et al.. (2015). Knocking out Pk-free graphs. Discrete Applied Mathematics. 190-191. 100–108.

Johnson, Matthew, et al.. (2013). Evader interdiction: algorithms, complexity and collateral damage. Annals of Operations Research. 222(1). 341–359. 6 indexed citations

Jakob, Michal, Antonín Komenda, Zhengyu Yin, et al.. (2012). AgentPolis: towards a platform for fully agent-based modeling of multi-modal transportation (demonstration). Adaptive Agents and Multi-Agents Systems. 1501–1502. 7 indexed citations

10.

Johnson, Matthew, Fei Fang, Rong Yang, Milind Tambe, & Heidi J. Albers. (2012). Challenges in Patrolling to Maximize Pristine Forest Area (Position Paper).. National Conference on Artificial Intelligence. 3 indexed citations

11.

Jiang, Albert Xin, Zhengyu Yin, Matthew Johnson, et al.. (2012). Towards optimal patrol strategies for fare inspection in transit systems. National Conference on Artificial Intelligence. 15 indexed citations

12.

Cereceda, Luis, Jan van den Heuvel, & Matthew Johnson. (2009). Mixing 3-colourings in bipartite graphs. European Journal of Combinatorics. 30(7). 1593–1606. 35 indexed citations

13.

Johnson, Matthew, et al.. (2009). Path factors and parallel knock-out schemes of almost claw-free graphs. Discrete Mathematics. 310(9). 1413–1423. 10 indexed citations

14.

Cereceda, Luis, Jan van den Heuvel, & Matthew Johnson. (2007). Connectedness of the graph of vertex-colourings. Discrete Mathematics. 308(5-6). 913–919. 53 indexed citations

15.

Johnson, Matthew, et al.. (2006). Cycle decompositions of the complete graph.. Ars Combinatoria. 81. 4 indexed citations

16.

Johnson, Matthew. (2006). Amalgamations of factorizations of complete graphs. Journal of Combinatorial Theory Series B. 97(4). 597–611. 6 indexed citations

17.

Hilton, A. J. W. & Matthew Johnson. (2004). Amalgamations of factorizations of complete equipartite graphs. Discrete Mathematics. 284(1-3). 157–175.

18.

Hilton, A. J. W., et al.. (2003). Amalgamations of connected k-factorizations. Journal of Combinatorial Theory Series B. 88(2). 267–279. 10 indexed citations

19.

Johnson, Matthew, et al.. (2001). Weak critical sets in cyclic Latin squares. Australas. J Comb.. 23. 301.

20.

Johnson, Matthew & S. Trippett. (1981). The apicophilicity of the phenylseleno group in five-co-ordinate phosphoranes. Journal of the Chemical Society Perkin Transactions 1. 3074–3074. 4 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