The following pages link to Raphael Yuster (Q222643):
Displaying 50 items.
- Orthogonal \(H\)-decompositions. (Q2765166) (← links)
- Packing triangles in regular tournaments (Q2852611) (← links)
- Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence (Q2904488) (← links)
- Approximation algorithms for cycle packing problems (Q2921712) (← links)
- Finding heaviest <i>H</i> -subgraphs in real weighted graphs, with applications (Q2930324) (← links)
- Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication (Q2933644) (← links)
- (Q2934588) (← links)
- (Q2934690) (← links)
- On the Compatibility of Quartet Trees (Q2935283) (← links)
- Fast sparse matrix multiplication (Q2944486) (← links)
- (Q3002808) (← links)
- Distance Oracles for Vertex-Labeled Graphs (Q3012943) (← links)
- The effect of induced subgraphs on quasi-randomness (Q3055880) (← links)
- Two-phase algorithms for the parametric shortest path problem (Q3113746) (← links)
- The quasi-randomness of hypergraph cut properties (Q3119045) (← links)
- Independent Transversals and Independent Coverings in Sparse Partite Graphs (Q3123116) (← links)
- Dense graphs are antimagic (Q3159384) (← links)
- Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing (Q3168450) (← links)
- On graphs and algebraic graphs that do not contain cycles of length 4 (Q3174238) (← links)
- Edge-Disjoint Cliques in Graphs with High Minimum Degree (Q3192169) (← links)
- Mean Ramsey–Turán numbers (Q3419705) (← links)
- Fractional decompositions of dense hypergraphs (Q3429620) (← links)
- Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover (Q3527209) (← links)
- Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets (Q3541823) (← links)
- (Q3549658) (← links)
- Almost Exact Matchings (Q3603472) (← links)
- Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems (Q3613765) (← links)
- Computing the Girth of a Planar Graph in O(n logn) Time (Q3638079) (← links)
- (Q4222171) (← links)
- (Q4230372) (← links)
- Tree decomposition of graphs (Q4240601) (← links)
- The characterization of zero-sum (mod 2) bipartite Ramsey numbers (Q4242959) (← links)
- Decomposing large graphs with small graphs of high density (Q4265585) (← links)
- The Algorithmic Aspects of the Regularity Lemma (Q4289842) (← links)
- Threshold Functions for <i>H</i>-factors (Q4290084) (← links)
- Finding Even Cycles Even Faster (Q4337730) (← links)
- (Q4347877) (← links)
- Color-coding (Q4369883) (← links)
- Equitable Coloring of<i>k</i>-Uniform Hypergraphs (Q4443107) (← links)
- Some remarks on domination (Q4474284) (← links)
- (Q4487455) (← links)
- Connected Domination and Spanning Trees with Many Leaves (Q4490780) (← links)
- Finding even cycles even faster (Q4632454) (← links)
- (Q4633908) (← links)
- Families of Trees Decompose the Random Graph in an Arbitrary Way (Q4650645) (← links)
- Integer and fractional packing of families of graphs (Q4667859) (← links)
- The decomposition threshold for bipartite graphs with minimum degree one (Q4803312) (← links)
- The number of edge colorings with no monochromatic triangle (Q4879181) (← links)
- Reconstructing Approximate Phylogenetic Trees from Quartet Samples (Q4910572) (← links)
- Approximating the Diameter of Planar Graphs in Near Linear Time (Q4962209) (← links)
