E-LIB Suche - Ergebnisse für: Ben-Arroyo Hartman, Irith

1

A simulation study of commuting alternatives for day care c..:

Cich, Glenn ; Ben-Arroyo Hartman, Irith ; Knapen, Luk.
Future Generation Computer Systems. 110 (2020) - p. 323-337 , 2020

Link: https://doi.org/10.1016/..

2

Using path decomposition enumeration to enhance route choic..:

Knapen, Luk ; Ben-Arroyo Hartman, Irith ; Bellemans, Tom
Future Generation Computer Systems. 107 (2020) - p. 1077-1088 , 2020

Link: https://doi.org/10.1016/..

3

Scalability issues in optimal assignment for carpooling:

Knapen, Luk ; Ben-Arroyo Hartman, Irith ; Keren, Daniel...
Journal of Computer and System Sciences. 81 (2015) 3 - p. 568-584 , 2015

Link: https://doi.org/10.1016/..

4

Group planning with time constraints:

Hadad, Meirav ; Kraus, Sarit ; Ben-Arroyo Hartman, Irith.
Annals of Mathematics and Artificial Intelligence. 69 (2013) 3 - p. 243-291 , 2013

Link: https://doi.org/10.1007/..

5

The Third Haifa Workshop on Interdisciplinary Applications ..:

Ben-Arroyo Hartman, Irith ; Naor, Seffi ; Penn, Michal.
Discrete Applied Mathematics. 156 (2008) 4 - p. 407-408 , 2008

Link: https://doi.org/10.1016/..

6

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

Berger, Eli ; Ben-Arroyo Hartman, Irith
European Journal of Combinatorics. 29 (2008) 1 - p. 179-192 , 2008

Link: https://doi.org/10.1016/..

7

Editorial:

Ben-Arroyo Hartman, Irith ; Naor, Seffi ; Penn, Michal.
Discrete Applied Mathematics. 156 (2008) 4 - p. 410-411 , 2008

Link: https://doi.org/10.1016/..

8

Berge's conjecture on directed path partitions—a survey:

Ben-Arroyo Hartman, Irith
Discrete Mathematics. 306 (2006) 19-20 - p. 2498-2514 , 2006

Link: https://doi.org/10.1016/..

9

On Greene-Kleitman's theorem for general digraphs:

Aharoni, Ron ; Ben-Arroyo Hartman, Irith
Discrete Mathematics. 120 (1993) 1-3 - p. 13-24 , 1993

Link: https://doi.org/10.1016/..

10

Enumerating minimum path decompositions to support route ch..:

Hartman, Irith Ben-Arroyo ; Knapen, Luk ; Bellemans, Tom
Procedia Computer Science. 109 (2017) - p. 196-203 , 2017

Link: https://doi.org/10.1016/..

11

Determining structural route components from GPS traces:

Knapen, Luk ; Hartman, Irith Ben-Arroyo ; Schulz, Daniel...
Transportation Research Part B: Methodological. 90 (2016) - p. 156-171 , 2016

Link: https://doi.org/10.1016/..

12

Theory and Practice in Large Carpooling Problems:

Hartman, Irith Ben-Arroyo ; Keren, Daniel ; Dbai, Abed Abu...
Procedia Computer Science. 32 (2014) - p. 339-347 , 2014

Link: https://doi.org/10.1016/..

13

On greene's theorem for digraphs:

Hartman, Irith Ben-Arroyo ; Saleh, Fathi ; Hershkowitz, Daniel
Journal of Graph Theory. 18 (1994) 2 - p. 169-175 , 1994

Link: https://doi.org/10.1002/..

14

Ranking intervals under visibility constraints∗:

Edelsbrunner, Herbert ; Overmars, Mark H. ; Welzl, Emo..
International Journal of Computer Mathematics. 34 (1990) 3-4 - p. 129-144 , 1990

Link: https://doi.org/10.1080/..

15

Long Cycles Generate the Cycle Space of a Graph:

Hartman, Irith Ben-Arroyo
European Journal of Combinatorics. 4 (1983) 3 - p. 237-246 , 1983

Link: https://doi.org/10.1016/..