Stephan Dominique Andres

Orcid: 0000-0001-7657-4746

Affiliations:

University of Hagen, Germany

According to our database¹, Stephan Dominique Andres authored at least 36 papers between 2003 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Line game-perfect graphs.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Wai Lam Fong

Discret. Math. Theor. Comput. Sci., 2024

2023

The Complexity of Two Colouring Games.

[BibT_eX]

[DOI]

Stephan Dominique Andres

François Dross

Melissa A. Huggan

Fionn Mc Inerney

Richard J. Nowakowski

Algorithmica, April, 2023

Strong and weak Perfect Digraph Theorems for perfect, α-perfect and strictly perfect digraphs.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Discuss. Math. Graph Theory, 2023

2021

Greedy versus recursive greedy: Uncorrelated heuristics for the binary paint shop problem.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Discret. Appl. Math., 2021

2020

Corrigendum to "The orthogonal colouring game" [Theor. Comput. Sci. 795 (2019) 312-325].

[BibT_eX]

[DOI]

Stephan Dominique Andres

Melissa A. Huggan

Fionn Mc Inerney

Richard J. Nowakowski

Theor. Comput. Sci., 2020

Equality Perfect Graphs and Digraphs.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Contributions Discret. Math., 2020

A semi-strong perfect digraph theorem.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Helena Bergold

Winfried Hochstättler

Johanna Wiehe

AKCE Int. J. Graphs Comb., 2020

On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs.

[BibT_eX]

[DOI]

Stephan Dominique Andres

AKCE Int. J. Graphs Comb., 2020

2019

The orthogonal colouring game.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Melissa A. Huggan

Fionn Mc Inerney

Richard J. Nowakowski

Theor. Comput. Sci., 2019

Characterising and recognising game-perfect graphs.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Edwin Lock

Discret. Math. Theor. Comput. Sci., 2019

Autotopism stabilized colouring games on rook's graphs.

[BibT_eX]

[DOI]

Raúl M. Falcón

Stephan Dominique Andres

Discret. Appl. Math., 2019

2018

Autoparatopism stabilized colouring games on rook's graphs.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Helena Bergold

Raúl M. Falcón

Electron. Notes Discret. Math., 2018

2016

Note on the game colouring number of powers of graphs.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Andrea Theuser

Discuss. Math. Graph Theory, 2016

2015

Perfect digraphs.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Winfried Hochstättler

J. Graph Theory, 2015

The game colouring number of powers of forests.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Winfried Hochstättler

Discret. Math. Theor. Comput. Sci., 2015

2014

On a base exchange game on bispanning graphs.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Winfried Hochstättler

Markus Merkel

Discret. Appl. Math., 2014

2013

Perfect digraphs and a strong perfect digraph theorem.

[BibT_eX]

Stephan Dominique Andres

Winfried Hochstättler

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012

Game-perfect digraphs.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Math. Methods Oper. Res., 2012

On characterizing game-perfect graphs by forbidden induced subgraphs.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Contributions Discret. Math., 2012

2011

Some heuristics for the binary paint shop problem and their expected number of colour changes.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Winfried Hochstättler

J. Discrete Algorithms, 2011

The game chromatic number and the game colouring number of classes of oriented cactuses.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Winfried Hochstättler

Inf. Process. Lett., 2011

The game chromatic index of wheels.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Winfried Hochstättler

Christiane Schallück

Discret. Appl. Math., 2011

2010

Erratum to: The incidence game chromatic number [Discrete Appl. Math. 157(9) (2009) 1980-1987]

[BibT_eX]

[DOI]

Stephan Dominique Andres

Discret. Appl. Math., 2010

Directed defective asymmetric graph coloring games.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Discret. Appl. Math., 2010

Note on the number of rooted complete N-ary trees.

[BibT_eX]

Stephan Dominique Andres

Ars Comb., 2010

The Classfication of B-perfect Graphs.

[BibT_eX]

Stephan Dominique Andres

Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009

Game-perfect graphs.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Math. Methods Oper. Res., 2009

Classification of All Associative Mono-<i>n</i>-ary Algebras with 2 Elements.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Int. J. Math. Math. Sci., 2009

Asymmetric directed graph coloring games.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Discret. Math., 2009

Lightness of digraphs in surfaces and directed game chromatic number.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Discret. Math., 2009

The incidence game chromatic number.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Discret. Appl. Math., 2009

2007

Directed defective asymmetric graph coloring games on forests.

[BibT_eX]

Stephan Dominique Andres

Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006

Game-perfect Graphs with Clique Number 2.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Electron. Notes Discret. Math., 2006

The game chromatic index of forests of maximum degree Delta>=5.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Discret. Appl. Math., 2006

2005

The Positive Lightness of Digraphs, Embeddable in a Surface, without 4-Cycles.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Electron. Notes Discret. Math., 2005

2003

The Game Chromatic Index of Forests of Maximum Degree 5.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Electron. Notes Discret. Math., 2003

Stephan Dominique Andres

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...