Geir Agnarsson
Geir Agnarsson
Associate Professor, George Mason University
Email verificata su - Home page
TitoloCitata daAnno
Graph theory: Modeling, applications, and algorithms
G Agnarsson, R Greenlaw
Pearson/Prentice Hall, 2007
Coloring powers of planar graphs
G Agnarsson, MM Halldórsson
SIAM Journal on Discrete Mathematics 16 (4), 651-662, 2003
On powers of chordal graphs and their colorings
G Agnarsson, R Greenlaw, MM Halldórsson
Congressus Numerantium, 41-66, 2000
Strong colorings of hypergraphs
G Agnarsson, MM Halldórsson
International Workshop on Approximation and Online Algorithms, 253-266, 2004
On colorings of squares of outerplanar graphs
G Agnarsson, MM Halldórsson
Proceedings of the fifteenth annual ACM-SIAM Symposium on Discrete …, 2004
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
Recognition of matrix rings II
G Agnarsson, SA Amitsur, JC Robson
Israel Journal of Mathematics 96 (1), 1-13, 1996
Powers of geometric intersection graphs and dispersion algorithms
G Agnarsson, P Damaschke, MM Halldórsson
Discrete Applied Mathematics 132 (1-3), 3-16, 2003
On the Sylvester denumerants for general restricted partitions
G Agnarsson
Congressus numerantium, 49-60, 2002
The number of outside corners of monomial ideals
G Agnarsson
Journal of Pure and Applied Algebra 117, 3-21, 1997
On Minkowski sums of simplices
G Agnarsson, WD Morris
Annals of Combinatorics 13 (3), 271, 2009
Extremal graphs of order dimension 4
G Agnarsson
Mathematica scandinavica, 5-12, 2002
The flag polynomial of the Minkowski sum of simplices
G Agnarsson
Annals of Combinatorics 17 (3), 401-426, 2013
On the extension of vertex maps to graph homomorphisms
G Agnarsson, L Chen
Discrete mathematics 306 (17), 2021-2030, 2006
On vertex coloring simple genetic digraphs
G Agnarsson, AS Egilsson
Congressus Numerantium, 117-128, 2003
Powers of chordal graphs and their coloring, to appear in Congr
G Agnarsson, R Greenlaw, MM Halldórsson
Numer, 0
On the expected number of level-i-nodes in a random labeled tree
G Agnarsson, N Deo, P Micikevicis
Bulletin of the ICA 41, 51-60, 2004
On cyber attacks and the maximum-weight rooted-subtree problem
G Agnarsson, R Greenlaw, S Kantabutra
Acta Cybernetica 22 (3), 591-612, 2016
Induced subgraphs of hypercubes
G Agnarsson
European Journal of Combinatorics 34 (2), 155-168, 2013
The Complexity of the Evolution of Graph Labelings
G Agnarsson, R Greenlaw, S Kantabutra
2008 Ninth ACIS International Conference on Software Engineering, Artificial …, 2008
Il sistema al momento non puņ eseguire l'operazione. Riprova pił tardi.
Articoli 1–20