Irith Ben-Arroyo Hartman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 21 from 21

2020

A simulation study of commuting alternatives for day care centresGlenn Cich, Irith Ben-Arroyo Hartman, Luk Knapen, Davy Janssens. fgcs, 110:323-337, 2020. [doi]

Using path decomposition enumeration to enhance route choice modelsLuk Knapen, Irith Ben-Arroyo Hartman, Tom Bellemans. fgcs, 107:1077-1088, 2020. [doi]

2019

Contractors' minimum spanning treeIrith Ben-Arroyo Hartman, Ilan Newman. ajc, 74:33-45, 2019. [doi]

2017

Enumerating minimum path decompositions to support route choice set generationIrith Ben-Arroyo Hartman, Luk Knapen, Tom Bellemans. ant 2017: 196-203 [doi]

2015

Scalability issues in optimal assignment for carpoolingLuk Knapen, Irith Ben-Arroyo Hartman, Daniel Keren, Ansar-Ul-Haque Yasar, Sungjin Cho, Tom Bellemans, Davy Janssens, Geert Wets. jcss, 81(3):568-584, 2015. [doi]

2014

Theory and Practice in Large Carpooling ProblemsIrith Ben-Arroyo Hartman, Daniel Keren, Abed Abu Dbai, Elad Cohen, Luk Knapen, Ansar-Ul-Haque Yasar, Davy Janssens. ant 2014: 339-347 [doi]

2013

Group planning with time constraintsMeirav Hadad, Sarit Kraus, Irith Ben-Arroyo Hartman, Avi Rosenfeld. AMAI, 69(3):243-291, 2013. [doi]

2012

A unified approach to known and unknown cases of Berge's conjectureEli Berger, Irith Ben-Arroyo Hartman. jgt, 71(3):317-330, 2012. [doi]

2009

On Path Partitions and Colourings in DigraphsIrith Ben-Arroyo Hartman. BIRTHDAY 2009: 134-143 [doi]

2008

Proof of Berge s strong path partition conjecture for k=2Eli Berger, Irith Ben-Arroyo Hartman. ejc, 29(1):179-192, 2008. [doi]

The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and AlgorithmsIrith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum. DAM, 156(4):407-408, 2008. [doi]

2007

On path partitions and colourings in digraphsIrith Ben-Arroyo Hartman. colognetwente 2007: 63-66

2006

Berge s conjecture on directed path partitions - a surveyIrith Ben-Arroyo Hartman. DM, 306(19-20):2498-2514, 2006. [doi]

1994

On greene's theorem for digraphsIrith Ben-Arroyo Hartman, Fathi Saleh, Daniel Hershkowitz. jgt, 18(2):169-175, 1994. [doi]

1993

On Greene-Kleitman s theorem for general digraphsRon Aharoni, Irith Ben-Arroyo Hartman. DM, 120(1-3):13-24, 1993. [doi]

Grid intersection graphs and boxicityS. Bellantoni, Irith Ben-Arroyo Hartman, Teresa M. Przytycka, Sue Whitesides. DM, 114(1-3):41-49, 1993. [doi]

1992

Optimal K-Coloring and K-Nesting of IntervalsIrith Ben-Arroyo Hartman. istcs 1992: 207-220

1991

On grid intersection graphsIrith Ben-Arroyo Hartman, Ilan Newman, Ran Ziv. DM, 87(1):41-52, 1991. [doi]

1990

Ranking intervals under visibility constraintsHerbert Edelsbrunner, Mark H. Overmars, Emo Welzl, Irith Ben-Arroyo Hartman, Jack A. Feldman. ijcm, 34(3-4):129-144, 1990. [doi]

1988

Variations on the Gallai-Milgram theoremIrith Ben-Arroyo Hartman. DM, 71(2):95-105, 1988. [doi]

1983

Long Cycles Generate the Cycle Space of a GraphIrith Ben-Arroyo Hartman. ejc, 4(3):237-246, 1983. [doi]

Sign in or sign up to see more results.

runs on WebDSL