The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Roberto Solis-Oba: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba
    On Packing Squares with Resource Augmentation: Maximizing the Profit. [Citation Graph (0, 0)][DBLP]
    CATS, 2005, pp:61-67 [Conf]
  2. Piotr Krysta, Roberto Solis-Oba
    Approximation Algorithms for Bounded Facility Location. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:241-250 [Conf]
  3. Lucian Ilie, Roberto Solis-Oba, Sheng Yu
    Reducing the Size of NFAs by Using Equivalences and Preorders. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:310-321 [Conf]
  4. Lucian Ilie, Roberto Solis-Oba
    Gene Assembly Algorithms for Ciliates. [Citation Graph (0, 0)][DBLP]
    DNA, 2006, pp:71-82 [Conf]
  5. Peter Sanders, Roberto Solis-Oba
    How Helpers Hasten h-Relations. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:392-402 [Conf]
  6. Roberto Solis-Oba
    2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:441-452 [Conf]
  7. Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
    Job Shop Scheduling Problems with Controllable Processing Times. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:107-122 [Conf]
  8. Klaus Jansen, Roberto Solis-Oba
    An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:175-186 [Conf]
  9. Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
    Approximation Algorithms for Flexible Job Shop Problems. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:68-77 [Conf]
  10. Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba
    Packing Weighted Rectangles into a Square. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:352-363 [Conf]
  11. Klaus Jansen, Roberto Solis-Oba
    Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints. [Citation Graph (0, 0)][DBLP]
    PPAM, 2003, pp:105-112 [Conf]
  12. Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko
    A Linear Time Approximation Scheme for the Job Shop Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:177-188 [Conf]
  13. Greg N. Frederickson, Roberto Solis-Oba
    Increasing the Weight of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:539-546 [Conf]
  14. Greg N. Frederickson, Roberto Solis-Oba
    Efficient Algorithms for Robustness in Matroid Optimization. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:659-668 [Conf]
  15. Klaus Jansen, Roberto Solis-Oba
    An asymptotic approximation algorithm for 3D-strip packing. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:143-152 [Conf]
  16. Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko
    Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:394-399 [Conf]
  17. Roberto Solis-Oba
    A Framework for Designing Approximation Algorithms for Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:253-260 [Conf]
  18. Greg N. Frederickson, Roberto Solis-Oba
    Algorithms for Measuring Perturbability in Matroid Optimization. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:4, pp:503-518 [Journal]
  19. Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
    Approximation algorithms for flexible job shop problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:2, pp:361-379 [Journal]
  20. Greg N. Frederickson, Roberto Solis-Oba
    Increasing the Weight of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:33, n:2, pp:244-266 [Journal]
  21. Peter Sanders, Roberto Solis-Oba
    How Helpers Hasten h-Relations. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:1, pp:86-98 [Journal]
  22. Piotr Krysta, Roberto Solis-Oba
    Approximation Algorithms for Bounded Facility Location Problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:2, pp:233-247 [Journal]
  23. Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko
    Makespan Minimization in Job Shops: A Linear Time Approximation Scheme. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:2, pp:288-300 [Journal]
  24. Greg N. Frederickson, Roberto Solis-Oba
    Efficient algorithms for robustness in resource allocation and scheduling problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:352, n:1-3, pp:250-265 [Journal]
  25. Klaus Jansen, Roberto Solis-Oba
    An asymptotic fully polynomial time approximation scheme for bin covering. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:543-551 [Journal]
  26. Klaus Jansen, Roberto Solis-Oba
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:361, n:2-3, pp:131-132 [Journal]
  27. Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
    Approximation schemes for job shop scheduling problems with controllable processing times. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:167, n:2, pp:297-319 [Journal]
  28. Klaus Jansen, Roberto Solis-Oba
    New Approximability Results for 2-Dimensional Packing Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:103-114 [Conf]

  29. Web Prefetching with Machine Learning Algorithms. [Citation Graph (, )][DBLP]


  30. Improving the Performance of Online Mapping Applications with Prefetching. [Citation Graph (, )][DBLP]


  31. An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths. [Citation Graph (, )][DBLP]


  32. A Polynomial Time Approximation Scheme for the Square Packing Problem. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002