default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoberto Solis-Oba
Person information
- affiliation: University of Western Ontario, London, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j36]Andrew Bloch-Hansen, Roberto Solis-Oba, Daniel R. Page:
Algorithms for the thief orienteering problem on directed acyclic graphs. Theor. Comput. Sci. 1023: 114900 (2025)- 2024
- [j35]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: 13010-13019 (2024) - [c31]Andrew Bloch-Hansen, Roberto Solis-Oba:
The Thief Orienteering Problem on Series-Parallel Graphs. ISCO 2024: 248-262 - 2023
- [j34]Andrew Bloch-Hansen, Nasim Samei, Roberto Solis-Oba:
A local search approximation algorithm for the multiway cut problem. Discret. Appl. Math. 338: 8-21 (2023) - [c30]Andrew Bloch-Hansen, Daniel R. Page, Roberto Solis-Oba:
A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs. IWOCA 2023: 87-98 - 2022
- [c29]Andrew Bloch-Hansen, Roberto Solis-Oba, Andy Yu:
High Multiplicity Strip Packing with Three Rectangle Types. ISCO 2022: 215-227 - 2021
- [c28]Andrew Bloch-Hansen, Nasim Samei, Roberto Solis-Oba:
Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem. CALDAM 2021: 346-358 - [c27]Fu Chi Chen, Gopi Gugan, Roberto Solis-Oba, Anwar Haque:
Simple and Efficient Algorithm for Drone Path Planning. ICC 2021: 1-6 - [i3]Evan R. M. Debenham, Roberto Solis-Oba:
New Algorithms for Computing Field of Vision over 2D Grids. CoRR abs/2101.11002 (2021) - 2020
- [j33]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: 204-217 (2020) - [j32]Daniel R. Page, Roberto Solis-Oba:
Makespan minimization on unrelated parallel machines with a few bags. Theor. Comput. Sci. 821: 34-44 (2020) - [j31]Klaus Jansen, Marten Maack, Roberto Solis-Oba:
Structural parameters for scheduling with assignment restrictions. Theor. Comput. Sci. 844: 154-170 (2020)
2010 – 2019
- 2019
- [j30]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): 1045-1070 (2019) - [j29]Roberto Solis-Oba, Rudolf Fleischer:
Guest Editorial: Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 63(8): 1755-1756 (2019) - 2018
- [j28]Zhendong Shao, Roberto Solis-Oba:
Labeling Total Graphs with a Condition at Distance Two. Ars Comb. 140: 97-111 (2018) - [j27]Zhendong Shao, Roberto Solis-Oba:
Labeling Mycielski Graphs with a Condition at Distance Two. Ars Comb. 140: 337-349 (2018) - [c26]Daniel R. Page, Roberto Solis-Oba:
Makespan Minimization on Unrelated Parallel Machines with a Few Bags. AAIM 2018: 24-35 - [c25]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: 341-356 - [p2]Roberto Solis-Oba, Nasim Samei:
Local Search. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 277-294 - [e6]Roberto Solis-Oba, Rudolf Fleischer:
Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10787, Springer 2018, ISBN 978-3-319-89440-9 [contents] - [i2]Nasim Samei, Roberto Solis-Oba:
A local search algorithm for the constrained max cut problem on hypergraphs. PeerJ Prepr. 6: e27434 (2018) - 2017
- [j26]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): 374-388 (2017) - [j25]Zhendong Shao, Igor Averbakh, Roberto Solis-Oba:
L(2, 1)-Labeling of Kneser graphs and coloring squares of Kneser graphs. Discret. Appl. Math. 221: 106-114 (2017) - [c24]Klaus Jansen, Marten Maack, Roberto Solis-Oba:
Structural Parameters for Scheduling with Assignment Restrictions. CIAC 2017: 357-368 - [i1]Klaus Jansen, Marten Maack, Roberto Solis-Oba:
Structural Parameters for Scheduling with Assignment Restrictions. CoRR abs/1701.07242 (2017) - 2016
- [j24]Daniel R. Page, Roberto Solis-Oba:
A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights. Algorithms 9(2): 38 (2016) - [j23]Zhendong Shao, Roberto Solis-Oba:
On some results for the L(2, 1)-labeling on Cartesian sum graphs. Ars Comb. 124: 365-377 (2016) - [j22]Zhendong Shao, Roberto Solis-Oba:
A New Characterization of Disk Graphs and its Application. Ars Comb. 127: 421-434 (2016) - 2015
- [j21]Nasim Samei, Roberto Solis-Oba:
Analysis of a local search algorithm for the k-facility location problem. RAIRO Theor. Informatics Appl. 49(4): 285-306 (2015) - [j20]Roberto Solis-Oba, Giuseppe Persiano:
Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 56(1): 1-2 (2015) - 2014
- [j19]Lucian Ilie, Bahlul Haider, Michael Molnar, Roberto Solis-Oba:
SAGE: String-overlap Assembly of GEnomes. BMC Bioinform. 15: 302 (2014) - 2013
- [j18]Zhendong Shao, Roberto Solis-Oba:
L(2, 1)L(2, 1)-labelings on the modular product of two graphs. Theor. Comput. Sci. 487: 74-81 (2013) - [e5]Frank Dehne, Roberto Solis-Oba, Jörg-Rüdiger Sack:
Algorithms and Data Structures - 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings. Lecture Notes in Computer Science 8037, Springer 2013, ISBN 978-3-642-40103-9 [contents] - 2012
- [j17]Klaus Jansen, Roberto Solis-Oba:
Packing Squares with Profits. SIAM J. Discret. Math. 26(1): 263-279 (2012) - [e4]Roberto Solis-Oba, Giuseppe Persiano:
Approximation and Online Algorithms - 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7164, Springer 2012, ISBN 978-3-642-29115-9 [contents] - 2011
- [j16]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): 479-482 (2011) - [j15]Klaus Jansen, Roberto Solis-Oba:
A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths. Math. Oper. Res. 36(4): 743-753 (2011) - [e3]Klaus Jansen, Roberto Solis-Oba:
Approximation and Online Algorithms - 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers. Lecture Notes in Computer Science 6534, Springer 2011, ISBN 978-3-642-18317-1 [contents] - 2010
- [j14]Klaus Jansen, Roberto Solis-Oba:
Approximation Schemes for Scheduling Jobs with Chain Precedence Constraints. Int. J. Found. Comput. Sci. 21(1): 27-49 (2010) - [j13]Zhendong Shao, Roberto Solis-Oba:
L(2, 1)-Labelings on the composition of n graphs. Theor. Comput. Sci. 411(34-36): 3287-3292 (2010) - [c23]Guo Mei, Roberto Solis-Oba:
Improvements on Existing Search Engines through Categorization. International Conference on Internet Computing 2010: 71-76 - [c22]Klaus Jansen, Roberto Solis-Oba:
An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths. IPCO 2010: 438-449
2000 – 2009
- 2009
- [j12]Klaus Jansen, Roberto Solis-Oba:
Rectangle packing with one-dimensional resource augmentation. Discret. Optim. 6(3): 310-323 (2009) - [c21]Qinghui Liu, Roberto Solis-Oba:
Improving the Performance of Online Mapping Applications with Prefetching. International Conference on Internet Computing 2009: 180-186 - 2008
- [j11]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) - [c20]Qinghui Liu, Roberto Solis-Oba:
Web Prefetching with Machine Learning Algorithms. International Conference on Internet Computing 2008: 142-148 - [c19]Klaus Jansen, Roberto Solis-Oba:
A Polynomial Time Approximation Scheme for the Square Packing Problem. IPCO 2008: 184-198 - 2007
- [c18]Klaus Jansen, Roberto Solis-Oba:
New Approximability Results for 2-Dimensional Packing Problems. MFCS 2007: 103-114 - [r1]Roberto Solis-Oba:
Local Search. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j10]Greg N. Frederickson, Roberto Solis-Oba:
Efficient algorithms for robustness in resource allocation and scheduling problems. Theor. Comput. Sci. 352(1-3): 250-265 (2006) - [j9]Klaus Jansen, Roberto Solis-Oba:
Preface. Theor. Comput. Sci. 361(2-3): 131-132 (2006) - [c17]Lucian Ilie, Roberto Solis-Oba:
Gene Assembly Algorithms for Ciliates. DNA 2006: 71-82 - [c16]Klaus Jansen, Roberto Solis-Oba:
An asymptotic approximation algorithm for 3D-strip packing. SODA 2006: 143-152 - [p1]Roberto Solis-Oba:
Approximation Algorithms for the k-Median Problem. Efficient Approximation and Online Algorithms 2006: 292-320 - 2005
- [j8]Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba:
Approximation schemes for job shop scheduling problems with controllable processing times. Eur. J. Oper. Res. 167(2): 297-319 (2005) - [j7]Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba:
Approximation algorithms for flexible job shop problems. Int. J. Found. Comput. Sci. 16(2): 361-379 (2005) - [c15]Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba:
On Packing Squares with Resource Augmentation: Maximizing the Profit. CATS 2005: 61-67 - [c14]Lucian Ilie, Roberto Solis-Oba, Sheng Yu:
Reducing the Size of NFAs by Using Equivalences and Preorders. CPM 2005: 310-321 - [c13]Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba:
Packing Weighted Rectangles into a Square. MFCS 2005: 352-363 - [e2]Giuseppe Persiano, Roberto Solis-Oba:
Approximation and Online Algorithms, Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3351, Springer 2005, ISBN 3-540-24574-X [contents] - 2004
- [e1]Klaus Jansen, Roberto Solis-Oba:
Approximation and Online Algorithms, First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers. Lecture Notes in Computer Science 2909, Springer 2004, ISBN 3-540-21079-2 [contents] - 2003
- [j6]Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko:
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme. SIAM J. Discret. Math. 16(2): 288-300 (2003) - [j5]Klaus Jansen, Roberto Solis-Oba:
An asymptotic fully polynomial time approximation scheme for bin covering. Theor. Comput. Sci. 306(1-3): 543-551 (2003) - [c12]Klaus Jansen, Roberto Solis-Oba:
Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints. PPAM 2003: 105-112 - [c11]Roberto Solis-Oba:
A Framework for Designing Approximation Algorithms for Scheduling Problems. WEA 2003: 253-260 - 2002
- [c10]Klaus Jansen, Roberto Solis-Oba:
An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering. ISAAC 2002: 175-186 - 2001
- [j4]Peter Sanders, Roberto Solis-Oba:
How Helpers Hasten h-Relations. J. Algorithms 41(1): 86-98 (2001) - [j3]Piotr Krysta, Roberto Solis-Oba:
Approximation Algorithms for Bounded Facility Location Problems. J. Comb. Optim. 5(2): 233-247 (2001) - [c9]Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba:
Job Shop Scheduling Problems with Controllable Processing Times. ICTCS 2001: 107-122 - 2000
- [c8]Peter Sanders, Roberto Solis-Oba:
How Helpers Hasten h-Relations. ESA 2000: 392-402 - [c7]Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba:
Approximation Algorithms for Flexible Job Shop Problems. LATIN 2000: 68-77
1990 – 1999
- 1999
- [j2]Greg N. Frederickson, Roberto Solis-Oba:
Increasing the Weight of Minimum Spanning Trees. J. Algorithms 33(2): 244-266 (1999) - [c6]Piotr Krysta, Roberto Solis-Oba:
Approximation Algorithms for Bounded Facility Location. COCOON 1999: 241-250 - [c5]Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko:
A Linear Time Approximation Scheme for the Job Shop Scheduling Problem. RANDOM-APPROX 1999: 177-188 - [c4]Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko:
Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme. STOC 1999: 394-399 - 1998
- [j1]Greg N. Frederickson, Roberto Solis-Oba:
Algorithms for Measuring Perturbability in Matroid Optimization. Comb. 18(4): 503-518 (1998) - [c3]Roberto Solis-Oba:
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves. ESA 1998: 441-452 - 1997
- [b1]Roberto Solis-Oba:
Robustness and approximation in combinatorial optimization. Purdue University, USA, 1997 - [c2]Greg N. Frederickson, Roberto Solis-Oba:
Efficient Algorithms for Robustness in Matroid Optimization. SODA 1997: 659-668 - 1996
- [c1]Greg N. Frederickson, Roberto Solis-Oba:
Increasing the Weight of Minimum Spanning Trees. SODA 1996: 539-546
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
