The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Andrzej Rucinski" ( http://dblp.L3S.de/Authors/Andrzej_Rucinski )

  Author page on DBLP  Author page in RDF  Community of Andrzej Rucinski in ASPL-2

Publication years (Num. hits)
1984-1997 (16) 1998-2002 (18) 2003-2008 (18) 2009-2012 (14)
Publication types (Num. hits)
article(50) inproceedings(16)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 12 occurrences of 12 keywords

Results
Found 66 publication records. Showing 66 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Noga Alon, Peter Frankl, Hao Huang, Vojtech Rödl, Andrzej Rucinski, Benny Sudakov Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Marek Karpinski, Andrzej Rucinski, Edyta Szymanska Approximate Counting of Matchings in Sparse Hypergraphs Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Marek Karpinski, Andrzej Rucinski, Edyta Szymanska Approximate Counting of Matchings in Sparse Uniform Hypergraphs Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski Universality of Random Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski An Improved Upper Bound on the Density of Universal Random Graphs. Search on Bibsonomy LATIN The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Klas Markström, Andrzej Rucinski Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Andrzej Dudek, Joanna Polcyn, Andrzej Rucinski Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Marek Karpinski, Andrzej Rucinski, Edyta Szymanska Computational Complexity of the Perfect Matching Problem in Hypergraphs with Subcritical Density. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Catherine S. Greenhill, Svante Janson, Andrzej Rucinski On the Number of Perfect Matchings in Random Lifts. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Marek Karpinski, Andrzej Rucinski, Edyta Szymanska Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs. Search on Bibsonomy LATIN The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi Perfect matchings in large uniform hypergraphs with large minimum collective degree. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Joanna Polcyn, Andrzej Rucinski Short paths in epsilon-regular pairs and small diameter decompositions of dense graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Jozef Skokan The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Marek Karpinski, Andrzej Rucinski, Edyta Szymanska The Complexity of Perfect Matching Problems on Dense Hypergraphs. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Izolda Gorgol, Andrzej Rucinski Planar Ramsey numbers for cycles. Search on Bibsonomy Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Vojtech Rödl, Endre Szemerédi, Andrzej Rucinski An approximate Dirac-type theorem for k -uniform hypergraphs. Search on Bibsonomy Combinatorica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 05C65, 05C45, 05D05
1Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski Universality of random graphs. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Alexander Drozd, Svetlana Antoshchuk, Andrzej Rucinski, A. Martinuk Parity prediction method for on-line testing of a Barrel-shifter. Search on Bibsonomy EWDTS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Vojtech Rödl, Andrzej Rucinski, Mathias Schacht Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Miklós Simonovits, Jozef Skokan The Ramsey number for hypergraph cycles I. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Joanna Polcyn, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi Short paths in quasi-random triple systems with sparse underlying graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi Perfect matchings in uniform hypergraphs with large minimum degree. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Catherine S. Greenhill, Andrzej Rucinski Neighbour-Distinguishing Edge Colourings of Random Regular Graphs. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2006 DBLP  BibTeX  RDF
1Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi A Dirac-Type Theorem for 3-Uniform Hypergraphs. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Andrzej Kurek, Andrzej Rucinski Two variants of the size Ramsey number. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 2005 DBLP  BibTeX  RDF
1Endre Szemerédi, Andrzej Rucinski, Vojtech Rödl The Generalization of Dirac's Theorem for Hypergraphs. Search on Bibsonomy MFCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald Random Hypergraph Processes with Degree Restrictions. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Svante Janson, Andrzej Rucinski The Deletion Method For Upper Tail Estimates. Search on Bibsonomy Combinatorica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 60F05
1Andrzej Rucinski, Artur Skrygulec, Khrystyna Pysareva, Jakub Mocny Microsystem Development Using the TQM Design Methodology. Search on Bibsonomy DELTA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Ehud Friedgut, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali Ramsey Games Against a One-Armed Bandit. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald Connectedness Of The Degree Bounded Star Process. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Andrzej Rucinski, Barrett Stetson, S. T. P. Brundavani A DOT1 & DOT4 MOSIS - Compatible Library. Search on Bibsonomy MSE The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Ronald L. Graham, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski Ramsey Properties of Families of Graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Tomasz Luczak, Andrzej Rucinski, Sebastian Urbanski Vertex Ramsey Properties of Families of Graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Yuejian Peng, Vojtech Rödl, Andrzej Rucinski Holes in Graphs. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2002 DBLP  BibTeX  RDF
1Svante Janson, Andrzej Rucinski The infamous upper tail. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Andrzej Rucinski, Barbara Dziurla-Rucinska Boundary Scan as a Test Solution in Microelectronics Curricula. Search on Bibsonomy DELTA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF IEEE 1149.4 standard, Education, Boundary scan
1Tomasz Luczak, Andrzej Rucinski, Sebastian Urbanski On minimal Folkman graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski On Bipartite Graphs with Linear Ramsey Numbers. Search on Bibsonomy Combinatorica The full citation details ... 2001 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) Classes: 05C55, 05C80, 05D40
1Vojtech Rödl, Andrzej Rucinski, Michelle Wagner Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi Near-optimum Universal Graphs for Graphs with Bounded Degrees. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Justyna Kurkowiak, Andrzej Rucinski Solitary subgraphs of random graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi Universality and Tolerance. Search on Bibsonomy FOCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF positive integers, sparse universal graphs, random constructions, fault-tolerant bipartite random graph, graph theory, graph theory, graphs, bipartite graphs, universality, vertices, tolerance, maximum degree
1Vojtech Rödl, Andrzej Rucinski, Anusch Taraz Hypergraph Packing And Graph Embedding. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 1999 DBLP  BibTeX  RDF
1Vojtech Rödl, Andrzej Rucinski Perfect Matchings in -Regular Graphs and the Blow-Up Lemma. Search on Bibsonomy Combinatorica The full citation details ... 1999 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 05C75
1Pawel Nowakowski, Barbara Dziurla-Rucinska, Andrzej Rucinski VLSI Design and Test Sequence in an Academic Environment: A Case Study. Search on Bibsonomy MSE The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Vojtech Rödl, Andrzej Rucinski Ramsey Properties of Random Hypergraphs. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Noga Alon, Vojtech Rödl, Andrzej Rucinski Perfect Matchings in $\epsilon$-regular Graphs. Search on Bibsonomy Electr. J. Comb. The full citation details ... 1998 DBLP  BibTeX  RDF
1Dwight Duffus, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski Endomorphisms of Partially Ordered Sets. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 1998 DBLP  BibTeX  RDF
1Vojtech Rödl, Andrzej Rucinski, Michelle Wagner An Algorithmic Embedding of Graphs via Perfect Matchings. Search on Bibsonomy RANDOM The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Andrzej Rucinski, Miroslaw Truszczynski A note on local colorings of graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Vojtech Rödl, Andrzej Rucinski Bipartite Coverings of Graphs. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 1997 DBLP  BibTeX  RDF
1Tomasz Luczak, Andrzej Rucinski, Jacek Gruszka On the evolution of a random tournament. Search on Bibsonomy Discrete Mathematics The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Vojtech Rödl, Andrzej Rucinski Random Graphs with Monochromatic Triangles in Every Edge Coloring. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Tomasz Luczak, Andrzej Rucinski, Bernd Voigt Ramsey properties of random graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Andrzej Rucinski Matching and covering the vertices of a random graph by copies of a given graph. Search on Bibsonomy Discrete Mathematics The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Andrzej Rucinski, Nicholas C. Wormald Random Graph Processes with Degree Restrictions. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Tomasz Luczak, Andrzej Rucinski Tree-Matchings in Graph Processes. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Nicholas Ilyadis, Peter Drexel, Andrzej Rucinski The simulation of the non-linear dynamic behavior of distributed routing networks using DECSIM. Search on Bibsonomy Winter Simulation Conference The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Andrew D. Barbour, Svante Janson, Michal Karonski, Andrzej Rucinski Small Cliques in Random Graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Andrzej Rucinski, Frank Hludik, John L. Pokoski A partnership in domestication of rapid prototyping technologies. Search on Bibsonomy SIGCSE The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Andrew D. Barbour, Michal Karonski, Andrzej Rucinski A central limit theorem for decomposable random variables with applications to random graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Andrzej Rucinski, Andrew Vince Balanced extensions of graphs and hypergraphs. Search on Bibsonomy Combinatorica The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
1Zbigniew Palka, Andrzej Rucinski, Joel Spencer On a method for random graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
1Andrzej Rucinski, John L. Pokoski Polystructural, Reconfigurable, and Fault-Tolerant Computers. Search on Bibsonomy ICDCS The full citation details ... 1986 DBLP  BibTeX  RDF
1Andrzej Rucinski The behaviour of (k, ..., kn, n-ik)ci/i! is asymptotically normal. Search on Bibsonomy Discrete Mathematics The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #66 of 66 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.