default search action
Robbert Fokkink
Person information
- affiliation: Delft University, Mathematics and Information Technology, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i5]Jan-Tino Brethouwer, Robbert Fokkink:
Search and Rescue on a Poset. CoRR abs/2312.06622 (2023) - [i4]Robbert Fokkink, Hans de Munnik:
Multiplayer boycotts in convex games. CoRR abs/2312.13700 (2023) - 2020
- [i3]Jan-Tino Brethouwer, Arnout van de Rijt, Roy Lindelauf, Robbert Fokkink:
"Stay Nearby or Get Checked": A Covid-19 Lockdown Exit Strategy. CoRR abs/2004.06891 (2020)
2010 – 2019
- 2019
- [j12]Robbert Fokkink, Thomas Lidbetter
, László A. Végh
On Submodular Search and Machine Scheduling. Math. Oper. Res. 44(4): 1431-1449 (2019) - 2017
- [j11]Robbert Fokkink
The search value of a set. Ann. Oper. Res. 256(1): 63-73 (2017) - 2016
- [j10]Steve Alpern, Robbert Fokkink, Martin Simanjuntak:
Optimal search and ambush for a hider who can escape the search region. Eur. J. Oper. Res. 251(3): 707-714 (2016) - [i2]Wieb Bosma, Robbert Fokkink, Thijmen J. P. Krebs:
On automatic subsets of the Gaussian integers. CoRR abs/1602.08579 (2016) - 2015
- [i1]Robbert J. Fokkink, Cor Kraaikamp, Jeffrey O. Shallit:
Hankel Matrices for the Period-Doubling Sequence. CoRR abs/1511.06569 (2015) - 2014
- [j9]Steve Alpern, Robbert Fokkink:
Accumulation games on graphs. Networks 64(1): 40-47 (2014) - 2013
- [j8]Andrey Garnaev
A Searcher versus Hider Game with Incomplete Information about Search Resources. Asia Pac. J. Oper. Res. 30(2) (2013) - [j7]Steve Alpern, Robbert Fokkink, Shmuel Gal, Marco Timmer:
On Search Games That Include Ambush. SIAM J. Control. Optim. 51(6): 4544-4556 (2013) - [j6]Steve Alpern, Robbert Fokkink:
Illuminating a Network from Its Nodes. Am. Math. Mon. 120(4): 358-359 (2013) - 2012
- [j5]Steve Alpern, Robbert Fokkink, Christos Pelekis:
A Proof of the Kikuta-Ruckle Conjecture on Cyclic Caching of Resources. J. Optim. Theory Appl. 153(3): 650-661 (2012) - [j4]Robbert Fokkink:
Tossing Coins to Guess a Secret Number. Am. Math. Mon. 119(4): 337-339 (2012) - 2011
- [c3]Robbert Fokkink, Misha Stassen:
An Asymptotic Solution of Dresher's Guessing Game. GameSec 2011: 104-116 - 2010
- [j3]Steve Alpern, Robbert Fokkink, Ken Kikuta:
On Ruckle's Conjecture on Accumulation Games. SIAM J. Control. Optim. 48(8): 5073-5083 (2010) - [c2]Steve Alpern, Robbert Fokkink, Joram op den Kelder, Tom Lidbetter:
Disperse or Unite? A Mathematical Model of Coordinated Attack. GameSec 2010: 220-233
2000 – 2009
- 2009
- [c1]Steve Alpern, Robbert Fokkink:
How to hide information for later use on networks. GAMENETS 2009: 653-657 - 2008
- [j2]Steve Alpern, Robbert Fokkink, Roy Lindelauf
The ''Princess and Monster'' Game on an Interval. SIAM J. Control. Optim. 47(3): 1178-1190 (2008) - 2002
- [j1]Robbert Fokkink:
R3 Has No Root. Am. Math. Mon. 109(3): 285 (2002)
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-05-08 20:58 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: