Остановите войну!
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 35 matches
- 2020
- Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee:
Intersecting Restrictions in Clutters. Comb. 40(5): 605-623 (2020) - Noga Alon, Mrinal Kumar, Ben Lee Volk:
Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. Comb. 40(2): 149-178 (2020) - Peter J. Ayre, Amin Coja-Oghlan, Pu Gao, Noëla Müller:
The Satisfiability Threshold For Random Linear Equations. Comb. 40(2): 179-235 (2020) - Anurag Bishnoi, Ferdinand Ihringer, Valentina Pepe:
A Construction for Clique-Free Pseudorandom Graphs. Comb. 40(3): 307-314 (2020) - Grigoriy Blekherman, Annie Raymond, Mohit Singh, Rekha R. Thomas:
Simple Graph Density Inequalities with No Sum of Squares Proofs. Comb. 40(4): 455-471 (2020) - Michael Chapman, Nati Linial, Yuval Peled:
Expander Graphs - Both Local and Global. Comb. 40(4): 473-509 (2020) - John Chiarelli, Pooya Hatami, Michael E. Saks:
An Asymptotically Tight Bound on the Number of Relevant Variables in a Bounded Degree Boolean function. Comb. 40(2): 237-244 (2020) - Ilkyoo Choi, Daniel W. Cranston, Théo Pierron:
Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles. Comb. 40(5): 625-653 (2020) - Alexander Clifton, Hao Huang:
On Almost k-Covers of Hypercubes. Comb. 40(4): 511-526 (2020) - Robert Connelly, Steven J. Gortler, Louis Theran:
Generically Globally Rigid Graphs Have Generic Universally Rigid Frameworks. Comb. 40(1): 1-37 (2020) - Zdenek Dvorák, Patrice Ossona de Mendez, Hehui Wu:
1-Subdivisions, the Fractional Chromatic Number and the Hall Ratio. Comb. 40(6): 759-774 (2020) - Oliver Ebsen, Mathias Schacht:
Homomorphism Thresholds for Odd Cycles. Comb. 40(1): 39-62 (2020) - Chaim Even-Zohar:
Patterns in Random Permutations. Comb. 40(6): 775-804 (2020) - Stefan Felsner, Tamás Mészáros, Piotr Micek:
Boolean Dimension and Tree-Width. Comb. 40(5): 655-677 (2020) - Asaf Ferber, Vishesh Jain, Benny Sudakov:
Number of 1-Factorizations of Regular High-Degree Graphs. Comb. 40(3): 315-344 (2020) - Zouhaier Ferchiou, Bertrand Guenin:
A Short Proof of Shih's Isomorphism Theorem on Graphic Subspaces. Comb. 40(6): 805-837 (2020) - Alexander L. Gavrilyuk, Sho Suda, Janos Vidali:
On Tight 4-Designs in Hamming Association Schemes. Comb. 40(3): 345-362 (2020) - Stefan Glock, Felix Joos, Daniela Kühn, Deryk Osthus:
Euler Tours in Hypergraphs. Comb. 40(5): 679-690 (2020) - Stefan Glock, Daniela Kühn, Allan Lo, Deryk Osthus:
On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems. Comb. 40(3): 363-403 (2020) - He Guo, Lutz Warnke:
Packing Nearly Optimal Ramsey R(3, t) Graphs. Comb. 40(1): 63-103 (2020) - Ervin Györi, Michael D. Plummer, Dong Ye, Xiaoya Zha:
Cycle Traversability for Claw-Free Graphs and Polyhedral Maps. Comb. 40(3): 405-433 (2020) - Gergely Harcos, Daniel Soltész:
New Bounds on Even Cycle Creating Hamiltonian Paths Using Expander Graphs. Comb. 40(3): 435-454 (2020) - Andreas F. Holmsen:
Large Cliques in Hypergraphs with Forbidden Substructures. Comb. 40(4): 527-537 (2020) - Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood:
Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth. Comb. 40(6): 839-868 (2020) - Tali Kaufman, Izhar Oppenheim:
High Order Random Walks: Beyond Spectral Gap. Comb. 40(2): 245-281 (2020) - Andrey Kupavskii:
The VC-Dimension of K-Vertex D-Polytopes. Comb. 40(6): 869-874 (2020) - Matthew Kwan, Shoham Letzter, Benny Sudakov, Tuan Tran:
Dense Induced Bipartite Subgraphs in Triangle-Free Graphs. Comb. 40(2): 283-305 (2020) - Christian Lindorfer, Wolfgang Woess:
The Language of Self-Avoiding Walks. Comb. 40(5): 691-720 (2020) - Jie Ma, Bo Ning:
Stability Results on the Circumference of a Graph. Comb. 40(1): 105-147 (2020) - Orit E. Raz, Zvi Shem-Tov:
Expanding Polynomials: A Generalization of the Elekes-Rónyai Theorem to d Variables. Comb. 40(5): 721-748 (2020)
skipping 5 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-06-20 04:06 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