 | 2009 |
|---|
| 15 |       | Geir Agnarsson,
Magnús M. Halldórsson,
Elena Losievskaja:
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs.
ICALP (1) 2009: 12-23 |
| 2008 |
|---|
| 14 | | Geir Agnarsson,
Raymond Greenlaw,
Sanpawat Kantabutra:
The Complexity of the Evolution of Graph Labelings.
SNPD 2008: 79-84 |
| 13 | | Geir Agnarsson,
Ágúst S. Egilsson,
Magnús M. Halldórsson:
Vertex coloring acyclic digraphs and their corresponding hypergraphs.
Discrete Applied Mathematics 156(10): 1918-1928 (2008) |
| 12 | | Geir Agnarsson:
On multipartite posets.
Discrete Mathematics 308(22): 5284-5288 (2008) |
| 2007 |
|---|
| 11 | | Geir Agnarsson,
Magnús M. Halldórsson:
Strongly simplicial vertices of powers of trees.
Discrete Mathematics 307(21): 2647-2652 (2007) |
| 2006 |
|---|
| 10 | | Geir Agnarsson,
Li Chen:
On the extension of vertex maps to graph homomorphisms.
Discrete Mathematics 306(17): 2021-2030 (2006) |
| 2004 |
|---|
| 9 | | Geir Agnarsson,
Magnús M. Halldórsson:
On colorings of squares of outerplanar graphs.
SODA 2004: 244-253 |
| 8 | | Geir Agnarsson,
Magnús M. Halldórsson:
Strong Colorings of Hypergraphs.
WAOA 2004: 253-266 |
| 2003 |
|---|
| 7 | | Geir Agnarsson,
Ágúst S. Egilsson,
Magnús M. Halldórsson:
Proper Down-Coloring Simple Acyclic Digraphs.
AGTIVE 2003: 299-312 |
| 6 | | Geir Agnarsson,
Peter Damaschke,
Magnús M. Halldórsson:
Powers of geometric intersection graphs and dispersion algorithms.
Discrete Applied Mathematics 132(1-3): 3-16 (2003) |
| 5 | | Geir Agnarsson,
Magnús M. Halldórsson:
Coloring Powers of Planar Graphs.
SIAM J. Discrete Math. 16(4): 651-662 (2003) |
| 2002 |
|---|
| 4 | | Geir Agnarsson,
Peter Damaschke,
Magnús M. Halldórsson:
Powers of Geometric Intersection Graphs and Dispersion Algorithms.
SWAT 2002: 140-149 |
| 2001 |
|---|
| 3 | | Geir Agnarsson,
Benjamin Doerr,
Tomasz Schoen:
Coloring t-dimensional m-Boxes.
Discrete Mathematics 226(1-3): 21-33 (2001) |
| 2000 |
|---|
| 2 | | Geir Agnarsson,
Magnús M. Halldórsson:
Coloring powers of planar graphs.
SODA 2000: 654-662 |
| 1999 |
|---|
| 1 | | Geir Agnarsson,
Stefan Felsner,
William T. Trotter:
The maximum number of edges in a graph of bounded dimension, with applications to ring theory.
Discrete Mathematics 201(1-3): 5-19 (1999) |
