default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeir Agnarsson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j18]Geir Agnarsson, Elie Alhajjar, Aleyah Dawkins
:
On locally finite ordered rooted trees and their rooted subtrees. Discret. Appl. Math. 360: 1-21 (2025)- 2020
- [j17]Geir Agnarsson, Neil Epstein:
On Monomial Ideals and Their Socles. Order 37(2): 341-369 (2020)
2010 – 2019
- 2017
- [j16]Geir Agnarsson:
On a Special Class of Hyper-Permutahedra. Electron. J. Comb. 24(3): 3 (2017) - 2016
- [j15]Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra:
On Cyber Attacks and the Maximum-Weight Rooted-Subtree Problem. Acta Cybern. 22(3): 591-612 (2016) - [j14]Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra:
The Structure of Rooted Weighted Trees Modeling Layered Cyber-security Systems. Acta Cybern. 22(4): 735-769 (2016) - [i2]Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra:
The structure and topology of rooted weighted trees modeling layered cyber-security systems. CoRR abs/1605.03569 (2016) - 2015
- [i1]Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra:
The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem. CoRR abs/1508.03657 (2015) - 2013
- [j13]Geir Agnarsson:
On the number of hypercubic bipartitions of an integer. Discret. Math. 313(24): 2857-2864 (2013) - [j12]Geir Agnarsson:
Induced subgraphs of hypercubes. Eur. J. Comb. 34(2): 155-168 (2013) - [j11]Geir Agnarsson, Magnús M. Halldórsson, Elena Losievskaja:
SDP-based algorithms for maximum independent set problems on hypergraphs. Theor. Comput. Sci. 470: 1-9 (2013) - 2011
- [j10]Geir Agnarsson, Jill Bigley Dunham:
A Note on the Maximum Number of Edges of Nonflowerable Coin Graphs. SIAM J. Discret. Math. 25(4): 1714-1721 (2011) - 2010
- [j9]Geir Agnarsson, Magnús M. Halldórsson:
Vertex coloring the square of outerplanar graphs of low degree. Discuss. Math. Graph Theory 30(4): 619-636 (2010)
2000 – 2009
- 2009
- [c7]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
- [j8]Geir Agnarsson, Ágúst S. Egilsson, Magnús M. Halldórsson:
Vertex coloring acyclic digraphs and their corresponding hypergraphs. Discret. Appl. Math. 156(10): 1918-1928 (2008) - [j7]Geir Agnarsson:
On multipartite posets. Discret. Math. 308(22): 5284-5288 (2008) - [c6]Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra:
The Complexity of the Evolution of Graph Labelings. SNPD 2008: 79-84 - 2007
- [j6]Geir Agnarsson, Magnús M. Halldórsson:
Strongly simplicial vertices of powers of trees. Discret. Math. 307(21): 2647-2652 (2007) - 2006
- [j5]Geir Agnarsson, Li Chen:
On the extension of vertex maps to graph homomorphisms. Discret. Math. 306(17): 2021-2030 (2006) - 2004
- [c5]Geir Agnarsson, Magnús M. Halldórsson:
On colorings of squares of outerplanar graphs. SODA 2004: 244-253 - [c4]Geir Agnarsson, Magnús M. Halldórsson:
Strong Colorings of Hypergraphs. WAOA 2004: 253-266 - 2003
- [j4]Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson:
Powers of geometric intersection graphs and dispersion algorithms. Discret. Appl. Math. 132(1-3): 3-16 (2003) - [j3]Geir Agnarsson, Magnús M. Halldórsson:
Coloring Powers of Planar Graphs. SIAM J. Discret. Math. 16(4): 651-662 (2003) - [c3]Geir Agnarsson, Ágúst S. Egilsson, Magnús M. Halldórsson:
Proper Down-Coloring Simple Acyclic Digraphs. AGTIVE 2003: 299-312 - 2002
- [c2]Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson:
Powers of Geometric Intersection Graphs and Dispersion Algorithms. SWAT 2002: 140-149 - 2001
- [j2]Geir Agnarsson, Benjamin Doerr, Tomasz Schoen:
Coloring t-dimensional m-Boxes. Discret. Math. 226(1-3): 21-33 (2001) - 2000
- [c1]Geir Agnarsson, Magnús M. Halldórsson:
Coloring powers of planar graphs. SODA 2000: 654-662
1990 – 1999
- 1999
- [j1]Geir Agnarsson, Stefan Felsner, William T. Trotter:
The maximum number of edges in a graph of bounded dimension, with applications to ring theory. Discret. Math. 201(1-3): 5-19 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
