default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIrith Ben-Arroyo Hartman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
Journal Articles
- 2020
[j17]Luk Knapen
, Irith Ben-Arroyo Hartman, Tom Bellemans:
Using path decomposition enumeration to enhance route choice models. Future Gener. Comput. Syst. 107: 1077-1088 (2020)- [j16]Glenn Cich, Irith Ben-Arroyo Hartman, Luk Knapen, Davy Janssens:
A simulation study of commuting alternatives for day care centres. Future Gener. Comput. Syst. 110: 323-337 (2020) - 2019
- [j15]Irith Ben-Arroyo Hartman, Ilan Newman:
Contractors' minimum spanning tree. Australas. J Comb. 74: 33-45 (2019) - 2015
- [j14]Luk Knapen, Irith Ben-Arroyo Hartman, Daniel Keren, Ansar-Ul-Haque Yasar, Sungjin Cho, Tom Bellemans, Davy Janssens, Geert Wets:
Scalability issues in optimal assignment for carpooling. J. Comput. Syst. Sci. 81(3): 568-584 (2015) - 2013
- [j13]Meirav Hadad, Sarit Kraus, Irith Ben-Arroyo Hartman, Avi Rosenfeld:
Group planning with time constraints. Ann. Math. Artif. Intell. 69(3): 243-291 (2013) - 2012
- [j12]Eli Berger, Irith Ben-Arroyo Hartman:
A unified approach to known and unknown cases of Berge's conjecture. J. Graph Theory 71(3): 317-330 (2012) - 2008
- [j11]Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum:
The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms. Discret. Appl. Math. 156(4): 407-408 (2008) - [j10]Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum:
Editorial. Discret. Appl. Math. 156(4): 410-411 (2008) - [j9]Eli Berger, Irith Ben-Arroyo Hartman:
Proof of Berge's strong path partition conjecture for k=2. Eur. J. Comb. 29(1): 179-192 (2008) - 2006
- [j8]Irith Ben-Arroyo Hartman:
Berge's conjecture on directed path partitions - a survey. Discret. Math. 306(19-20): 2498-2514 (2006) - 1994
- [j7]Irith Ben-Arroyo Hartman, Fathi Saleh, Daniel Hershkowitz:
On greene's theorem for digraphs. J. Graph Theory 18(2): 169-175 (1994) - 1993
- [j6]S. Bellantoni, Irith Ben-Arroyo Hartman, Teresa M. Przytycka, Sue Whitesides:
Grid intersection graphs and boxicity. Discret. Math. 114(1-3): 41-49 (1993) - [j5]Ron Aharoni, Irith Ben-Arroyo Hartman:
On Greene-Kleitman's theorem for general digraphs. Discret. Math. 120(1-3): 13-24 (1993) - 1991
- [j4]Irith Ben-Arroyo Hartman, Ilan Newman, Ran Ziv:
On grid intersection graphs. Discret. Math. 87(1): 41-52 (1991) - 1990
- [j3]Herbert Edelsbrunner, Mark H. Overmars, Emo Welzl, Irith Ben-Arroyo Hartman, Jack A. Feldman:
Ranking intervals under visibility constraints. Int. J. Comput. Math. 34(3-4): 129-144 (1990) - 1988
- [j2]Irith Ben-Arroyo Hartman:
Variations on the Gallai-Milgram theorem. Discret. Math. 71(2): 95-105 (1988) - 1983
- [j1]Irith Ben-Arroyo Hartman:
Long Cycles Generate the Cycle Space of a Graph. Eur. J. Comb. 4(3): 237-246 (1983)
Conference and Workshop Papers
- 2017
- [c5]Irith Ben-Arroyo Hartman, Luk Knapen, Tom Bellemans:
Enumerating minimum path decompositions to support route choice set generation. ANT/SEIT 2017: 196-203 - 2014
- [c4]Irith Ben-Arroyo Hartman, Daniel Keren, Abed Abu Dbai, Elad Cohen, Luk Knapen, Ansar-Ul-Haque Yasar, Davy Janssens:
Theory and Practice in Large Carpooling Problems. ANT/SEIT 2014: 339-347 - 2009
- [c3]Irith Ben-Arroyo Hartman:
On Path Partitions and Colourings in Digraphs. Graph Theory, Computational Intelligence and Thought 2009: 134-143 - 2007
- [c2]Irith Ben-Arroyo Hartman:
On path partitions and colourings in digraphs. CTW 2007: 63-66 - 1992
- [c1]Irith Ben-Arroyo Hartman:
Optimal K-Coloring and K-Nesting of Intervals. ISTCS 1992: 207-220
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-11-04 00:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
