Skip to main navigation Skip to search Skip to main content
20192026

Research activity per year

Fingerprint

Dive into the research topics where Amir Abboud is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
  • 1 Similar Profiles

Collaborations and top research areas from the last five years

Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
  • A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection

    Abboud, A., Akmal, S. & Fischer, N., 1 Jan 2026, Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026. Larsen, K. G. & Saha, B. (eds.). p. 3562-3599 38 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Vol. 2026-January).

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

  • Faster Combinatorial k-Clique Algorithms

    Abboud, A., Fischer, N. & Shechter, Y., 22 May 2026, In: Algorithmica. 88, 3, 48.

    Research output: Contribution to journalArticlepeer-review

  • Triangle Detection in H-Free Graphs

    Abboud, A., Safier, R. & Wallheimer, N., 23 Jan 2026, 17th Innovations in Theoretical Computer Science Conference,ITCS 2026. Saraf, S. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 19 p. 1. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 362).

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

    Open Access
  • All-Pairs Shortest Paths with Few Weights per Node

    Abboud, A., Fischer, N., Jin, C., Williams, V. V. & Xi, Z., 15 Jun 2025, STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Koucky, M. & Bansal, N. (eds.). p. 1956-1964 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    Open Access
    File
    46 Downloads (Pure)
  • Deterministic Almost-Linear-Time Gomory-Hu Trees

    Abboud, A., Kyng, R., Li, J., Panigrahi, D., Gutenberg, M. P., Saranurak, T., Yuan, W. & Yuan, W., 14 Dec 2025, Proceedings - 2025 IEEE 66th Annual Symposium on Foundations of Computer Science, FOCS 2025. IEEE Computer Society, p. 659-666 8 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

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