# Roberto Solis-Oba

According to our database

Collaborative distances:

^{1}, Roberto Solis-Oba authored at least 59 papers between 1997 and 2021.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2021

CoRR, 2021

Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem.

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments.

Theor. Comput. Sci., 2020

Theor. Comput. Sci., 2020

Theor. Comput. Sci., 2020

2019

Theory Comput. Syst., 2019

Approximation algorithms for the graph balancing problem with two speeds and two job lengths.

J. Comb. Optim., 2019

2018

PeerJ Prepr., 2018

Labeling Mycielski Graphs with a Condition at Distance Two.

Ars Comb., 2018

Labeling Total Graphs with a Condition at Distance Two.

Ars Comb., 2018

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Discret. Appl. Math., 2017

A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves.

Algorithmica, 2017

2016

A New Characterization of Disk Graphs and its Application.

Ars Comb., 2016

On some results for the L(2, 1)-labeling on Cartesian sum graphs.

Ars Comb., 2016

Algorithms, 2016

2015

Theory Comput. Syst., 2015

RAIRO Theor. Informatics Appl., 2015

2014

BMC Bioinform., 2014

2013

Theor. Comput. Sci., 2013

2012

SIAM J. Discret. Math., 2012

2011

A Polynomial Time <i>OPT</i> + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths.

Math. Oper. Res., 2011

A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption.

Inf. Process. Lett., 2011

2010

Theor. Comput. Sci., 2010

Int. J. Found. Comput. Sci., 2010

An <i>OPT</i> + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths.

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Improvements on Existing Search Engines through Categorization.

Proceedings of the 2010 International Conference on Internet Computing, 2010

2009

Discret. Optim., 2009

Improving the Performance of Online Mapping Applications with Prefetching.

Proceedings of the 2009 International Conference on Internet Computing, 2009

2008

Algorithmic Oper. Res., 2008

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

Web Prefetching with Machine Learning Algorithms.

Proceedings of the 2008 International Conference on Internet Computing, 2008

2007

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

Proceedings of the Efficient Approximation and Online Algorithms, 2006

Theor. Comput. Sci., 2006

Efficient algorithms for robustness in resource allocation and scheduling problems.

Theor. Comput. Sci., 2006

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

2005

Int. J. Found. Comput. Sci., 2005

Approximation schemes for job shop scheduling problems with controllable processing times.

Eur. J. Oper. Res., 2005

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

Proceedings of the Theory of Computing 2005, 2005

2003

Theor. Comput. Sci., 2003

SIAM J. Discret. Math., 2003

Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

Proceedings of the Parallel Processing and Applied Mathematics, 2003

2001

J. Comb. Optim., 2001

J. Algorithms, 2001

Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

2000

Proceedings of the Algorithms, 2000

1999

J. Algorithms, 1999

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Proceedings of the Randomization, 1999

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

Comb., 1998

2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves.

Proceedings of the Algorithms, 1998

1997

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997