default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 44 matches
- 2020
- Hüseyin Acan, Boris G. Pittel:
On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graph. Random Struct. Algorithms 56(1): 37-62 (2020) - Anna Adamaszek, Peter Allen, Codrut Grosu, Jan Hladký:
Almost all trees are almost graceful. Random Struct. Algorithms 56(4): 948-987 (2020) - Peter Allen, Julia Böttcher, Jozef Skokan, Maya Stein:
Regularity inheritance in pseudorandom graphs. Random Struct. Algorithms 56(2): 306-338 (2020) - Michael Anastos, Alan M. Frieze:
On the connectivity of proper colorings of random graphs and hypergraphs. Random Struct. Algorithms 56(4): 988-997 (2020) - Wiebke Bedenknecht, Christian Reiher:
Squares of Hamiltonian cycles in 3-uniform hypergraphs. Random Struct. Algorithms 56(2): 339-372 (2020) - Omri Ben-Eliezer, Dan Hefetz, Gal Kronenberg, Olaf Parczyk, Clara Shikhelman, Milos Stojakovic:
Semi-random graph process. Random Struct. Algorithms 56(3): 648-675 (2020) - Shankar Bhamidi, Sanchayan Sen:
Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees. Random Struct. Algorithms 56(3): 676-721 (2020) - Antonio Blanca, Zongchen Chen, Eric Vigoda:
Swendsen-Wang dynamics for general graphs in the tree uniqueness region. Random Struct. Algorithms 56(2): 373-400 (2020) - Béla Bollobás, Simon Griffiths, Robert Morris, Leonardo T. Rolla, Paul Smith:
Nucleation and growth in two dimensions. Random Struct. Algorithms 56(1): 63-96 (2020) - Charles Bordenave, Uriel Feige, Elchanan Mossel:
Shotgun assembly of random jigsaw puzzles. Random Struct. Algorithms 56(4): 998-1015 (2020) - Nicolas Broutin, Jean-François Marckert:
The combinatorics of the colliding bullets. Random Struct. Algorithms 56(2): 401-431 (2020) - Krzysztof Burdzy, Soumik Pal:
Twin peaks. Random Struct. Algorithms 56(2): 432-460 (2020) - Junyu Cao, Mariana Olvera-Cravioto:
Connectivity of a general class of inhomogeneous random digraphs. Random Struct. Algorithms 56(3): 722-774 (2020) - Oliver Cooley, Nicola Del Giudice, Mihyun Kang, Philipp Sprüssel:
Vanishing of cohomology groups of random simplicial complexes. Random Struct. Algorithms 56(2): 461-500 (2020) - Chris Dowden, Mihyun Kang, Michael Krivelevich:
The genus of the Erdős-Rényi random graph and the fragile genus property. Random Struct. Algorithms 56(1): 97-121 (2020) - Andrzej Dudek, Christian Reiher, Andrzej Rucinski, Mathias Schacht:
Powers of Hamiltonian cycles in randomly augmented graphs. Random Struct. Algorithms 56(1): 122-141 (2020) - Nathanaël Enriquez, Gabriel Faraud, Laurent Ménard:
Limiting shape of the depth first search tree in an Erdős-Rényi graph. Random Struct. Algorithms 56(2): 501-516 (2020) - Uriel Feige, David Gamarnik, Joe Neeman, Miklós Z. Rácz, Prasad Tetali:
Finding cliques using few probes. Random Struct. Algorithms 56(1): 142-153 (2020) - Reza Gheissari, Eyal Lubetzky:
Quasi-polynomial mixing of critical two-dimensional random cluster models. Random Struct. Algorithms 56(2): 517-556 (2020) - Stefan Glock, Felix Joos:
A rainbow blow-up lemma. Random Struct. Algorithms 56(4): 1031-1069 (2020) - Leslie Ann Goldberg, John Lapinskas, David Richerby:
Phase transitions of the Moran process and algorithmic consequences. Random Struct. Algorithms 56(3): 597-647 (2020) - John Haslegrave, Jonathan H. Jordan, Mark Yarrow:
Condensation in preferential attachment models with location-based choice. Random Struct. Algorithms 56(3): 775-795 (2020) - Steven Heilman:
A periodic isoperimetric problem related to the unique games conjecture. Random Struct. Algorithms 56(1): 154-168 (2020) - Tim Hulshof, Asaf Nachmias:
Slightly subcritical hypercube percolation. Random Struct. Algorithms 56(2): 557-593 (2020) - Svante Janson:
Asymptotic normality in random graphs with given vertex degrees. Random Struct. Algorithms 56(4): 1070-1116 (2020) - Tobias Johnson, Moumanti Podder, Fiona Skerman:
Random tree recursions: Which fixed points correspond to tangible sets of trees? Random Struct. Algorithms 56(3): 796-837 (2020) - Felix Joos, Jaehoon Kim:
Spanning trees in randomly perturbed graphs. Random Struct. Algorithms 56(1): 169-219 (2020) - Matthew Kahle, Francisco Martinez-Figueroa:
The chromatic number of random Borsuk graphs. Random Struct. Algorithms 56(3): 838-850 (2020) - Mihyun Kang, Michael Moßhammer, Philipp Sprüssel:
Phase transitions in graphs on orientable surfaces. Random Struct. Algorithms 56(4): 1117-1170 (2020) - Michal Karonski:
Thirty years... Random Struct. Algorithms 56(1): 3-4 (2020)
skipping 14 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-03 15:09 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint