Find:

Searching for PHRASE raphael yuster.

Restrict to:   Header   Title   Order by:   Expected citations   Hubs   Usage   Date   Try:   Google (CiteSeer)   Google (Web)   Yahoo!   MSN   CSB   DBLP
48 documents found. Order: number of citations.

Color-Coding - Alon, Yuster, Zwick (1995)   (Correct)   (15 citations)
for Advanced Study and Tel Aviv University Raphael Yuster z Dept. of Computer Science Tel Aviv
www.math.tau.ac.il/~zwick/color-code.ps.gz

Finding and Counting Given Length Cycles - Alon, Yuster, Zwick (1998)   (Correct)   (12 citations)
counting given length cycles Noga Alon y Raphael Yuster y Uri Zwick y August 9, 1998 Abstract We
and Counting Given Length Cycles Noga Alon, Raphael Yuster, Uri Zwick
www.math.tau.ac.il/~raphy/count.ps

Threshold functions for H-factors - Alon, Yuster (1993)   (Correct)   (5 citations)
Tel Aviv University, Tel Aviv, Israel and Raphael Yuster Department of Mathematics Raymond and Beverly
Threshold functions for H-factors Noga Alon, Raphael Yuster
www.math.tau.ac.il/~raphy/thresh.ps

Finding Even Cycles Even Faster - Yuster, Zwick (1996)   (Correct)   (5 citations)
Finding Even Cycles Even Faster Raphael Yuster y and Uri Zwick y July 21, 1994 Revised:
pp. 532-543. Finding Even Cycles Even Faster Raphael Yuster, Uri Zwick
www.math.tau.ac.il/~zwick/even-final.ps.gz

Covering Non-uniform Hypergraphs - Boros, Caro, al. (2001)   (Correct)   (2 citations)
1364, Hungary E-mail: furedi#math-inst.hu and Raphael Yuster Department of Mathematics, University of
rutcor.rutgers.edu/~boros/Papers/2001-JCTB-BCFY.pdf

Covering Non-Uniform Hypergraphs - Boros, Caro, Furedi, Yuster   (Correct)   (2 citations)
Endre Boros #Yair Caro Zoltan Furedi #Raphael Yuster Abstract A subset of the vertices in a
Endre Boros, Yair Caro, Zoltan Furedi, Raphael Yuster
rutcor.rutgers.edu/~boros/Papers/BCFY00covering.pdf

Covering the Edges of a Graph By a Prescribed Tree With.. - Alon, Caro, Yuster   (Correct)   (1 citation)
minimum overlap Noga Alon Yair Caro y Raphael Yuster z Abstract Let H =VH EH )be a graph,
With Minimum Overlap Noga Alon, Yair Caro, Raphael Yuster
www.math.tau.ac.il/~raphy/overlap.ps

The Number of Edge Colorings with no Monochromatic Triangle - Raphael Yuster Department (1996)   (Correct)   (1 citation)
Edge Colorings with no Monochromatic Triangle Raphael Yuster Department of Mathematics Raymond and Beverly
Edge Colorings with no Monochromatic Triangle Raphael Yuster Department
www.math.tau.ac.il/~raphy/numcol.ps

Independent Transversals in r-partite Graphs - Yuster (1997)   (Correct)   (1 citation)
Independent Transversals in r-partite Graphs Raphael Yuster Department of Mathematics Raymond and Beverly
Independent Transversals in r-partite Graphs Raphael Yuster
www.math.tau.ac.il/~raphy/partite.ps

Connected Domination and Spanning Trees with Many Leaves - Caro, West, Yuster   (Correct)   (1 citation)
Many Leaves Yair Caro Douglas B. West y Raphael Yuster z Abstract Let G =V E) be a connected
with Many Leaves Yair Caro, Douglas B. West, Raphael Yuster
www.math.uiuc.edu/~west/condom.ps

Fast Sparse Matrix Multiplication - Yuster, Zwick (2004)   (Correct)
Fast sparse matrix multiplication #Raphael Yuster Uri Zwick #Abstract Let A and B two n
ESA'04. 12 Fast Sparse Matrix Multiplication Raphael Yuster, Uri Zwick
www.cs.tau.ac.il/%7Ezwick/papers/sparse.pdf

A note on the number of edges guaranteeing a C 4 in.. - Jian Shen Department   (Correct)
San Marcos, TX 78666 email: js48@swt.edu Raphael Yuster Department of Mathematics University of Haifa
www.combinatorics.org/Volume_9/PDF/v9i1n6.pdf

The Order of Monochromatic Subgraphs with a Given Minimum Degree - Caro, Yuster (2003)   (Correct)
with a given minimum degree Yair Caro and Raphael Yuster y Department of Mathematics University of
with a Given Minimum Degree Yair Caro, Raphael Yuster
www.combinatorics.org/Volume_10/PostScriptfiles/v10i1r32.ps

Detecting Short Directed Cycles Using Rectangular Matrix.. - Yuster, Zwick   (Correct)
matrix multiplication and dynamic programming Raphael Yuster #Uri Zwick Abstract We present several new
Matrix Multiplication and Dynamic Programming Raphael Yuster, Uri Zwick
www.cs.tau.ac.il/%7Ezwick/papers/cycle-rect-soda.ps

A note on the number of edges guaranteeing a C_4 in Eulerian.. - Shen, Yuster (2002)   (Correct)
San Marcos, TX 78666 email: js48@swt.edu Raphael Yuster Department of Mathematics University of Haifa
C_4 in Eulerian bipartite digraphs Jian Shen, Raphael Yuster
www.combinatorics.org/Volume_9/PostScriptfiles/v9i1n6.ps

The Order of Monochromatic Subgraphs With a Given - Minimum Degree Yair   (Correct)
with a given minimum degree Yair Caro #and Raphael Yuster Department of Mathematics University of
www.combinatorics.org/Volume_10/PDF/v10i1r32.pdf

The 123 Theorem and its extensions - Noga Alon And   (Correct)
Theorem and its extensions Noga Alon and Raphael Yuster Department of Mathematics Raymond and Beverly
www.math.tau.ac.il/~raphy/123.ps

Efficient Covering Designs of the Complete Graph - Caro, Yuster (1997)   (Correct)
of the complete graph Ya i r Ca r o and Raphael Yuster Department of Mathematics University of
Designs of the Complete Graph Yair Caro, Raphael Yuster
www.emis.de/journals/EJC/Volume_4/PDF/v4i1r10.pdf

First 20 documents  Next 20

Try your query at:   Google (CiteSeer)   Google (Web)   Yahoo!   MSN   CSB   DBLP

CiteSeer.IST - Copyright Penn State and NEC