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 | 156 | 1998 |
Increasing the weight of minimum spanning trees GN Frederickson, R Solis-Oba Journal of Algorithms 33 (2), 244-266, 1999 | 150 | 1999 |
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 | 86 | 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 | 61 | 2000 |
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 | 58 | 2003 |
Rectangle packing with one-dimensional resource augmentation K Jansen, R Solis-Oba Discrete Optimization 6 (3), 310-323, 2009 | 56 | 2009 |
New approximability results for 2-dimensional packing problems K Jansen, R Solis-Oba International Symposium on Mathematical Foundations of Computer Science, 103-114, 2007 | 51 | 2007 |
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 | 51 | 1999 |
Reducing the size of NFAs by using equivalences and preorders L Ilie, R Solis-Oba, S Yu Combinatorial Pattern Matching: 16th Annual Symposium, CPM 2005, Jeju Island …, 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 | 41 | 2008 |
Packing weighted rectangles into a square AV Fishkin, O Gerber, K Jansen, R Solis-Oba Mathematical Foundations of Computer Science 2005: 30th International …, 2005 | 38 | 2005 |
An asymptotic approximation algorithm for 3 d-strip packing K Jansen, R Solis-Oba SODA 6, 143-152, 2006 | 37 | 2006 |
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 | 34 | 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 | 24 | 1999 |
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 |
Makespan minimization on unrelated parallel machines with a few bags DR Page, R Solis-Oba Theoretical Computer Science 821, 34-44, 2020 | 21 | 2020 |
Approximation algorithms for bounded facility location problems P Krysta, R Solis-Oba Journal of combinatorial optimization 5, 233-247, 2001 | 17 | 2001 |
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 | 16 | 2017 |
L (2, 1)-labelings on the modular product of two graphs Z Shao, R Solis-Oba Theoretical computer science 487, 74-81, 2013 | 16 | 2013 |