The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Jacques Verstraëte" ( http://dblp.L3S.de/Authors/Jacques_Verstraëte )

URL (Homepage):  http://www.math.ucsd.edu/~jverstra/  Author page on DBLP  Author page in RDF  Community of Jacques Verstraëte in ASPL-2

Publication years (Num. hits)
2000-2007 (16) 2008-2011 (12)
Publication types (Num. hits)
article(26) inproceedings(2)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 4 occurrences of 4 keywords

Results
Found 28 publication records. Showing 28 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte On Dissemination Thresholds in Regular and Irregular Graph Classes. Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Pawel Pralat, Jacques Verstraëte, Nicholas C. Wormald On the threshold for k-regular subgraphs of random graphs. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Penny E. Haxell, Jacques Verstraëte List Coloring Hypergraphs. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2010 DBLP  BibTeX  RDF
1Dhruv Mubayi, Jacques Verstraëte Two-regular subgraphs of hypergraphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Sebastian M. Cioaba, André Kündgen, Jacques Verstraëte On decompositions of complete hypergraphs. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Oleg Pikhurko, Jacques Verstraëte The maximum size of hypergraphs without generalized 4-cycles. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michael Cavers, Jacques Verstraëte Clique partitions of complements of forests and bounded degree graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Stefaan De Winter, Felix Lazebnik, Jacques Verstraëte An Extremal Characterization of Projective Planes. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2008 DBLP  BibTeX  RDF
1Hamed Shirazi, Jacques Verstraëte A Note on Polynomials and f-Factors of Graphs. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2008 DBLP  BibTeX  RDF
1Benny Sudakov, Jacques Verstraëte Cycle lengths in sparse graphs. Search on Bibsonomy Combinatorica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 05C35, 05C38
1Assaf Naor, Jacques Verstraëte Parity check matrices and product representations of squares. Search on Bibsonomy Combinatorica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 05Cxx, 05Dxx, 94B65
1Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte On Dissemination Thresholds in Regular and Irregular Graph Classes. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Dhruv Mubayi, Jacques Verstraëte Minimal paths and cycles in set systems. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Peter Keevash, Dhruv Mubayi, Benny Sudakov, Jacques Verstraëte Rainbow Turán Problems. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Penny E. Haxell, Ben Seamone, Jacques Verstraëte Independent dominating sets and hamiltonian cycles. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Jacques Verstraëte Product representations of polynomials. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Jeong Han Kim, Jacques Verstraëte Regular subgraphs of random graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Alexandr V. Kostochka, Jacques Verstraëte Even cycles in hypergraphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Thomas Lam, Jacques Verstraëte A Note on Graphs Without Short Even Cycles. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2005 DBLP  BibTeX  RDF
1Dhruv Mubayi, Jacques Verstraëte Proof Of A Conjecture Of Erdös On Triangles In Set-Systems. Search on Bibsonomy Combinatorica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C35, 05D05, 05C65
1Jacques Verstraëte Unavoidable cycle lengths in graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Mohammad R. Salavatipour, Jacques Verstraëte Disjoint Cycles: Integrality Gap, Hardness, and Approximation. Search on Bibsonomy IPCO The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Dhruv Mubayi, Jacques Verstraëte A hypergraph extension of the bipartite Turán problem. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Jacques Verstraëte On The Number Of Sets Of Cycle Lengths. Search on Bibsonomy Combinatorica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C38
1Jacques Verstraëte Vertex-disjoint cycles of the same length. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Felix Lazebnik, Jacques Verstraëte On Hypergraphs of Girth Five. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2003 DBLP  BibTeX  RDF
1Jacques Verstraëte A Note On Vertex-Disjoint Cycles. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Jacques Verstraëte On Arithmetic Progressions Of Cycle Lengths In Graphs. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2000 DBLP  BibTeX  RDF
Displaying result #1 - #28 of 28 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.