The Game Chromatic Index of Forests of Maximum Degree 5. - Stephan Dominique Andres (Electron. Notes Discret. Math., 2003)

The Positive Lightness of Digraphs, Embeddable in a Surface, without 4-Cycles. - Stephan Dominique Andres (Electron. Notes Discret. Math., 2005)

The game chromatic index of forests of maximum degree Delta>=5. - Stephan Dominique Andres (Discret. Appl. Math., 2006)

Game-perfect Graphs with Clique Number 2. - Stephan Dominique Andres (Electron. Notes Discret. Math., 2006)

Directed defective asymmetric graph coloring games on forests. - Stephan Dominique Andres (CTW, 2007)

The incidence game chromatic number. - Stephan Dominique Andres (Discret. Appl. Math., 2009)

Lightness of digraphs in surfaces and directed game chromatic number. - Stephan Dominique Andres (Discret. Math., 2009)

Asymmetric directed graph coloring games. - Stephan Dominique Andres (Discret. Math., 2009)

Classification of All Associative Mono-n-ary Algebras with 2 Elements. - Stephan Dominique Andres (Int. J. Math. Math. Sci., 2009)

Game-perfect graphs. - Stephan Dominique Andres (Math. Methods Oper. Res., 2009)

The Classfication of B-perfect Graphs. - Stephan Dominique Andres (CTW, 2010)

Note on the number of rooted complete N-ary trees. - Stephan Dominique Andres (Ars Comb., 2010)

Directed defective asymmetric graph coloring games. - Stephan Dominique Andres (Discret. Appl. Math., 2010)

Erratum to: The incidence game chromatic number [Discrete Appl. Math. 157(9) (2009) 1980-1987] - Stephan Dominique Andres (Discret. Appl. Math., 2010)

The game chromatic index of wheels. - Stephan Dominique Andres; Winfried Hochstättler; Christiane Schallück (Discret. Appl. Math., 2011)

The game chromatic number and the game colouring number of classes of oriented cactuses. - Stephan Dominique Andres; Winfried Hochstättler (Inf. Process. Lett., 2011)

Some heuristics for the binary paint shop problem and their expected number of colour changes. - Stephan Dominique Andres; Winfried Hochstättler (J. Discrete Algorithms, 2011)

On characterizing game-perfect graphs by forbidden induced subgraphs. - Stephan Dominique Andres (Contributions Discret. Math., 2012)

Game-perfect digraphs. - Stephan Dominique Andres (Math. Methods Oper. Res., 2012)

Perfect digraphs and a strong perfect digraph theorem. - Stephan Dominique Andres; Winfried Hochstättler (CTW, 2013)

On a base exchange game on bispanning graphs. - Stephan Dominique Andres; Winfried Hochstättler; Markus Merkel (Discret. Appl. Math., 2014)

The game colouring number of powers of forests. - Stephan Dominique Andres; Winfried Hochstättler (Discret. Math. Theor. Comput. Sci., 2015)

Perfect digraphs. - Stephan Dominique Andres; Winfried Hochstättler (J. Graph Theory, 2015)

Note on the game colouring number of powers of graphs. - Stephan Dominique Andres; Andrea Theuser (Discuss. Math. Graph Theory, 2016)

Autoparatopism stabilized colouring games on rook's graphs. - Stephan Dominique Andres; Helena Bergold; Raúl M. Falcón (Electron. Notes Discret. Math., 2018)

Autotopism stabilized colouring games on rook's graphs. - Raúl M. Falcón; Stephan Dominique Andres (Discret. Appl. Math., 2019)

Characterising and recognising game-perfect graphs. - Stephan Dominique Andres; Edwin Lock (Discret. Math. Theor. Comput. Sci., 2019)

The orthogonal colouring game. - Stephan Dominique Andres; Melissa A. Huggan; Fionn Mc Inerney; Richard J. Nowakowski (Theor. Comput. Sci., 2019)

On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs. - Stephan Dominique Andres (AKCE Int. J. Graphs Comb., 2020)

A semi-strong perfect digraph theorem. - Stephan Dominique Andres; Helena Bergold; Winfried Hochstättler; Johanna Wiehe (AKCE Int. J. Graphs Comb., 2020)

Equality Perfect Graphs and Digraphs. - Stephan Dominique Andres (Contributions Discret. Math., 2020)

Corrigendum to "The orthogonal colouring game" [Theor. Comput. Sci. 795 (2019) 312-325]. - Stephan Dominique Andres; Melissa A. Huggan; Fionn Mc Inerney; Richard J. Nowakowski (Theor. Comput. Sci., 2020)

Greedy versus recursive greedy: Uncorrelated heuristics for the binary paint shop problem. - Stephan Dominique Andres (Discret. Appl. Math., 2021)

Strong and weak Perfect Digraph Theorems for perfect, α-perfect and strictly perfect digraphs. - Stephan Dominique Andres (Discuss. Math. Graph Theory, 2023)

The Complexity of Two Colouring Games. - Stephan Dominique Andres; François Dross; Melissa A. Huggan; Fionn Mc Inerney; Richard J. Nowakowski (Algorithmica, 2023)

Line game-perfect graphs. - Stephan Dominique Andres; Wai Lam Fong (Discret. Math. Theor. Comput. Sci., 2024)