default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephan Dominique Andres
Person information
- affiliation: University of Hagen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j34]Stephan Dominique Andres, Wai Lam Fong:
Line game-perfect graphs. Discret. Math. Theor. Comput. Sci. 26(2) (2024)- 2023
- [j33]Stephan Dominique Andres, François Dross, Melissa A. Huggan, Fionn Mc Inerney
, Richard J. Nowakowski:
The Complexity of Two Colouring Games. Algorithmica 85(4): 1067-1090 (2023) - [j32]Stephan Dominique Andres:
Strong and weak Perfect Digraph Theorems for perfect, α-perfect and strictly perfect digraphs. Discuss. Math. Graph Theory 43(4): 909-930 (2023) - 2021
- [j31]Stephan Dominique Andres:
Greedy versus recursive greedy: Uncorrelated heuristics for the binary paint shop problem. Discret. Appl. Math. 303: 4-7 (2021) - 2020
- [j30]Stephan Dominique Andres:
On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs. AKCE Int. J. Graphs Comb. 17(1): 539-549 (2020) - [j29]Stephan Dominique Andres, Helena Bergold, Winfried Hochstättler, Johanna Wiehe:
A semi-strong perfect digraph theorem. AKCE Int. J. Graphs Comb. 17(3): 992-994 (2020) - [j28]Stephan Dominique Andres:
Equality Perfect Graphs and Digraphs. Contributions Discret. Math. 15(2): 159-178 (2020) - [j27]Stephan Dominique Andres, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski:
Corrigendum to "The orthogonal colouring game" [Theor. Comput. Sci. 795 (2019) 312-325]. Theor. Comput. Sci. 842: 133-135 (2020)
2010 – 2019
- 2019
- [j26]Raúl M. Falcón, Stephan Dominique Andres:
Autotopism stabilized colouring games on rook's graphs. Discret. Appl. Math. 266: 200-212 (2019) - [j25]Stephan Dominique Andres, Edwin Lock:
Characterising and recognising game-perfect graphs. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [j24]Stephan Dominique Andres, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski:
The orthogonal colouring game. Theor. Comput. Sci. 795: 312-325 (2019) - 2018
- [j23]Stephan Dominique Andres, Helena Bergold, Raúl M. Falcón:
Autoparatopism stabilized colouring games on rook's graphs. Electron. Notes Discret. Math. 68: 233-238 (2018) - 2016
- [j22]Stephan Dominique Andres, Andrea Theuser:
Note on the game colouring number of powers of graphs. Discuss. Math. Graph Theory 36(1): 31-42 (2016) - 2015
- [j21]Stephan Dominique Andres, Winfried Hochstättler:
The game colouring number of powers of forests. Discret. Math. Theor. Comput. Sci. 18(1) (2015) - [j20]Stephan Dominique Andres, Winfried Hochstättler:
Perfect digraphs. J. Graph Theory 79(1): 21-29 (2015) - 2014
- [j19]Stephan Dominique Andres, Winfried Hochstättler, Markus Merkel:
On a base exchange game on bispanning graphs. Discret. Appl. Math. 165: 25-36 (2014) - 2013
- [i1]Stephan Dominique Andres, Winfried Hochstättler:
Perfect digraphs and a strong perfect digraph theorem. CTW 2013: 11-13 - 2012
- [j18]Stephan Dominique Andres:
On characterizing game-perfect graphs by forbidden induced subgraphs. Contributions Discret. Math. 7(1) (2012) - [j17]Stephan Dominique Andres:
Game-perfect digraphs. Math. Methods Oper. Res. 76(3): 321-341 (2012) - 2011
- [j16]Stephan Dominique Andres, Winfried Hochstättler, Christiane Schallück:
The game chromatic index of wheels. Discret. Appl. Math. 159(16): 1660-1665 (2011) - [j15]Stephan Dominique Andres, Winfried Hochstättler:
The game chromatic number and the game colouring number of classes of oriented cactuses. Inf. Process. Lett. 111(5): 222-226 (2011) - [j14]Stephan Dominique Andres, Winfried Hochstättler:
Some heuristics for the binary paint shop problem and their expected number of colour changes. J. Discrete Algorithms 9(2): 203-211 (2011) - 2010
- [j13]Stephan Dominique Andres:
Note on the number of rooted complete N-ary trees. Ars Comb. 94 (2010) - [j12]Stephan Dominique Andres:
Directed defective asymmetric graph coloring games. Discret. Appl. Math. 158(4): 251-260 (2010) - [j11]Stephan Dominique Andres:
Erratum to: The incidence game chromatic number [Discrete Appl. Math. 157(9) (2009) 1980-1987]. Discret. Appl. Math. 158(6): 728 (2010) - [c2]Stephan Dominique Andres:
The Classfication of B-perfect Graphs. CTW 2010: 9-12
2000 – 2009
- 2009
- [j10]Stephan Dominique Andres:
The incidence game chromatic number. Discret. Appl. Math. 157(9): 1980-1987 (2009) - [j9]Stephan Dominique Andres:
Lightness of digraphs in surfaces and directed game chromatic number. Discret. Math. 309(11): 3564-3579 (2009) - [j8]Stephan Dominique Andres:
Asymmetric directed graph coloring games. Discret. Math. 309(18): 5799-5802 (2009) - [j7]Stephan Dominique Andres:
Classification of All Associative Mono-n-ary Algebras with 2 Elements. Int. J. Math. Math. Sci. 2009: 678987:1-678987:16 (2009) - [j6]Stephan Dominique Andres:
Game-perfect graphs. Math. Methods Oper. Res. 69(2): 235-250 (2009) - 2007
- [c1]Stephan Dominique Andres:
Directed defective asymmetric graph coloring games on forests. CTW 2007: 9-12 - 2006
- [j5]Stephan Dominique Andres:
The game chromatic index of forests of maximum degree Delta>=5. Discret. Appl. Math. 154(9): 1317-1323 (2006) - [j4]Stephan Dominique Andres:
Game-perfect Graphs with Clique Number 2. Electron. Notes Discret. Math. 25: 13-16 (2006) - [j3]Stephan Dominique Andres:
The incidence game chromatic number. Electron. Notes Discret. Math. 27: 1-2 (2006) - 2005
- [j2]Stephan Dominique Andres:
The Positive Lightness of Digraphs, Embeddable in a Surface, without 4-Cycles. Electron. Notes Discret. Math. 22: 119-122 (2005) - 2003
- [j1]Stephan Dominique Andres:
The Game Chromatic Index of Forests of Maximum Degree 5. Electron. Notes Discret. Math. 13: 5-8 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
