The following pages link to Raphael Yuster (Q222643):
Displaying 44 items.
- Approximation algorithms and hardness results for cycle packing problems (Q4962688) (← links)
- All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint ${k}$-Cliques (and This Is Tight) (Q4997139) (← links)
- Disjoint Color-Avoiding Triangles (Q5189508) (← links)
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree (Q5190328) (← links)
- Vector clique decompositions (Q5236259) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311107) (← links)
- Approximating the Diameter of Planar Graphs in Near Linear Time (Q5326614) (← links)
- On the Maximum Number of Spanning Copies of an Orientation in a Tournament (Q5366972) (← links)
- On the compatibility of quartet trees (Q5384000) (← links)
- Hardness and Algorithms for Rainbow Connectivity (Q5389981) (← links)
- Computing the Girth of a Planar Graph in $O(n \logn)$ Time (Q5392914) (← links)
- (Q5395722) (← links)
- Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs (Q5397736) (← links)
- (Q5417639) (← links)
- (Q5417687) (← links)
- Rainbow decompositions (Q5438446) (← links)
- Packing Cliques in Graphs with Independence Number 2 (Q5443808) (← links)
- (Q5463356) (← links)
- Algorithms – ESA 2004 (Q5464618) (← links)
- (Q5475540) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479394) (← links)
- Connected odd dominating sets in graphs (Q5492638) (← links)
- (Q5501266) (← links)
- A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs (Q5894223) (← links)
- A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs (Q5895540) (← links)
- Approximation algorithms and hardness results for the clique packing problem (Q5900079) (← links)
- Approximation algorithms and hardness results for the clique packing problem (Q5902134) (← links)
- Large monotone paths in graphs with bounded degree (Q5952394) (← links)
- List decomposition of graphs. (Q5957697) (← links)
- A note on the number of edges guaranteeing a \(C_4\) in Eulerian bipartite digraphs (Q5960796) (← links)
- On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\) (Q5964974) (← links)
- The number of bounded‐degree spanning trees (Q6074882) (← links)
- On the quartet distance given partial information (Q6081560) (← links)
- Packing and Covering a Given Directed Graph in a Directed Graph (Q6146269) (← links)
- Sum-distinguishing number of sparse hypergraphs (Q6171496) (← links)
- Perfect and nearly perfect separation dimension of complete and random graphs (Q6186984) (← links)
- Hamiltonian cycles above expectation in r-graphs and quasi-random r-graphs (Q6387278) (← links)
- On tournament inversion (Q6462089) (← links)
- Finding heaviest \(H\)-subgraphs in real weighted graphs, with applications (Q6486945) (← links)
- Path-monochromatic bounded depth rooted trees in (random) tournaments (Q6494953) (← links)
- Counting homomorphic cycles in degenerate graphs (Q6575093) (← links)
- Flip colouring of graphs (Q6632145) (← links)
- Finding and counting small tournaments in large tournaments (Q6652454) (← links)
- On the minimum density of monotone subwords (Q6738535) (← links)
