Roberto Solis-Oba

Klaus Jansen, Roberto Solis-Oba: Packing Squares with Profits. SIAM J. Discrete Math. 26(1): 263-279 (2012)

Roberto Solis-Oba, Giuseppe Persiano (Eds.): 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

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)

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)

Klaus Jansen, Roberto Solis-Oba (Eds.): 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

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

Zhendong Shao, Roberto Solis-Oba: L(2, 1)-Labelings on the composition of n graphs. Theor. Comput. Sci. 411(34-36): 3287-3292 (2010)

Guo Mei, Roberto Solis-Oba: Improvements on Existing Search Engines through Categorization. International Conference on Internet Computing 2010: 71-76

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

Klaus Jansen, Roberto Solis-Oba: Rectangle packing with one-dimensional resource augmentation. Discrete Optimization 6(3): 310-323 (2009)

Qinghui Liu, Roberto Solis-Oba: Improving the Performance of Online Mapping Applications with Prefetching. International Conference on Internet Computing 2009: 180-186

Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba: On Packing Rectangles with Resource Augmentation: Maximizing the Profit. Algorithmic Operations Research 3(1) (2008)

Qinghui Liu, Roberto Solis-Oba: Web Prefetching with Machine Learning Algorithms. International Conference on Internet Computing 2008: 142-148

Klaus Jansen, Roberto Solis-Oba: A Polynomial Time Approximation Scheme for the Square Packing Problem. IPCO 2008: 184-198

Klaus Jansen, Roberto Solis-Oba: New Approximability Results for 2-Dimensional Packing Problems. MFCS 2007: 103-114

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)

Klaus Jansen, Roberto Solis-Oba: Preface. Theor. Comput. Sci. 361(2-3): 131-132 (2006)

Lucian Ilie, Roberto Solis-Oba: Gene Assembly Algorithms for Ciliates. DNA 2006: 71-82

Klaus Jansen, Roberto Solis-Oba: An asymptotic approximation algorithm for 3D-strip packing. SODA 2006: 143-152

Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba: Approximation schemes for job shop scheduling problems with controllable processing times. European Journal of Operational Research 167(2): 297-319 (2005)

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

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

Lucian Ilie, Roberto Solis-Oba, Sheng Yu: Reducing the Size of NFAs by Using Equivalences and Preorders. CPM 2005: 310-321

Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba: Packing Weighted Rectangles into a Square. MFCS 2005: 352-363

Giuseppe Persiano, Roberto Solis-Oba (Eds.): 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

Klaus Jansen, Roberto Solis-Oba (Eds.): 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

Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko: Makespan Minimization in Job Shops: A Linear Time Approximation Scheme. SIAM J. Discrete Math. 16(2): 288-300 (2003)

Klaus Jansen, Roberto Solis-Oba: An asymptotic fully polynomial time approximation scheme for bin covering. Theor. Comput. Sci. 306(1-3): 543-551 (2003)

Klaus Jansen, Roberto Solis-Oba: Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints. PPAM 2003: 105-112

Roberto Solis-Oba: A Framework for Designing Approximation Algorithms for Scheduling Problems. WEA 2003: 253-260

Klaus Jansen, Roberto Solis-Oba: An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering. ISAAC 2002: 175-186

Peter Sanders, Roberto Solis-Oba: How Helpers Hasten h-Relations. J. Algorithms 41(1): 86-98 (2001)

Piotr Krysta, Roberto Solis-Oba: Approximation Algorithms for Bounded Facility Location Problems. J. Comb. Optim. 5(2): 233-247 (2001)

Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba: Job Shop Scheduling Problems with Controllable Processing Times. ICTCS 2001: 107-122

Peter Sanders, Roberto Solis-Oba: How Helpers Hasten h-Relations. ESA 2000: 392-402

Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba: Approximation Algorithms for Flexible Job Shop Problems. LATIN 2000: 68-77

Greg N. Frederickson, Roberto Solis-Oba: Increasing the Weight of Minimum Spanning Trees. J. Algorithms 33(2): 244-266 (1999)

Piotr Krysta, Roberto Solis-Oba: Approximation Algorithms for Bounded Facility Location. COCOON 1999: 241-250

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

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

Greg N. Frederickson, Roberto Solis-Oba: Algorithms for Measuring Perturbability in Matroid Optimization. Combinatorica 18(4): 503-518 (1998)

Roberto Solis-Oba: 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves. ESA 1998: 441-452

Greg N. Frederickson, Roberto Solis-Oba: Efficient Algorithms for Robustness in Matroid Optimization. SODA 1997: 659-668

Greg N. Frederickson, Roberto Solis-Oba: Increasing the Weight of Minimum Spanning Trees. SODA 1996: 539-546