×
Author ID: yuster.raphael Recent zbMATH articles by "Yuster, Raphael"
Published as: Yuster, Raphael; Yuster, R.
Homepage: http://research.haifa.ac.il/~raphy/
External Links: MGP · dblp
Documents Indexed: 192 Publications since 1992, including 5 Additional arXiv Preprints
Reviewing Activity: 7 Reviews
Co-Authors: 74 Co-Authors with 118 Joint Publications
3,293 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

150 Publications have been cited 1,962 times in 1,486 Documents Cited by Year
Color-coding. Zbl 0885.68116
Alon, Noga; Yuster, Raphael; Zwick, Uri
317
1995
Finding and counting given length cycles. Zbl 0865.68093
Alon, N.; Yuster, R.; Zwick, U.
109
1997
The rainbow connection of a graph is (at most) reciprocal to its minimum degree. Zbl 1193.05079
Krivelevich, Michael; Yuster, Raphael
100
2010
On rainbow connection. Zbl 1181.05037
Caro, Yair; Lev, Arie; Roditty, Yehuda; Tuza, Zsolt; Yuster, Raphael
86
2008
The algorithmic aspects of the regularity lemma. Zbl 0794.05119
Alon, N.; Duke, Richard A.; Lefmann, Hanno; Rödl, Vojtěch; Yuster, R.
76
1994
\(H\)-factors in dense graphs. Zbl 0855.05085
Alon, Noga; Yuster, Raphael
75
1996
Dense graphs are antimagic. Zbl 1055.05132
Alon, N.; Kaplan, G.; Lev, A.; Roditty, Y.; Yuster, R.
70
2004
Hardness and algorithms for rainbow connection. Zbl 1319.05049
Chakraborty, Sourav; Fischer, Eldar; Matsliah, Arie; Yuster, Raphael
69
2011
Some remarks on domination. Zbl 1041.05057
Archdeacon, D.; Ellis-Monaghan, J.; Fisher, D.; Froncek, D.; Lam, P. C. B.; Seager, S.; Wei, B.; Yuster, R.
47
2004
Connected domination and spanning trees with many leaves. Zbl 0941.05045
Caro, Yair; West, Douglas B.; Yuster, Raphael
41
2000
Combinatorial and computational aspects of graph packing and graph decomposition. Zbl 1302.05149
Yuster, Raphael
38
2007
The number of edge colorings with no monochromatic triangle. Zbl 0846.05026
Yuster, Raphael
29
1996
Finding even cycles even faster. Zbl 0867.05065
Yuster, Raphael; Zwick, Uri
25
1997
Approximation algorithms and hardness results for cycle packing problems. Zbl 1446.68121
Krivelevich, Michael; Nutov, Zeev; Salavatipour, Mohammad R.; Verstraete, Jacques; Yuster, Raphael
25
2007
Colorful monochromatic connectivity. Zbl 1223.05065
Caro, Yair; Yuster, Raphael
23
2011
Hardness and algorithms for rainbow connectivity. Zbl 1236.68080
Chakraborty, Sourav; Fischer, Eldar; Matsliah, Arie; Yuster, Raphael
23
2009
Linear coloring of graphs. Zbl 0956.05046
Yuster, Raphael
23
1998
Remarks on the second neighborhood problem. Zbl 1122.05040
Fidler, D.; Yuster, R.
22
2007
On a hypergraph matching problem. Zbl 1090.05051
Alon, Noga; Yuster, Raphael
22
2005
Almost \(H\)-factors in dense graphs. Zbl 0769.05072
Alon, Noga; Yuster, Raphael
20
1992
Independent transversals in \(r\)-partite graphs. Zbl 0891.05041
Yuster, Raphael
20
1997
The number of oriantations having no fixed tournament. Zbl 1107.05040
Alon, Noga; Yuster, Raphael
19
2006
Integer and fractional packing of families of graphs. Zbl 1061.05076
Yuster, Raphael
18
2005
Fast sparse matrix multiplication. Zbl 1321.65073
Yuster, Raphael; Zwick, Uri
18
2005
Packing graphs: The packing problem solved. Zbl 0885.05052
Caro, Yair; Yuster, Raphael
16
1997
Second neighborhood via first neighborhood in digraphs. Zbl 1017.05057
Chen, Guantao; Shen, Jian; Yuster, Raphael
14
2003
Threshold functions for \(H\)-factors. Zbl 0794.05098
Alon, Noga; Yuster, Raphael
13
1993
Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions. Zbl 1070.05071
Yuster, Raphael
13
2005
A comment on Ryser’s conjecture for intersecting hypergraphs. Zbl 1211.05094
Mansour, Toufik; Song, Chunwei; Yuster, Raphael
13
2009
A \((1-1/e)\)-approximation algorithm for the generalized assignment problem. Zbl 1110.90065
Nutov, Zeev; Beniaminy, Israel; Yuster, Raphael
13
2006
Approximation algorithms for cycle packing problems. Zbl 1297.05127
Krivelevich, Michael; Nutov, Zeev; Yuster, Raphael
13
2005
Monotone paths in edge-ordered sparse graphs. Zbl 0961.05040
Roditty, Yehuda; Shoham, Barack; Yuster, Raphael
12
2001
Dominating a family of graphs with small connected subgraphs. Zbl 0964.05049
Caro, Yair; Yuster, Raphael
12
2000
Dense graphs with a large triangle cover have a large triangle packing. Zbl 1252.05103
Yuster, Raphael
12
2012
On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\). Zbl 1331.05098
Caro, Yair; Yuster, Raphael
12
2016
Maximum matching in regular and almost regular graphs. Zbl 1263.05081
Yuster, Raphael
12
2013
Replacement paths and distance sensitivity oracles via fast matrix multiplication. Zbl 1301.68208
Weimann, Oren; Yuster, Raphael
12
2013
On the exact maximum induced density of almost all graphs and their inducibility. Zbl 1414.05173
Yuster, Raphael
11
2019
Large monotone paths in graphs with bounded degree. Zbl 1010.05044
Yuster, Raphael
10
2001
The algorithmic aspects of the regularity lemma (extended abstract). Zbl 0915.05102
Alon, N.; Duke, Richard A.; Lefmann, Hanno; Rödl, Vojtěch; Yuster, R.
10
1992
Maximum matching in graphs with an excluded minor. Zbl 1302.05198
Yuster, Raphael; Zwick, Uri
10
2007
Finding heaviest \(H\)-subgraphs in real weighted graphs, with applications. Zbl 1300.05307
Vassilevska, Virginia; Williams, Ryan; Yuster, Raphael
10
2010
Covering graphs: The covering problem solved. Zbl 0913.05078
Caro, Yair; Yuster, Raphael
9
1998
The characterization of zero-sum (mod 2) bipartite Ramsey numbers. Zbl 0929.05060
Caro, Yair; Yuster, Raphael
9
1998
The decomposition threshold for bipartite graphs with minimum degree one. Zbl 1018.05090
Yuster, Raphael
9
2002
All pairs bottleneck paths and max-min matrix products in truly subcubic time. Zbl 1213.68338
Vassilevska, Virginia; Williams, Ryan; Yuster, Raphael
9
2009
A Turán type problem concerning the powers of the degrees of a graph. Zbl 0986.05059
Caro, Yair; Yuster, Raphael
9
2000
Orthogonal decomposition and packing of complete graphs. Zbl 0938.05052
Caro, Yair; Yuster, Raphael
8
1999
Packing and decomposition of graphs with trees. Zbl 1028.05095
Yuster, Raphael
8
2000
The effect of induced subgraphs on quasi-randomness. Zbl 1209.05230
Shapira, Asaf; Yuster, Raphael
8
2010
All-pairs bottleneck paths for general graphs in truly sub-cubic time. Zbl 1231.05254
Vassilevska, Virginia; Williams, Ryan; Yuster, Raphael
8
2007
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets. Zbl 1224.05476
Yuster, Raphael
8
2010
Approximation algorithms and hardness results for the clique packing problem. Zbl 1172.05046
Chataigner, F.; Manić, G.; Wakabayashi, Y.; Yuster, R.
8
2009
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. Zbl 1318.05084
Yuster, Raphael; Zwick, Uri
8
2004
All-pairs bottleneck paths in vertex weighted graphs. Zbl 1302.05196
Shapira, Asaf; Yuster, Raphael; Zwick, Uri
8
2007
Packing and covering dense graphs. Zbl 0914.05013
Alon, Noga; Caro, Yair; Yuster, Raphael
7
1998
List decomposition of graphs. Zbl 1049.05063
Caro, Yair; Yuster, Raphael
7
2002
The uniformity space of hypergraphs and its applications. Zbl 0932.05069
Caro, Yair; Yuster, Raphael
7
1999
A note on graphs with \(k\)-connected subgraphs. Zbl 1078.05054
Yuster, Raphael
7
2003
Covering non-uniform hypergraphs. Zbl 1026.05087
Boros, Endre; Caro, Yair; Füredi, Zoltán; Yuster, Raphael
7
2001
Large induced subgraphs with equated maximum degree. Zbl 1214.05054
Caro, Y.; Yuster, R.
7
2010
The quasi-randomness of hypergraph cut properties. Zbl 1241.05105
Shapira, Asaf; Yuster, Raphael
7
2012
The 123 theorem and its extensions. Zbl 0834.60015
Alon, Noga; Yuster, Raphael
7
1995
Efficient algorithms on sets of permutations, dominance, and real-weighted APSP. Zbl 1423.68575
Yuster, Raphael
7
2009
Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs. Zbl 1282.05054
Huang, Hao; Ma, Jie; Shapira, Asaf; Sudakov, Benny; Yuster, Raphael
7
2013
Zero-sum square matrices. Zbl 1020.15019
Balister, Paul; Caro, Yair; Rousseau, Cecil; Yuster, Raphael
6
2002
A shortest cycle for each vertex of a graph. Zbl 1260.05083
Yuster, Raphael
6
2011
All-pairs bottleneck paths in vertex weighted graphs. Zbl 1211.05168
Shapira, Asaf; Yuster, Raphael; Zwick, Uri
6
2011
Matrix sparsification and nested dissection over arbitrary fields. Zbl 1281.65074
Alon, Noga; Yuster, Raphael
6
2013
Rainbow \(H\)-factors. Zbl 1081.05095
Yuster, Raphael
6
2006
Approximating the diameter of planar graphs in near linear time. Zbl 1398.68686
Weimann, Oren; Yuster, Raphael
6
2016
The Turán number of sparse spanning graphs. Zbl 1301.05201
Alon, Noga; Yuster, Raphael
6
2013
Forcing \(k\)-repetitions in degree sequences. Zbl 1300.05064
Caro, Yair; Shapira, Asaf; Yuster, Raphael
6
2014
Orthogonal colorings of graphs. Zbl 0909.05026
Caro, Yair; Yuster, Raphael
5
1999
Tiling transitive tournaments and their blow-ups. Zbl 1041.05043
Yuster, Raphael
5
2003
Graph decomposition of slim graphs. Zbl 0937.05063
Caro, Yair; Yuster, Raphael
5
1999
Fast sparse matrix multiplication. Zbl 1111.65301
Yuster, Raphael; Zwick, Uri
5
2004
Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative. Zbl 0966.05058
Alon, Noga; Yuster, Raphael
5
2000
Near linear time construction of an approximate index for all maximum consecutive sub-sums of a sequence. Zbl 1358.68334
Cicalese, Ferdinando; Laber, Eduardo; Weimann, Oren; Yuster, Raphael
5
2012
Almost exact matchings. Zbl 1236.68107
Yuster, Raphael
5
2012
Perfect sequence covering arrays. Zbl 1433.05070
Yuster, Raphael
5
2020
On minimum witnesses for Boolean matrix multiplication. Zbl 1360.68973
Cohen, Keren; Yuster, Raphael
5
2014
Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs. Zbl 1184.05088
Yuster, Raphael
5
2006
Independent transversals and independent coverings in sparse partite graphs. Zbl 0882.05104
Yuster, Raphael
5
1997
Connected odd dominating sets in graphs. Zbl 1103.05058
Caro, Yair; Klostermeyer, William F.; Yuster, Raphael
5
2005
Orthogonal \(H\)-decompositions. Zbl 1049.05062
Caro, Yair; Yuster, Raphael
4
2001
2-connected graphs with small 2-connected dominating sets. Zbl 1051.05064
Caro, Yair; Yuster, Raphael
4
2003
Graphs with large variance. Zbl 1064.05044
Caro, Yair; Yuster, Raphael
4
2000
Large disjoint subgraphs with the same order and size. Zbl 1200.05111
Caro, Y.; Yuster, R.
4
2009
Two-phase algorithms for the parametric shortest path problem. Zbl 1230.68228
Chakraborty, Sourav; Fischer, Eldar; Lachish, Oded; Yuster, Raphael
4
2010
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets. Zbl 1159.05320
Yuster, Raphael
4
2008
Finding the smallest \(H\)-subgraph in real weighted graphs and related problems. Zbl 1223.05302
Vassilevska, Virginia; Williams, Ryan; Yuster, Raphael
4
2006
Distance oracles for vertex-labeled graphs. Zbl 1333.68212
Hermelin, Danny; Levy, Avivit; Weimann, Oren; Yuster, Raphael
4
2011
Fractional decompositions of dense hypergraphs. Zbl 1121.05080
Yuster, Raphael
4
2007
Packing directed cycles efficiently. Zbl 1129.05035
Nutov, Zeev; Yuster, Raphael
4
2007
Fast algorithms for maximum subset matching and all-pairs shortest paths in graphs with a (not so) small vertex cover. Zbl 1151.05329
Alon, Noga; Yuster, Raphael
4
2007
Approximating the diameter of planar graphs in near linear time. Zbl 1336.68303
Weimann, Oren; Yuster, Raphael
4
2013
On packing trees into complete bipartite graphs. Zbl 0871.05013
Yuster, Raphael
4
1997
The removal lemma for tournaments. Zbl 1414.05131
Fox, Jacob; Gishboliner, Lior; Shapira, Asaf; Yuster, Raphael
4
2019
Tree decomposition of graphs. Zbl 0917.05059
Yuster, Raphael
3
1998
Counting homomorphic cycles in degenerate graphs. Zbl 07753153
Gishboliner, Lior; Levanzov, Yevgeny; Shapira, Asaf; Yuster, Raphael
1
2023
Sum-distinguishing number of sparse hypergraphs. Zbl 1519.05182
Axenovich, Maria; Caro, Yair; Yuster, Raphael
1
2023
On factors of independent transversals in \(k\)-partite graphs. Zbl 1478.05148
Yuster, Raphael
1
2021
Paths with many shortcuts in tournaments. Zbl 1455.05034
Yuster, Raphael
1
2021
Perfect sequence covering arrays. Zbl 1433.05070
Yuster, Raphael
5
2020
Induced subgraphs with many repeated degrees. Zbl 1435.05143
Caro, Yair; Yuster, Raphael
2
2020
Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs. Zbl 1450.05071
Yuster, Raphael
1
2020
On the exact maximum induced density of almost all graphs and their inducibility. Zbl 1414.05173
Yuster, Raphael
11
2019
The removal lemma for tournaments. Zbl 1414.05131
Fox, Jacob; Gishboliner, Lior; Shapira, Asaf; Yuster, Raphael
4
2019
Acyclic subgraphs with high chromatic number. Zbl 1400.05088
Nassar, Safwat; Yuster, Raphael
3
2019
The effect of local majority on global majorityin connected graphs. Zbl 1402.05093
Caro, Yair; Yuster, Raphael
1
2018
A Ramsey type result for oriented trees. Zbl 1348.05132
Yuster, Raphael
3
2017
On the maximum number of spanning copies of an orientation in a tournament. Zbl 1371.05111
Yuster, Raphael
1
2017
On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\). Zbl 1331.05098
Caro, Yair; Yuster, Raphael
12
2016
Approximating the diameter of planar graphs in near linear time. Zbl 1398.68686
Weimann, Oren; Yuster, Raphael
6
2016
Unavoidable tournaments. Zbl 1327.05140
Shapira, Asaf; Yuster, Raphael
3
2016
Packing edge-disjoint triangles in regular and almost regular tournaments. Zbl 1303.05073
Akaria, Islam; Yuster, Raphael
2
2015
Forcing \(k\)-repetitions in degree sequences. Zbl 1300.05064
Caro, Yair; Shapira, Asaf; Yuster, Raphael
6
2014
On minimum witnesses for Boolean matrix multiplication. Zbl 1360.68973
Cohen, Keren; Yuster, Raphael
5
2014
On the compatibility of quartet trees. Zbl 1349.92102
Alon, Noga; Snir, Sagi; Yuster, Raphael
3
2014
Edge-disjoint cliques in graphs with high minimum degree. Zbl 1301.05192
Yuster, Raphael
3
2014
Approximating the maximum consecutive subsums of a sequence. Zbl 1284.68483
Cicalese, Ferdinando; Laber, Eduardo; Weimann, Oren; Yuster, Raphael
2
2014
Maximum matching in regular and almost regular graphs. Zbl 1263.05081
Yuster, Raphael
12
2013
Replacement paths and distance sensitivity oracles via fast matrix multiplication. Zbl 1301.68208
Weimann, Oren; Yuster, Raphael
12
2013
Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs. Zbl 1282.05054
Huang, Hao; Ma, Jie; Shapira, Asaf; Sudakov, Benny; Yuster, Raphael
7
2013
Matrix sparsification and nested dissection over arbitrary fields. Zbl 1281.65074
Alon, Noga; Yuster, Raphael
6
2013
The Turán number of sparse spanning graphs. Zbl 1301.05201
Alon, Noga; Yuster, Raphael
6
2013
Approximating the diameter of planar graphs in near linear time. Zbl 1336.68303
Weimann, Oren; Yuster, Raphael
4
2013
Packing triangles in regular tournaments. Zbl 1272.05068
Yuster, Raphael
3
2013
Dense graphs with a large triangle cover have a large triangle packing. Zbl 1252.05103
Yuster, Raphael
12
2012
The quasi-randomness of hypergraph cut properties. Zbl 1241.05105
Shapira, Asaf; Yuster, Raphael
7
2012
Near linear time construction of an approximate index for all maximum consecutive sub-sums of a sequence. Zbl 1358.68334
Cicalese, Ferdinando; Laber, Eduardo; Weimann, Oren; Yuster, Raphael
5
2012
Almost exact matchings. Zbl 1236.68107
Yuster, Raphael
5
2012
\(H\)-packing of \(k\)-chromatic graphs. Zbl 1267.05149
Yuster, Raphael
3
2012
Reconstructing approximate phylogenetic trees from quartet samples. Zbl 1261.92041
Snir, Sagi; Yuster, Raphael
2
2012
Approximate shortest paths in weighted graphs. Zbl 1237.68248
Yuster, Raphael
2
2012
Hardness and algorithms for rainbow connection. Zbl 1319.05049
Chakraborty, Sourav; Fischer, Eldar; Matsliah, Arie; Yuster, Raphael
69
2011
Colorful monochromatic connectivity. Zbl 1223.05065
Caro, Yair; Yuster, Raphael
23
2011
A shortest cycle for each vertex of a graph. Zbl 1260.05083
Yuster, Raphael
6
2011
All-pairs bottleneck paths in vertex weighted graphs. Zbl 1211.05168
Shapira, Asaf; Yuster, Raphael; Zwick, Uri
6
2011
Distance oracles for vertex-labeled graphs. Zbl 1333.68212
Hermelin, Danny; Levy, Avivit; Weimann, Oren; Yuster, Raphael
4
2011
A linear time approximation scheme for maximum quartet consistency on sparse sampled inputs. Zbl 1233.92063
Snir, Sagi; Yuster, Raphael
1
2011
On the size of dissociated bases. Zbl 1217.05046
Lev, Vsevolod F.; Yuster, Raphael
1
2011
Equitable hypergraph orientations. Zbl 1217.05171
Caro, Yair; West, Douglas; Yuster, Raphael
1
2011
The rainbow connection of a graph is (at most) reciprocal to its minimum degree. Zbl 1193.05079
Krivelevich, Michael; Yuster, Raphael
100
2010
Finding heaviest \(H\)-subgraphs in real weighted graphs, with applications. Zbl 1300.05307
Vassilevska, Virginia; Williams, Ryan; Yuster, Raphael
10
2010
The effect of induced subgraphs on quasi-randomness. Zbl 1209.05230
Shapira, Asaf; Yuster, Raphael
8
2010
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets. Zbl 1224.05476
Yuster, Raphael
8
2010
Large induced subgraphs with equated maximum degree. Zbl 1214.05054
Caro, Y.; Yuster, R.
7
2010
Two-phase algorithms for the parametric shortest path problem. Zbl 1230.68228
Chakraborty, Sourav; Fischer, Eldar; Lachish, Oded; Yuster, Raphael
4
2010
Computing the girth of a planar graph in \(O(n \log n)\) time. Zbl 1213.05152
Weimann, Oren; Yuster, Raphael
3
2010
On the density of a graph and its blowup. Zbl 1208.05067
Shapira, Asaf; Yuster, Raphael
2
2010
Single source shortest paths in \(H\)-minor free graphs. Zbl 1196.68177
Yuster, Raphael
1
2010
Reconstructing approximate phylogenetic trees from quartet samples. Zbl 1288.68275
Snir, Sagi; Yuster, Raphael
1
2010
Hardness and algorithms for rainbow connectivity. Zbl 1236.68080
Chakraborty, Sourav; Fischer, Eldar; Matsliah, Arie; Yuster, Raphael
23
2009
A comment on Ryser’s conjecture for intersecting hypergraphs. Zbl 1211.05094
Mansour, Toufik; Song, Chunwei; Yuster, Raphael
13
2009
All pairs bottleneck paths and max-min matrix products in truly subcubic time. Zbl 1213.68338
Vassilevska, Virginia; Williams, Ryan; Yuster, Raphael
9
2009
Approximation algorithms and hardness results for the clique packing problem. Zbl 1172.05046
Chataigner, F.; Manić, G.; Wakabayashi, Y.; Yuster, R.
8
2009
Efficient algorithms on sets of permutations, dominance, and real-weighted APSP. Zbl 1423.68575
Yuster, Raphael
7
2009
Large disjoint subgraphs with the same order and size. Zbl 1200.05111
Caro, Y.; Yuster, R.
4
2009
On rainbow connection. Zbl 1181.05037
Caro, Yair; Lev, Arie; Roditty, Yehuda; Tuza, Zsolt; Yuster, Raphael
86
2008
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets. Zbl 1159.05320
Yuster, Raphael
4
2008
Disjoint color-avoiding triangles. Zbl 1215.05077
Yuster, Raphael
2
2008
The effect of induced subgraphs on quasi-randomness. Zbl 1192.05148
Shapira, Asaf; Yuster, Raphael
2
2008
Packing transitive triples in a tournament. Zbl 1169.05330
Kabiya, Mohamad; Yuster, Raphael
2
2008
All-pairs disjoint paths from a common ancestor in \(\widetilde O (n^\omega)\) time. Zbl 1140.68054
Yuster, Raphael
2
2008
Almost given length cycles in digraphs. Zbl 1147.05044
Yuster, Raphael
1
2008
Rainbow decompositions. Zbl 1138.05029
Yuster, Raphael
1
2008
Combinatorial and computational aspects of graph packing and graph decomposition. Zbl 1302.05149
Yuster, Raphael
38
2007
Approximation algorithms and hardness results for cycle packing problems. Zbl 1446.68121
Krivelevich, Michael; Nutov, Zeev; Salavatipour, Mohammad R.; Verstraete, Jacques; Yuster, Raphael
25
2007
Remarks on the second neighborhood problem. Zbl 1122.05040
Fidler, D.; Yuster, R.
22
2007
Maximum matching in graphs with an excluded minor. Zbl 1302.05198
Yuster, Raphael; Zwick, Uri
10
2007
All-pairs bottleneck paths for general graphs in truly sub-cubic time. Zbl 1231.05254
Vassilevska, Virginia; Williams, Ryan; Yuster, Raphael
8
2007
All-pairs bottleneck paths in vertex weighted graphs. Zbl 1302.05196
Shapira, Asaf; Yuster, Raphael; Zwick, Uri
8
2007
Fractional decompositions of dense hypergraphs. Zbl 1121.05080
Yuster, Raphael
4
2007
Packing directed cycles efficiently. Zbl 1129.05035
Nutov, Zeev; Yuster, Raphael
4
2007
Fast algorithms for maximum subset matching and all-pairs shortest paths in graphs with a (not so) small vertex cover. Zbl 1151.05329
Alon, Noga; Yuster, Raphael
4
2007
Packing cliques in graphs with independence number 2. Zbl 1220.05105
Yuster, Raphael
2
2007
Almost exact matchings. Zbl 1171.05397
Yuster, Raphael
1
2007
Approximation algorithms and hardness results for the clique packing problem. Zbl 1341.05204
Chataigner, F.; Manić, G.; Wakabayashi, Y.; Yuster, R.
1
2007
The number of oriantations having no fixed tournament. Zbl 1107.05040
Alon, Noga; Yuster, Raphael
19
2006
A \((1-1/e)\)-approximation algorithm for the generalized assignment problem. Zbl 1110.90065
Nutov, Zeev; Beniaminy, Israel; Yuster, Raphael
13
2006
Rainbow \(H\)-factors. Zbl 1081.05095
Yuster, Raphael
6
2006
Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs. Zbl 1184.05088
Yuster, Raphael
5
2006
Finding the smallest \(H\)-subgraph in real weighted graphs and related problems. Zbl 1223.05302
Vassilevska, Virginia; Williams, Ryan; Yuster, Raphael
4
2006
On a hypergraph matching problem. Zbl 1090.05051
Alon, Noga; Yuster, Raphael
22
2005
Integer and fractional packing of families of graphs. Zbl 1061.05076
Yuster, Raphael
18
2005
Fast sparse matrix multiplication. Zbl 1321.65073
Yuster, Raphael; Zwick, Uri
18
2005
Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions. Zbl 1070.05071
Yuster, Raphael
13
2005
Approximation algorithms for cycle packing problems. Zbl 1297.05127
Krivelevich, Michael; Nutov, Zeev; Yuster, Raphael
13
2005
Connected odd dominating sets in graphs. Zbl 1103.05058
Caro, Yair; Klostermeyer, William F.; Yuster, Raphael
5
2005
Packing 4-cycles in Eulerian and bipartite Eulerian tournaments with an application to distances in interchange graphs. Zbl 1059.05056
Yuster, Raphael
2
2005
Fractional decompositions of dense hypergraphs. Zbl 1142.05348
Yuster, Raphael
1
2005
Dense graphs are antimagic. Zbl 1055.05132
Alon, N.; Kaplan, G.; Lev, A.; Roditty, Y.; Yuster, R.
70
2004
Some remarks on domination. Zbl 1041.05057
Archdeacon, D.; Ellis-Monaghan, J.; Fisher, D.; Froncek, D.; Lam, P. C. B.; Seager, S.; Wei, B.; Yuster, R.
47
2004
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. Zbl 1318.05084
Yuster, Raphael; Zwick, Uri
8
2004
Fast sparse matrix multiplication. Zbl 1111.65301
Yuster, Raphael; Zwick, Uri
5
2004
The number of edge-disjoint transitive triples in a tournament. Zbl 1050.05062
Yuster, Raphael
1
2004
Packing directed cycles efficiently. Zbl 1096.68123
Nutov, Zeev; Yuster, Raphael
1
2004
Families of trees decompose the random graph in an arbitrary way. Zbl 1057.05070
Yuster, Raphael
1
2004
...and 50 more Documents
all top 5

Cited by 1,964 Authors

57 Li, Xueliang
48 Yuster, Raphael
38 Henning, Michael Anthony
33 Saurabh, Saket
31 Zehavi, Meirav
27 Fomin, Fedor V.
24 Kühn, Daniela
24 Osthus, Deryk
21 Alon, Noga
21 Caro, Yair
21 Golovach, Petr A.
21 Hoppen, Carlos
21 Sudakov, Benny
18 Dondi, Riccardo
18 Lefmann, Hanno
18 Marx, Dániel
18 Schiermeyer, Ingo
17 Lokshtanov, Daniel
15 Fox, Jacob
15 Kohayakawa, Yoshiharu
15 Shapira, Asaf
14 Ma, Yingbin
14 Niedermeier, Rolf
14 Shi, Yongtang
13 Lingas, Andrzej
13 Lo, Allan Siu Lun
12 Han, Jie
12 Rodl, Vojtech
12 Treglown, Andrew
12 Yeo, Anders
12 Zhao, Yan
11 Rautenbach, Dieter
11 Schacht, Mathias
10 Kawarabayashi, Ken-ichi
9 Aharoni, Ron
9 Fertin, Guillaume
9 Hansberg, Adriana
9 Sikora, Florian
9 Thilikos, Dimitrios M.
9 Zhao, Yi
8 Balogh, József
8 Ducoffe, Guillaume
8 Glock, Stefan
8 Kratsch, Stefan
8 Lauri, Juho
8 van Bevern, René
8 Vassilevska Williams, Virginia
8 Wang, Guanghui
7 Bonnet, Edouard
7 Chan, Timothy Moon-Yew
7 Chen, Jian-er
7 Haxell, Penny E.
7 Kang, Liying
7 Komusiewicz, Christian
7 Kostochka, Aleksandr Vasil’evich
7 Li, Hengzhe
7 Li, Ping
7 Llado, Anna S.
7 Magnant, Colton
7 Molla, Theodore
7 Mota, Guilherme Oliveira
7 Panolan, Fahad
7 Pikhurko, Oleg
7 Raman, Venkatesh
7 Vialette, Stéphane
7 Wang, Jianxin
7 Yang, Donglei
6 Berger, Eli
6 Bodlaender, Hans L.
6 Böttcher, Julia
6 Conlon, David
6 Fellows, Michael Ralph
6 Fujita, Shinya
6 Hermelin, Danny
6 Kaski, Petteri
6 Kobayashi, Yusuke
6 Krivelevich, Michael
6 Mertzios, George B.
6 Misra, Neeldhara
6 Nichterlein, André
6 Odermann, Knut
6 Pilipczuk, Michał
6 Ruciński, Andrzej
6 Shachnai, Hadas
6 Sousa, Teresa Maria
6 Zhao, Yufei
6 Zhu, Xuding
5 Arvind, Vikraman
5 Bača, Martin
5 Barber, Ben
5 Bentert, Matthias
5 Björklund, Andreas
5 Bucić, Matija
5 Bulteau, Laurent
5 Cai, Qingqiong
5 Chandran, L. Sunil
5 Chen, Lily
5 Cohen, Nathann
5 Cygan, Marek
5 Eppstein, David Arthur
...and 1,864 more Authors
all top 5

Cited in 183 Serials

128 Discrete Mathematics
107 Discrete Applied Mathematics
85 Theoretical Computer Science
70 Algorithmica
59 Graphs and Combinatorics
52 Journal of Combinatorial Theory. Series B
52 Journal of Graph Theory
45 SIAM Journal on Discrete Mathematics
40 The Electronic Journal of Combinatorics
39 Combinatorics, Probability and Computing
35 Information Processing Letters
31 Discussiones Mathematicae. Graph Theory
28 European Journal of Combinatorics
27 Journal of Combinatorial Optimization
24 Journal of Computer and System Sciences
24 Random Structures & Algorithms
21 Journal of Combinatorial Theory. Series A
20 Applied Mathematics and Computation
17 SIAM Journal on Computing
16 Theory of Computing Systems
11 Israel Journal of Mathematics
11 Electronic Journal of Graph Theory and Applications
10 Combinatorica
10 Bulletin of the Malaysian Mathematical Sciences Society. Second Series
8 Journal of Discrete Algorithms
7 Information and Computation
7 Acta Mathematica Sinica. English Series
6 Acta Mathematicae Applicatae Sinica. English Series
6 The Australasian Journal of Combinatorics
6 Journal of Mathematical Sciences (New York)
6 Journal of Combinatorial Designs
5 Advances in Mathematics
5 Journal of the London Mathematical Society. Second Series
5 Advances in Applied Mathematics
5 European Journal of Operational Research
5 Discrete Optimization
5 Discrete Mathematics, Algorithms and Applications
5 Forum of Mathematics, Sigma
4 Transactions of the American Mathematical Society
4 Applied Mathematics Letters
4 Journal of Scheduling
4 Journal of Graph Algorithms and Applications
4 AKCE International Journal of Graphs and Combinatorics
4 Proyecciones
4 Mathematics in Computer Science
4 Ars Mathematica Contemporanea
4 ACM Transactions on Algorithms
3 Bulletin of the London Mathematical Society
3 Naval Research Logistics
3 Networks
3 Quaestiones Mathematicae
3 Designs, Codes and Cryptography
3 International Journal of Computer Mathematics
3 Linear Algebra and its Applications
3 Distributed Computing
3 Mathematical Programming. Series A. Series B
3 Annals of Combinatorics
3 Data Mining and Knowledge Discovery
3 Journal of Discrete Mathematical Sciences & Cryptography
3 Journal of the European Mathematical Society (JEMS)
3 Trudy Instituta Matematiki
3 Optimization Letters
3 Logical Methods in Computer Science
3 Computer Science Review
2 Indian Journal of Pure & Applied Mathematics
2 Mathematical Proceedings of the Cambridge Philosophical Society
2 Periodica Mathematica Hungarica
2 Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg
2 Czechoslovak Mathematical Journal
2 Statistics & Probability Letters
2 Acta Mathematica Hungarica
2 Discrete & Computational Geometry
2 Computers & Operations Research
2 Geometric and Functional Analysis. GAFA
2 SIAM Journal on Scientific Computing
2 Filomat
2 Opuscula Mathematica
2 The Journal of Artificial Intelligence Research (JAIR)
2 INFORMS Journal on Computing
2 Taiwanese Journal of Mathematics
2 Annals of Mathematics. Second Series
2 Journal of Applied Mathematics
2 4OR
2 ACM Journal of Experimental Algorithmics
2 Algorithms
2 Science China. Mathematics
2 Diskretnyĭ Analiz i Issledovanie Operatsiĭ
2 Open Mathematics
1 Computers & Mathematics with Applications
1 Communications on Pure and Applied Mathematics
1 Physica A
1 Physics Letters. A
1 Physics Reports
1 Acta Arithmetica
1 Annales Universitatis Mariae Curie-Skłodowska. Sectio A. Mathematica
1 Automatica
1 Computing
1 Fasciculi Mathematici
1 Fuzzy Sets and Systems
1 INFOR
...and 83 more Serials
all top 5

Cited in 35 Fields

1,166 Combinatorics (05-XX)
550 Computer science (68-XX)
107 Operations research, mathematical programming (90-XX)
23 Linear and multilinear algebra; matrix theory (15-XX)
22 Number theory (11-XX)
20 Biology and other natural sciences (92-XX)
19 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
16 Probability theory and stochastic processes (60-XX)
13 Mathematical logic and foundations (03-XX)
13 Information and communication theory, circuits (94-XX)
11 Statistics (62-XX)
11 Numerical analysis (65-XX)
6 Group theory and generalizations (20-XX)
4 Order, lattices, ordered algebraic structures (06-XX)
4 Geometry (51-XX)
4 Convex and discrete geometry (52-XX)
3 Real functions (26-XX)
3 Harmonic analysis on Euclidean spaces (42-XX)
3 Quantum theory (81-XX)
3 Systems theory; control (93-XX)
2 History and biography (01-XX)
2 Measure and integration (28-XX)
2 Dynamical systems and ergodic theory (37-XX)
2 Manifolds and cell complexes (57-XX)
2 Statistical mechanics, structure of matter (82-XX)
1 General and overarching topics; collections (00-XX)
1 Commutative algebra (13-XX)
1 Algebraic geometry (14-XX)
1 Associative rings and algebras (16-XX)
1 Category theory; homological algebra (18-XX)
1 Partial differential equations (35-XX)
1 Integral transforms, operational calculus (44-XX)
1 Functional analysis (46-XX)
1 Optics, electromagnetic theory (78-XX)
1 Relativity and gravitational theory (83-XX)

Citations by Year