Остановите войну!
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 39 matches
- 2000
- Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy:
Efficient Testing of Large Graphs. Comb. 20(4): 451-476 (2000) - Béla Bajnok, Shahriar Shahriari:
On Uniform f-vectors of Cutsets in the Truncated Boolean Lattice. Comb. 20(1): 1-14 (2000) - Malgorzata Bednarska, Tomasz Luczak:
Biased Positional Games for Which Random Strategies are Nearly Optimal. Comb. 20(4): 477-488 (2000) - Sergey G. Bobkov, Christian Houdré, Prasad Tetali:
lambdainfty Vertex Isoperimetry and Concentration. Comb. 20(2): 153-172 (2000) - Béla Bollobás, Andrew Thomason:
The Structure of Hereditary Properties and Colourings of Random Graphs. Comb. 20(2): 173-202 (2000) - Kathie Cameron:
A Min-Max Relation for Monotone Path Systems in Simple Regions. Comb. 20(3): 435-440 (2000) - Michele Conforti, Bert Gerards, Ajai Kapoor:
A Theorem of Truemper. Comb. 20(1): 15-26 (2000) - Andrew Dabrowski, Lawrence S. Moss:
The Johnson Graphs Satisfy a Distance Extension Property. Comb. 20(2): 295-300 (2000) - Dennis Eichhorn, Dhruv Mubayi:
Edge-Coloring Cliques with Many Colors on Subcliques. Comb. 20(3): 441-444 (2000) - Péter L. Erdös, Ákos Seress, László A. Székely:
Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets. Comb. 20(1): 27-45 (2000) - Ilijas Farah:
Approximate Homomorphisms II: Group Homomorphisms. Comb. 20(1): 47-60 (2000) - Robin Forman:
Morse Theory and Evasiveness. Comb. 20(4): 489-504 (2000) - Joel Friedman:
On Cayley Graphs on the Symmetric Group Generated by Tranpositions. Comb. 20(4): 505-519 (2000) - James F. Geelen:
An Algebraic Matching Algorithm. Comb. 20(1): 61-70 (2000) - Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, Alex Samorodnitsky:
Testing Monotonicity. Comb. 20(3): 301-337 (2000) - Vince Grolmusz:
Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs. Comb. 20(1): 71-86 (2000) - Jeannette C. M. Janssen, Kyriakos Kilakos:
Adaptive Multicolouring. Comb. 20(1): 87-102 (2000) - Tao Jiang, Dhruv Mubayi:
New Upper Bounds for a Canonical Ramsey Problem. Comb. 20(1): 141-146 (2000) - Jeff Kahn:
A Normal Law for Matchings. Comb. 20(3): 339-391 (2000) - Sanjeev Khanna, Nathan Linial, Shmuel Safra:
On the Hardness of Approximating the Chromatic Number. Comb. 20(3): 393-415 (2000) - Jeong Han Kim, Van H. Vu:
Concentration of Multivariate Polynomials and Its Applications. Comb. 20(3): 417-434 (2000) - János Komlós:
Tiling Turán Theorems. Comb. 20(2): 203-218 (2000) - János Körner, Gábor Simonyi:
Graph Pairs and their Entropies: Modularity Problems. Comb. 20(2): 227-240 (2000) - Alexandr V. Kostochka, Michael Stiebitz:
On the Number of Edges in Colour-Critical Graphs and Hypergraphs. Comb. 20(4): 521-530 (2000) - Andrei Kotlov:
Spectral Characterization of Tree-Width-Two Graphs. Comb. 20(1): 147-152 (2000) - Mekkia Kouider:
Neighborhoods and Covering Vertices by Cycles. Comb. 20(2): 219-226 (2000) - Benoît Larose, Claude Tardif:
Hedetniemi's Conjecture and the Retracts of a Product of Graphs. Comb. 20(4): 531-544 (2000) - Nathan Linial, Alex Samorodnitsky, Avi Wigderson:
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. Comb. 20(4): 545-568 (2000) - Jirí Matousek:
On the Signed Domination in Graphs. Comb. 20(1): 103-108 (2000) - Erich Prisner:
Bicliques in Graphs I: Bounds on Their Number. Comb. 20(1): 109-117 (2000)
skipping 9 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-07-05 05:34 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