University Logo Header

הפקולטה למדעי המחשב והמידע

אוניברסיטת חיפה

EN

University Logo Header
להרשמה
אוהד טרבלסי

ד"ר אוהד טרבלסי

פרסומים▼

  • Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs, Chuzhoy, J., Mosenzon, E. & Trabelsi, O., 2026, Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026. Larsen, K. G. & Saha, B. (eds.). Association for Computing Machinery, p. 5586-5623 38 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2026-January).
  • Breaking the O(mn)-Time Barrier for Vertex-Weighted Global Minimum Cut, Chuzhoy, J. & Trabelsi, O., 15 Jun 2025, STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Koucky, M. & Bansal, N. (eds.). Association for Computing Machinery, p. 144-155 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).
  • (Almost) Ruling Out SETH Lower Bounds for All-Pairs Max-Flow*, Trabelsi, O., 2025, Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025. Association for Computing Machinery, p. 2132-2156 25 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 4).
  • Bridge Girth: A Unifying Notion in Network Design, Bodwin, G., Hoppenworth, G. & Trabelsi, O., 2023, Proceedings - 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, FOCS 2023. IEEE Computer Society, p. 600-648 49 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).
  • Friendly Cut Sparsifiers and Faster Gomory-Hu Trees, Abboud, A., Krauthgamer, R. & Trabelsi, O., 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, p. 3630-3649 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2022-January).
  • APMF, Abboud, A., Krauthgamer, R. & Trabelsi, O., 2022, Proceedings - 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021. IEEE Computer Society, p. 1135-1146 12 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2022-February).
  • Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time, Abboud, A., Krauthgamer, R., Li, J., Panigrahi, D., Saranurak, T. & Trabelsi, O., 2022, Proceedings - 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science, FOCS 2022. IEEE Computer Society, p. 884-895 12 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2022-October).
  • Subcubic Algorithms for Gomory–Hu Tree in Unweighted Graphs, Abboud, A., Krauthgamer, R. & Trabelsi, O., 15 Jun 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). Association for Computing Machinery, p. 1725-1737 13 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).
  • New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs, Abboud, A., Krauthgamer, R. & Trabelsi, O., 2021, In: Theory of Computing. 17, 5.
  • Cut-equivalent trees are optimal for min-cut queries, Abboud, A., Krauthgamer, R. & Trabelsi, O., Nov 2020, Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020. IEEE Computer Society, p. 105-118 14 p. 9317894. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2020-November).
  • New algorithms and lower bounds for all-pairs max-flow in undirected graphs, Abboud, A., Krauthgamer, R. & Trabelsi, O., 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, p. 48-61 14 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2020-January).
  • Faster algorithms for all-pairs bounded min-cuts, Abboud, A., Georgiadis, L., Italiano, G. F., Krauthgamer, R., Parotsidis, N., Trabelsi, O., Uznański, P. & Wolleb-Graf, D., 1 Jul 2019, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Baier, C., Chatzigiannakis, I., Flocchini, P. & Leonardi, S. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 7. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 132).
  • The set cover conjecture and subgraph isomorphism with a tree pattern, Krauthgamer, R. & Trabelsi, O., 1 Mar 2019, 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019. Niedermeier, R. & Paul, C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 45. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 126).
  • Relaxed Voronoi: A simple framework for terminal-clustering problems, Filtser, A., Krauthgamer, R. & Trabelsi, O., Jan 2019, 2nd Symposium on Simplicity in Algorithms, SOSA 2019 - Co-located with the 30th ACM-SIAM Symposium on Discrete Algorithms, SODA 2019. Fineman, J. T. & Mitzenmacher, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 10. (OpenAccess Series in Informatics; vol. 69).
  • Bounded-Hop Communication Networks, Carmi, P., Chaitman-Yerushalmi, L. & Trabelsi, O., 1 Nov 2018, In: Algorithmica. 80, 11, p. 3050-3077 28 p.
  • Conditional lower bounds for all-pairs max-flow, Krauthgamer, R. & Trabelsi, O., Aug 2018, In: ACM Transactions on Algorithms. 14, 4, 42.
  • Conditional lower bounds for all-pairs max-flow, Krauthgamer, R. & Trabelsi, O., 1 Jul 2017, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. Muscholl, A., Indyk, P., Kuhn, F. & Chatzigiannakis, I. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 20. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 80).
  • On the bounded-hop range assignment problem, Carmi, P., Chaitman-Yerushalmi, L. & Trabelsi, O., 2015, Algorithms and Data Structures - 14th International Symposium, WADS 2015, Proceedings. Dehne, F., Sack, J.-R. & Stege, U. (eds.). Springer Verlag, p. 140-151 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9214).

תחומי מחקר▼

  • אלגוריתמים
  • סיבוכיות עדינה