Roberto Solis-Oba

82 papers A* 4A 2B 14C 6Misc 2Journal 40Unranked 10
YearRankTypeTitle / Venue / Authors
2026 — conf
A Resonance Neural Network for the K-Median Problem.
CALDAM
Andrew Bloch-Hansen, Cody Rossiter, Roberto Solis-Oba
2025 J jnl
Algorithms for the thief orienteering problem on directed acyclic graphs.
Theor. Comput. Sci.
Andrew Bloch-Hansen, Roberto Solis-Oba, Daniel R. Page
2025 J jnl
High Multiplicity Strip Packing with Three Rectangle Types.
Theory Comput. Syst.
Andrew Bloch-Hansen, Roberto Solis-Oba, Andy Yu
2025 J jnl
The thief orienteering problem on 2-terminal series-parallel graphs.
Acta Informatica
Andrew Bloch-Hansen, Roberto Solis-Oba
2024 J jnl
Endmember Analysis of Overlapping Handwritten Text in Hyperspectral Document Images.
IEEE Access
Hasan Irtaza Mirza, Saad Bin Ahmed, Roberto Solis-Oba, Muhammad Imran Malik
2024 C conf
The Thief Orienteering Problem on Series-Parallel Graphs.
ISCO
Andrew Bloch-Hansen, Roberto Solis-Oba
2023 C conf
A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs.
IWOCA
Andrew Bloch-Hansen, Daniel R. Page, Roberto Solis-Oba
2023 J jnl
A local search approximation algorithm for the multiway cut problem.
Discret. Appl. Math.
Andrew Bloch-Hansen, Nasim Samei, Roberto Solis-Oba
2022 C conf
High Multiplicity Strip Packing with Three Rectangle Types.
ISCO
Andrew Bloch-Hansen, Roberto Solis-Oba, Andy Yu
2021 — conf
Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem.
CALDAM
Andrew Bloch-Hansen, Nasim Samei, Roberto Solis-Oba
2021 J jnl
New Algorithms for Computing Field of Vision over 2D Grids.
CoRR
Evan R. M. Debenham, Roberto Solis-Oba
2021 — conf
Simple and Efficient Algorithm for Drone Path Planning.
ICC
Fu Chi Chen, Gopi Gugan, Roberto Solis-Oba, Anwar Haque
2020 J jnl
Makespan minimization on unrelated parallel machines with a few bags.
Theor. Comput. Sci.
Daniel R. Page, Roberto Solis-Oba
2020 J jnl
Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments.
Theor. Comput. Sci.
Daniel R. Page, Roberto Solis-Oba, Marten Maack
2020 J jnl
Structural parameters for scheduling with assignment restrictions.
Theor. Comput. Sci.
Klaus Jansen, Marten Maack, Roberto Solis-Oba
2019 J jnl
Approximation algorithms for the graph balancing problem with two speeds and two job lengths.
J. Comb. Optim.
Daniel R. Page, Roberto Solis-Oba
2019 J jnl
Guest Editorial: Special Issue on Approximation and Online Algorithms.
Theory Comput. Syst.
Roberto Solis-Oba, Rudolf Fleischer
2018 J jnl
A local search algorithm for the constrained max cut problem on hypergraphs.
PeerJ Prepr.
Nasim Samei, Roberto Solis-Oba
2018 B ed.
Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers
WAOA
Roberto Solis-Oba, Rudolf Fleischer
2018 J jnl
Labeling Mycielski Graphs with a Condition at Distance Two.
Ars Comb.
Zhendong Shao, Roberto Solis-Oba
2018 J jnl
Labeling Total Graphs with a Condition at Distance Two.
Ars Comb.
Zhendong Shao, Roberto Solis-Oba
2018 — ch.
Local Search.
Handbook of Approximation Algorithms and Metaheuristics (1)
Roberto Solis-Oba, Nasim Samei
2018 C conf
Makespan Minimization on Unrelated Parallel Machines with Simple Job-Intersection Structure and Bounded Job Assignments.
COCOA
Daniel R. Page, Roberto Solis-Oba, Marten Maack
2018 C conf
Makespan Minimization on Unrelated Parallel Machines with a Few Bags.
AAIM
Daniel R. Page, Roberto Solis-Oba
2017 J jnl
A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves.
Algorithmica
Roberto Solis-Oba, Paul S. Bonsma, Stefanie Lowski
2017 J jnl
L(2, 1)-Labeling of Kneser graphs and coloring squares of Kneser graphs.
Discret. Appl. Math.
Zhendong Shao, Igor Averbakh, Roberto Solis-Oba
2017 C conf
Structural Parameters for Scheduling with Assignment Restrictions.
CIAC
Klaus Jansen, Marten Maack, Roberto Solis-Oba
2017 J jnl
Structural Parameters for Scheduling with Assignment Restrictions.
CoRR
Klaus Jansen, Marten Maack, Roberto Solis-Oba
2016 J jnl
A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights.
Algorithms
Daniel R. Page, Roberto Solis-Oba
2016 J jnl
A New Characterization of Disk Graphs and its Application.
Ars Comb.
Zhendong Shao, Roberto Solis-Oba
2016 J jnl
On some results for the L(2, 1)-labeling on Cartesian sum graphs.
Ars Comb.
Zhendong Shao, Roberto Solis-Oba
2015 J jnl
Analysis of a local search algorithm for the k-facility location problem.
RAIRO Theor. Informatics Appl.
Nasim Samei, Roberto Solis-Oba
2015 J jnl
Special Issue on Approximation and Online Algorithms.
Theory Comput. Syst.
Roberto Solis-Oba, Giuseppe Persiano
2014 J jnl
SAGE: String-overlap Assembly of GEnomes.
BMC Bioinform.
Lucian Ilie, Bahlul Haider, Michael Molnar, Roberto Solis-Oba
2013 B ed.
Algorithms and Data Structures - 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings
WADS
Frank Dehne, Roberto Solis-Oba, Jörg-Rüdiger Sack
2012 B ed.
Approximation and Online Algorithms - 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers
WAOA
Roberto Solis-Oba, Giuseppe Persiano
2012 J jnl
Packing Squares with Profits.
SIAM J. Discret. Math.
Klaus Jansen, Roberto Solis-Oba
2011 J jnl
A Polynomial Time
Math. Oper. Res.
Klaus Jansen, Roberto Solis-Oba
2011 J jnl
A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption.
Inf. Process. Lett.
Klaus Jansen, Roberto Solis-Oba
2011 B ed.
Approximation and Online Algorithms - 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers
WAOA
Klaus Jansen, Roberto Solis-Oba
2010 B conf
An
IPCO
Klaus Jansen, Roberto Solis-Oba
2010 J jnl
Approximation Schemes for Scheduling Jobs with Chain Precedence Constraints.
Int. J. Found. Comput. Sci.
Klaus Jansen, Roberto Solis-Oba
2010 — conf
Improvements on Existing Search Engines through Categorization.
International Conference on Internet Computing
Guo Mei, Roberto Solis-Oba
2010 J jnl
L(2, 1)-Labelings on the composition of n graphs.
Theor. Comput. Sci.
Zhendong Shao, Roberto Solis-Oba
2009 — conf
Improving the Performance of Online Mapping Applications with Prefetching.
International Conference on Internet Computing
Qinghui Liu, Roberto Solis-Oba
2009 J jnl
Rectangle packing with one-dimensional resource augmentation.
Discret. Optim.
Klaus Jansen, Roberto Solis-Oba
2008 B conf
A Polynomial Time Approximation Scheme for the Square Packing Problem.
IPCO
Klaus Jansen, Roberto Solis-Oba
2008 J jnl
On Packing Rectangles with Resource Augmentation: Maximizing the Profit.
Algorithmic Oper. Res.
Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba
2008 — conf
Web Prefetching with Machine Learning Algorithms.
International Conference on Internet Computing
Qinghui Liu, Roberto Solis-Oba
2007 — ch.
Local Search.
Handbook of Approximation Algorithms and Metaheuristics
Roberto Solis-Oba
2007 B conf
New Approximability Results for 2-Dimensional Packing Problems.
MFCS
Klaus Jansen, Roberto Solis-Oba
2006 A* conf
An asymptotic approximation algorithm for 3D-strip packing.
SODA
Klaus Jansen, Roberto Solis-Oba
2006 — ch.
Approximation Algorithms for the k-Median Problem.
Efficient Approximation and Online Algorithms
Roberto Solis-Oba
2006 J jnl
Efficient algorithms for robustness in resource allocation and scheduling problems.
Theor. Comput. Sci.
Greg N. Frederickson, Roberto Solis-Oba
2006 B conf
Gene Assembly Algorithms for Ciliates.
DNA
Lucian Ilie, Roberto Solis-Oba
2006 J jnl
Preface.
Theor. Comput. Sci.
Klaus Jansen, Roberto Solis-Oba
2005 J jnl
Approximation algorithms for flexible job shop problems.
Int. J. Found. Comput. Sci.
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
2005 B ed.
Approximation and Online Algorithms, Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers
WAOA
Giuseppe Persiano, Roberto Solis-Oba
2005 J jnl
Approximation schemes for job shop scheduling problems with controllable processing times.
Eur. J. Oper. Res.
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
2005 — conf
On Packing Squares with Resource Augmentation: Maximizing the Profit.
CATS
Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba
2005 B conf
Packing Weighted Rectangles into a Square.
MFCS
Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba
2005 B conf
Reducing the Size of NFAs by Using Equivalences and Preorders.
CPM
Lucian Ilie, Roberto Solis-Oba, Sheng Yu
2004 B ed.
Approximation and Online Algorithms, First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers
WAOA
Klaus Jansen, Roberto Solis-Oba
2003 — conf
A Framework for Designing Approximation Algorithms for Scheduling Problems.
WEA
Roberto Solis-Oba
2003 J jnl
An asymptotic fully polynomial time approximation scheme for bin covering.
Theor. Comput. Sci.
Klaus Jansen, Roberto Solis-Oba
2003 Misc conf
Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints.
PPAM
Klaus Jansen, Roberto Solis-Oba
2003 J jnl
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme.
SIAM J. Discret. Math.
Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko
2002 B conf
An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering.
ISAAC
Klaus Jansen, Roberto Solis-Oba
2001 J jnl
Approximation Algorithms for Bounded Facility Location Problems.
J. Comb. Optim.
Piotr Krysta, Roberto Solis-Oba
2001 J jnl
How Helpers Hasten h-Relations.
J. Algorithms
Peter Sanders, Roberto Solis-Oba
2001 — conf
Job Shop Scheduling Problems with Controllable Processing Times.
ICTCS
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
2000 B conf
Approximation Algorithms for Flexible Job Shop Problems.
LATIN
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
2000 A conf
How Helpers Hasten
ESA
Peter Sanders, Roberto Solis-Oba
1999 — conf
A Linear Time Approximation Scheme for the Job Shop Scheduling Problem.
RANDOM-APPROX
Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko
1999 Misc conf
Approximation Algorithms for Bounded Facility Location.
COCOON
Piotr Krysta, Roberto Solis-Oba
1999 J jnl
Increasing the Weight of Minimum Spanning Trees.
J. Algorithms
Greg N. Frederickson, Roberto Solis-Oba
1999 A* conf
Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme.
STOC
Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko
1998 A conf
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves.
ESA
Roberto Solis-Oba
1998 J jnl
Algorithms for Measuring Perturbability in Matroid Optimization.
Comb.
Greg N. Frederickson, Roberto Solis-Oba
1997 A* conf
Efficient Algorithms for Robustness in Matroid Optimization.
SODA
Greg N. Frederickson, Roberto Solis-Oba
1997 — —
Robustness and approximation in combinatorial optimization
Roberto Solis-Oba
1996 A* conf
Increasing the Weight of Minimum Spanning Trees.
SODA
Greg N. Frederickson, Roberto Solis-Oba