Geir Agnarsson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 26 from 26

2025

On Posets, Monomial Ideals, Gorenstein Ideals and their CombinatoricsGeir Agnarsson, Neil Epstein. order, 42(1):59-85, April 2025. [doi]

On locally finite ordered rooted trees and their rooted subtreesGeir Agnarsson, Elie Alhajjar, Aleyah Dawkins. DAM, 360:1-21, 2025. [doi]

2020

On Monomial Ideals and Their SoclesGeir Agnarsson, Neil Epstein. order, 37(2):341-369, 2020. [doi]

2017

On a Special Class of Hyper-PermutahedraGeir Agnarsson. combinatorics, 24(3):3, 2017. [doi]

2016

On Cyber Attacks and the Maximum-Weight Rooted-Subtree ProblemGeir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra. actaC, 22(3):591-612, 2016. [doi]

The Structure of Rooted Weighted Trees Modeling Layered Cyber-security SystemsGeir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra. actaC, 22(4):735-769, 2016. [doi]

2013

On the number of hypercubic bipartitions of an integerGeir Agnarsson. DM, 313(24):2857-2864, 2013. [doi]

Induced subgraphs of hypercubesGeir Agnarsson. ejc, 34(2):155-168, 2013. [doi]

SDP-based algorithms for maximum independent set problems on hypergraphsGeir Agnarsson, Magnús M. Halldórsson, Elena Losievskaja. TCS, 470:1-9, 2013. [doi]

2011

A Note on the Maximum Number of Edges of Nonflowerable Coin GraphsGeir Agnarsson, Jill Bigley Dunham. siamdm, 25(4):1714-1721, 2011. [doi]

2010

Vertex coloring the square of outerplanar graphs of low degreeGeir Agnarsson, Magnús M. Halldórsson. dmgt, 30(4):619-636, 2010. [doi]

2009

SDP-Based Algorithms for Maximum Independent Set Problems on HypergraphsGeir Agnarsson, MagnÃºs M. HalldÃ³rsson, Elena Losievskaja. icalp 2009: 12-23 [doi]

2008

The Complexity of the Evolution of Graph LabelingsGeir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra. snpd 2008: 79-84 [doi]

On multipartite posetsGeir Agnarsson. DM, 308(22):5284-5288, 2008. [doi]

Vertex coloring acyclic digraphs and their corresponding hypergraphsGeir Agnarsson, Ágúst S. Egilsson, Magnús M. Halldórsson. DAM, 156(10):1918-1928, 2008. [doi]

2007

Strongly simplicial vertices of powers of treesGeir Agnarsson, Magnús M. Halldórsson. DM, 307(21):2647-2652, 2007. [doi]

2006

On the extension of vertex maps to graph homomorphismsGeir Agnarsson, Li Chen. DM, 306(17):2021-2030, 2006. [doi]

2004

On colorings of squares of outerplanar graphsGeir Agnarsson, Magnús M. Halldórsson. soda 2004: 244-253 [doi]

Strong Colorings of HypergraphsGeir Agnarsson, Magnús M. Halldórsson. waoa 2005: 253-266 [doi]

2003

Proper Down-Coloring Simple Acyclic DigraphsGeir Agnarsson, Ágúst S. Egilsson, Magnús M. Halldórsson. agtive 2004: 299-312 [doi]

Powers of geometric intersection graphs and dispersion algorithmsGeir Agnarsson, Peter Damaschke, Magnús M. Halldórsson. DAM, 132(1-3):3-16, 2003. [doi]

Coloring Powers of Planar GraphsGeir Agnarsson, Magnús M. Halldórsson. siamdm, 16(4):651-662, 2003. [doi]

2002

Powers of Geometric Intersection Graphs and Dispersion AlgorithmsGeir Agnarsson, Peter Damaschke, Magnús M. Halldórsson. swat 2002: 140-149 [doi]

2001

Coloring ::::t::::-dimensional ::::m::::-BoxesGeir Agnarsson, Benjamin Doerr, Tomasz Schoen. DM, 226(1-3):21-33, 2001. [doi]

2000

Coloring powers of planar graphsGeir Agnarsson, Magnús M. Halldórsson. soda 2000: 654-662 [doi]

1999

The maximum number of edges in a graph of bounded dimension, with applications to ring theoryGeir Agnarsson, Stefan Felsner, William T. Trotter. DM, 201(1-3):5-19, 1999. [doi]

Sign in or sign up to see more results.

runs on WebDSL