Geir Agnarsson

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