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 33 matches
- 2016
- Arnab Bhattacharyya, Zeev Dvir, Shubhangi Saraf, Amir Shpilka:
Tight lower bounds for linear 2-query LCCs over finite fields. Comb. 36(1): 1-36 (2016) - Gregory L. Cherlin, Saharon Shelah:
Universal graphs with a forbidden subgraph: Block path solidity. Comb. 36(3): 249-264 (2016) - David Conlon, Jacob Fox, Choongbum Lee, Benny Sudakov:
Ramsey numbers of cubes versus cliques. Comb. 36(1): 37-70 (2016) - Shagnik Das, Wenying Gan, Benny Sudakov:
The minimum number of disjoint pairs in set systems and related problems. Comb. 36(6): 623-660 (2016) - Edward Dobson, Pablo Spiga, Gabriel Verret:
Cayley graphs on abelian groups. Comb. 36(4): 371-393 (2016) - Vida Dujmovic, Gwenaël Joret, Jakub Kozik, David R. Wood:
Nonrepetitive colouring via entropy compression. Comb. 36(6): 661-686 (2016) - Michael J. Ferrara, Timothy D. LeSaulnier, Casey Moffatt, Paul S. Wenger:
On the sum necessary to ensure that a degree sequence is potentially H-graphic. Comb. 36(6): 687-702 (2016) - Justin Gilmer, Michael E. Saks, Srikanth Srinivasan:
Composition limits and separating examples for some boolean function complexity measures. Comb. 36(3): 265-311 (2016) - Chris D. Godsil, David E. Roberson, Robert Sámal, Simone Severini:
Sabidussi versus Hedetniemi for three variations of the chromatic number. Comb. 36(4): 395-415 (2016) - Ben Green, Robert Morris:
Counting sets with small sumset and applications. Comb. 36(2): 129-159 (2016) - Venkatesan Guruswami, Swastik Kopparty:
Explicit subspace designs. Comb. 36(2): 161-185 (2016) - Matthias Hamann:
Spanning trees in hyperbolic graphs. Comb. 36(3): 313-332 (2016) - Andreas F. Holmsen, Edgardo Roldán-Pensado:
The colored Hadwiger transversal theorem in ℝ d. Comb. 36(4): 417-429 (2016) - Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov:
On the densities of cliques and independent sets in graphs. Comb. 36(5): 493-512 (2016) - Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang:
Tree-width and dimension. Comb. 36(4): 431-450 (2016) - Dieter Jungnickel, Klaus Metsch:
The characterization problem for designs with the parameters of AGd(n, q). Comb. 36(5): 513-535 (2016) - Tali Kaufman, Avi Wigderson:
Symmetric LDPC codes and local testing. Comb. 36(1): 91-120 (2016) - Lauren Keough, Andrew John Radcliffe:
Graphs with the fewest matchings. Comb. 36(6): 703-723 (2016) - Daniela Kühn, Deryk Osthus, Timothy Townsend:
Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths. Comb. 36(4): 451-469 (2016) - Florian Lehner:
Distinguishing graphs with intermediate growth. Comb. 36(3): 333-347 (2016) - Allan Lo:
Properly coloured Hamiltonian cycles in edge-coloured complete graphs. Comb. 36(4): 471-492 (2016) - Jie Ma, Xingxing Yu:
On judicious bipartitions of graphs. Comb. 36(5): 537-556 (2016) - Klaus Metsch:
Small tight sets in finite elliptic, parabolic and Hermitian polar spaces. Comb. 36(6): 725-744 (2016) - Guy Moshkovitz, Asaf Shapira:
A short proof of Gowers' lower bound for the regularity lemma. Comb. 36(2): 187-194 (2016) - Ori Parzanchevski, Ron Rosenthal, Ran J. Tessler:
Isoperimetric inequalities in simplicial complexes. Comb. 36(2): 195-227 (2016) - Alain Plagne, Anne de Roton:
Maximal sets with no solution to x+y=3z. Comb. 36(2): 229-248 (2016) - Gonzalo Fiz Pontiveros, Simon Griffiths, Robert Morris, David Saxton, Jozef Skokan:
On the Ramsey number of the triangle and the cube. Comb. 36(1): 71-89 (2016) - Igor Protasov, Sergiy Slobodianiuk:
Note: A conjecture on partitions of groups. Comb. 36(3): 365-369 (2016) - Adam Sheffer, Joshua Zahl, Frank de Zeeuw:
Few distinct distances implies no heavy lines or circles. Comb. 36(3): 349-364 (2016) - Alexander Stoimenow:
A theorem on graph embedding with a relation to hyperbolic volume. Comb. 36(5): 557-589 (2016)
skipping 3 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-11-22 05:11 CET 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