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
- 2009
- Noga Alon, Eyal Lubetzky:
Uniformly cross intersecting families. Comb. 29(4): 389-431 (2009) - Simeon Ball, Oriol Serra:
Punctured combinatorial Nullstellensätze. Comb. 29(5): 511-522 (2009) - John Bamberg, Maska Law, Tim Penttila:
Tight sets and m-ovoids of generalised quadrangles. Comb. 29(1): 1-17 (2009) - Saugata Basu, Richard Pollack, Marie-Françoise Roy:
An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions. Comb. 29(5): 523-546 (2009) - Béla Bollobás, Boris G. Pittel:
The distribution of the root degree of a random permutation. Comb. 29(2): 131-151 (2009) - Mei-Chu Chang:
Explicit sum-product theorems for large subsets of \mathbbFp. Comb. 29(6): 629-635 (2009) - Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus:
Embeddings and Ramsey numbers of sparse kappa-uniform hypergraphs. Comb. 29(3): 263-297 (2009) - Bill Cuckler, Jeff Kahn:
Hamiltonian cycles in Dirac graphs. Comb. 29(3): 299-326 (2009) - Bill Cuckler, Jeff Kahn:
Entropy bounds for perfect matchings and Hamiltonian cycles. Comb. 29(3): 327-335 (2009) - Anton Dochtermann:
The universality of Hom complexes of graphs. Comb. 29(4): 433-448 (2009) - Gary L. Ebert, Giuseppe Marino, Olga Polverino, Rocco Trombetti:
Infinite families of new semifields. Comb. 29(6): 637-663 (2009) - Babak Farzad, Michael Molloy:
On the edge-density of 4-critical graphs. Comb. 29(6): 665-689 (2009) - Jacob Fox, Benny Sudakov:
Density theorems for bipartite graphs and related Ramsey-type results. Comb. 29(2): 153-196 (2009) - Komei Fukuda, Sonoko Moriyama, Hiroki Nakayama, Jürgen Richter-Gebert:
Every non-Euclidean oriented matroid admits a biquadratic final polynomial. Comb. 29(6): 691-698 (2009) - Massimo Giulietti:
Line partitions of internal points to a conic in PG(2, q). Comb. 29(1): 19-25 (2009) - Dan Hefetz, Michael Krivelevich, Tibor Szabó:
Hamilton cycles in highly connected and expanding graphs. Comb. 29(5): 547-568 (2009) - Hein van der Holst, Rudi Pendavingh:
On a graph property generalizing planarity and flatness. Comb. 29(3): 337-361 (2009) - Marek Janata, Jácint Szabó:
The superstar packing problem. Comb. 29(1): 27-48 (2009) - Vít Jelínek, Jan Kyncl, Rudolf Stolar, Tomás Valla:
Monochromatic triangles in two-colored plane. Comb. 29(6): 699-718 (2009) - Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
Arc-disjoint in-trees in directed graphs. Comb. 29(2): 197-214 (2009) - Ken-ichi Kawarabayashi, Bruce A. Reed:
Highly parity linked graphs. Comb. 29(2): 215-225 (2009) - Hal A. Kierstead, Goran Konjevod:
Coloring number and on-line Ramsey theory for graphs and hypergraphs. Comb. 29(1): 49-64 (2009) - Tamás Király, Jácint Szabó:
A note on parity constrained orientations. Comb. 29(5): 619-628 (2009) - Mihail N. Kolountzakis, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi:
On the Fourier spectrum of symmetric Boolean functions. Comb. 29(3): 363-387 (2009) - Daniela Kühn, Deryk Osthus:
The minimum degree threshold for perfect graph packings. Comb. 29(1): 65-107 (2009) - Vladimir Nikiforov, Cecil C. Rousseau:
Ramsey goodness and beyond. Comb. 29(2): 227-262 (2009) - Serguei Norine:
Drawing 4-Pfaffian graphs on the torus. Comb. 29(1): 109-119 (2009) - Attila Pór, David R. Wood:
Colourings of the cartesian product of graphs and multiplicative Sidon sets. Comb. 29(4): 449-466 (2009) - Vojtech Rödl, Mathias Schacht:
Generalizations of the removal lemma. Comb. 29(4): 467-501 (2009) - Werner Schwärzler:
On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary. Comb. 29(1): 121-126 (2009)
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-10-05 11:46 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