Geir Agnarsson

From MaRDI portal
Person:368450

Available identifiers

zbMath Open agnarsson.geirMaRDI QIDQ368450

List of research outcomes





PublicationDate of PublicationType
On locally finite ordered rooted trees and their rooted subtrees2024-12-04Paper
Power-closed ideals of polynomial and Laurent polynomial rings2024-09-03Paper
On locally finite ordered rooted trees and their rooted subtrees2023-12-18Paper
Power-closed ideals of polynomial and Laurent polynomial rings2023-06-07Paper
On posets, monomial ideals, Gorenstein ideals and their combinatorics2023-02-20Paper
On monomial ideals and their socles2020-07-17Paper
On a special presentation of matrix algebras2020-01-09Paper
On a special class of hyper-permutahedra2017-09-08Paper
The Structure of Rooted Weighted Trees Modeling Layered Cyber-security Systems2017-03-31Paper
On cyber attacks and the maximum-weight rooted-subtree problem2016-09-09Paper
The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem2015-08-12Paper
On Colorings of Squares of Outerplanar Graphs2015-08-03Paper
On rational radii coin representations of the wheel graph2014-08-12Paper
On the number of hypercubic bipartitions of an integer2014-01-27Paper
The flag polynomial of the Minkowski sum of simplices2013-09-23Paper
Extremal subgraphs of the $d$-dimensional grid graph2013-02-26Paper
SDP-based algorithms for maximum independent set problems on hypergraphs2013-02-19Paper
Induced subgraphs of hypercubes2012-12-03Paper
A Note on the Maximum Number of Edges of Nonflowerable Coin Graphs2012-03-15Paper
On Minkowski sums of simplices2012-01-24Paper
Vertex coloring the square of outerplanar graphs of low degree2011-05-09Paper
https://portal.mardi4nfdi.de/entity/Q29966152011-05-03Paper
https://portal.mardi4nfdi.de/entity/Q36448542009-11-13Paper
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs2009-07-14Paper
On multipartite posets2009-01-27Paper
The Complexity of the Evolution of Graph Labelings2008-09-12Paper
Vertex coloring acyclic digraphs and their corresponding hypergraphs2008-09-10Paper
Strongly simplicial vertices of powers of trees2007-10-25Paper
On the extension of vertex maps to graph homomorphisms2006-09-14Paper
Approximation and Online Algorithms2005-12-14Paper
https://portal.mardi4nfdi.de/entity/Q48261402004-11-11Paper
https://portal.mardi4nfdi.de/entity/Q30464862004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q44703602004-06-22Paper
On chordal graphs and their chromatic polynomials2004-03-28Paper
Coloring Powers of Planar Graphs2004-01-08Paper
Powers of geometric intersection graphs and dispersion algorithms2003-12-04Paper
https://portal.mardi4nfdi.de/entity/Q44057812003-10-16Paper
Extremal graphs of order dimension 42003-08-06Paper
https://portal.mardi4nfdi.de/entity/Q43290532002-10-24Paper
Co-generators for algebras over fields and commutative applications2002-07-09Paper
On powers of chordal graphs and their colorings2002-01-08Paper
https://portal.mardi4nfdi.de/entity/Q49526822001-08-02Paper
Coloring \(t\)-dimensional \(m\)-boxes2001-06-04Paper
https://portal.mardi4nfdi.de/entity/Q47618562001-02-21Paper
The maximum number of edges in a graph of bounded dimension, with applications to ring theory2000-05-18Paper
The number of outside corners of monomial ideals1998-09-20Paper
On a class of presentations of matrix algebras1998-08-25Paper
Recognition of matrix rings. II1998-01-05Paper

Research outcomes over time

This page was built for person: Geir Agnarsson