| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Raphael Yuster |
Almost Exact Matchings.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Shapira, Raphael Yuster |
The quasi-randomness of hypergraph cut properties. |
Random Struct. Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Approximate shortest paths in weighted graphs. |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster |
Hardness and algorithms for rainbow connection. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
A shortest cycle for each vertex of a graph. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Caro, Raphael Yuster |
Colorful monochromatic connectivity. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Shapira, Raphael Yuster, Uri Zwick |
All-Pairs Bottleneck Paths in Vertex Weighted Graphs. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Caro, Douglas B. West, Raphael Yuster |
Equitable Hypergraph Orientations. |
Electr. J. Comb. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Vsevolod F. Lev, Raphael Yuster |
On the Size of Dissociated Bases. |
Electr. J. Comb. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Oren Weimann, Raphael Yuster |
Approximating the Diameter of Planar Graphs in Near Linear Time |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sagi Snir, Raphael Yuster |
A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, H. Tracy Hall, Christian Knauer, Rom Pinchasi, Raphael Yuster |
On graphs and algebraic graphs that do not contain cycles of length 4. |
Journal of Graph Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster |
Distance Oracles for Vertex-Labeled Graphs. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sagi Snir, Raphael Yuster |
A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Shapira, Raphael Yuster |
On the density of a graph and its blowup. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Single source shortest paths in H-minor free graphs. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Caro, Raphael Yuster |
Large induced subgraphs with equated maximum degree. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Shapira, Raphael Yuster |
The effect of induced subgraphs on quasi-randomness. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Virginia Vassilevska, Ryan Williams, Raphael Yuster |
Finding heaviest H-subgraphs in real weighted graphs, with applications. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets. |
Combinatorica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Oded Lachish, Raphael Yuster |
Two-phase algorithms for the parametric shortest path problem |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Raphael Yuster |
Computing the diameter polynomially faster than APSP |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Oren Weimann, Raphael Yuster |
Computing the Girth of a Planar Graph in O(n logn) Time. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Raphael Yuster |
The rainbow connection of a graph is (at most) reciprocal to its minimum degree. |
Journal of Graph Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sagi Snir, Raphael Yuster |
Reconstructing Approximate Phylogenetic Trees from Quartet Samples. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Raphael Yuster |
Generating a d-dimensional Linear Subspace Efficiently. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Oded Lachish, Raphael Yuster |
Two-phase Algorithms for the Parametric Shortest Path Problem. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oren Weimann, Raphael Yuster |
Replacement Paths via Fast Matrix Multiplication. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Raphael Yuster |
Solving Linear Systems through Nested Dissection. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Virginia Vassilevska, Ryan Williams, Raphael Yuster |
All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time. |
Theory of Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Caro, Raphael Yuster |
Large disjoint subgraphs with the same order and size. |
Eur. J. Comb. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Shapira, Raphael Yuster |
Multigraphs (Only) Satisfy a Weak Triangle Removal Lemma. |
Electr. J. Comb. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Toufik Mansour, Chunwei Song, Raphael Yuster |
A Comment on Ryser's Conjecture for Intersecting Hypergraphs. |
Graphs and Combinatorics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster |
Hardness and Algorithms for Rainbow Connectivity |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Frédéric Chataigner, Gordana Manic, Yoshiko Wakabayashi, Raphael Yuster |
Approximation algorithms and hardness results for the clique packing problem. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Efficient algorithms on sets of permutations, dominance, and real-weighted APSP. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oren Weimann, Raphael Yuster |
Computing the Girth of a Planar Graph in O(n logn) Time. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster |
Hardness and Algorithms for Rainbow Connectivity. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
All-pairs disjoint paths from a common ancestor in O~(ninfinit) time. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Caro, Arieh Lev, Yehuda Roditty, Zsolt Tuza, Raphael Yuster |
On Rainbow Connection. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Raphael Yuster |
Almost Given Length Cycles in Digraphs. |
Graphs and Combinatorics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Single source shortest paths in H-minor free graphs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Raphael Yuster |
Disjoint Color-Avoiding Triangles. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Raphael Yuster, Uri Zwick |
Color Coding. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Shapira, Raphael Yuster |
The effect of induced subgraphs on quasi-randomness. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Matrix Sparsification for Rank and Determinant Computations via Nested Dissection. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Combinatorial and computational aspects of graph packing and graph decomposition. |
Computer Science Review |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Chataigner, Gordana Manic, Yoshiko Wakabayashi, Raphael Yuster |
Approximation algorithms and hardness results for the clique packing problem. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Packing Cliques in Graphs with Independence Number 2. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Yuster, Raphael Yuster |
Approximation algorithms and hardness results for cycle packing problems. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
Cycle packing, edge-disjoint, approximation algorithms, hardness of approximation, integrality gap |
| 1 | Dror Fidler, Raphael Yuster |
Remarks on the second neighborhood problem. |
Journal of Graph Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov, Raphael Yuster |
Packing directed cycles efficiently. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Raphael Yuster |
Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster, Uri Zwick |
Maximum matching in graphs with an excluded minor. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Shapira, Raphael Yuster, Uri Zwick |
All-pairs bottleneck paths in vertex weighted graphs. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Almost Exact Matchings. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Virginia Vassilevska, Ryan Williams, Raphael Yuster |
All-pairs bottleneck paths for general graphs in truly sub-cubic time. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
bottleneck path, maximum capacity path, matrix multiplication, subcubic |
| 1 | Zeev Nutov, Israel Beniaminy, Raphael Yuster |
A (1-1/e)-approximation algorithm for the generalized assignment problem. |
Oper. Res. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Finding and counting cliques and independent sets in r-uniform hypergraphs. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Decomposing oriented graphs into transitive tournaments. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Rainbow H-factors. |
Electr. J. Comb. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Raphael Yuster |
The Number Of Orientations Having No Fixed Tournament. |
Combinatorica |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C20, 05C30 |
| 1 | Virginia Vassilevska, Ryan Williams, Raphael Yuster |
Finding heaviest H-subgraphs in real weighted graphs, with applications |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Raphael Yuster |
Mean Ramsey-Turán numbers. |
Journal of Graph Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Virginia Vassilevska, Ryan Williams, Raphael Yuster |
Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Asymptotically optimal Kk-packings of dense graphs via fractional Kk-decompositions. |
J. Comb. Theory, Ser. B |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Integer and fractional packing of families of graphs. |
Random Struct. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster, Uri Zwick |
Fast sparse matrix multiplication. |
ACM Transactions on Algorithms |
2005 |
DBLP DOI BibTeX RDF |
Matrix multiplication, sparse matrices |
| 1 | Noga Alon, Raphael Yuster |
On a Hypergraph Matching Problem. |
Graphs and Combinatorics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Caro, William Klostermeyer, Raphael Yuster |
Connected odd dominating sets in graphs. |
Discussiones Mathematicae Graph Theory |
2005 |
DBLP BibTeX RDF |
|
| 1 | Michael Krivelevich, Zeev Nutov, Raphael Yuster |
Approximation algorithms for cycle packing problems. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Fractional Decompositions of Dense Hypergraphs. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster, Uri Zwick |
Answering distance queries in directed graphs using fast matrix multiplication. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Caro, Raphael Yuster |
Edge coloring complete uniform hypergraphs with many components. |
J. Comb. Theory, Ser. B |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
The number of edge-disjoint transitive triples in a tournament. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Families of Trees Decompose the Random Graph in an Arbitrary Way. |
Combinatorics, Probability & Computing |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Gil Kaplan, Arieh Lev, Yehuda Roditty, Raphael Yuster |
Dense graphs are antimagic. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Archdeacon, Joanna A. Ellis-Monaghan, D. Fisher, Dalibor Froncek, Peter Che Bor Lam, Suzanne M. Seager, B. Wei, Raphael Yuster |
Some remarks on domination. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Nowhere 0 mod p dominating sets in multigraphs. |
Ars Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Raphael Yuster, Uri Zwick |
Fast Sparse Matrix Multiplication. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster, Uri Zwick |
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov, Raphael Yuster |
Packing Directed Cycles Efficiently. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Caro, Raphael Yuster |
2-connected graphs with small 2-connected dominating sets. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Caro, Raphael Yuster |
The Order of Monochromatic Subgraphs with a Given Minimum Degree. |
Electr. J. Comb. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Simon Litsyn, Raphael Yuster |
A Coding Theory Bound and Zero-Sum Square Matrices. |
Graphs and Combinatorics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Equitable Coloring of k-Uniform Hypergraphs. |
SIAM J. Discrete Math. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Raphael Yuster |
Tiling Transitive Tournaments and Their Blow-ups. |
Order |
2003 |
DBLP DOI BibTeX RDF |
factor, tournament |
| 1 | Raphael Yuster |
A note on graphs without k-connected subgraphs. |
Ars Comb. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Yair Caro, Raphael Yuster |
List decomposition of graphs. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Balister, Yair Caro, Cecil C. Rousseau, Raphael Yuster |
Zero-sum Square Matrices. |
Eur. J. Comb. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jian Shen, Raphael Yuster |
A Note on the Number of Edges Guaranteeing a C4 in Eulerian Bipartite Digraphs. |
Electr. J. Comb. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Raphael Yuster |
The decomposition threshold for bipartite graphs with minimum degree one. |
Random Struct. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Endre Boros, Yair Caro, Zoltán Füredi, Raphael Yuster |
Covering Non-uniform Hypergraphs. |
J. Comb. Theory, Ser. B |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Roditty, Barack Shoham, Raphael Yuster |
Monotone paths in edge-ordered sparse graphs. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Large Monotone Paths in Graphs with Bounded Degree. |
Graphs and Combinatorics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Packing and Decomposition of Graphs with Trees. |
J. Comb. Theory, Ser. B |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Caro, Raphael Yuster |
Intersecting Designs. |
J. Comb. Theory, Ser. A |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Arithmetic progressions with constant weight. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Raphael Yuster |
EveryH-decomposition ofKnhas a Nearly Resolvable Alternative. |
Eur. J. Comb. |
2000 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")