Roberto Solis-Oba

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 27

Top Topics

Unrelated Parallel Machines

Top Venues

Theor. Comput. Sci.

Publications

Andrew Bloch-Hansen, Roberto Solis-Oba
The Thief Orienteering Problem on Series-Parallel Graphs. ISCO (2024)
Hasan Irtaza Mirza, Saad Bin Ahmed, Roberto Solis-Oba, Muhammad Imran Malik
Endmember Analysis of Overlapping Handwritten Text in Hyperspectral Document Images. IEEE Access 12 (2024)
Andrew Bloch-Hansen, Daniel R. Page, Roberto Solis-Oba
A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs. IWOCA (2023)
Andrew Bloch-Hansen, Nasim Samei, Roberto Solis-Oba
A local search approximation algorithm for the multiway cut problem. Discret. Appl. Math. 338 (2023)
Andrew Bloch-Hansen, Roberto Solis-Oba, Andy Yu
High Multiplicity Strip Packing with Three Rectangle Types. ISCO (2022)
Andrew Bloch-Hansen, Nasim Samei, Roberto Solis-Oba
Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem. CALDAM (2021)
Evan R. M. Debenham, Roberto Solis-Oba
New Algorithms for Computing Field of Vision over 2D Grids. CoRR (2021)
Fu Chi Chen, Gopi Gugan, Roberto Solis-Oba, Anwar Haque
Simple and Efficient Algorithm for Drone Path Planning. ICC (2021)
Klaus Jansen, Marten Maack, Roberto Solis-Oba
Structural parameters for scheduling with assignment restrictions. Theor. Comput. Sci. 844 (2020)
Daniel R. Page, Roberto Solis-Oba
Makespan minimization on unrelated parallel machines with a few bags. Theor. Comput. Sci. 821 (2020)
Daniel R. Page, Roberto Solis-Oba, Marten Maack
Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments. Theor. Comput. Sci. 809 (2020)
Roberto Solis-Oba, Rudolf Fleischer
Guest Editorial: Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 63 (8) (2019)
Daniel R. Page, Roberto Solis-Oba
Approximation algorithms for the graph balancing problem with two speeds and two job lengths. J. Comb. Optim. 37 (3) (2019)
Daniel R. Page, Roberto Solis-Oba, Marten Maack
Makespan Minimization on Unrelated Parallel Machines with Simple Job-Intersection Structure and Bounded Job Assignments. COCOA (2018)
Daniel R. Page, Roberto Solis-Oba
Makespan Minimization on Unrelated Parallel Machines with a Few Bags. AAIM (2018)
Zhendong Shao, Roberto Solis-Oba
Labeling Mycielski Graphs with a Condition at Distance Two. Ars Comb. 140 (2018)
Nasim Samei, Roberto Solis-Oba
A local search algorithm for the constrained max cut problem on hypergraphs. PeerJ Prepr. 6 (2018)
Zhendong Shao, Roberto Solis-Oba
Labeling Total Graphs with a Condition at Distance Two. Ars Comb. 140 (2018)
Zhendong Shao, Igor Averbakh, Roberto Solis-Oba
L(2, 1)-Labeling of Kneser graphs and coloring squares of Kneser graphs. Discret. Appl. Math. 221 (2017)
Klaus Jansen, Marten Maack, Roberto Solis-Oba
Structural Parameters for Scheduling with Assignment Restrictions. CoRR (2017)
Roberto Solis-Oba, Paul S. Bonsma, Stefanie Lowski
A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves. Algorithmica 77 (2) (2017)
Klaus Jansen, Marten Maack, Roberto Solis-Oba
Structural Parameters for Scheduling with Assignment Restrictions. CIAC (2017)
Zhendong Shao, Roberto Solis-Oba
A New Characterization of Disk Graphs and its Application. Ars Comb. 127 (2016)
Daniel R. Page, Roberto Solis-Oba
A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights. Algorithms 9 (2) (2016)
Zhendong Shao, Roberto Solis-Oba
On some results for the L(2, 1)-labeling on Cartesian sum graphs. Ars Comb. 124 (2016)
Roberto Solis-Oba, Giuseppe Persiano
Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 56 (1) (2015)
Nasim Samei, Roberto Solis-Oba
Analysis of a local search algorithm for the k-facility location problem. RAIRO Theor. Informatics Appl. 49 (4) (2015)
Lucian Ilie, Bahlul Haider, Michael Molnar, Roberto Solis-Oba
SAGE: String-overlap Assembly of GEnomes. BMC Bioinform. 15 (2014)
Zhendong Shao, Roberto Solis-Oba
(2, 1)L(2, 1)-labelings on the modular product of two graphs. Theor. Comput. Sci. 487 (2013)
Klaus Jansen, Roberto Solis-Oba
Packing Squares with Profits. SIAM J. Discret. Math. 26 (1) (2012)
Klaus Jansen, Roberto Solis-Oba
+ 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths. Math. Oper. Res. 36 (4) (2011)
Klaus Jansen, Roberto Solis-Oba
A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption. Inf. Process. Lett. 111 (10) (2011)
Zhendong Shao, Roberto Solis-Oba
L(2, 1)-Labelings on the composition of n graphs. Theor. Comput. Sci. 411 (34-36) (2010)
Klaus Jansen, Roberto Solis-Oba
+ 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths. IPCO (2010)
Klaus Jansen, Roberto Solis-Oba
Approximation Schemes for Scheduling Jobs with Chain Precedence Constraints. Int. J. Found. Comput. Sci. 21 (1) (2010)
Guo Mei, Roberto Solis-Oba
Improvements on Existing Search Engines through Categorization. International Conference on Internet Computing (2010)
Qinghui Liu, Roberto Solis-Oba
Improving the Performance of Online Mapping Applications with Prefetching. International Conference on Internet Computing (2009)
Klaus Jansen, Roberto Solis-Oba
Rectangle packing with one-dimensional resource augmentation. Discret. Optim. 6 (3) (2009)
Qinghui Liu, Roberto Solis-Oba
Web Prefetching with Machine Learning Algorithms. International Conference on Internet Computing (2008)
Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba
On Packing Rectangles with Resource Augmentation: Maximizing the Profit. Algorithmic Oper. Res. 3 (1) (2008)
Klaus Jansen, Roberto Solis-Oba
A Polynomial Time Approximation Scheme for the Square Packing Problem. IPCO (2008)
Klaus Jansen, Roberto Solis-Oba
New Approximability Results for 2-Dimensional Packing Problems. MFCS (2007)
Greg N. Frederickson, Roberto Solis-Oba
Efficient algorithms for robustness in resource allocation and scheduling problems. Theor. Comput. Sci. 352 (1-3) (2006)
Lucian Ilie, Roberto Solis-Oba
Gene Assembly Algorithms for Ciliates. DNA (2006)
Klaus Jansen, Roberto Solis-Oba
An asymptotic approximation algorithm for 3D-strip packing. SODA (2006)
Klaus Jansen, Roberto Solis-Oba
Preface. Theor. Comput. Sci. 361 (2-3) (2006)
Lucian Ilie, Roberto Solis-Oba, Sheng Yu
Reducing the Size of NFAs by Using Equivalences and Preorders. CPM (2005)
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
Approximation schemes for job shop scheduling problems with controllable processing times. Eur. J. Oper. Res. 167 (2) (2005)
Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba
Packing Weighted Rectangles into a Square. MFCS (2005)
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
Approximation algorithms for flexible job shop problems. Int. J. Found. Comput. Sci. 16 (2) (2005)
Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba
On Packing Squares with Resource Augmentation: Maximizing the Profit. CATS (2005)
Klaus Jansen, Roberto Solis-Oba
An asymptotic fully polynomial time approximation scheme for bin covering. Theor. Comput. Sci. 306 (1-3) (2003)
Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme. SIAM J. Discret. Math. 16 (2) (2003)
Roberto Solis-Oba
A Framework for Designing Approximation Algorithms for Scheduling Problems. WEA (2003)
Klaus Jansen, Roberto Solis-Oba
Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints. PPAM (2003)
Klaus Jansen, Roberto Solis-Oba
An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering. ISAAC (2002)
Piotr Krysta, Roberto Solis-Oba
Approximation Algorithms for Bounded Facility Location Problems. J. Comb. Optim. 5 (2) (2001)
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
Job Shop Scheduling Problems with Controllable Processing Times. ICTCS (2001)
Peter Sanders, Roberto Solis-Oba
How Helpers Hasten h-Relations. J. Algorithms 41 (1) (2001)
Peter Sanders, Roberto Solis-Oba
-Relations. ESA (2000)
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
Approximation Algorithms for Flexible Job Shop Problems. LATIN (2000)
Piotr Krysta, Roberto Solis-Oba
Approximation Algorithms for Bounded Facility Location. COCOON (1999)
Greg N. Frederickson, Roberto Solis-Oba
Increasing the Weight of Minimum Spanning Trees. J. Algorithms 33 (2) (1999)
Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko
A Linear Time Approximation Scheme for the Job Shop Scheduling Problem. RANDOM-APPROX (1999)
Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko
Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme. STOC (1999)
Greg N. Frederickson, Roberto Solis-Oba
Algorithms for Measuring Perturbability in Matroid Optimization. Comb. 18 (4) (1998)
Roberto Solis-Oba
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves. ESA (1998)
Greg N. Frederickson, Roberto Solis-Oba
Efficient Algorithms for Robustness in Matroid Optimization. SODA (1997)
Greg N. Frederickson, Roberto Solis-Oba
Increasing the Weight of Minimum Spanning Trees. SODA (1996)