On grid intersection graphs IBA Hartman, I Newman, R Ziv Discrete Mathematics 87 (1), 41-52, 1991 | 152 | 1991 |

Grid intersection graphs and boxicity S Bellantoni, IBA Hartman, T Przytycka, S Whitesides Discrete mathematics 114 (1-3), 41-49, 1993 | 62 | 1993 |

Graph theory, combinatorics and algorithms: Interdisciplinary applications MC Golumbic, IBA Hartman Springer Science & Business Media, 2006 | 59 | 2006 |

Theory and practice in large carpooling problems IBA Hartman, D Keren, AA Dbai, E Cohen, L Knapen, D Janssens Procedia Computer Science 32, 339-347, 2014 | 45 | 2014 |

Path partitions and packs of acyclic digraphs. R Aharoni, IBA Hartman, AJ Hoffman | 38 | 1985 |

Berge's conjecture on directed path partitions—a survey IBA Hartman Discrete mathematics 306 (19-20), 2498-2514, 2006 | 26 | 2006 |

Group planning with time constraints M Hadad, S Kraus, I Ben-Arroyo Hartman, A Rosenfeld Annals of mathematics and artificial intelligence 69, 243-291, 2013 | 22 | 2013 |

Proof of Berge’s strong path partition conjecture for k= 2 E Berger, IBA Hartman European Journal of Combinatorics 29 (1), 179-192, 2008 | 22 | 2008 |

Determining structural route components from GPS traces L Knapen, IBA Hartman, D Schulz, T Bellemans, D Janssens, G Wets Transportation Research Part B: Methodological 90, 156-171, 2016 | 20 | 2016 |

Graph Theory, Combinatorics and Algorithms IBA Hartman, MC Golumbic Springer, 2005 | 18 | 2005 |

Scalability issues in optimal assignment for carpooling L Knapen, IBA Hartman, D Keren, S Cho, T Bellemans, D Janssens, ... Journal of Computer and System Sciences 81 (3), 568-584, 2015 | 17 | 2015 |

Long cycles generate the cycle space of a graph IBA Hartman European Journal of Combinatorics 4 (3), 237-246, 1983 | 17 | 1983 |

On Greene's theorem for digraphs IBA Hartman, F Saleh, D Hershkowitz Journal of Graph Theory 18 (2), 169-175, 1994 | 15 | 1994 |

Variations on the Gallai-Milgram theorem IBA Hartman Discrete mathematics 71 (2), 95-105, 1988 | 11 | 1988 |

On Greene-Kleitman's theorem for general digraphs R Aharoni, IBA Hartman Discrete mathematics 120 (1-3), 13-24, 1993 | 9 | 1993 |

Optimal k-colouring and k-nesting of intervals IBA Hartman Israel Symposium on Theory of Computing and Systems, 207-220, 1992 | 6 | 1992 |

A new proof of a theorem of Dirac JA Bondy, BENA HARTMAN, L SC | 6 | 1981 |

Using path decomposition enumeration to enhance route choice models L Knapen, IBA Hartman, T Bellemans Future Generation Computer Systems 107, 1077-1088, 2020 | 4 | 2020 |

Optimal assignment for carpooling-draft IBA Hartman Draft, 2013 | 3 | 2013 |

A unified approach to known and unknown cases of Berge's conjecture E Berger, IBA Hartman Journal of Graph Theory 71 (3), 317-330, 2012 | 3 | 2012 |