( en | de | ru )

 

Disambiguation of "Hartman, Irith Ben-Arroyo"

Author of the publication

copydeleteadd this publication to your clipboard
Enumerating minimum path decompositions to support route choice set generation.

, , and . ANT/SEIT, volume 109 of Procedia Computer Science, page 196-203. Elsevier, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Irith Baumann

Irith Wiegand

Irith Bittmann

Irith Bittmann

Irith Reuters

 

Other publications of authors with the same name

Long Cycles Generate the Cycle Space of a Graph.. Eur. J. Comb., 4 (3): 237-246 (1983)Editorial., , , and . Discret. Appl. Math., 156 (4): 410-411 (2008)The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms., , , and . Discret. Appl. Math., 156 (4): 407-408 (2008)On grid intersection graphs., , and . Discret. Math., 87 (1): 41-52 (1991)Using path decomposition enumeration to enhance route choice models., , and . Future Gener. Comput. Syst., (2020)Optimal K-Coloring and K-Nesting of Intervals.. ISTCS, volume 601 of Lecture Notes in Computer Science, page 207-220. Springer, (1992)Proof of Berge's strong path partition conjecture for k=2., and . Eur. J. Comb., 29 (1): 179-192 (2008)Contractors' minimum spanning tree., and . Australas. J Comb., (2019)On greene's theorem for digraphs., , and . J. Graph Theory, 18 (2): 169-175 (1994)On Path Partitions and Colourings in Digraphs.. Graph Theory, Computational Intelligence and Thought, volume 5420 of Lecture Notes in Computer Science, page 134-143. Springer, (2009)