Geir Agnarsson

Neil Epstein

Order, April, 2025

On locally finite ordered rooted trees and their rooted subtrees.

[BibT_eX]

[DOI]

Elie Alhajjar

Aleyah Dawkins

Discret. Appl. Math., 2025

2020

On Monomial Ideals and Their Socles.

[BibT_eX]

[DOI]

Neil Epstein

Order, 2020

2017

On a Special Class of Hyper-Permutahedra.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

2016

The structure and topology of rooted weighted trees modeling layered cyber-security systems.

[BibT_eX]

[DOI]

CoRR, 2016

The Structure of Rooted Weighted Trees Modeling Layered Cyber-security Systems.

[BibT_eX]

[DOI]

Acta Cybern., 2016

On Cyber Attacks and the Maximum-Weight Rooted-Subtree Problem.

[BibT_eX]

[DOI]

Acta Cybern., 2016

2015

The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem.

[BibT_eX]

[DOI]

CoRR, 2015

2013

Induced subgraphs of hypercubes.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

On the number of hypercubic bipartitions of an integer.

[BibT_eX]

[DOI]

Discret. Math., 2013

2011

A Note on the Maximum Number of Edges of Nonflowerable Coin Graphs.

[BibT_eX]

[DOI]

Jill Bigley Dunham

SIAM J. Discret. Math., 2011

2010

Vertex coloring the square of outerplanar graphs of low degree.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2010

2009

SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs.

[BibT_eX]

[DOI]

Elena Losievskaja

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008

On multipartite posets.

[BibT_eX]

[DOI]

Discret. Math., 2008

Vertex coloring acyclic digraphs and their corresponding hypergraphs.

[BibT_eX]

[DOI]

Ágúst S. Egilsson

Discret. Appl. Math., 2008

The Complexity of the Evolution of Graph Labelings.

[BibT_eX]

[DOI]

Proceedings of the Ninth ACIS International Conference on Software Engineering, 2008

2007

Strongly simplicial vertices of powers of trees.

[BibT_eX]

[DOI]

Discret. Math., 2007

2006

On the extension of vertex maps to graph homomorphisms.

[BibT_eX]

[DOI]

Li Chen

Discret. Math., 2006

2004

Strong Colorings of Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

On colorings of squares of outerplanar graphs.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

Proper Down-Coloring Simple Acyclic Digraphs.

[BibT_eX]

[DOI]

Ágúst S. Egilsson

Proceedings of the Applications of Graph Transformations with Industrial Relevance, 2003

2002

Powers of Geometric Intersection Graphs and Dispersion Algorithms.

[BibT_eX]

[DOI]

Peter Damaschke

Proceedings of the Algorithm Theory, 2002

2001

Coloring <i>t</i>-dimensional <i>m</i>-Boxes.

[BibT_eX]

[DOI]

Benjamin Doerr

Tomasz Schoen

Discret. Math., 2001

2000

Coloring powers of planar graphs.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

The maximum number of edges in a graph of bounded dimension, with applications to ring theory.

[BibT_eX]

[DOI]