1992 …2024

Research activity per year

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 2022

    Counting Homomorphic Cycles in Degenerate Graphs

    Gishboliner, L., Levanzov, Y., Shapira, A. & Yuster, R., 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, p. 417-430 14 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2022-January).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2014

    On the compatibility of quartet trees

    Alon, N., Snir, S. & Yuster, R., 2014, Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. Association for Computing Machinery, p. 535-545 11 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2013

    Approximating the diameter of planar graphs in near linear time

    Weimann, O. & Yuster, R., 2013, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings. PART 1 ed. p. 828-839 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7965 LNCS, no. PART 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • 2012

    Near linear time construction of an approximate index for all maximum consecutive sub-sums of a sequence

    Cicalese, F., Laber, E., Weimann, O. & Yuster, R., 2012, Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Proceedings. p. 149-158 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7354 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2011

    A linear time approximation scheme for maximum quartet consistency on sparse sampled inputs

    Snir, S. & Yuster, R., 2011, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 14th International Workshop, APPROX 2011 and 15th International Workshop, RANDOM 2011, Proceedings. p. 339-350 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6845 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Distance oracles for vertex-labeled graphs

    Hermelin, D., Levy, A., Weimann, O. & Yuster, R., 2011, Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings. PART 2 ed. p. 490-501 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6756 LNCS, no. PART 2).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2010

    Generating a d-dimensional linear subspace efficiently

    Yuster, R., 2010, Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery (ACM), p. 467-470 4 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Reconstructing approximate phylogenetic trees from quartet samples

    Snir, S. & Yuster, R., 2010, Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery (ACM), p. 1035-1044 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Replacement paths via fast matrix multiplication

    Weimann, O. & Yuster, R., 2010, Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010. IEEE Computer Society, p. 655-662 8 p. 5671330. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Solving linear systems through nested dissection

    Alon, N. & Yuster, R., 2010, Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010. IEEE Computer Society, p. 225-234 10 p. 5671172. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Two-phase algorithms for the parametric shortest path problem

    Chakraborty, S., Fischer, E., Lachish, O. & Yuster, R., 2010, STACS 2010 - 27th International Symposium on Theoretical Aspects of Computer Science. p. 167-178 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 5).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2009

    Computing the girth of a planar graph in O(n logn) time

    Weimann, O. & Yuster, R., 2009, Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings. PART 1 ed. p. 764-773 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5555 LNCS, no. PART 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Efficient algorithms on sets of permutations, dominance, and real-weighted APSP

    Yuster, R., 2009, Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery (ACM), p. 950-957 8 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Hardness and algorithms for rainbow connectivity

    Chakraborty, S., Fischer, E., Matsliah, A. & Yuster, R., 2009, STACS 2009 - 26th International Symposium on Theoretical Aspects of Computer Science. p. 243-254 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 3).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2008

    Matrix sparsification for rank and determinant computations via nested dissection

    Yuster, R., 2008, Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008. p. 137-145 9 p. 4690948. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets

    Yuster, R., 2008, Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques - 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Proceedings. p. 596-601 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5171 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • The effect of induced subgraphs on quasi-randomness

    Shapira, A. & Yuster, R., 2008, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 789-798 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2007

    All-pairs bottleneck paths for general graphs in truly sub-cubic time

    Vassilevska, V., Williams, R. & Yuster, R., 2007, STOC'07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing. p. 585-589 5 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • All-Pairs Bottleneck Paths in vertex weighted graphs

    Shapira, A., Yuster, R. & Zwick, U., 2007, Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007. Association for Computing Machinery, p. 978-985 8 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 07-09-January-2007).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Almost exact matchings

    Yuster, R., 2007, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 10th International Workshop, APPROX 2007 and 11th International Workshop, RANDOM 2007, Proceedings. Springer Verlag, p. 286-295 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4627 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Fast algorithms for maximum subset matching and all-pairs shortest paths in graphs with a (not so) small vertex cover

    Alon, N. & Yustcr, R., 2007, Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings. Springer Verlag, p. 175-186 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4698 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Maximum matching in graphs with an excluded minor

    Yuster, R. & Zwick, U., 2007, Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007. Association for Computing Machinery, p. 108-117 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 07-09-January-2007).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2006

    Finding the smallest H-subgraph in real weighted graphs and related problems

    Vassilevska, V., Williams, R. & Yuster, R., 2006, Automata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings. Springer Verlag, p. 262-273 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4051 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • 2005

    Answering distance queries in directed graphs using fast matrix multiplication

    Yuster, R. & Zwick, U., 2005, Proceedings - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005. p. 389-396 8 p. 1530731. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2005).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 1994

    Color-coding: A new method for finding simple paths, cycles and other small subgraphs within large graphs

    Alon, N., Yuster, R. & Zwick, U., 23 May 1994, Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC 1994. Association for Computing Machinery, p. 326-335 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129502).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Finding even cycles even faster

    Yuster, R. & Zwick, U., 1994, Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings. Abiteboul, S. & Shamir, E. (eds.). Springer Verlag, p. 532-543 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 820 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 1992

    The algorithmic aspects of the regularity lemma

    Alon, N., Duke, R. A., Lefmann, H., Rödl, V. & Yuster, R., 1992, Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, p. 473-481 9 p. 267804. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 1992-October).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access