Irith Ben-Arroyo Hartman

According to our database, Irith Ben-Arroyo Hartman authored at least 21 papers between 1983 and 2020.

Collaborative distances:

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

2020

Using path decomposition enumeration to enhance route choice models.

Luk Knapen, Irith Ben-Arroyo Hartman, Tom Bellemans

Future Gener. Comput. Syst., 2020

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

2019

Contractors' minimum spanning tree.

Irith Ben-Arroyo Hartman, Ilan Newman

Australas. J Comb., 2019

2017

Enumerating minimum path decompositions to support route choice set generation.

Irith Ben-Arroyo Hartman, Luk Knapen, Tom Bellemans

Proceedings of the 8th International Conference on Ambient Systems, 2017

2015

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

2014

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

Proceedings of the 5th International Conference on Ambient Systems, 2014

2013

Group planning with time constraints.

Meirav Hadad, Sarit Kraus, Irith Ben-Arroyo Hartman, Avi Rosenfeld

Ann. Math. Artif. Intell., 2013

2012

A unified approach to known and unknown cases of Berge's conjecture.

Eli Berger, Irith Ben-Arroyo Hartman

J. Graph Theory, 2012

2008

Proof of Berge's strong path partition conjecture for k=2.

Eli Berger, Irith Ben-Arroyo Hartman

Eur. J. Comb., 2008

Editorial.

Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum

Discret. Appl. Math., 2008

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

2007

On path partitions and colourings in digraphs.

Irith Ben-Arroyo Hartman

Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006

Berge's conjecture on directed path partitions - a survey.

Irith Ben-Arroyo Hartman

Discret. Math., 2006

1994

On greene's theorem for digraphs.

Irith Ben-Arroyo Hartman, Fathi Saleh, Daniel Hershkowitz

J. Graph Theory, 1994

1993

Grid intersection graphs and boxicity.

S. Bellantoni, Irith Ben-Arroyo Hartman, Teresa M. Przytycka, Sue Whitesides

Discret. Math., 1993

On Greene-Kleitman's theorem for general digraphs.

Ron Aharoni, Irith Ben-Arroyo Hartman

Discret. Math., 1993

1992

Optimal K-Coloring and K-Nesting of Intervals.

Irith Ben-Arroyo Hartman

Proceedings of the Theory of Computing and Systems, 1992

1991

On grid intersection graphs.

Irith Ben-Arroyo Hartman, Ilan Newman, Ran Ziv

Discret. Math., 1991

1990

Ranking intervals under visibility constraints.

Herbert Edelsbrunner, Mark H. Overmars, Emo Welzl, Irith Ben-Arroyo Hartman, Jack A. Feldman

Int. J. Comput. Math., 1990

1988

Variations on the Gallai-Milgram theorem.

Irith Ben-Arroyo Hartman

Discret. Math., 1988

1983

Long Cycles Generate the Cycle Space of a Graph.

Irith Ben-Arroyo Hartman

Eur. J. Comb., 1983