Efficient Algorithms for Robustness in Matroid Optimization. - Greg N. Frederickson; Roberto Solis-Oba (SODA, 1997)

Robustness and approximation in combinatorial optimization - Roberto Solis-Oba (1997)

2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves. - Roberto Solis-Oba (ESA, 1998)

Algorithms for Measuring Perturbability in Matroid Optimization. - Greg N. Frederickson; Roberto Solis-Oba (Comb., 1998)

Approximation Algorithms for Bounded Facility Location. - Piotr Krysta; Roberto Solis-Oba (COCOON, 1999)

A Linear Time Approximation Scheme for the Job Shop Scheduling Problem. - Klaus Jansen; Roberto Solis-Oba; Maxim Sviridenko (RANDOM-APPROX, 1999)

Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme. - Klaus Jansen; Roberto Solis-Oba; Maxim Sviridenko (STOC, 1999)

Increasing the Weight of Minimum Spanning Trees. - Greg N. Frederickson; Roberto Solis-Oba (J. Algorithms, 1999)

How Helpers Hasten h-Relations. - Peter Sanders 001; Roberto Solis-Oba (ESA, 2000)

Job Shop Scheduling Problems with Controllable Processing Times. - Klaus Jansen; Monaldo Mastrolilli; Roberto Solis-Oba (ICTCS, 2001)

How Helpers Hasten h-Relations. - Peter Sanders 001; Roberto Solis-Oba (J. Algorithms, 2001)

Approximation Algorithms for Bounded Facility Location Problems. - Piotr Krysta; Roberto Solis-Oba (J. Comb. Optim., 2001)

Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints. - Klaus Jansen; Roberto Solis-Oba (PPAM, 2003)

A Framework for Designing Approximation Algorithms for Scheduling Problems. - Roberto Solis-Oba (WEA, 2003)

Makespan Minimization in Job Shops: A Linear Time Approximation Scheme. - Klaus Jansen; Roberto Solis-Oba; Maxim Sviridenko (SIAM J. Discret. Math., 2003)

An asymptotic fully polynomial time approximation scheme for bin covering. - Klaus Jansen; Roberto Solis-Oba (Theor. Comput. Sci., 2003)

On Packing Squares with Resource Augmentation: Maximizing the Profit. - Aleksei V. Fishkin; Olga Gerber; Klaus Jansen; Roberto Solis-Oba (CATS, 2005)

Reducing the Size of NFAs by Using Equivalences and Preorders. - Lucian Ilie; Roberto Solis-Oba; Sheng Yu 001 (CPM, 2005)

Packing Weighted Rectangles into a Square. - Aleksei V. Fishkin; Olga Gerber; Klaus Jansen; Roberto Solis-Oba (MFCS, 2005)

Approximation schemes for job shop scheduling problems with controllable processing times. - Klaus Jansen; Monaldo Mastrolilli; Roberto Solis-Oba (Eur. J. Oper. Res., 2005)

Approximation algorithms for flexible job shop problems. - Klaus Jansen; Monaldo Mastrolilli; Roberto Solis-Oba (Int. J. Found. Comput. Sci., 2005)

Gene Assembly Algorithms for Ciliates. - Lucian Ilie; Roberto Solis-Oba (DNA, 2006)

An asymptotic approximation algorithm for 3D-strip packing. - Klaus Jansen; Roberto Solis-Oba (SODA, 2006)

Efficient algorithms for robustness in resource allocation and scheduling problems. - Greg N. Frederickson; Roberto Solis-Oba (Theor. Comput. Sci., 2006)

Preface. - Klaus Jansen; Roberto Solis-Oba (Theor. Comput. Sci., 2006)

Approximation Algorithms for the k-Median Problem. - Roberto Solis-Oba (Efficient Approximation and Online Algorithms, 2006)

New Approximability Results for 2-Dimensional Packing Problems. - Klaus Jansen; Roberto Solis-Oba (MFCS, 2007)

Local Search. - Roberto Solis-Oba (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Web Prefetching with Machine Learning Algorithms. - Qinghui Liu; Roberto Solis-Oba (International Conference on Internet Computing, 2008)

A Polynomial Time Approximation Scheme for the Square Packing Problem. - Klaus Jansen; Roberto Solis-Oba (IPCO, 2008)

On Packing Rectangles with Resource Augmentation: Maximizing the Profit. - Aleksei V. Fishkin; Olga Gerber; Klaus Jansen; Roberto Solis-Oba (Algorithmic Oper. Res., 2008)

Improving the Performance of Online Mapping Applications with Prefetching. - Qinghui Liu; Roberto Solis-Oba (International Conference on Internet Computing, 2009)

Rectangle packing with one-dimensional resource augmentation. - Klaus Jansen; Roberto Solis-Oba (Discret. Optim., 2009)

Improvements on Existing Search Engines through Categorization. - Guo Mei; Roberto Solis-Oba (International Conference on Internet Computing, 2010)

An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths. - Klaus Jansen; Roberto Solis-Oba (IPCO, 2010)

Approximation Schemes for Scheduling Jobs with Chain Precedence Constraints. - Klaus Jansen; Roberto Solis-Oba (Int. J. Found. Comput. Sci., 2010)

L(2, 1)-Labelings on the composition of n graphs. - Zhendong Shao; Roberto Solis-Oba (Theor. Comput. Sci., 2010)

A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption. - Klaus Jansen; Roberto Solis-Oba (Inf. Process. Lett., 2011)

A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths. - Klaus Jansen; Roberto Solis-Oba (Math. Oper. Res., 2011)

Packing Squares with Profits. - Klaus Jansen; Roberto Solis-Oba (SIAM J. Discret. Math., 2012)

L(2, 1)L(2, 1)-labelings on the modular product of two graphs. - Zhendong Shao; Roberto Solis-Oba (Theor. Comput. Sci., 2013)

SAGE: String-overlap Assembly of GEnomes. - Lucian Ilie; Bahlul Haider; Michael Molnar; Roberto Solis-Oba (BMC Bioinform., 2014)

Analysis of a local search algorithm for the k-facility location problem. - Nasim Samei; Roberto Solis-Oba (RAIRO Theor. Informatics Appl., 2015)

Special Issue on Approximation and Online Algorithms. - Roberto Solis-Oba; Giuseppe Persiano (Theory Comput. Syst., 2015)

A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights. - Daniel R. Page; Roberto Solis-Oba (Algorithms, 2016)

On some results for the L(2, 1)-labeling on Cartesian sum graphs. - Zhendong Shao; Roberto Solis-Oba (Ars Comb., 2016)

A New Characterization of Disk Graphs and its Application. - Zhendong Shao; Roberto Solis-Oba (Ars Comb., 2016)

A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves. - Roberto Solis-Oba; Paul S. Bonsma; Stefanie Lowski (Algorithmica, 2017)

L(2, 1)-Labeling of Kneser graphs and coloring squares of Kneser graphs. - Zhendong Shao; Igor Averbakh; Roberto Solis-Oba (Discret. Appl. Math., 2017)

Local Search. - Roberto Solis-Oba; Nasim Samei (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

Labeling Total Graphs with a Condition at Distance Two. - Zhendong Shao; Roberto Solis-Oba (Ars Comb., 2018)

Labeling Mycielski Graphs with a Condition at Distance Two. - Zhendong Shao; Roberto Solis-Oba (Ars Comb., 2018)

A local search algorithm for the constrained max cut problem on hypergraphs. - Nasim Samei; Roberto Solis-Oba (PeerJ Prepr., 2018)

Approximation algorithms for the graph balancing problem with two speeds and two job lengths. - Daniel R. Page; Roberto Solis-Oba (J. Comb. Optim., 2019)

Guest Editorial: Special Issue on Approximation and Online Algorithms. - Roberto Solis-Oba; Rudolf Fleischer (Theory Comput. Syst., 2019)

Structural parameters for scheduling with assignment restrictions. - Klaus Jansen; Marten Maack; Roberto Solis-Oba (Theor. Comput. Sci., 2020)

Makespan minimization on unrelated parallel machines with a few bags. - Daniel R. Page; Roberto Solis-Oba (Theor. Comput. Sci., 2020)

Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments. - Daniel R. Page; Roberto Solis-Oba; Marten Maack (Theor. Comput. Sci., 2020)

Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem. - Andrew Bloch-Hansen; Nasim Samei; Roberto Solis-Oba (CALDAM, 2021)

Simple and Efficient Algorithm for Drone Path Planning. - Fu Chi Chen; Gopi Gugan; Roberto Solis-Oba; Anwar Haque (ICC, 2021)

New Algorithms for Computing Field of Vision over 2D Grids. - Evan R. M. Debenham; Roberto Solis-Oba (CoRR, 2021)

A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs. - Andrew Bloch-Hansen; Daniel R. Page; Roberto Solis-Oba (IWOCA, 2023)

A local search approximation algorithm for the multiway cut problem. - Andrew Bloch-Hansen; Nasim Samei; Roberto Solis-Oba (Discret. Appl. Math., 2023)

The Thief Orienteering Problem on Series-Parallel Graphs. - Andrew Bloch-Hansen; Roberto Solis-Oba (ISCO, 2024)

Endmember Analysis of Overlapping Handwritten Text in Hyperspectral Document Images. - Hasan Irtaza Mirza; Saad Bin Ahmed; Roberto Solis-Oba; Muhammad Imran Malik (IEEE Access, 2024)

Algorithms for the thief orienteering problem on directed acyclic graphs. - Andrew Bloch-Hansen; Roberto Solis-Oba; Daniel R. Page (Theor. Comput. Sci., 2025)

High Multiplicity Strip Packing with Three Rectangle Types. - Andrew Bloch-Hansen; Roberto Solis-Oba; Andy Yu (Theory Comput. Syst., 2025)

The thief orienteering problem on 2-terminal series-parallel graphs. - Andrew Bloch-Hansen; Roberto Solis-Oba (Acta Informatica, 2025)