| Increasing the weight of minimum spanning trees GN Frederickson, R Solis-Oba Journal of Algorithms 33 (2), 244-266, 1999 | 157 | 1999 |
| 2-approximation algorithm for finding a spanning tree with maximum number of leaves R Solis-Oba Algorithms—ESA’98: 6th Annual European Symposium Venice, Italy, August 24 …, 1998 | 155 | 1998 |
| Approximation schemes for job shop scheduling problems with controllable processing times K Jansen, M Mastrolilli, R Solis-Oba European journal of operational research 167 (2), 297-319, 2005 | 83 | 2005 |
| An asymptotic fully polynomial time approximation scheme for bin covering K Jansen, R Solis-Oba Theoretical Computer Science 306 (1-3), 543-551, 2003 | 73 | 2003 |
| Approximation algorithms for flexible job shop problems K Jansen, M Mastrolilli, R Solis-Oba LATIN 2000: Theoretical Informatics: 4th Latin American Symposium, Punta del …, 2000 | 64 | 2000 |
| Rectangle packing with one-dimensional resource augmentation K Jansen, R Solis-Oba Discrete Optimization 6 (3), 310-323, 2009 | 60 | 2009 |
| Makespan minimization in job shops: A linear time approximation scheme K Jansen, R Solis-Oba, M Sviridenko SIAM Journal on Discrete Mathematics 16 (2), 288-300, 2003 | 59 | 2003 |
| Makespan minimization in job shops: a polynomial time approximation scheme K Jansen, R Solis-Oba, M Sviridenko Proceedings of the thirty-first annual ACM symposium on Theory of Computing …, 1999 | 54 | 1999 |
| New approximability results for 2-dimensional packing problems K Jansen, R Solis-Oba International Symposium on Mathematical Foundations of Computer Science, 103-114, 2007 | 53 | 2007 |
| Reducing the size of NFAs by using equivalences and preorders L Ilie, R Solis-Oba, S Yu Annual Symposium on Combinatorial Pattern Matching, 310-321, 2005 | 45 | 2005 |
| A polynomial time approximation scheme for the square packing problem K Jansen, R Solis-Oba International Conference on Integer Programming and Combinatorial …, 2008 | 44 | 2008 |
| An asymptotic approximation algorithm for 3d-strip packing K Jansen, R Solis-Oba Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006 | 38 | 2006 |
| Packing weighted rectangles into a square AV Fishkin, O Gerber, K Jansen, R Solis-Oba International Symposium on Mathematical Foundations of Computer Science, 352-363, 2005 | 38 | 2005 |
| Approximation algorithms for flexible job shop problems K Jansen, M Mastrolilli, R Solis-Oba International Journal of Foundations of Computer Science 16 (02), 361-379, 2005 | 32 | 2005 |
| A linear time approximation scheme for the job shop scheduling problem K Jansen, R Solis-Oba, M Sviridenko International Workshop on Randomization and Approximation Techniques in …, 1999 | 25 | 1999 |
| Makespan minimization on unrelated parallel machines with a few bags DR Page, R Solis-Oba Theoretical Computer Science 821, 34-44, 2020 | 23 | 2020 |
| E cient algorithms for robustness in matroid optimization GN Frederickson, R Solis-Oba Proceedings of the Eight Annual ACM-SIAM Symposium on Discrete Algorithms …, 1997 | 23 | 1997 |
| A 2-approximation algorithm for finding a spanning tree with maximum number of leaves R Solis-Oba, P Bonsma, S Lowski Algorithmica 77, 374-388, 2017 | 20 | 2017 |
| Explainable-ai in automated medical report generation using chest x-ray images SB Ahmed, R Solis-Oba, L Ilie Applied Sciences 12 (22), 11750, 2022 | 17 | 2022 |
| L (2, 1)-labelings on the modular product of two graphs Z Shao, R Solis-Oba Theoretical computer science 487, 74-81, 2013 | 17 | 2013 |
