Roberto Solis-Oba

According to our database1, 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
New Algorithms for Computing Field of Vision over 2D Grids.
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

Makespan minimization on unrelated parallel machines with a few bags.
Theor. Comput. Sci., 2020

Structural parameters for scheduling with assignment restrictions.
Theor. Comput. Sci., 2020

2019
Guest Editorial: Special Issue on Approximation and Online Algorithms.
Theory Comput. Syst., 2019

Approximation algorithms for the graph balancing problem with two speeds and two job lengths.
J. Comb. Optim., 2019

2018
A local search algorithm for the constrained max cut problem on hypergraphs.
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

Local Search.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
L(2, 1)-Labeling of Kneser graphs and coloring squares of Kneser graphs.
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

A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights.
Algorithms, 2016

2015
Special Issue on Approximation and Online Algorithms.
Theory Comput. Syst., 2015

Analysis of a local search algorithm for the k-facility location problem.
RAIRO Theor. Informatics Appl., 2015

2014
SAGE: String-overlap Assembly of GEnomes.
BMC Bioinform., 2014

2013
<i>L</i>(2, 1)L(2, 1)-labelings on the modular product of two graphs.
Theor. Comput. Sci., 2013

2012
Packing Squares with Profits.
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
L(2, 1)-Labelings on the composition of n graphs.
Theor. Comput. Sci., 2010

Approximation Schemes for Scheduling Jobs with Chain Precedence Constraints.
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
Rectangle packing with one-dimensional resource augmentation.
Discret. Optim., 2009

Improving the Performance of Online Mapping Applications with Prefetching.
Proceedings of the 2009 International Conference on Internet Computing, 2009

2008
On Packing Rectangles with Resource Augmentation: Maximizing the Profit.
Algorithmic Oper. Res., 2008

A Polynomial Time Approximation Scheme for the Square Packing Problem.
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
Local Search.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

New Approximability Results for 2-Dimensional Packing Problems.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
Approximation Algorithms for the k-Median Problem.
Proceedings of the Efficient Approximation and Online Algorithms, 2006

Preface.
Theor. Comput. Sci., 2006

Efficient algorithms for robustness in resource allocation and scheduling problems.
Theor. Comput. Sci., 2006

An asymptotic approximation algorithm for 3D-strip packing.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Gene Assembly Algorithms for Ciliates.
Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

2005
Approximation algorithms for flexible job shop problems.
Int. J. Found. Comput. Sci., 2005

Approximation schemes for job shop scheduling problems with controllable processing times.
Eur. J. Oper. Res., 2005

Packing Weighted Rectangles into a Square.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Reducing the Size of NFAs by Using Equivalences and Preorders.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

On Packing Squares with Resource Augmentation: Maximizing the Profit.
Proceedings of the Theory of Computing 2005, 2005

2003
An asymptotic fully polynomial time approximation scheme for bin covering.
Theor. Comput. Sci., 2003

Makespan Minimization in Job Shops: A Linear Time Approximation Scheme.
SIAM J. Discret. Math., 2003

A Framework for Designing Approximation Algorithms for Scheduling Problems.
Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints.
Proceedings of the Parallel Processing and Applied Mathematics, 2003

2001
Approximation Algorithms for Bounded Facility Location Problems.
J. Comb. Optim., 2001

How Helpers Hasten h-Relations.
J. Algorithms, 2001

Job Shop Scheduling Problems with Controllable Processing Times.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

2000
How Helpers Hasten <i>h</i>-Relations.
Proceedings of the Algorithms, 2000

1999
Increasing the Weight of Minimum Spanning Trees.
J. Algorithms, 1999

Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

A Linear Time Approximation Scheme for the Job Shop Scheduling Problem.
Proceedings of the Randomization, 1999

Approximation Algorithms for Bounded Facility Location.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
Algorithms for Measuring Perturbability in Matroid Optimization.
Comb., 1998

2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves.
Proceedings of the Algorithms, 1998

1997
Efficient Algorithms for Robustness in Matroid Optimization.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997


  Loading...