Geir Agnarsson

Publication Activity (10 Years)

Years Active: 1999-2020
Publications (10 Years): 5

Top Topics

Bipartite Graph

Security Systems

Top Venues

Electron. J. Comb.

Publications

Geir Agnarsson, Neil Epstein
On Monomial Ideals and Their Socles. Order 37 (2) (2020)
Geir Agnarsson
On a Special Class of Hyper-Permutahedra. Electron. J. Comb. 24 (3) (2017)
Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra
The Structure of Rooted Weighted Trees Modeling Layered Cyber-security Systems. Acta Cybern. 22 (4) (2016)
Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra
The structure and topology of rooted weighted trees modeling layered cyber-security systems. CoRR (2016)
Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra
On Cyber Attacks and the Maximum-Weight Rooted-Subtree Problem. Acta Cybern. 22 (3) (2016)
Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra
The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem. CoRR (2015)
Geir Agnarsson
Induced subgraphs of hypercubes. Eur. J. Comb. 34 (2) (2013)
Geir Agnarsson, Magnús M. Halldórsson, Elena Losievskaja
SDP-based algorithms for maximum independent set problems on hypergraphs. Theor. Comput. Sci. 470 (2013)
Geir Agnarsson
On the number of hypercubic bipartitions of an integer. Discret. Math. 313 (24) (2013)
Geir Agnarsson, Jill Bigley Dunham
A Note on the Maximum Number of Edges of Nonflowerable Coin Graphs. SIAM J. Discret. Math. 25 (4) (2011)
Geir Agnarsson, Magnús M. Halldórsson
Vertex coloring the square of outerplanar graphs of low degree. Discuss. Math. Graph Theory 30 (4) (2010)
Geir Agnarsson, Magnús M. Halldórsson, Elena Losievskaja
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs. ICALP (1) (2009)
Geir Agnarsson
On multipartite posets. Discret. Math. 308 (22) (2008)
Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra
The Complexity of the Evolution of Graph Labelings. SNPD (2008)
Geir Agnarsson, Ágúst S. Egilsson, Magnús M. Halldórsson
Vertex coloring acyclic digraphs and their corresponding hypergraphs. Discret. Appl. Math. 156 (10) (2008)
Geir Agnarsson, Magnús M. Halldórsson
Strongly simplicial vertices of powers of trees. Discret. Math. 307 (21) (2007)
Geir Agnarsson, Li Chen
On the extension of vertex maps to graph homomorphisms. Discret. Math. 306 (17) (2006)
Geir Agnarsson, Magnús M. Halldórsson
Strong Colorings of Hypergraphs. WAOA (2004)
Geir Agnarsson, Magnús M. Halldórsson
On colorings of squares of outerplanar graphs. SODA (2004)
Geir Agnarsson, Magnús M. Halldórsson
Coloring Powers of Planar Graphs. SIAM J. Discret. Math. 16 (4) (2003)
Geir Agnarsson, Ágúst S. Egilsson, Magnús M. Halldórsson
Proper Down-Coloring Simple Acyclic Digraphs. AGTIVE (2003)
Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson
Powers of geometric intersection graphs and dispersion algorithms. Discret. Appl. Math. 132 (1-3) (2003)
Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson
Powers of Geometric Intersection Graphs and Dispersion Algorithms. SWAT (2002)
Geir Agnarsson, Benjamin Doerr, Tomasz Schoen
-Boxes. Discret. Math. 226 (1-3) (2001)
Geir Agnarsson, Magnús M. Halldórsson
Coloring powers of planar graphs. SODA (2000)
Geir Agnarsson, Stefan Felsner, William T. Trotter
The maximum number of edges in a graph of bounded dimension, with applications to ring theory. Discret. Math. 201 (1-3) (1999)