Raphael Yuster
Orcid: 0000000175506506Affiliations:
 University of Haifa, Israel
According to our database^{1},
Raphael Yuster
authored at least 173 papers
between 1992 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on zbmath.org

on orcid.org
On csauthors.net:
Bibliography
2024
SIAM J. Discret. Math., March, 2024
Discret. Math., 2024
Electron. J. Comb., 2024
2023
Eur. J. Comb., August, 2023
Random Struct. Algorithms, May, 2023
ACM Trans. Algorithms, January, 2023
CoRR, 2023
2022
J. Graph Theory, 2022
Hamiltonian cycles above expectation in <i>r</i>graphs and quasirandom <i>r</i>graphs.
J. Comb. Theory B, 2022
J. Comb. Theory B, 2022
Electron. J. Comb., 2022
2021
All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor{k}+1$ Disjoint kCliques (and This Is Tight).
SIAM J. Discret. Math., 2021
Discret. Math., 2021
Electron. J. Comb., 2021
2020
A 2<sup><i>O</i>(<i>k</i>)</sup><i>n</i> algorithm for <i>k</i>cycle in minorclosed graph families.
Theor. Comput. Sci., 2020
Inf. Process. Lett., 2020
Discret. Math., 2020
Des. Codes Cryptogr., 2020
CoRR, 2020
Electron. J. Comb., 2020
2019
J. Comb. Theory B, 2019
J. Comb. Theory B, 2019
Eur. J. Comb., 2019
Electron. J. Comb., 2019
Proceedings of the Thirtieth Annual ACMSIAM Symposium on Discrete Algorithms, 2019
2018
Graphs Comb., 2018
2017
Eur. J. Comb., 2017
Discret. Math., 2017
Discret. Appl. Math., 2017
Comb. Probab. Comput., 2017
2016
Encyclopedia of Algorithms, 2016
ACM Trans. Algorithms, 2016
J. Comb. Theory B, 2016
Graphs Comb., 2016
2015
Discret. Math., 2015
2014
Theor. Comput. Sci., 2014
SIAM J. Discret. Math., 2014
SIAM J. Discret. Math., 2014
Electron. J. Comb., 2014
Algorithmica, 2014
2013
Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication.
ACM Trans. Algorithms, 2013
J. Graph Theory, 2013
J. Comb. Theory B, 2013
J. ACM, 2013
Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs.
Comb. Probab. Comput., 2013
Electron. J. Comb., 2013
Algorithmica, 2013
2012
SIAM J. Comput., 2012
Random Struct. Algorithms, 2012
J. Comput. Syst. Sci., 2012
Comb. Probab. Comput., 2012
Algorithmica, 2012
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Subsums of a Sequence.
Proceedings of the Combinatorial Pattern Matching  23rd Annual Symposium, 2012
2011
A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs.
SIAM J. Discret. Math., 2011
J. Graph Theory, 2011
J. Comb. Optim., 2011
Inf. Process. Lett., 2011
Discret. Math., 2011
Electron. J. Comb., 2011
Electron. J. Comb., 2011
Algorithmica, 2011
Proceedings of the Automata, Languages and Programming  38th International Colloquium, 2011
2010
Theor. Comput. Sci., 2010
ACM Trans. Algorithms, 2010
SIAM J. Discret. Math., 2010
Random Struct. Algorithms, 2010
J. Graph Theory, 2010
J. Comb. Theory B, 2010
Discret. Math., 2010
CoRR, 2010
CoRR, 2010
Quasirandomness is determined by the distribution of copies of a fixed graph in equicardinal large sets.
Comb., 2010
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010
Proceedings of the TwentyFirst Annual ACMSIAM Symposium on Discrete Algorithms, 2010
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010
2009
Theory Comput., 2009
Graphs Comb., 2009
Eur. J. Comb., 2009
Electron. J. Comb., 2009
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009
Proceedings of the Twentieth Annual ACMSIAM Symposium on Discrete Algorithms, 2009
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009
2008
Proceedings of the Encyclopedia of Algorithms  2008 Edition, 2008
Theor. Comput. Sci., 2008
SIAM J. Discret. Math., 2008
Graphs Comb., 2008
Electron. J. Comb., 2008
Matrix Sparsification for Rank and Determinant Computations via Nested Dissection.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008
2007
ACM Trans. Algorithms, 2007
J. Graph Theory, 2007
Electron. Notes Discret. Math., 2007
Discret. Appl. Math., 2007
Comput. Sci. Rev., 2007
Comb. Probab. Comput., 2007
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
Fast Algorithms for Maximum Subset Matching and AllPairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover.
Proceedings of the Algorithms, 2007
2006
Oper. Res. Lett., 2006
J. Graph Theory, 2006
Inf. Process. Lett., 2006
Discret. Math., 2006
CoRR, 2006
Electron. J. Comb., 2006
Comb., 2006
Finding the Smallest <i>H</i>Subgraph in Real Weighted Graphs and Related Problems.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006
2005
ACM Trans. Algorithms, 2005
Random Struct. Algorithms, 2005
Asymptotically optimal <i>K</i><sub><i>k</i></sub>packings of dense graphs via fractional <i>K</i><sub><i>k</i></sub>decompositions.
J. Comb. Theory B, 2005
Graphs Comb., 2005
Discuss. Math. Graph Theory, 2005
Proceedings of the Sixteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2005
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005
Proceedings of the Approximation, 2005
2004
J. Graph Theory, 2004
J. Graph Theory, 2004
J. Comb. Theory B, 2004
Discret. Math., 2004
Comb. Probab. Comput., 2004
Nowhere 0 mod p dominating sets in multigraphs.
Ars Comb., 2004
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming.
Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2004
2003
SIAM J. Discret. Math., 2003
Order, 2003
Graphs Comb., 2003
Discret. Math., 2003
Electron. J. Comb., 2003
A note on graphs without kconnected subgraphs.
Ars Comb., 2003
2002
Random Struct. Algorithms, 2002
Eur. J. Comb., 2002
Discret. Math., 2002
Electron. J. Comb., 2002
2001
J. Comb. Theory B, 2001
Graphs Comb., 2001
Discret. Math., 2001
2000
SIAM J. Discret. Math., 2000
J. Comb. Theory B, 2000
J. Comb. Theory A, 2000
Every<i>H</i>decomposition of<i>K<sub>n</sub></i>has a Nearly Resolvable Alternative.
Eur. J. Comb., 2000
Discret. Math., 2000
Comb. Probab. Comput., 2000
Electron. J. Comb., 2000
Comb., 2000
Graphs with Large Variance.
Ars Comb., 2000
1999
J. Graph Theory, 1999
J. Comb. Theory A, 1999
Graphs Comb., 1999
Discret. Math., 1999
Discret. Math., 1999
Electron. J. Comb., 1999
Graphs Having the Local Decomposition Property.
Ars Comb., 1999
1998
Random Struct. Algorithms, 1998
J. Graph Theory, 1998
J. Comb. Theory A, 1998
Discret. Math., 1998
1997
SIAM J. Discret. Math., 1997
J. Comb. Theory B, 1997
J. Complex., 1997
Discret. Math., 1997
Discret. Math., 1997
Comb. Probab. Comput., 1997
Electron. J. Comb., 1997
Electron. J. Comb., 1997
Algorithmica, 1997
1996
J. Graph Theory, 1996
J. Comb. Theory B, 1996
1995
The 123 Theorem and Its Extensions.
J. Comb. Theory A, 1995
J. ACM, 1995
1994
J. Algorithms, 1994
Colorcoding: a new method for finding simple paths, cycles and other small subgraphs within large graphs.
Proceedings of the TwentySixth Annual ACM Symposium on Theory of Computing, 1994
Proceedings of the Algorithms, 1994
1993
Comb. Probab. Comput., 1993
1992
Graphs Comb., 1992
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992