1993 …2021

Research activity per year

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

Search results

  • 2021

    Polynomial Time k-Shortest Multi-criteria Prioritized and All-Criteria-Disjoint Paths: (Extended Abstract)

    Dinitz, Y., Dolev, S. & Kumar, M., 1 Jan 2021, Cyber Security Cryptography and Machine Learning - 5th International Symposium, CSCML 2021, Proceedings. Dolev, S., Margalit, O., Pinkas, B. & Schwarzmann, A. (eds.). Springer Science and Business Media Deutschland GmbH, p. 266-274 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12716 LNCS).

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

  • 2020

    Brief Announcements: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs

    Dinitz, Y., Dolev, S. & Kumar, M., 1 Jan 2020, Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Proceedings. Devismes, S. & Mittal, N. (eds.). Springer Science and Business Media Deutschland GmbH, p. 113-117 5 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12514 LNCS).

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

    1 Scopus citations
  • 2019

    Network cloudification

    Dinitz, Y., Dolev, S., Frenkel, S., Binun, A. & Khankin, D., 1 Jan 2019, Cyber Security Cryptography and Machine Learning - 3rd International Symposium, CSCML 2019, Proceedings. Dolev, S., Hendler, D., Lodha, S. & Yung, M. (eds.). Springer Verlag, p. 249-259 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11527 LNCS).

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

    2 Scopus citations
  • 2018

    Make&activate-before-break: Policy preserving seamless routes replacement in SDN

    Dinitz, Y., Dolev, S. & Khankin, D., 1 Jan 2018, 25th International Colloquium, SIROCCO 2018, Revised Selected Papers. Lotker, Z. & Patt-Shamir, B. (eds.). Springer Verlag, p. 34-37 4 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11085).

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

    2 Scopus citations
  • 2017

    Dependence graph and master switch for seamless dependent routes replacement in SDN (extended abstract)

    Dinitz, Y., Dolev, S. & Khankin, D., 8 Dec 2017, 2017 IEEE 16th International Symposium on Network Computing and Applications, NCA 2017. Avresky, D. R., Gkoulalas-Divanis, A., Avresky, D. R. & Correia, M. P. (eds.). Institute of Electrical and Electronics Engineers Inc., p. 1-7 7 p. (2017 IEEE 16th International Symposium on Network Computing and Applications, NCA 2017; vol. 2017-January).

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

    7 Scopus citations
  • 2012

    RNA tree comparisons via unrooted unordered alignments

    Milo, N., Zakov, S., Katzenelson, E., Bachmat, E., Dinitz, Y. & Ziv-Ukelson, M., 1 Oct 2012, Algorithms in Bioinformatics - 12th International Workshop, WABI 2012, Proceedings. p. 135-148 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7534 LNBI).

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

  • 2008

    Shallow-low-light trees, and tight lower bounds for euclidean spanners

    Dinitz, Y., Elkin, M. & Solomon, S., 31 Dec 2008, Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008. p. 519-528 10 p. 4690985. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

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

    13 Scopus citations
  • 2007

    On optimal solutions for the bottleneck tower of hanoi problem

    Dinitz, Y. & Solomon, S., 1 Jan 2007, SOFSEM 2007: Theory and Practice of Computer Science - 33rd Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Springer Verlag, p. 248-259 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4362 LNCS).

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

    6 Scopus citations
  • 2006

    Optimal algorithms for Tower of Hanoi problems with relaxed placement rules

    Dinitz, Y. & Solomon, S., 1 Dec 2006, Algorithms and Computation - 17th International Symposium, ISAAC 2006, Proceedings. p. 36-47 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4288 LNCS).

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

    5 Scopus citations
  • 2001

    Planarity of the 2-level cactus model

    Cornelsen, S., Dinitz, Y. & Wagner, D., 1 Jan 2001, Graph-Theoretic Concepts in Computer Science - 27th International Workshop, WG 2001, Proceedings. Brandstadt, A. & Le, V. B. (eds.). Springer Verlag, p. 91-102 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2204).

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

  • 2000

    Incremental maintenance of the 5-edge-connectivity classes of a graph

    Dinitz, Y. & Nossenson, R., 1 Jan 2000, Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings. Halldórsson, M. M. (ed.). Springer Verlag, p. 272-285 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1851).

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

    4 Scopus citations
  • 1997

    Finding optimum k-vertex connected spanning subgraphs: Improved approximation algorithms for k=3, 4, 5

    Dinitz, Y. & Nutov, Z., 1 Jan 1997, Algorithms and Complexity - 3rd Italian Conference, CIAC 1997, Proceedings. Bongiovanni, G., Bovet, D. P. & Di Battista, G. (eds.). Springer Verlag, p. 13-24 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1203).

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

    4 Scopus citations
  • On optimal graphs embedded into paths and rings, with analysis using l1-spheres

    Dinitz, Y., Feighelstein, M. & Zaks, S., 1 Jan 1997, Graph-Theoretic Concepts in Computer Science - 23rd International Workshop, WG 1997, Proceedings. Mothring, R. H. (ed.). Springer Verlag, p. 171-183 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1335).

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

    9 Scopus citations
  • 1995

    Locally orientable graphs, cell structures, and a new algorithm for the incremental maintenance of connectivity carcasses

    Dinitz, Y. & Vainshtein, A., 22 Jan 1995, Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995. Association for Computing Machinery, p. 302-311 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    6 Scopus citations
  • 1994

    The connectivity carcass of a vertex subset in a graph and its incremental maintenance

    Dinitz, Y. E. & Vainshteint, A., 23 May 1994, Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC 1994. Association for Computing Machinery, p. 716-725 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

    15 Scopus citations
  • 1993

    The 3-edge-components and a structural description of all 3-edge-cuts in a graph

    Dinitz, E., 1 Jan 1993, Graph-Theoretic Concepts in Computer Science - 18th International Workshop, WG 1992, Proceedings. Mayr, E. W. (ed.). Springer Verlag, p. 145-157 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 657 LNCS).

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

    4 Scopus citations