( en | de | ru )

 

Disambiguation of "Yuster, Raphael"

Author of the publication

copydeleteadd this publication to your clipboard
Approximation algorithms for cycle packing problems.

, , and . SODA, page 556-561. SIAM, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Raphael Paschke

Banking regulation with value-at-risk. Uni Mannheim, (2009)

Raphael Kunis

Raphael Wittkowski

Raphael Pultuskier

Raphael Kranz

 

Other publications of authors with the same name

Families of Trees Decompose the Random Graph in an Arbitrary Way.. Comb. Probab. Comput., 13 (6): 893-910 (2004)Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing.. Comb. Probab. Comput., 21 (6): 952-962 (2012)Packing Cliques in Graphs with Independence Number 2.. Comb. Probab. Comput., 16 (5): 805-817 (2007)Perfect sequence covering arrays.. Des. Codes Cryptogr., 88 (3): 585-593 (2020)Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets.. APPROX-RANDOM, volume 5171 of Lecture Notes in Computer Science, page 596-601. Springer, (2008)Nowhere 0 mod p dominating sets in multigraphs.. Ars Comb., (2004)All-pairs bottleneck paths in vertex weighted graphs., , and . SODA, page 978-985. SIAM, (2007)A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs., and . APPROX-RANDOM, volume 6845 of Lecture Notes in Computer Science, page 339-350. Springer, (2011)The effect of induced subgraphs on quasi-randomness., and . SODA, page 789-798. SIAM, (2008)Edge coloring complete uniform hypergraphs with many components., and . J. Comb. Theory B, 91 (2): 215-227 (2004)