Graph theory: Modeling, applications, and algorithms G Agnarsson, R Greenlaw Prentice-Hall, Inc., 2006 | 233 | 2006 |

Coloring powers of planar graphs G Agnarsson, MM Halldórsson SIAM Journal on Discrete Mathematics 16 (4), 651-662, 2003 | 185 | 2003 |

On powers of chordal graphs and their colorings G Agnarsson, R Greenlaw, MM Halldórsson Congressus Numerantium, 41-66, 2000 | 71 | 2000 |

Strong colorings of hypergraphs G Agnarsson, MM Halldórsson International Workshop on Approximation and Online Algorithms, 253-266, 2004 | 33 | 2004 |

On colorings of squares of outerplanar graphs G Agnarsson, MM Halldorsson arXiv preprint arXiv:0706.1526, 2007 | 25 | 2007 |

The maximum number of edges in a graph of bounded dimension, with applications to ring theory G Agnarsson, S Felsner, WT Trotter Discrete mathematics 201 (1-3), 5-19, 1999 | 22 | 1999 |

Powers of geometric intersection graphs and dispersion algorithms G Agnarsson, P Damaschke, MM Halldórsson Discrete Applied Mathematics 132 (1-3), 3-16, 2003 | 19 | 2003 |

On the Sylvester denumerants for general restricted partitions G Agnarsson Congressus numerantium, 49-60, 2002 | 18 | 2002 |

Recognition of matrix rings II G Agnarsson, SA Amitsur, JC Robson Israel Journal of Mathematics 96 (1), 1-13, 1996 | 18 | 1996 |

The number of outside corners of monomial ideals G Agnarsson Journal of Pure and Applied Algebra 117, 3-21, 1997 | 14 | 1997 |

On Minkowski sums of simplices G Agnarsson, WD Morris Annals of Combinatorics 13 (3), 271, 2009 | 12 | 2009 |

Extremal graphs of order dimension 4 G Agnarsson Mathematica scandinavica, 5-12, 2002 | 8 | 2002 |

The flag polynomial of the Minkowski sum of simplices G Agnarsson Annals of Combinatorics 17 (3), 401-426, 2013 | 7 | 2013 |

On vertex coloring simple genetic digraphs G Agnarsson, AS Egilsson Congressus Numerantium, 117-128, 2003 | 7 | 2003 |

On the extension of vertex maps to graph homomorphisms G Agnarsson, L Chen Discrete mathematics 306 (17), 2021-2030, 2006 | 6 | 2006 |

Powers of chordal graphs and their coloring, to appear in Congr G Agnarsson, R Greenlaw, MM Halldórsson Numer, 0 | 6 | |

On cyber attacks and the maximum-weight rooted-subtree problem G Agnarsson, R Greenlaw, S Kantabutra Acta Cybernetica 22 (3), 591-612, 2016 | 5 | 2016 |

On chordal graphs and their chromatic polynomials G Agnarsson Mathematica Scandinavica, 240-246, 2003 | 5 | 2003 |

The graph relabeling problem and its variants G Agnarsson, R Greenlaw, S Kantabutra 2008 5th International Conference on Electrical Engineering/Electronics …, 2008 | 4 | 2008 |

On the expected number of level-i-nodes in a random labeled tree G Agnarsson, N Deo, P Micikevicius Bulletin of ICA 41, 51-60, 2004 | 4 | 2004 |