Irith Ben-Arroyo Hartman

Publication Activity (10 Years)

Years Active: 1983-2020
Publications (10 Years): 5

Top Topics

Optimal Assignment

Minimum Spanning Tree

Scalability Issues

Top Venues

Future Gener. Comput. Syst.

Ann. Math. Artif. Intell.

J. Comput. Syst. Sci.

Publications

Luk Knapen, Irith Ben-Arroyo Hartman, Tom Bellemans
Using path decomposition enumeration to enhance route choice models. Future Gener. Comput. Syst. 107 (2020)
Glenn Cich, Irith Ben-Arroyo Hartman, Luk Knapen, Davy Janssens
A simulation study of commuting alternatives for day care centres. Future Gener. Comput. Syst. 110 (2020)
Irith Ben-Arroyo Hartman, Ilan Newman
Contractors' minimum spanning tree. Australas. J Comb. 74 (2019)
Irith Ben-Arroyo Hartman, Luk Knapen, Tom Bellemans
Enumerating minimum path decompositions to support route choice set generation. ANT/SEIT (2017)
Luk Knapen, Irith Ben-Arroyo Hartman, Daniel Keren, Ansar-Ul-Haque Yasar, Sungjin Cho, Tom Bellemans, Davy Janssens, Geert Wets
Scalability issues in optimal assignment for carpooling. J. Comput. Syst. Sci. 81 (3) (2015)
Irith Ben-Arroyo Hartman, Daniel Keren, Abed Abu Dbai, Elad Cohen, Luk Knapen, Ansar-Ul-Haque Yasar, Davy Janssens
Theory and Practice in Large Carpooling Problems. ANT/SEIT (2014)
Meirav Hadad, Sarit Kraus, Irith Ben-Arroyo Hartman, Avi Rosenfeld
Group planning with time constraints. Ann. Math. Artif. Intell. 69 (3) (2013)
Eli Berger, Irith Ben-Arroyo Hartman
A unified approach to known and unknown cases of Berge's conjecture. J. Graph Theory 71 (3) (2012)
Irith Ben-Arroyo Hartman
On Path Partitions and Colourings in Digraphs. Graph Theory, Computational Intelligence and Thought (2009)
Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum
Editorial. Discret. Appl. Math. 156 (4) (2008)
Eli Berger, Irith Ben-Arroyo Hartman
Proof of Berge's strong path partition conjecture for k=2. Eur. J. Comb. 29 (1) (2008)
Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum
The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms. Discret. Appl. Math. 156 (4) (2008)
Irith Ben-Arroyo Hartman
On path partitions and colourings in digraphs. CTW (2007)
Irith Ben-Arroyo Hartman
Berge's conjecture on directed path partitions - a survey. Discret. Math. 306 (19-20) (2006)
Irith Ben-Arroyo Hartman, Fathi Saleh, Daniel Hershkowitz
On greene's theorem for digraphs. J. Graph Theory 18 (2) (1994)
S. Bellantoni, Irith Ben-Arroyo Hartman, Teresa M. Przytycka, Sue Whitesides
Grid intersection graphs and boxicity. Discret. Math. 114 (1-3) (1993)
Ron Aharoni, Irith Ben-Arroyo Hartman
On Greene-Kleitman's theorem for general digraphs. Discret. Math. 120 (1-3) (1993)
Irith Ben-Arroyo Hartman
Optimal K-Coloring and K-Nesting of Intervals. ISTCS (1992)
Irith Ben-Arroyo Hartman, Ilan Newman, Ran Ziv
On grid intersection graphs. Discret. Math. 87 (1) (1991)
Herbert Edelsbrunner, Mark H. Overmars, Emo Welzl, Irith Ben-Arroyo Hartman, Jack A. Feldman
Ranking intervals under visibility constraints. Int. J. Comput. Math. 34 (3-4) (1990)
Irith Ben-Arroyo Hartman
Variations on the Gallai-Milgram theorem. Discret. Math. 71 (2) (1988)
Irith Ben-Arroyo Hartman
Long Cycles Generate the Cycle Space of a Graph. Eur. J. Comb. 4 (3) (1983)