Geir Agnarsson - Citegraph

Author Info

Name	Affiliation	Papers
GEIR AGNARSSON	Department of Mathematical Sciences, George Mason University, MS 3F2, 4400 University Drive, Fairfax, VA - 22030, USA	22
Collaborators	Citations	PageRank
12	103	14.69
Referers	Referees	References
188	206	158

Search Limit

100206

Publications (22 rows)

Collaborators (12 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
On a Special Class of Hyper-Permutahedra.	0	0.34	2017
On Cyber Attacks and the Maximum-Weight Rooted-Subtree Problem.	0	0.34	2016
The Structure of Rooted Weighted Trees Modeling Layered Cyber-security Systems.	0	0.34	2016
The structure and topology of rooted weighted trees modeling layered cyber-security systems.	0	0.34	2016
The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem	1	0.39	2015
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs	1	0.35	2013
On the number of hypercubic bipartitions of an integer.	1	0.41	2013
Induced subgraphs of hypercubes	0	0.34	2013
A Note on the Maximum Number of Edges of Nonflowerable Coin Graphs	0	0.34	2011
Vertex coloring the square of outerplanar graphs of low degree.	1	0.35	2010
On multipartite posets	0	0.34	2008
The Complexity of the Evolution of Graph Labelings	1	0.39	2008
Vertex coloring acyclic digraphs and their corresponding hypergraphs	0	0.34	2008
Strongly simplicial vertices of powers of trees	0	0.34	2007
On the extension of vertex maps to graph homomorphisms	3	0.45	2006
On colorings of squares of outerplanar graphs	11	0.63	2004
Strong colorings of hypergraphs	5	0.53	2004
Coloring Powers of Planar Graphs	63	5.37	2003
Powers of geometric intersection graphs and dispersion algorithms	6	0.51	2003
Proper Down-Coloring Simple Acyclic Digraphs	2	0.40	2003
Coloring t-dimensional m-boxes	2	1.25	2001
The maximum number of edges in a graph of bounded dimension, with applications to ring theory	6	0.62	1999