default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDReto Spöhel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j22]Benjamin Doerr, Carola Doerr
, Reto Spöhel, Henning Thomas:
Playing Mastermind With Many Colors. J. ACM 63(5): 42:1-42:23 (2016)- 2014
- [j21]Luca Gugelmann, Reto Spöhel:
On balanced coloring games in random graphs. Eur. J. Comb. 35: 297-312 (2014) - [j20]Yoshiharu Kohayakawa, Mathias Schacht, Reto Spöhel:
Upper bounds on probability thresholds for asymmetric Ramsey properties. Random Struct. Algorithms 44(1): 1-28 (2014) - [j19]Torsten Mütze, Thomas Rast, Reto Spöhel:
Coloring random graphs online without creating monochromatic subgraphs. Random Struct. Algorithms 44(4): 419-464 (2014) - 2013
- [j18]Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, Henning Thomas:
Explosive Percolation in Erdős-Rényi-Like Random Graph Processes. Comb. Probab. Comput. 22(1): 133-145 (2013) - [c8]Benjamin Doerr, Reto Spöhel, Henning Thomas, Carola Winzen:
Playing Mastermind with Many Colors. SODA 2013: 695-704 - 2012
- [j17]Michael Krivelevich, Reto Spöhel:
Creating Small Subgraphs in Achlioptas Processes With Growing Parameter. SIAM J. Discret. Math. 26(2): 670-686 (2012) - [j16]Michael Belfrage, Torsten Mütze, Reto Spöhel:
Probabilistic One-Player Ramsey Games via Deterministic Two-Player Games. SIAM J. Discret. Math. 26(3): 1031-1049 (2012) - [c7]Benjamin Doerr, Reto Spöhel, Henning Thomas, Carola Winzen:
Playing Mastermind with Many Colors. CTW 2012: 108-111 - [i2]Benjamin Doerr, Reto Spöhel, Henning Thomas, Carola Winzen:
Playing Mastermind with Many Colors. CoRR abs/1207.0773 (2012) - 2011
- [j15]Torsten Mütze, Reto Spöhel:
On the Path-Avoidance Vertex-Coloring Game. Electron. J. Comb. 18(1) (2011) - [j14]Nicla Bernasconi, Julian Lorenz, Reto Spöhel:
Von Neumann and Newman poker with a flip of hand values. Discret. Math. 311(21): 2337-2345 (2011) - [j13]Luca Gugelmann, Reto Spöhel:
On Balanced Coloring Games in Random Graphs. Electron. Notes Discret. Math. 38: 425-430 (2011) - [j12]Torsten Mütze, Reto Spöhel:
On the path-avoidance vertex-coloring game. Electron. Notes Discret. Math. 38: 657-662 (2011) - [j11]Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, Henning Thomas:
Explosive Percolation in Erdős-Rényi-Like Random Graph Processes. Electron. Notes Discret. Math. 38: 699-704 (2011) - [j10]Torsten Mütze, Reto Spöhel, Henning Thomas:
Small subgraphs in random graphs and the power of multiple choices. J. Comb. Theory B 101(4): 237-268 (2011) - [c6]Timo Kötzing, Frank Neumann, Reto Spöhel:
PAC learning and genetic programming. GECCO 2011: 2091-2096 - [c5]Torsten Mütze, Thomas Rast, Reto Spöhel:
Coloring random graphs online without creating monochromatic subgraphs. SODA 2011: 145-158 - [i1]Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, Henning Thomas:
Explosive Percolation in Erdös-Rényi-Like Random Graph Processes. CoRR abs/1104.1309 (2011) - 2010
- [j9]Martin Marciniszyn, Reto Spöhel:
Online vertex-coloring games in random graphs. Comb. 30(1): 105-123 (2010) - [j8]Reto Spöhel, Angelika Steger, Henning Thomas:
Coloring the Edges of a Random Graph without a Monochromatic Giant Component. Electron. J. Comb. 17(1) (2010) - [j7]Jan Remy, Reto Spöhel, Andreas Weißl:
On Euclidean vehicle routing with allocation. Comput. Geom. 43(4): 357-376 (2010) - [j6]Michael Krivelevich, Reto Spöhel, Angelika Steger:
Offline thresholds for Ramsey-type games on random graphs. Random Struct. Algorithms 36(1): 57-79 (2010)
2000 – 2009
- 2009
- [j5]Anupam Prakash, Reto Spöhel, Henning Thomas:
Balanced Online Ramsey Games in Random Graphs. Electron. J. Comb. 16(1) (2009) - [j4]Martin Marciniszyn, Reto Spöhel, Angelika Steger:
Upper Bounds for Online Ramsey Games in Random Graphs. Comb. Probab. Comput. 18(1-2): 259-270 (2009) - [j3]Martin Marciniszyn, Reto Spöhel, Angelika Steger:
Online Ramsey Games in Random Graphs. Comb. Probab. Comput. 18(1-2): 271-300 (2009) - [j2]Reto Spöhel, Angelika Steger, Henning Thomas:
Coloring the edges of a random graph without a monochromatic giant component. Electron. Notes Discret. Math. 34: 615-619 (2009) - [j1]Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger:
Asymmetric Ramsey properties of random graphs involving cliques. Random Struct. Algorithms 34(4): 419-453 (2009) - 2007
- [c4]Martin Marciniszyn, Reto Spöhel:
Online vertex colorings of random graphs without monochromatic subgraphs. SODA 2007: 486-493 - [c3]Jan Remy, Reto Spöhel, Andreas Weißl:
On Euclidean Vehicle Routing with Allocation. WADS 2007: 601-612 - 2006
- [c2]Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger:
Threshold Functions for Asymmetric Ramsey Properties Involving Cliques. APPROX-RANDOM 2006: 462-474 - 2005
- [c1]Martin Marciniszyn, Reto Spöhel, Angelika Steger:
The Online Clique Avoidance Game on Random Graphs. APPROX-RANDOM 2005: 390-401
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 2024-06-10 20:31 CEST 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:
