Solving thousand-digit Frobenius problems using Gröbner bases. - Bjarke Hammersholt Roune (J. Symb. Comput., 2008)

A slice algorithm for koszul simplicial complexes on the lcm lattice of monomial ideals. - Bjarke Hammersholt Roune (ACM Commun. Comput. Algebra, 2009)

The Slice Algorithm for irreducible decomposition of monomial ideals. - Bjarke Hammersholt Roune (J. Symb. Comput., 2009)

A Slice algorithm for corners and Hilbert-Poincaré series of monomial ideals. - Bjarke Hammersholt Roune (ISSAC, 2010)

Practical Gröbner basis computation. - Bjarke Hammersholt Roune; Michael Eugene Stillman (ISSAC, 2012)

Practical Groebner Basis Computation. - Bjarke Hammersholt Roune; Michael Eugene Stillman (CoRR, 2012)

Signature rewriting in gröbner basis computation. - Christian Eder; Bjarke Hammersholt Roune (ISSAC, 2013)

Complexity and algorithms for Euler characteristic of simplicial complexes. - Bjarke Hammersholt Roune; Eduardo Sáenz-de-Cabezón (J. Symb. Comput., 2013)

The Parametric Frobenius Problem. - Bjarke Hammersholt Roune; Kevin Woods (Electron. J. Comb., 2015)

Connect Four and Graph Decomposition. - Laurent Evain; Mathias Lederer; Bjarke Hammersholt Roune (Comput. Complex., 2016)