The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for 05D40 with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2001 (3) 2004 (4) 2005 (2) 2006 (3)
Publication types (Num. hits)
article(12)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 14 occurrences of 5 keywords

Results
Found 12 publication records. Showing 12 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
24Christos H. Papadimitriou, Santosh S. Vempala On The Approximability Of The Traveling Salesman Problem. Search on Bibsonomy Comb. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 68Q17, 05D40
24Lihua Liu, Hao Shen Explicit constructions of separating hash families from algebraic curves over finite fields. Search on Bibsonomy Des. Codes Cryptogr. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF AMS Classification 05D05, 05D40
24Peter Keevash, Cheng Yeaw Ku A random construction for permutation codes and the covering radius. Search on Bibsonomy Des. Codes Cryptogr. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF AMS Classification 05D40
24Jeong Han Kim, Jirí Matousek 0001, Van H. Vu Discrepancy After Adding A Single Set. Search on Bibsonomy Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05D40
24Alan M. Frieze, Nicholas C. Wormald Random k-Sat: A Tight Threshold For Moderately Growing k. Search on Bibsonomy Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05D40, 68Q25
24Daniela Kühn, Deryk Osthus Every Graph of Sufficiently Large Average Degree Contains a C4-Free Subgraph of Large Average Degree. Search on Bibsonomy Comb. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C35, 05D40
24Daniela Kühn, Deryk Osthus Induced Subdivisions In Ks, s-Free Graphs of Large Average Degree. Search on Bibsonomy Comb. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C35, 05D40
24Bruce A. Reed, Benny Sudakov List Colouring When The Chromatic Number Is Close To the Order Of The Graph. Search on Bibsonomy Comb. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C15, 05D40
24Daniela Kühn, Deryk Osthus Complete Minors In Ks, s-Free Graphs. Search on Bibsonomy Comb. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C83, 05C35, 05D40
24Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski 0001 On Bipartite Graphs with Linear Ramsey Numbers. Search on Bibsonomy Comb. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) Classes: 05C55, 05C80, 05D40
24Noga Alon, János Pach, József Solymosi Ramsey-type Theorems with Forbidden Subgraphs. Search on Bibsonomy Comb. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) Classes: 05D10, 05D40, 05C20
24Maria Axenovich, André Kündgen On a Generalized Anti-Ramsey Problem. Search on Bibsonomy Comb. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) Classes: 05C55, 05C35, 05D40
Displaying result #1 - #12 of 12 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license