Geir Agnarsson

507 total citations
27 papers, 246 citations indexed

About

Geir Agnarsson is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Geir Agnarsson has authored 27 papers receiving a total of 246 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Computational Theory and Mathematics, 12 papers in Discrete Mathematics and Combinatorics and 6 papers in Geometry and Topology. Recurrent topics in Geir Agnarsson's work include Advanced Graph Theory Research (14 papers), Graph Labeling and Dimension Problems (11 papers) and Advanced Combinatorial Mathematics (6 papers). Geir Agnarsson is often cited by papers focused on Advanced Graph Theory Research (14 papers), Graph Labeling and Dimension Problems (11 papers) and Advanced Combinatorial Mathematics (6 papers). Geir Agnarsson collaborates with scholars based in United States, Iceland and Thailand. Geir Agnarsson's co-authors include Magnús M. Halldórsson, Raymond Greenlaw, J. C. Robson, S. A. Amitsur, Li Chen, Walter D. Morris, Peter Damaschke, Stefan Felsner, William T. Trotter and Tomasz Schoen and has published in prestigious journals such as Theoretical Computer Science, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Geir Agnarsson

26 papers receiving 212 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Geir Agnarsson United States	7	154	73	56	46	30	27	246
Dion Gijswijt Netherlands	9	107 0.7×	85 1.2×	68 1.2×	50 1.1×	40 1.3×	22	268
J. Richard Lundgren United States	11	233 1.5×	70 1.0×	58 1.0×	77 1.7×	79 2.6×	39	312
Luděk Kučera Czechia	8	177 1.1×	37 0.5×	29 0.5×	75 1.6×	29 1.0×	35	303
Jonathan F. Buss Canada	8	215 1.4×	48 0.7×	33 0.6×	98 2.1×	16 0.5×	20	314
Eyal Ackerman Israel	9	89 0.6×	48 0.7×	30 0.5×	27 0.6×	25 0.8×	26	229
Stephen G. Hartke United States	9	153 1.0×	73 1.0×	40 0.7×	29 0.6×	46 1.5×	41	222
Saul Stahl United States	10	218 1.4×	164 2.2×	64 1.1×	23 0.5×	102 3.4×	22	342
Attila Sali Hungary	9	82 0.5×	129 1.8×	104 1.9×	38 0.8×	39 1.3×	47	238
Zevi Miller United States	9	184 1.2×	71 1.0×	67 1.2×	63 1.4×	89 3.0×	29	261
Phyllis Zweig Chinn United States	4	227 1.5×	35 0.5×	59 1.1×	91 2.0×	58 1.9×	11	286

Countries citing papers authored by Geir Agnarsson

Since Specialization

Citations

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

Fields of papers citing papers by Geir Agnarsson

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Geir Agnarsson

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

Agnarsson, Geir. (2017). On a Special Class of Hyper-Permutahedra. The Electronic Journal of Combinatorics. 24(3). 3 indexed citations

Agnarsson, Geir, et al.. (2016). The Structure of Rooted Weighted Trees Modeling Layered Cyber-security Systems. Acta Cybernetica. 22(4). 735–769. 2 indexed citations

Agnarsson, Geir, et al.. (2016). On Cyber Attacks and the Maximum-Weight Rooted-Subtree Problem. Acta Cybernetica. 22(3). 591–612. 4 indexed citations

Agnarsson, Geir, et al.. (2012). On the Graph Relabeling Problem. Thai Journal of Mathematics. 8(1). 21–42. 1 indexed citations

Agnarsson, Geir. (2012). Induced subgraphs of hypercubes. European Journal of Combinatorics. 34(2). 155–168. 2 indexed citations

Agnarsson, Geir, et al.. (2012). SDP-based algorithms for maximum independent set problems on hypergraphs. Theoretical Computer Science. 470. 1–9. 3 indexed citations

Agnarsson, Geir & Walter D. Morris. (2009). On Minkowski Sums of Simplices. Annals of Combinatorics. 13(3). 271–287. 4 indexed citations

Agnarsson, Geir, et al.. (2008). Vertex coloring acyclic digraphs and their corresponding hypergraphs. Discrete Applied Mathematics. 156(10). 1918–1928. 1 indexed citations

Agnarsson, Geir, et al.. (2008). The graph relabeling problem and its variants. 42. 49–52. 3 indexed citations

10.

Agnarsson, Geir & Raymond Greenlaw. (2006). Graph Theory: Modeling, Applications, and Algorithms. Prentice-Hall, Inc eBooks. 71 indexed citations

11.

Agnarsson, Geir & Li Chen. (2006). On the extension of vertex maps to graph homomorphisms. Discrete Mathematics. 306(17). 2021–2030. 6 indexed citations

12.

Agnarsson, Geir. (2006). Graph theory. 9 indexed citations

13.

Agnarsson, Geir & Magnús M. Halldórsson. (2004). On colorings of squares of outerplanar graphs. Symposium on Discrete Algorithms. 244–253. 10 indexed citations

14.

Agnarsson, Geir. (2003). On chordal graphs and their chromatic polynomials. MATHEMATICA SCANDINAVICA. 93(2). 240–240. 2 indexed citations

15.

Agnarsson, Geir & Magnús M. Halldórsson. (2003). Coloring Powers of Planar Graphs. SIAM Journal on Discrete Mathematics. 16(4). 651–662. 71 indexed citations

16.

Agnarsson, Geir, Benjamin Doerr, & Tomasz Schoen. (2001). Coloring t-dimensional m-Boxes. Discrete Mathematics. 226(1-3). 21–33. 2 indexed citations

17.

Agnarsson, Geir & Magnús M. Halldórsson. (2000). Coloring powers of planar graphs. Symposium on Discrete Algorithms. 654–662. 10 indexed citations

18.

Agnarsson, Geir, Stefan Felsner, & William T. Trotter. (1999). The maximum number of edges in a graph of bounded dimension, with applications to ring theory. Discrete Mathematics. 201(1-3). 5–19. 7 indexed citations

19.

Agnarsson, Geir. (1997). The number of outside corners of monomial ideals. Journal of Pure and Applied Algebra. 117-118. 3–21. 5 indexed citations

20.

Agnarsson, Geir, S. A. Amitsur, & J. C. Robson. (1996). Recognition of matrix rings II. Israel Journal of Mathematics. 96(1). 1–13. 14 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