The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Raphael Yuster: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Noga Alon, Raphael Yuster, Uri Zwick
    Color-Coding. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1995, v:42, n:4, pp:844-856 [Journal]
  2. Raphael Yuster
    Fractional Decompositions of Dense Hypergraphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:482-493 [Conf]
  3. Noga Alon, Raphael Yuster, Uri Zwick
    Finding and Counting Given Length Cycles (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:354-364 [Conf]
  4. Raphael Yuster, Uri Zwick
    Fast Sparse Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:604-615 [Conf]
  5. Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster
    The Algorithmic Aspects of the Regularity Lemma (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:473-481 [Conf]
  6. Raphael Yuster, Uri Zwick
    Answering distance queries in directed graphs using fast matrix multiplication. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:389-396 [Conf]
  7. Virginia Vassilevska, Ryan Williams, Raphael Yuster
    Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:262-273 [Conf]
  8. Raphael Yuster, Uri Zwick
    Finding Even Cycles Even Faster. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:532-543 [Conf]
  9. Zeev Nutov, Raphael Yuster
    Packing Directed Cycles Efficiently. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:310-321 [Conf]
  10. Michael Krivelevich, Zeev Nutov, Raphael Yuster
    Approximation algorithms for cycle packing problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:556-561 [Conf]
  11. Raphael Yuster, Uri Zwick
    Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:254-260 [Conf]
  12. Noga Alon, Raphael Yuster, Uri Zwick
    Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:326-335 [Conf]
  13. Noga Alon, Raphael Yuster, Uri Zwick
    Finding and Counting Given Length Cycles. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:3, pp:209-223 [Journal]
  14. Yair Caro, Raphael Yuster
    Graphs with Large Variance. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:57, n:, pp:- [Journal]
  15. Yair Caro, Raphael Yuster
    Graphs Having the Local Decomposition Property. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:52, n:, pp:- [Journal]
  16. Raphael Yuster
    A note on graphs without k-connected subgraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  17. Raphael Yuster
    Nowhere 0 mod p dominating sets in multigraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:70, n:, pp:- [Journal]
  18. Noga Alon, Raphael Yuster
    The Number Of Orientations Having No Fixed Tournament. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:1, pp:1-16 [Journal]
  19. Raphael Yuster
    Decomposing Hypergraphs into Simple Hypertrees. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:1, pp:119-140 [Journal]
  20. Yair Caro, Raphael Yuster
    A Tura'n Type Problem Concerning the Powers of the Degrees of a Graph. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  21. Yair Caro, Raphael Yuster
    The Order of Monochromatic Subgraphs with a Given Minimum Degree. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  22. Yair Caro, Raphael Yuster
    Packing Graphs: The packing problem solved. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:1, pp:- [Journal]
  23. Yair Caro, Raphael Yuster
    Efficient Covering Designs of the Complete Graph. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:1, pp:- [Journal]
  24. Yair Caro, Raphael Yuster
    Orthogonal Colorings of Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  25. Jian Shen, Raphael Yuster
    A Note on the Number of Edges Guaranteeing a C4 in Eulerian Bipartite Digraphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
  26. Yair Caro, Raphael Yuster
    Dominating A Family Of Graphs With Small Connected Subgraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2000, v:9, n:4, pp:- [Journal]
  27. Noga Alon, Raphael Yuster
    Threshold Functions for H-factors. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:137-144 [Journal]
  28. Raphael Yuster
    Families of Trees Decompose the Random Graph in an Arbitrary Way. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:37, n:6, pp:893-910 [Journal]
  29. Raphael Yuster
    Independent Transversals and Independent Coverings in Sparse Partite Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:1, pp:115-125 [Journal]
  30. Zeev Nutov, Raphael Yuster
    Packing directed cycles efficiently. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:2, pp:82-91 [Journal]
  31. Yair Caro, Raphael Yuster
    List decomposition of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:243, n:1-3, pp:67-77 [Journal]
  32. Yair Caro, Raphael Yuster
    2-connected graphs with small 2-connected dominating sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:265-271 [Journal]
  33. Yehuda Roditty, Barack Shoham, Raphael Yuster
    Monotone paths in edge-ordered sparse graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:226, n:1-3, pp:411-417 [Journal]
  34. Raphael Yuster
    Arithmetic progressions with constant weight. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:224, n:1-3, pp:225-237 [Journal]
  35. Raphael Yuster
    The number of edge-disjoint transitive triples in a tournament. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:187-191 [Journal]
  36. Raphael Yuster
    Decomposing oriented graphs into transitive tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:166-170 [Journal]
  37. Noga Alon, Raphael Yuster, Uri Zwick
    Color-Coding [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:9, pp:- [Journal]
  38. Paul Balister, Yair Caro, Cecil C. Rousseau, Raphael Yuster
    Zero-sum Square Matrices. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:5, pp:489-497 [Journal]
  39. Noga Alon, Raphael Yuster
    EveryH-decomposition ofKnhas a Nearly Resolvable Alternative. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:7, pp:839-845 [Journal]
  40. Noga Alon, Simon Litsyn, Raphael Yuster
    A Coding Theory Bound and Zero-Sum Square Matrices. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2003, v:19, n:4, pp:449-457 [Journal]
  41. Noga Alon, Raphael Yuster
    On a Hypergraph Matching Problem. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:4, pp:377-384 [Journal]
  42. Raphael Yuster
    Large Monotone Paths in Graphs with Bounded Degree. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:3, pp:579-587 [Journal]
  43. Raphael Yuster
    Finding and counting cliques and independent sets in r-uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:99, n:4, pp:130-134 [Journal]
  44. Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster
    The Algorithmic Aspects of the Regularity Lemma. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:16, n:1, pp:80-109 [Journal]
  45. Yair Caro, Raphael Yuster
    Recognizing Global Occurrence of Local Properties. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1997, v:13, n:3, pp:340-352 [Journal]
  46. Noga Alon, Yair Caro, Raphael Yuster
    Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:71, n:2, pp:144-161 [Journal]
  47. Noga Alon, Raphael Yuster
    The 123 Theorem and Its Extensions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1995, v:72, n:2, pp:322-331 [Journal]
  48. Noga Alon, Raphael Yuster
    H-Factors in Dense Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:2, pp:269-282 [Journal]
  49. Endre Boros, Yair Caro, Zoltán Füredi, Raphael Yuster
    Covering Non-uniform Hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:82, n:2, pp:270-284 [Journal]
  50. Yair Caro, Raphael Yuster
    Intersecting Designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:89, n:1, pp:113-125 [Journal]
  51. Yair Caro, Raphael Yuster
    Edge coloring complete uniform hypergraphs with many components. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:91, n:2, pp:215-227 [Journal]
  52. Yair Caro, Raphael Yuster
    Covering Graphs: The Covering Problem Solved. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1998, v:83, n:2, pp:273-282 [Journal]
  53. Yair Caro, Raphael Yuster
    Orthogonal Decomposition and Packing of Complete Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:88, n:1, pp:93-111 [Journal]
  54. Raphael Yuster
    Packing and Decomposition of Graphs with Trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:78, n:1, pp:123-140 [Journal]
  55. Raphael Yuster
    Asymptotically optimal Kk-packings of dense graphs via fractional Kk-decompositions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:95, n:1, pp:1-11 [Journal]
  56. Raphael Yuster
    Tiling Transitive Tournaments and Their Blow-ups. [Citation Graph (0, 0)][DBLP]
    Order, 2003, v:20, n:2, pp:121-133 [Journal]
  57. Zeev Nutov, Israel Beniaminy, Raphael Yuster
    A (1-1/e)-approximation algorithm for the generalized assignment problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:3, pp:283-288 [Journal]
  58. Raphael Yuster
    The decomposition threshold for bipartite graphs with minimum degree one. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:21, n:2, pp:121-134 [Journal]
  59. Raphael Yuster
    Integer and fractional packing of families of graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:26, n:1-2, pp:110-118 [Journal]
  60. Raphael Yuster
    Tree decomposition of graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:12, n:3, pp:237-251 [Journal]
  61. Yair Caro, Douglas B. West, Raphael Yuster
    Connected Domination and Spanning Trees with Many Leaves. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:2, pp:202-211 [Journal]
  62. Raphael Yuster
    Equitable Coloring of k-Uniform Hypergraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:4, pp:524-532 [Journal]
  63. Raphael Yuster, Uri Zwick
    Finding Even Cycles Even Faster. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:2, pp:209-222 [Journal]
  64. Raphael Yuster, Uri Zwick
    Fast sparse matrix multiplication. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:1, pp:2-13 [Journal]
  65. Raphael Yuster
    Mean Ramsey-Turán numbers. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:53, n:2, pp:126-134 [Journal]
  66. Dan Archdeacon, J. Ellis-Monaghan, D. Fisher, Dalibor Froncek, Peter Che Bor Lam, S. Seager, B. Wei, Raphael Yuster
    Some remarks on domination. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:46, n:3, pp:207-210 [Journal]
  67. Noga Alon, Gil Kaplan, Arieh Lev, Yehuda Roditty, Raphael Yuster
    Dense graphs are antimagic. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:4, pp:297-309 [Journal]
  68. Raphael Yuster
    Almost Exact Matchings. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:286-295 [Conf]
  69. Noga Alon, Raphael Yuster
    Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:175-186 [Conf]
  70. Asaf Shapira, Raphael Yuster, Uri Zwick
    All-pairs bottleneck paths in vertex weighted graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:978-985 [Conf]
  71. Raphael Yuster, Uri Zwick
    Maximum matching in graphs with an excluded minor. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:108-117 [Conf]
  72. Virginia Vassilevska, Ryan Williams, Raphael Yuster
    All-pairs bottleneck paths for general graphs in truly sub-cubic time. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:585-589 [Conf]
  73. Virginia Vassilevska, Ryan Williams, Raphael Yuster
    Finding heaviest H-subgraphs in real weighted graphs, with applications [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  74. Yair Caro, Raphael Yuster
    The uniformity space of hypergraphs and its applications. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:202, n:1-3, pp:1-19 [Journal]
  75. Raphael Yuster
    Optimal factorizations of families of trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:203, n:1-3, pp:291-297 [Journal]
  76. Raphael Yuster
    Linear coloring of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:185, n:1-3, pp:293-297 [Journal]
  77. Raphael Yuster
    Independent transversals in r-partite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:176, n:1-3, pp:255-261 [Journal]
  78. Raphael Yuster
    On packing trees into complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:163, n:1-3, pp:325-327 [Journal]

  79. Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets. [Citation Graph (, )][DBLP]


  80. Matrix Sparsification for Rank and Determinant Computations via Nested Dissection. [Citation Graph (, )][DBLP]


  81. Computing the Girth of a Planar Graph in O(n logn) Time. [Citation Graph (, )][DBLP]


  82. The effect of induced subgraphs on quasi-randomness. [Citation Graph (, )][DBLP]


  83. Efficient algorithms on sets of permutations, dominance, and real-weighted APSP. [Citation Graph (, )][DBLP]


  84. Generating a d-dimensional Linear Subspace Efficiently. [Citation Graph (, )][DBLP]


  85. Reconstructing Approximate Phylogenetic Trees from Quartet Samples. [Citation Graph (, )][DBLP]


  86. Two-phase Algorithms for the Parametric Shortest Path Problem. [Citation Graph (, )][DBLP]


  87. Hardness and Algorithms for Rainbow Connectivity. [Citation Graph (, )][DBLP]


  88. Rainbow H-factors. [Citation Graph (, )][DBLP]


  89. Single source shortest paths in H-minor free graphs [Citation Graph (, )][DBLP]


  90. Hardness and Algorithms for Rainbow Connectivity [Citation Graph (, )][DBLP]


  91. Two-phase algorithms for the parametric shortest path problem [Citation Graph (, )][DBLP]


  92. Packing Cliques in Graphs with Independence Number 2. [Citation Graph (, )][DBLP]


  93. Approximation algorithms and hardness results for the clique packing problem. [Citation Graph (, )][DBLP]


  94. Large induced subgraphs with equated maximum degree. [Citation Graph (, )][DBLP]


  95. Large disjoint subgraphs with the same order and size. [Citation Graph (, )][DBLP]


Search in 0.127secs, Finished in 0.132secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002