default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNina Kamcev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j12]Sylwia Antoniuk, Nina Kamcev
, Andrzej Rucinski:
Properly Colored Hamilton Cycles in Dirac-Type Hypergraphs. Electron. J. Comb. 30(1) (2023)- [j11]Nina Kamcev, Alp Müyesser:
Unavoidable patterns in locally balanced colourings. Comb. Probab. Comput. 32(5): 796-808 (2023) - [c1]Nina Kamcev, Mathias Schacht:
Canonical colourings in random graphs. LAGOS 2023: 5-12 - [i3]Nicolas Broutin, Nina Kamcev, Gábor Lugosi:
Increasing paths in random temporal graphs. CoRR abs/2306.11401 (2023) - [i2]Vilhelm Agdur, Nina Kamcev, Fiona Skerman:
Universal lower bound for community structure of sparse graphs. CoRR abs/2307.07271 (2023) - 2022
- [j10]Nina Kamcev, Christoph Spiegel:
Another Note on Intervals in the Hales-Jewett Theorem. Electron. J. Comb. 29(1) (2022) - 2021
- [j9]Nina Kamcev, Anita Liebenau, David R. Wood, Liana Yepremyan:
The Size Ramsey Number of Graphs with Bounded Treewidth. SIAM J. Discret. Math. 35(1): 281-293 (2021) - 2020
- [j8]Nina Kamcev, Michael Krivelevich, Natasha Morrison, Benny Sudakov:
The Kőnig graph process. Random Struct. Algorithms 57(4): 1272-1302 (2020)
2010 – 2019
- 2019
- [j7]Thomas Kalinowski, Nina Kamcev, Benny Sudakov:
The Zero Forcing Number of Graphs. SIAM J. Discret. Math. 33(1): 95-115 (2019) - [i1]Nina Kamcev, Anita Liebenau, David Wood, Liana Yepremyan:
The size Ramsey number of graphs with bounded treewidth. CoRR abs/1906.09185 (2019) - 2018
- [j6]Nina Kamcev, Tomasz Luczak, Benny Sudakov:
Anagram-Free Colourings of Graphs. Comb. Probab. Comput. 27(4): 623-642 (2018) - 2017
- [j5]Nina Kamcev, Benny Sudakov, Jan Volec:
Bounded colorings of multipartite graphs and hypergraphs. Eur. J. Comb. 66: 235-249 (2017) - [j4]Nina Kamcev, Tomasz Luczak, Benny Sudakov:
Anagram-free colorings of graphs. Electron. Notes Discret. Math. 61: 671-677 (2017) - 2016
- [j3]Nina Kamcev, Michael Krivelevich, Benny Sudakov:
Some Remarks on Rainbow Connectivity. J. Graph Theory 83(4): 372-383 (2016) - 2015
- [j2]Nina Kamcev, Michael Krivelevich, Benny Sudakov:
Some Remarks on Rainbow Connectivity. Electron. Notes Discret. Math. 49: 123-131 (2015) - 2014
- [j1]Nina Kamcev:
Generalised Knight's Tours. Electron. J. Comb. 21(1): 1 (2014)
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 21:25 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:
