The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "Combinatorica"( http://dblp.L3S.de/Venues/Combinatorica )

URL (DBLP): http://dblp.uni-trier.de/db/journals/combinatorica

Publication years (Num. hits)
1981 (43) 1982 (44) 1983 (38) 1984 (46) 1985 (43) 1986 (36) 1987 (36) 1988 (38) 1989 (39) 1990 (31) 1991 (36) 1992 (46) 1993 (35) 1994 (37) 1995 (45) 1996 (46) 1997 (38) 1998 (41) 1999 (31) 2000 (39) 2001 (38) 2002 (35) 2003 (32) 2004 (54) 2005 (34) 2006 (40) 2007 (43) 2008 (44) 2009 (35) 2010 (38) 2011 (38)
Publication types (Num. hits)
article(1219)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 363 occurrences of 75 keywords

Results
Found 1219 publication records. Showing 1219 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Saharon Shelah, Jindrich Zapletal Ramsey theorems for product of finite sets with submeasures. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Molly Dunkum, Peter Hamburger, Attila Pór Destroying cycles in digraphs. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Yong-Gao Chen, Jin-Hui Fang On a problem of Cilleruelo and Nathanson. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Zohar Shay Karnin, Amir Shpilka Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Darryn E. Bryant, Melinda Buchanan, Daniel Horsley, Barbara M. Maenhaut, Victor Scharaschkin On the non-existence of pair covering designs with at least as many points as blocks. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Andrzej Dudek, Vojtech Rödl On Ks-free subgraphs in Ks+k-free graphs and vertex Folkman numbers. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Tamás Terpai Proof of a conjecture of V. Nikiforov. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Paul Wollan Packing cycles with modularity constraints. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Joseph A. Thas, Hendrik Van Maldeghem Generalized Veronesean embeddings of projective spaces. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jørgen Bang-Jensen, Matthias Kriesell On the problem of finding disjoint cycles and dicycles in a digraph. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Edward Marchant, Andrew Thomason The structure of hereditary properties and 2-coloured multigraphs. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jun Fujisawa, Shinya Fujita, Michael D. Plummer, Akira Saito, Ingo Schiermeyer A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jonathan Browder, Isabella Novik Face numbers of generalized balanced Cohen-Macaulay complexes. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ákos Seress, Tsai-Lien Wong, Xuding Zhu Distinguishing labeling of the actions of almost simple groups. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Amir Yehudayoff Affine extractors over prime fields. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jin-Hui Fang A characterization of the identity function with equation f(p+q+r)=f(p)+f(q)+f(r). Search on Bibsonomy Combinatorica 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
1Hiroshi Nozaki Inside S-inner product sets and Euclidean designs. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1David Brink Chevalley's theorem with restricted variables. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Svante Janson Poset limits and exchangeable random posets. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Colin McDiarmid, Tobias Müller On the chromatic number of random geometric graphs. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1R. Bruce Richter, Brendan Rooney, Carsten Thomassen On planarity of compact, locally connected, metric spaces. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hongze Li, Hao Pan Monochromatic integers adding to polynomials of prime variables. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Alexander Engström A local criterion for Tverberg graphs. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Zeev Dvir, Amir Shpilka Towards dimension expanders over finite fields. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Anders Björner A q-analogue of the FKG inequality and some applications. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Richard P. Anstee, Balin Fleming Linear algebra methods for forbidden configurations. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Alexander A. Sherstov The unbounded-error communication complexity of symmetric functions. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1József Balogh, Wojciech Samotij The number of Km, m-free graphs. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Erika R. Kovács, László A. Végh The constructive characterization of (κ, ℓ)-edge-connected digraphs. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Eli Berger, Henning Bruhn Eulerian edge sets in locally finite graphs. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Domingos Dellamonica Jr., Vojtech Rödl Hereditary quasirandom properties of hypergraphs. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Pierre Gillibert, Friedrich Wehrung An infinite combinatorial statement with a poset parameter. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Bertrand Guenin, Robin Thomas Packing directed circuits exactly. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Simeon Ball, Oriol Serra Erratum to: Punctured Combinatorial Nullstellensätze. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Shahar Dobzinski, Noam Nisan Limitations of VCG-based mechanisms. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Noam Greenberg, Carl G. Jockusch Jr., Kevin G. Milans Binary subtrees with few labeled paths. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Daniela Amato, John K. Truss Some constructions of highly arc-transitive digraphs. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar Approximation algorithms via contraction decomposition. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1George Androulakis, Stephen J. Dilworth, Nigel J. Kalton A new approach to the Ramsey-type games and the Gowers dichotomy in F-spaces. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ada Chan, Chris D. Godsil Type-II matrices and combinatorial structures. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger On properties of random dissections and triangulations. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1H. Van Vu Structure of large incomplete sets in abelian groups. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Claude Laflamme, Lionel Nguyen Van Thé, Norbert W. Sauer Partition properties of the dense local order and a colored version of Milliken's theorem. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Benny Sudakov, Jan Vondrák A randomized embedding algorithm for trees. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Stefaan De Winter, Jeroen Schillewaert Characterizations of finite classical polar spaces by intersection numbers with hyperplanes and spaces of codimension 2. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel Every rayless graph has an unfriendly partition. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi A fast algorithm for equitable coloring. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Bill Jackson An inequality for Tutte polynomials. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tom Bohman, Alan M. Frieze, Dhruv Mubayi, Oleg Pikhurko Hypergraphs with independent neighborhoods. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Venkatesan Guruswami, James R. Lee, Alexander A. Razborov Almost Euclidean subspaces of l 1N VIA expander codes. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Torsten Korneffel, Eberhard Triesch An asymptotic bound for the complexity of monotone graph properties. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Katalin Gyarmati, Máté Matolcsi, Imre Z. Ruzsa A superadditivity and submultiplicativity property for cardinalities of sumsets. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Manor Mendel, Assaf Naor Maximum gradient embeddings and monotone clustering. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Gábor Elek On the limit of large girth graph sequences. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ronnie Barequet, Gill Barequet, Günter Rote Formulae and growth rates of high-dimensional polycubes. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Shawn Hedman, Wai Yan Pong Locally finite homogeneous graphs. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Peter Keevash, Dhruv Mubayi Set systems without a simplex or a cluster. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Henry A. Kierstead, Alexandr V. Kostochka Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Reinhard Diestel, Philipp Sprüssel The homology of a locally finite graph with ends. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Shinya Fujita, Ken-ichi Kawarabayashi Non-separating even cycles in highly connected graphs. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Satoru Fujishige A note on disjoint arborescences. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Peter Adams, Elizabeth J. Billington, Dean G. Hoffman, Charles Curtis Lindner The generalized almost resolvable cycle system problem. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Hiroshi Hirai Metric packing for K3+K3. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Péter Csikvári On a poset of trees. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ernest E. Shult, Koen Thas A theorem of Cohen on parapolar spaces. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Raphael Yuster Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Maria Chudnovsky, Paul D. Seymour The three-in-a-tree problem. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ken-ichi Kawarabayashi, Yusuke Kobayashi Algorithms for finding an induced cycle in planar graphs. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Guo-Niu Han New hook length formulas for binary trees. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ryan O'Donnell, Rocco A. Servedio New degree bounds for polynomial threshold functions. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1E. Rodney Canfield, Brendan D. McKay Asymptotic enumeration of integer matrices with large equal row and column sums. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Rade T. Zivaljevic Oriented matroids and Ky Fan's theorem. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Martin Marciniszyn, Reto Spöhel Online vertex-coloring games in random graphs. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Cécile Dartyge, András Sárközy, Mihály Szalay On the pseudo-randomness of subsets related to primitive roots. Search on Bibsonomy Combinatorica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Hein van der Holst, Rudi Pendavingh On a graph property generalizing planarity and flatness. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Anton Dochtermann The universality of Hom complexes of graphs. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus Embeddings and Ramsey numbers of sparse kappa-uniform hypergraphs. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Gary L. Ebert, Giuseppe Marino, Olga Polverino, Rocco Trombetti Infinite families of new semifields. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Vojtech Rödl, Mathias Schacht Generalizations of the removal lemma. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Mihail N. Kolountzakis, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi On the Fourier spectrum of symmetric Boolean functions. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Serguei Norine Drawing 4-Pfaffian graphs on the torus. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Simeon Ball, Oriol Serra Punctured combinatorial Nullstellensätze. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Marek Janata, Jácint Szabó The superstar packing problem. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Daniela Kühn, Deryk Osthus The minimum degree threshold for perfect graph packings. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Bill Cuckler, Jeff Kahn Hamiltonian cycles in Dirac graphs. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Babak Farzad, Michael Molloy On the edge-density of 4-critical graphs. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Hal A. Kierstead, Goran Konjevod Coloring number and on-line Ramsey theory for graphs and hypergraphs. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1John Bamberg, Maska Law, Tim Penttila Tight sets and m-ovoids of generalised quadrangles. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Emanuele Viola, Avi Wigderson One-way multiparty communication lower bound for pointer jumping with applications. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Ken-ichi Kawarabayashi, Bruce A. Reed Highly parity linked graphs. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Bill Cuckler, Jeff Kahn Entropy bounds for perfect matchings and Hamiltonian cycles. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Vladimir Nikiforov, Cecil C. Rousseau Ramsey goodness and beyond. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1John P. Steinberger Tilings of the integers can have superpolynomial periods. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Baogang Xu, Xingxing Yu On a bipartition problem of Bollobás and Scott. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Werner Schwärzler On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa Arc-disjoint in-trees in directed graphs. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Komei Fukuda, Sonoko Moriyama, Hiroki Nakayama, Jürgen Richter-Gebert Every non-Euclidean oriented matroid admits a biquadratic final polynomial. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Dan Hefetz, Michael Krivelevich, Tibor Szabó Hamilton cycles in highly connected and expanding graphs. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 1219 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.