Kathie Cameron

1.1k total citations
43 papers, 589 citations indexed

About

Kathie Cameron is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Kathie Cameron has authored 43 papers receiving a total of 589 indexed citations (citations by other indexed papers that have themselves been cited), including 42 papers in Computational Theory and Mathematics, 22 papers in Discrete Mathematics and Combinatorics and 12 papers in Geometry and Topology. Recurrent topics in Kathie Cameron's work include Advanced Graph Theory Research (40 papers), Limits and Structures in Graph Theory (21 papers) and Graph Labeling and Dimension Problems (18 papers). Kathie Cameron is often cited by papers focused on Advanced Graph Theory Research (40 papers), Limits and Structures in Graph Theory (21 papers) and Graph Labeling and Dimension Problems (18 papers). Kathie Cameron collaborates with scholars based in Canada, United States and China. Kathie Cameron's co-authors include Jack Edmonds, R. Sritharan, Chı́nh T. Hoàng, Pavol Hell, Tracy Walker, Shenwei Huang, Vadim Lozin, László Lovász, Anthony Bonato and Steven Chaplick and has published in prestigious journals such as Mathematical Programming, Theoretical Computer Science and Networks.

In The Last Decade

Kathie Cameron

38 papers receiving 560 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Kathie Cameron Canada	11	541	229	183	153	66	43	589
Bert L. Hartnell Canada	12	491 0.9×	141 0.6×	137 0.7×	147 1.0×	74 1.1×	52	538
Christina M. Mynhardt Canada	14	634 1.2×	173 0.8×	160 0.9×	136 0.9×	29 0.4×	95	679
Tomáš Kaiser Czechia	12	348 0.6×	194 0.8×	59 0.3×	109 0.7×	73 1.1×	60	404
Genghua Fan China	17	667 1.2×	450 2.0×	159 0.9×	273 1.8×	193 2.9×	63	781
David P. Sumner United States	13	770 1.4×	303 1.3×	226 1.2×	300 2.0×	103 1.6×	23	811
Yoshimi Egawa Japan	13	448 0.8×	279 1.2×	138 0.8×	172 1.1×	176 2.7×	89	531
Zdeněk Ryjáček Czechia	15	934 1.7×	500 2.2×	285 1.6×	328 2.1×	165 2.5×	86	970
Michael Stiebitz Germany	14	504 0.9×	366 1.6×	40 0.2×	150 1.0×	79 1.2×	51	555
Matthias Kriesell Germany	11	365 0.7×	107 0.5×	170 0.9×	101 0.7×	121 1.8×	56	415
Izak Broere South Africa	9	289 0.5×	150 0.7×	30 0.2×	98 0.6×	54 0.8×	47	320

Countries citing papers authored by Kathie Cameron

Since Specialization

Citations

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

Fields of papers citing papers by Kathie Cameron

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Kathie Cameron

This figure shows the co-authorship network connecting the top 25 collaborators of Kathie Cameron. A scholar is included among the top collaborators of Kathie Cameron 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 Kathie Cameron. Kathie Cameron 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

Cameron, Kathie, et al.. (2023). Reconfiguration of vertex colouring and forbidden induced subgraphs. European Journal of Combinatorics. 118. 103908–103908.

Cameron, Kathie, et al.. (2021). An optimal χ‐bound for (P6, diamond)‐free graphs. Journal of Graph Theory. 97(3). 451–465. 10 indexed citations

Cameron, Kathie, Jan Goedgebeur, Shenwei Huang, & Yongtang Shi. (2021). k-Critical graphs in P5-free graphs. Theoretical Computer Science. 864. 80–91. 9 indexed citations

Cameron, Kathie & Chı́nh T. Hoàng. (2018). Solving the clique cover problem on (bull, C4)-free graphs. Discrete Applied Mathematics. 261. 119–122. 1 indexed citations

Cameron, Kathie, et al.. (2017). Structure and algorithms for (cap, even hole)-free graphs. Discrete Mathematics. 341(2). 463–473. 14 indexed citations

Cameron, Kathie, Steven Chaplick, & Chı́nh T. Hoàng. (2015). Edge intersection graphs of L-shaped paths in grids. Discrete Applied Mathematics. 210. 185–194. 4 indexed citations

Cameron, Kathie, Steven Chaplick, & Chı́nh T. Hoàng. (2013). Edge Intersection Graphs of L-Shaped Paths in Grids. Electronic Notes in Discrete Mathematics. 44. 363–369. 10 indexed citations

Cameron, Kathie, Benjamin Lévêque, & Frédéric Maffray. (2011). Coloring vertices of a graph or finding a Meyniel obstruction. Theoretical Computer Science. 428. 10–17. 1 indexed citations

Cameron, Kathie. (2008). Brambles and independent packings in chordal graphs. Discrete Mathematics. 309(18). 5766–5769. 2 indexed citations

10.

Cameron, Kathie & Jack Edmonds. (2007). The travelling preacher, projection, and a lower bound for the stability number of a graph. Discrete Optimization. 5(2). 290–292. 1 indexed citations

11.

Cameron, Kathie & Tracy Walker. (2005). The graphs with maximum induced matching and maximum matching the same size. Discrete Mathematics. 299(1-3). 49–55. 29 indexed citations

12.

Cameron, Kathie & Pavol Hell. (2005). Independent packings in structured graphs. Mathematical Programming. 105(2-3). 201–213. 32 indexed citations

13.

Cameron, Kathie, et al.. (2004). On computing the dissociation number and the induced matching number of bipartite graphs.. Ars Combinatoria. 72. 35 indexed citations

14.

Cameron, Kathie, et al.. (2004). The list partition problem for graphs. Symposium on Discrete Algorithms. 391–399. 20 indexed citations

15.

Cameron, Kathie. (2003). Induced matchings in intersection graphs. Discrete Mathematics. 278(1-3). 1–9. 51 indexed citations

16.

Cameron, Kathie, et al.. (2003). Finding a maximum induced matching in weakly chordal graphs. Discrete Mathematics. 266(1-3). 133–142. 49 indexed citations

17.

Cameron, Kathie & Jack Edmonds. (1992). Coflow polyhedra. Discrete Mathematics. 101(1-3). 1–21. 5 indexed citations

18.

Cameron, Kathie. (1989). A min-max relation for the partial q- colourings of a graph. Part II: Box perfection. Discrete Mathematics. 74(1-2). 15–27. 8 indexed citations

19.

Cameron, Kathie. (1989). Induced matchings. Discrete Applied Mathematics. 24(1-3). 97–102. 138 indexed citations

20.

Cameron, Kathie. (1986). On k-Optimum Dipath Partitions and Partial k-Colourings of Acyclic Digraphs. European Journal of Combinatorics. 7(2). 115–118. 8 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