Irith Ben-Arroyo Hartman

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