A MILP model for an extended version of the Flexible Job Shop Problem. - Ernesto G. Birgin; Paulo Feofiloff; Cristina G. Fernandes; Everton L. de Melo; Marcio T. I. Oshiro; Débora P. Ronconi (Optim. Lett., 2014)

Path decompositions of regular graphs with prescribed girth. - Fábio Botler; Guilherme Oliveira Mota; M. T. I. Oshiro; Yoshiko Wakabayashi (Electron. Notes Discret. Math., 2015)

Decompositions of highly connected graphs into paths of any given length. - Fábio Botler; Guilherme Oliveira Mota; M. T. I. Oshiro; Yoshiko Wakabayashi (Electron. Notes Discret. Math., 2015)

Decompositions of highly connected graphs into paths of length five. - Fábio Botler; Guilherme Oliveira Mota; M. T. I. Oshiro; Yoshiko Wakabayashi (Electron. Notes Discret. Math., 2015)

Trajectory clustering of points in R. - Cristina G. Fernandes; Marcio T. I. Oshiro (Electron. Notes Discret. Math., 2015)

Trajectory clustering (Clustering de trajetórias). - Marcio T. I. Oshiro (2015)

Kinetic clustering of points on the line. - Cristina G. Fernandes; Marcio T. I. Oshiro (Theor. Comput. Sci., 2016)

Decomposing regular graphs with prescribed girth into paths of given length. - Fábio Botler; Guilherme Oliveira Mota; M. T. I. Oshiro; Yoshiko Wakabayashi (Eur. J. Comb., 2017)

Decomposing highly edge-connected graphs into paths of any given length. - Fábio Botler; Guilherme Oliveira Mota; M. T. I. Oshiro; Yoshiko Wakabayashi (J. Comb. Theory B, 2017)

Decomposing highly connected graphs into paths of length five. - Fábio Botler; Guilherme Oliveira Mota; M. T. I. Oshiro; Yoshiko Wakabayashi (Discret. Appl. Math., 2018)