default search action
Dennis Clemens
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j26]Simona Boyadzhiyska, Dennis Clemens, Pranshu Gupta, Jonathan Rollin:
Ramsey Equivalence for Asymmetric Pairs of Graphs. SIAM J. Discret. Math. 38(1): 55-74 (2024) - 2023
- [j25]Juri Barkey, Dennis Clemens, Fabian Hamann, Mirjana Mikalacki, Amedeo Sgueglia:
Multistage positional games. Discret. Math. 346(9): 113478 (2023) - [j24]Anurag Bishnoi, Simona Boyadzhiyska, Dennis Clemens, Pranshu Gupta, Thomas Lesgourgues, Anita Liebenau:
On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles. SIAM J. Discret. Math. 37(1): 25-50 (2023) - 2022
- [j23]Simona Boyadzhiyska, Dennis Clemens, Pranshu Gupta:
Minimal Ramsey Graphs with Many Vertices of Small Degree. SIAM J. Discret. Math. 36(3): 1503-1528 (2022) - 2021
- [j22]Dennis Clemens, Laurin Kirsch, Yannick Mogge:
Connector-Breaker Games on Random Boards. Electron. J. Comb. 28(3): 3 (2021) - [j21]Dennis Clemens, Meysam Miralaei, Damian Reding, Mathias Schacht, Anusch Taraz:
On the size-Ramsey number of grid graphs. Comb. Probab. Comput. 30(5): 670-685 (2021) - [j20]Dennis Clemens, Fabian Hamann, Yannick Mogge, Olaf Parczyk:
Maker-Breaker Games on Randomly Perturbed Graphs. SIAM J. Discret. Math. 35(4): 2723-2748 (2021) - 2020
- [j19]Dennis Clemens, Julia Ehrenmüller, Yury Person:
A Dirac-type Theorem for Berge Cycles in Random Hypergraphs. Electron. J. Comb. 27(3): 3 (2020) - [j18]Dennis Clemens, Pranshu Gupta, Fabian Hamann, Alexander Haupt, Mirjana Mikalacki, Yannick Mogge:
Fast Strategies in Waiter-Client Games. Electron. J. Comb. 27(3): 3 (2020) - [j17]Dennis Clemens, Anita Liebenau, Damian Reding:
On minimal Ramsey graphs and Ramsey equivalence in multiple colours. Comb. Probab. Comput. 29(4): 537-554 (2020)
2010 – 2019
- 2019
- [j16]Dennis Clemens, Matthew Jenssen, Yoshiharu Kohayakawa, Natasha Morrison, Guilherme Oliveira Mota, Damian Reding, Barnaby Roberts:
The size?Ramsey number of powers of paths. J. Graph Theory 91(3): 290-299 (2019) - 2018
- [j15]Dennis Clemens, Mirjana Mikalacki:
How fast can Maker win in fair biased games? Discret. Math. 341(1): 51-66 (2018) - [j14]Dennis Clemens, Shagnik Das, Tuan Tran:
Colourings without monochromatic disjoint pairs. Eur. J. Comb. 70: 99-124 (2018) - 2017
- [j13]Dennis Clemens, Anita Liebenau:
A non-trivial upper bound on the threshold bias of the Oriented-cycle game. J. Comb. Theory B 122: 21-54 (2017) - [j12]Dennis Clemens, Julia Ehrenmüller, Alexey Pokrovskiy:
On sets not belonging to algebras and rainbow matchings in graphs. J. Comb. Theory B 122: 109-120 (2017) - 2016
- [j11]Dennis Clemens, Julia Ehrenmüller:
An Improved Bound on the Sizes of Matchings Guaranteeing a Rainbow Matching. Electron. J. Comb. 23(2): 2 (2016) - [j10]Dennis Clemens, Heidi Gebauer, Anita Liebenau:
The Random Graph Intuition for the Tournament Game. Comb. Probab. Comput. 25(1): 76-88 (2016) - [j9]Dennis Clemens, Yury Person:
Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs. Comb. Probab. Comput. 25(6): 850-869 (2016) - [j8]Dennis Clemens, Tuan Tran:
Creating cycles in Walker-Breaker games. Discret. Math. 339(8): 2113-2126 (2016) - [j7]Dennis Clemens, Julia Ehrenmüller, Yury Person:
A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs. Electron. Notes Discret. Math. 54: 181-186 (2016) - 2015
- [j6]Dennis Clemens, Julia Ehrenmüller, Yury Person, Tuan Tran:
Keeping Avoider's Graph Almost Acyclic. Electron. J. Comb. 22(1): 1 (2015) - [j5]Dennis Clemens, Mirjana Mikalacki:
A Remark on the Tournament Game. Electron. J. Comb. 22(3): 3 (2015) - [j4]Dennis Clemens, Yury Person:
Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs. Electron. Notes Discret. Math. 49: 23-30 (2015) - [j3]Dennis Clemens, Mirjana Mikalacki:
Winning fast in fair biased Maker-Breaker games. Electron. Notes Discret. Math. 49: 353-358 (2015) - [j2]Dennis Clemens, Asaf Ferber, Roman Glebov, Dan Hefetz, Anita Liebenau:
Building Spanning Trees Quickly in Maker-Breaker Games. SIAM J. Discret. Math. 29(3): 1683-1705 (2015) - 2012
- [j1]Dennis Clemens, Asaf Ferber, Michael Krivelevich, Anita Liebenau:
Fast Strategies In Maker-Breaker Games Played on Random Boards. Comb. Probab. Comput. 21(6): 897-915 (2012)
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-08-05 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint