**o Theses:**

- "Optimal partitions and packings of paths in directed graphs", D.Sc. Thesis, Technion, Israel, 1986.
- "The cycle space of a graph", M. Math. thesis, University of Waterloo, Canada, 1982.

**o Books:**

I. B. A. Hartman, S. Naor, M. Penn and U. Rothblum (Eds.)

"A Special Issue of Discrete Applied Mathematics: The Third Haifa Workshop on Interdisciplinary Application of Graph-Theory, Combinatorics, and Algorithms", Elsevier, 2008.- Golumbic, Martin Charles, Hartman, Irith Ben-Arroyo (Eds.),

"Graph Theory, Combinations and Algorithms: Interdisciplinary Applications",Springer Science + Business Media, Inc. 2005.

- A. Ginsburg, N. Arad, Irith Hartman and T.Elam-Zoref, ”Graph Theory Study Guide “, 1992 - Open University, Tel-Aviv, Israel.

**o Papers:**

- I. B-A. Hartman, "NOTE: Optimal assignment for carpooling", submitted for publication.

- M. Hadad, S. Kraus, and I. B-A. Hartman, "Cooperative planning with time constraints", to appear in Annals of Mathematics and Artificial Intelligence, DOI 10.1007/s10472-013-9363-9.

- Eli Berger and Irith Ben-Arroyo Hartman - "Proof of Berge's Strong Path Partition Conjecture for
*k*= 2" - European Journal of Combinatorics, Vol 29, Issue 1 (Jan 2008), 179-192 .

- Irith Ben-Arroyo Hartman and Eli Berger - "A Unified Approach to Known and Unknown Cases of Berge's conjecture", Journal of Graph Theory (December, 2011), DOI: 10.1002/jgt.20648

- Irith Ben-Arroyo Hartman - " On Path Partitions and Colourings in Digraphs", Proc. Graph Theory, Computational Intelligence and Thought, (Israel, Sept 19-25, 2008).
*Lecture Notes in Computer Science*, LNCS 5420, Springer-Verlag (2009), 134-143"

- Irith Ben-Arroyo Hartman - "Berge's Conjecture on Directed Path Partitions - A Survey", Special Issue of Discrete Mathematics: "Creation and Recreation: A tribute to the Memory of Claude Berge" edited by A. Bondy, V. Chvatal. Discrete Mathematics 306 (2006) 2498-2514.

- Louis Caccetta, Irith Ben-Arroyo Hartman, and Jing Huang - “Concerning the Number of Edges in a Graph with Diameter Constraints”. Journal of Combinatorial Mathematics and Combinatorial Computing 36 (2001) 161-173.

- V. Manevitz, M. Shpitalni, and I. Ben-Arroyo Hartman “On the 4-colour problem.” Etgar September 1995 (in Hebrew).

- B. Radin, M. Shpitalni and I. Hartman, "Two-stage algorithm for rapid determination of the bending sequence in sheet metal products", Trans. of ASME J. of Mechanical Design, Vol. 119, No. 2, June 1997, pp.259-266.

- I. Ben-Arroyo Hartman, F. Salleh and D. Hershkowitz “On Greene's theorem for general digraphs” Journal of Graph Theory 18 (1994) 169-175.

- R. Aharoni and I. Ben-Arroyo Hartman - “On Greene-Kleitman's theorem for digraphs”. Discrete Mathematics 120 (1993) 13-24.

- S. Bellantoni, I. Ben-Arroyo Hartman, T. Przytycka, and S. Whitesides – “Grid intersection graphs and boxicity.” Discrete Mathematics 114 (1993) 41-49.

- I. Ben-Arroyo Hartman ”Optimal k-colouring and k-nesting of intervals.” Theory of Computing and Systems Eds. D. Dolev, Z. Galil, and M. Rodeh, Lecture Notes in Computer Science 601, Springer-Verlag Berlin Heidelberg 1992.

- I.Ben-Arroyo Hartman, I. Newman and R. Ziv - “On grid intersection graphs”. Discrete Mathematics 87 (1991) 41-52.

- H. Edelsbrunner, M. Overmars, E. Welzl, I. Ben-Arroyo Hartman, and J. Feldman. - “Ranking intervals under visibility constraints”. International J. Computer Math. 34(1990) 129-144.

- Irith Ben-Arroyo Hartman - “Variations on the Gallai-Milgram theorem”. Discrete Mathematics 71(1988) 95-105.

- R. Aharoni, I. Ben-Arroyo Hartman and A. J. Hoffman -“ Path partitions and packs of acyclic digraphs”. Pacific Journal of Mathematics 118(1985), 249-259.

- Irith Ben-Arroyo Hartman - “Long cycles generate the cycle space of a graph”. European Journal of Combinatorics 4(1983), 237-246.

- J. A. Bondy. I. Ben-Arroyo Hartman, and S.C. Locke - “A new proof of a theorem of Dirac.” Proc. of the Twelfth Southeastern Conference on Combinatorics, Graph Theory and Computing, Louisiana State University, Baton Rouge, LA. Congressus Numerantium 32(1981), 131-136.