2008 |
10 | EE | Irith Ben-Arroyo Hartman,
Seffi Naor,
Michal Penn,
Uriel G. Rothblum:
The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms.
Discrete Applied Mathematics 156(4): 407-408 (2008) |
9 | EE | Irith Ben-Arroyo Hartman,
Seffi Naor,
Michal Penn,
Uriel G. Rothblum:
Editorial.
Discrete Applied Mathematics 156(4): 410-411 (2008) |
8 | EE | Eli Berger,
Irith Ben-Arroyo Hartman:
Proof of Berge's strong path partition conjecture for k=2.
Eur. J. Comb. 29(1): 179-192 (2008) |
2007 |
7 | | Irith Ben-Arroyo Hartman:
On path partitions and colourings in digraphs.
CTW 2007: 63-66 |
2006 |
6 | EE | Irith Ben-Arroyo Hartman:
Berge's conjecture on directed path partitions - a survey.
Discrete Mathematics 306(19-20): 2498-2514 (2006) |
1993 |
5 | EE | S. Bellantoni,
Irith Ben-Arroyo Hartman,
Teresa M. Przytycka,
Sue Whitesides:
Grid intersection graphs and boxicity.
Discrete Mathematics 114(1-3): 41-49 (1993) |
4 | EE | Ron Aharoni,
Irith Ben-Arroyo Hartman:
On Greene-Kleitman's theorem for general digraphs.
Discrete Mathematics 120(1-3): 13-24 (1993) |
1992 |
3 | | Irith Ben-Arroyo Hartman:
Optimal K-Coloring and K-Nesting of Intervals.
ISTCS 1992: 207-220 |
1991 |
2 | EE | Irith Ben-Arroyo Hartman,
Ilan Newman,
Ran Ziv:
On grid intersection graphs.
Discrete Mathematics 87(1): 41-52 (1991) |
1988 |
1 | EE | Irith Ben-Arroyo Hartman:
Variations on the Gallai-Milgram theorem.
Discrete Mathematics 71(2): 95-105 (1988) |