Nathan Wallheimer

According to our database, Nathan Wallheimer authored at least 7 papers between 2022 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2026

Witness-Sensitive Detection of Induced Diamonds.

Keren Censor-Hillel, Tomer Even, Virginia Vasillevska Williams, Nathan Wallheimer

CoRR, May, 2026

Equivalent Dichotomies for Triangle Detection in Subgraph, Induced, and Colored H-Free Graphs.

Amir Abboud, Ron Safier, Nathan Wallheimer

CoRR, February, 2026

Triangle Detection in H-Free Graphs.

Amir Abboud, Ron Safier, Nathan Wallheimer

Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

2025

Recognizing Sumsets is NP-Complete.

Amir Abboud, Nick Fischer, Ron Safier, Nathan Wallheimer

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

Worst-Case to Expander-Case Reductions: Derandomized and Generalized.

Amir Abboud, Nathan Wallheimer

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Worst-Case to Expander-Case Reductions.

Amir Abboud, Nathan Wallheimer

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

Improved Compression of the Okamura-Seymour Metric.

Shay Mozes, Nathan Wallheimer, Oren Weimann

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022