Itay Tabib

According to our database, Itay Tabib authored at least 2 papers between 2022 and 2024.

Collaborative distances:

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

2024

Generalized Longest Simple Path Problems: Speeding up Search Using SPQR Trees.

Gal Dahan, Itay Tabib, Solomon Eyal Shimony, Yefim Dinitz

Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

2022

Generalized Longest Path Problems.

Gal Dahan, Itay Tabib, Solomon Eyal Shimony, Ariel Felner

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022