Long Cycles Generate the Cycle Space of a Graph. - Irith Ben-Arroyo Hartman (Eur. J. Comb., 1983)

Variations on the Gallai-Milgram theorem. - Irith Ben-Arroyo Hartman (Discret. Math., 1988)

Ranking intervals under visibility constraints. - Herbert Edelsbrunner; Mark H. Overmars; Emo Welzl; Irith Ben-Arroyo Hartman; Jack A. Feldman (Int. J. Comput. Math., 1990)

On grid intersection graphs. - Irith Ben-Arroyo Hartman; Ilan Newman; Ran Ziv (Discret. Math., 1991)

Optimal K-Coloring and K-Nesting of Intervals. - Irith Ben-Arroyo Hartman (ISTCS, 1992)

On Greene-Kleitman's theorem for general digraphs. - Ron Aharoni; Irith Ben-Arroyo Hartman (Discret. Math., 1993)

Grid intersection graphs and boxicity. - S. Bellantoni; Irith Ben-Arroyo Hartman; Teresa M. Przytycka; Sue Whitesides (Discret. Math., 1993)

On greene's theorem for digraphs. - Irith Ben-Arroyo Hartman; Fathi Saleh; Daniel Hershkowitz (J. Graph Theory, 1994)

Berge's conjecture on directed path partitions - a survey. - Irith Ben-Arroyo Hartman (Discret. Math., 2006)

On path partitions and colourings in digraphs. - Irith Ben-Arroyo Hartman (CTW, 2007)

The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms. - Irith Ben-Arroyo Hartman; Seffi Naor; Michal Penn; Uriel G. Rothblum (Discret. Appl. Math., 2008)

Editorial. - Irith Ben-Arroyo Hartman; Seffi Naor; Michal Penn; Uriel G. Rothblum (Discret. Appl. Math., 2008)

Proof of Berge's strong path partition conjecture for k=2. - Eli Berger; Irith Ben-Arroyo Hartman (Eur. J. Comb., 2008)

A unified approach to known and unknown cases of Berge's conjecture. - Eli Berger; Irith Ben-Arroyo Hartman (J. Graph Theory, 2012)

Group planning with time constraints. - Meirav Hadad; Sarit Kraus; Irith Ben-Arroyo Hartman; Avi Rosenfeld (Ann. Math. Artif. Intell., 2013)

Theory and Practice in Large Carpooling Problems. - Irith Ben-Arroyo Hartman; Daniel Keren; Abed Abu Dbai; Elad Cohen; Luk Knapen; Ansar-Ul-Haque Yasar; Davy Janssens (ANT/SEIT, 2014)

Scalability issues in optimal assignment for carpooling. - Luk Knapen; Irith Ben-Arroyo Hartman; Daniel Keren; Ansar-Ul-Haque Yasar; Sungjin Cho; Tom Bellemans; Davy Janssens; Geert Wets (J. Comput. Syst. Sci., 2015)

Enumerating minimum path decompositions to support route choice set generation. - Irith Ben-Arroyo Hartman; Luk Knapen; Tom Bellemans (ANT/SEIT, 2017)

Contractors' minimum spanning tree. - Irith Ben-Arroyo Hartman; Ilan Newman (Australas. J Comb., 2019)

A simulation study of commuting alternatives for day care centres. - Glenn Cich; Irith Ben-Arroyo Hartman; Luk Knapen; Davy Janssens (Future Gener. Comput. Syst., 2020)

Using path decomposition enumeration to enhance route choice models. - Luk Knapen; Irith Ben-Arroyo Hartman; Tom Bellemans (Future Gener. Comput. Syst., 2020)