The maximum number of edges in a graph of bounded dimension, with applications to ring theory. - Geir Agnarsson; Stefan Felsner; William T. Trotter (Discret. Math., 1999)

Coloring t-dimensional m-Boxes. - Geir Agnarsson; Benjamin Doerr; Tomasz Schoen (Discret. Math., 2001)

Proper Down-Coloring Simple Acyclic Digraphs. - Geir Agnarsson; Ágúst S. Egilsson; Magnús M. Halldórsson (AGTIVE, 2003)

Powers of geometric intersection graphs and dispersion algorithms. - Geir Agnarsson; Peter Damaschke; Magnús M. Halldórsson (Discret. Appl. Math., 2003)

Coloring Powers of Planar Graphs. - Geir Agnarsson; Magnús M. Halldórsson (SIAM J. Discret. Math., 2003)

On colorings of squares of outerplanar graphs. - Geir Agnarsson; Magnús M. Halldórsson (SODA, 2004)

Strong Colorings of Hypergraphs. - Geir Agnarsson; Magnús M. Halldórsson (WAOA, 2004)

On the extension of vertex maps to graph homomorphisms. - Geir Agnarsson; Li Chen (Discret. Math., 2006)

Strongly simplicial vertices of powers of trees. - Geir Agnarsson; Magnús M. Halldórsson (Discret. Math., 2007)

The Complexity of the Evolution of Graph Labelings. - Geir Agnarsson; Raymond Greenlaw; Sanpawat Kantabutra (SNPD, 2008)

Vertex coloring acyclic digraphs and their corresponding hypergraphs. - Geir Agnarsson; Ágúst S. Egilsson; Magnús M. Halldórsson (Discret. Appl. Math., 2008)

On multipartite posets. - Geir Agnarsson (Discret. Math., 2008)

Vertex coloring the square of outerplanar graphs of low degree. - Geir Agnarsson; Magnús M. Halldórsson (Discuss. Math. Graph Theory, 2010)

A Note on the Maximum Number of Edges of Nonflowerable Coin Graphs. - Geir Agnarsson; Jill Bigley Dunham (SIAM J. Discret. Math., 2011)

On the number of hypercubic bipartitions of an integer. - Geir Agnarsson (Discret. Math., 2013)

Induced subgraphs of hypercubes. - Geir Agnarsson (Eur. J. Comb., 2013)

SDP-based algorithms for maximum independent set problems on hypergraphs. - Geir Agnarsson; Magnús M. Halldórsson; Elena Losievskaja (Theor. Comput. Sci., 2013)

The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem. - Geir Agnarsson; Raymond Greenlaw; Sanpawat Kantabutra (CoRR, 2015)

On Cyber Attacks and the Maximum-Weight Rooted-Subtree Problem. - Geir Agnarsson; Raymond Greenlaw; Sanpawat Kantabutra (Acta Cybern., 2016)

The Structure of Rooted Weighted Trees Modeling Layered Cyber-security Systems. - Geir Agnarsson; Raymond Greenlaw; Sanpawat Kantabutra (Acta Cybern., 2016)

The structure and topology of rooted weighted trees modeling layered cyber-security systems. - Geir Agnarsson; Raymond Greenlaw; Sanpawat Kantabutra (CoRR, 2016)

On a Special Class of Hyper-Permutahedra. - Geir Agnarsson (Electron. J. Comb., 2017)

On Monomial Ideals and Their Socles. - Geir Agnarsson; Neil Epstein (Order, 2020)

On locally finite ordered rooted trees and their rooted subtrees. - Geir Agnarsson; Elie Alhajjar; Aleyah Dawkins (Discret. Appl. Math., 2025)

On Posets, Monomial Ideals, Gorenstein Ideals and their Combinatorics. - Geir Agnarsson; Neil Epstein (Order, 2025)