Marcio T. I. Oshiro

According to our database, Marcio T. I. Oshiro authored at least 10 papers between 2014 and 2018.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2018

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

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, Ser. B, 2017

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

2016

Kinetic clustering of points on the line.

Cristina G. Fernandes, Marcio T. I. Oshiro

Theor. Comput. Sci., 2016

2015

Trajectory clustering (Clustering de trajetórias).

Marcio T. I. Oshiro

PhD thesis, 2015

Trajectory clustering of points in R.

Cristina G. Fernandes, Marcio T. I. Oshiro

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

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

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

2014

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