Nei Yoshihiro Soma

Orcid: 0000-0003-3069-9644

According to our database1, Nei Yoshihiro Soma authored at least 22 papers between 1987 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Rectangle packing with a recursive Pilot Method.
Comput. Oper. Res., January, 2024

2023
Solving NP-Complete Akari games with deep learning.
Entertain. Comput., August, 2023

2022
Formation control method based on artificial potential fields for aircraft flight simulation.
Simul., 2022

2021
Trajectory planning with a dynamic obstacle clustering strategy using Mixed-Integer Linear Programming.
Proceedings of the 2021 American Control Conference, 2021

2020
Selecting Projects on the Brazilian R&D Energy Sector: A Fuzzy-Based Approach for Criteria Selection.
IEEE Access, 2020

2016
An analysis of bibliometric indicators to JCR according to Benford's law.
Scientometrics, 2016

A general resolution of intractable problems in polynomial time through DNA Computing.
Biosyst., 2016

2015
A breadth-first search applied to the minimization of the open stacks.
J. Oper. Res. Soc., 2015

2014
Benford's Law and articles of scientific journals: comparison of JCR® and Scopus data.
Scientometrics, 2014

A computational DNA solution approach for the Quadratic Diophantine Equation.
Appl. Math. Comput., 2014

2011
LattesMiner: a multilingual DSL for information extraction from lattes platform.
Proceedings of the SPLASH'11 Workshops, 2011

2010
Observations on optimal parallelizations of two-list algorithm.
Parallel Comput., 2010

2009
A polynomial-time DNA computing solution for the Bin-Packing Problem.
Appl. Math. Comput., 2009

2008
Parallel time and space upper-bounds for the subset-sum problem.
Theor. Comput. Sci., 2008

2007
An optimal and scalable parallelization of the two-list.
Eur. J. Oper. Res., 2007

2006
On irreversibility of von Neumann additive cellular automata on grids.
Discret. Appl. Math., 2006

2004
A method for solving the minimization of the maximum number of open stacks problem within a cutting process.
Comput. Oper. Res., 2004

2002
Comments on parallel algorithms for the knapsack problem.
Parallel Comput., 2002

An exact algorithm for the subset sum problem.
Eur. J. Oper. Res., 2002

2000
Fractal Color Image Compression.
Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2000), 2000

1995
A Polynomial Approximation Scheme for the Subset Sum Problem.
Discret. Appl. Math., 1995

1987
A new enumeration scheme for the knapsack problem.
Discret. Appl. Math., 1987


  Loading...