Marcio T. I. Oshiro

TL;DR: A MILP model for an extended version of the Flexible Job Shop Scheduling problem is proposed, which allows the precedences between operations of a job to be given by an arbitrary directed acyclic graph rather than a linear order.

TL;DR: This paper proves that the conjecture that for each tree $T$ there exists a natural number $k_T$ such that $G$ is a-edge-connected graph and $|E(G)$ is divisible by $|T(T)$, and that this conjecture holds for paths of any fixed length.

TL;DR: Barat and Thomassen as discussed by the authors proved that this conjecture holds for paths of any fixed length for stars, some bistars, paths of length 3, 5, and 2 r for every positive integer r.

TL;DR: It is proved that, for graphs with girth at least l − 1, statement (i) holds for every m ≥ 1 ; and it is observed that, statements (ii) and (i) also holds forevery m ≤ 1.

TL;DR: This paper verified the following decomposition conjecture for stars, some bistars, paths of length 3, and paths whose length is a power of 2: for each tree T, there exists a natural number k T such that G admits a decomposition into copies of T.