Остановите войну!
for scientists:
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 57 matches
- 2012
- Louigi Addario-Berry, Colin McDiarmid, Bruce A. Reed:
Connectivity for Bridge-Addable Monotone Graph Classes. Comb. Probab. Comput. 21(6): 803-815 (2012) - M. Amin Bahmanian:
Detachments of Hypergraphs I: The Berge-Johnson Problem. Comb. Probab. Comput. 21(4): 483-495 (2012) - Paul Balister, Béla Bollobás:
Critical Probabilities of 1-Independent Percolation Models. Comb. Probab. Comput. 21(1-2): 11-22 (2012) - Simeon Ball, Valentina Pepe:
Asymptotic Improvements to the Lower Bound of Certain Bipartite Turán Numbers. Comb. Probab. Comput. 21(3): 323-329 (2012) - József Balogh, Choongbum Lee, Wojciech Samotij:
Corrádi and Hajnal's Theorem for Sparse Random Graphs. Comb. Probab. Comput. 21(1-2): 23-55 (2012) - Fabrício Siqueira Benevides, Tomasz Luczak, Alex Scott, Jozef Skokan, M. White:
Monochromatic Cycles in 2-Coloured Graphs. Comb. Probab. Comput. 21(1-2): 57-87 (2012) - Andrew Beveridge, Andrzej Dudek, Alan M. Frieze, Tobias Müller:
Cops and Robbers on Geometric Graphs. Comb. Probab. Comput. 21(6): 816-834 (2012) - Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira:
Testing Odd-Cycle-Freeness in Boolean Functions. Comb. Probab. Comput. 21(6): 835-855 (2012) - Yonatan Bilu, Nathan Linial:
Are Stable Instances Easy? Comb. Probab. Comput. 21(5): 643-660 (2012) - Edward Boehnlein, Tao Jiang:
Set Families With a Forbidden Induced Subposet. Comb. Probab. Comput. 21(4): 496-511 (2012) - Béla Bollobás, Vladimir Nikiforov:
Degree Powers in Graphs: The Erdős-Stone Theorem. Comb. Probab. Comput. 21(1-2): 89-105 (2012) - Julia Böttcher, Anusch Taraz, Andreas Würfl:
Perfect Graphs of Fixed Density: Counting and Homogeneous Sets. Comb. Probab. Comput. 21(5): 661-682 (2012) - Nicolas Bousquet, Stéphan Thomassé:
Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs. Comb. Probab. Comput. 21(4): 512-514 (2012) - Graham R. Brightwell, Malwina J. Luczak:
Order-Invariant Measures on Fixed Causal Sets. Comb. Probab. Comput. 21(3): 330-357 (2012) - Nicolas Broutin, Omar Fawzi:
Longest Path Distance in Random Circuits. Comb. Probab. Comput. 21(6): 856-881 (2012) - Boris Bukh, Alfredo Hubard:
Space Crossing Numbers. Comb. Probab. Comput. 21(3): 358-373 (2012) - Siu On Chan, Michael Molloy:
(k+1)-Cores Have k-Factors. Comb. Probab. Comput. 21(6): 882-896 (2012) - Guantao Chen, Han Ren, Songling Shan:
Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs. Comb. Probab. Comput. 21(1-2): 107-111 (2012) - 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) - Ernie Croot:
Some Properties of Lower Level-Sets of Convolutions. Comb. Probab. Comput. 21(4): 515-530 (2012) - Péter Csikvári, Zoltán Lóránt Nagy:
The Density Turán Problem. Comb. Probab. Comput. 21(4): 531-553 (2012) - Nicolas Curien:
Strong Convergence of Partial Match Queries in Random Quadtrees. Comb. Probab. Comput. 21(5): 683-694 (2012) - Domingos Dellamonica Jr., Penny E. Haxell, Tomasz Luczak, Dhruv Mubayi, Brendan Nagle, Yury Person, Vojtech Rödl, Mathias Schacht, Jacques Verstraëte:
On Even-Degree Subgraphs of Linear Hypergraphs. Comb. Probab. Comput. 21(1-2): 113-127 (2012) - Domingos Dellamonica Jr., Vojtech Rödl:
Distance Preserving Ramsey Graphs. Comb. Probab. Comput. 21(4): 554-581 (2012) - Pandelis Dodos, Vassilis Kanellopoulos, Konstantinos Tyros:
Measurable Events Indexed by Trees. Comb. Probab. Comput. 21(3): 374-411 (2012) - Chaim Even-Zohar:
On Sums of Generating Sets in ℤ2 n . Comb. Probab. Comput. 21(6): 916-941 (2012) - Ralph J. Faudree:
My Friend and Colleague, Richard Schelp. Comb. Probab. Comput. 21(1-2): 1-9 (2012) - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Minimum Degree and Disjoint Cycles in Claw-Free Graphs. Comb. Probab. Comput. 21(1-2): 129-139 (2012) - Peter Frankl, Vojtech Rödl, Andrzej Rucinski:
On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size. Comb. Probab. Comput. 21(1-2): 141-148 (2012) - Michael Fuchs:
Limit Theorems for Subtree Size Profiles of Increasing Trees. Comb. Probab. Comput. 21(3): 412-441 (2012)
skipping 27 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-05-21 19:31 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