Irith Ben-Arroyo Hartman

发表

Berge's conjecture on directed path partitions - a survey

Irith Ben-Arroyo Hartman, I. Hartman, 2006, Discret. Math..

On greene's theorem for digraphs

Fathi Saleh, Daniel Hershkowitz, Irith Ben-Arroyo Hartman, 1994, J. Graph Theory.

Ranking intervals under visibility constraints

Mark H. Overmars, Herbert Edelsbrunner, Emo Welzl, 1990, Int. J. Comput. Math..

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

Eli Berger, Irith Ben-Arroyo Hartman, 2008, Eur. J. Comb..

Variations on the Gallai-Milgram theorem

Irith Ben-Arroyo Hartman, I. Hartman, 1988, Discret. Math..

Using path decomposition enumeration to enhance route choice models

Luk Knapen, Tom Bellemans, Irith Ben-Arroyo Hartman, 2017, Future Gener. Comput. Syst..

Editorial

Joseph Naor, Uriel G. Rothblum, Michal Penn, 2008, Discret. Appl. Math..

On grid intersection graphs

Ilan Newman, Ran Ziv, Irith Ben-Arroyo Hartman, 1991, Discret. Math..

Group planning with time constraints

Sarit Kraus, Avi Rosenfeld, Meirav Hadad, 2013, Annals of Mathematics and Artificial Intelligence.

Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications

Martin Charles Golumbic, Irith Ben-Arroyo Hartman, 2011 .

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

Eli Berger, Irith Ben-Arroyo Hartman, E. Berger, 2012, J. Graph Theory.

The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms

Joseph Naor, Uriel G. Rothblum, Michal Penn, 2008, Discret. Appl. Math..

Enumerating minimum path decompositions to support route choice set generation

Luk Knapen, Tom Bellemans, Irith Ben-Arroyo Hartman, 2017, ANT/SEIT.

On Path Partitions and Colourings in Digraphs

Irith Ben-Arroyo Hartman, 2007, Graph Theory, Computational Intelligence and Thought.

Long Cycles Generate the Cycle Space of a Graph

Irith Ben-Arroyo Hartman, I. Hartman, 1983, Eur. J. Comb..

Scalability issues in optimal assignment for carpooling

Davy Janssens, Geert Wets, Luk Knapen, 2015, J. Comput. Syst. Sci..

Theory and Practice in Large Carpooling Problems

Davy Janssens, Luk Knapen, Daniel Keren, 2014, ANT/SEIT.

On Greene-Kleitman's theorem for general digraphs

Ron Aharoni, Irith Ben-Arroyo Hartman, 1993, Discret. Math..

Optimal K-Coloring and K-Nesting of Intervals

Irith Ben-Arroyo Hartman, I. Hartman, 1992, ISTCS.

A simulation study of commuting alternatives for day care centres

Davy Janssens, Luk Knapen, Glenn Cich, 2020, Future Gener. Comput. Syst..

Grid intersection graphs and boxicity

Sue Whitesides, Teresa M. Przytycka, S. Bellantoni, 1993, Discret. Math..

Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications (Operations Research/Computer Science Interfaces Series)

Martin Charles Golumbic, Irith Ben-Arroyo Hartman, 2005 .

An Extension of the Greene and Greene-Kleitman Theorems to all Digraphs

Irith Ben-Arroyo Hartman, Benjamin de Rothschild, 2002 .

A New Proof of Berge ’ s Strong Path Partition Conjecture for Acyclic Digraphs

Irith Ben-Arroyo Hartman, 2008 .

Graph Theory, Combinatorics and Algorithms

Martin Charles Golumbic, Irith Ben-Arroyo Hartman, 2005 .

Determining structural route components from GPS traces

Davy Janssens, Geert Wets, Luk Knapen, 2016 .