Stephan Dominique Andres

37 papers C 3Journal 34
YearRankTypeTitle / Venue / Authors
2024 J jnl
Line game-perfect graphs.
Discret. Math. Theor. Comput. Sci.
Stephan Dominique Andres, Wai Lam Fong
2023 J jnl
Strong and weak Perfect Digraph Theorems for perfect, α-perfect and strictly perfect digraphs.
Discuss. Math. Graph Theory
Stephan Dominique Andres
2023 J jnl
The Complexity of Two Colouring Games.
Algorithmica
Stephan Dominique Andres, François Dross, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski
2021 J jnl
Greedy versus recursive greedy: Uncorrelated heuristics for the binary paint shop problem.
Discret. Appl. Math.
Stephan Dominique Andres
2020 J jnl
A semi-strong perfect digraph theorem.
AKCE Int. J. Graphs Comb.
Stephan Dominique Andres, Helena Bergold, Winfried Hochstättler, Johanna Wiehe
2020 J jnl
Corrigendum to "The orthogonal colouring game" [Theor. Comput. Sci. 795 (2019) 312-325].
Theor. Comput. Sci.
Stephan Dominique Andres, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski
2020 J jnl
Equality Perfect Graphs and Digraphs.
Contributions Discret. Math.
Stephan Dominique Andres
2020 J jnl
On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs.
AKCE Int. J. Graphs Comb.
Stephan Dominique Andres
2019 J jnl
Autotopism stabilized colouring games on rook's graphs.
Discret. Appl. Math.
Raúl M. Falcón, Stephan Dominique Andres
2019 J jnl
Characterising and recognising game-perfect graphs.
Discret. Math. Theor. Comput. Sci.
Stephan Dominique Andres, Edwin Lock
2019 J jnl
The orthogonal colouring game.
Theor. Comput. Sci.
Stephan Dominique Andres, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski
2018 J jnl
Autoparatopism stabilized colouring games on rook's graphs.
Electron. Notes Discret. Math.
Stephan Dominique Andres, Helena Bergold, Raúl M. Falcón
2016 J jnl
Note on the game colouring number of powers of graphs.
Discuss. Math. Graph Theory
Stephan Dominique Andres, Andrea Theuser
2015 J jnl
Perfect digraphs.
J. Graph Theory
Stephan Dominique Andres, Winfried Hochstättler
2015 J jnl
The game colouring number of powers of forests.
Discret. Math. Theor. Comput. Sci.
Stephan Dominique Andres, Winfried Hochstättler
2014 J jnl
On a base exchange game on bispanning graphs.
Discret. Appl. Math.
Stephan Dominique Andres, Winfried Hochstättler, Markus Merkel
2013 C conf
Perfect digraphs and a strong perfect digraph theorem.
CTW
Stephan Dominique Andres, Winfried Hochstättler
2012 J jnl
Game-perfect digraphs.
Math. Methods Oper. Res.
Stephan Dominique Andres
2012 J jnl
On characterizing game-perfect graphs by forbidden induced subgraphs.
Contributions Discret. Math.
Stephan Dominique Andres
2011 J jnl
Some heuristics for the binary paint shop problem and their expected number of colour changes.
J. Discrete Algorithms
Stephan Dominique Andres, Winfried Hochstättler
2011 J jnl
The game chromatic index of wheels.
Discret. Appl. Math.
Stephan Dominique Andres, Winfried Hochstättler, Christiane Schallück
2011 J jnl
The game chromatic number and the game colouring number of classes of oriented cactuses.
Inf. Process. Lett.
Stephan Dominique Andres, Winfried Hochstättler
2010 J jnl
Directed defective asymmetric graph coloring games.
Discret. Appl. Math.
Stephan Dominique Andres
2010 J jnl
Erratum to: The incidence game chromatic number [Discrete Appl. Math. 157(9) (2009) 1980-1987]
Discret. Appl. Math.
Stephan Dominique Andres
2010 J jnl
Note on the number of rooted complete N-ary trees.
Ars Comb.
Stephan Dominique Andres
2010 C conf
The Classfication of B-perfect Graphs.
CTW
Stephan Dominique Andres
2009 J jnl
Asymmetric directed graph coloring games.
Discret. Math.
Stephan Dominique Andres
2009 J jnl
Classification of All Associative Mono-
Int. J. Math. Math. Sci.
Stephan Dominique Andres
2009 J jnl
Game-perfect graphs.
Math. Methods Oper. Res.
Stephan Dominique Andres
2009 J jnl
Lightness of digraphs in surfaces and directed game chromatic number.
Discret. Math.
Stephan Dominique Andres
2009 J jnl
The incidence game chromatic number.
Discret. Appl. Math.
Stephan Dominique Andres
2007 C conf
Directed defective asymmetric graph coloring games on forests.
CTW
Stephan Dominique Andres
2006 J jnl
Game-perfect Graphs with Clique Number 2.
Electron. Notes Discret. Math.
Stephan Dominique Andres
2006 J jnl
The game chromatic index of forests of maximum degree Delta>=5.
Discret. Appl. Math.
Stephan Dominique Andres
2006 J jnl
The incidence game chromatic number.
Electron. Notes Discret. Math.
Stephan Dominique Andres
2005 J jnl
The Positive Lightness of Digraphs, Embeddable in a Surface, without 4-Cycles.
Electron. Notes Discret. Math.
Stephan Dominique Andres
2003 J jnl
The Game Chromatic Index of Forests of Maximum Degree 5.
Electron. Notes Discret. Math.
Stephan Dominique Andres