| 2008 |
|---|
| 32 | EE | Klaus Jansen,
Roberto Solis-Oba:
A Polynomial Time Approximation Scheme for the Square Packing Problem.
IPCO 2008: 184-198 |
| 31 | | Qinghui Liu,
Roberto Solis-Oba:
Web Prefetching with Machine Learning Algorithms.
International Conference on Internet Computing 2008: 142-148 |
| 2007 |
|---|
| 30 | EE | Klaus Jansen,
Roberto Solis-Oba:
New Approximability Results for 2-Dimensional Packing Problems.
MFCS 2007: 103-114 |
| 2006 |
|---|
| 29 | EE | Lucian Ilie,
Roberto Solis-Oba:
Gene Assembly Algorithms for Ciliates.
DNA 2006: 71-82 |
| 28 | EE | Klaus Jansen,
Roberto Solis-Oba:
An asymptotic approximation algorithm for 3D-strip packing.
SODA 2006: 143-152 |
| 27 | EE | 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) |
| 26 | EE | Klaus Jansen,
Roberto Solis-Oba:
Preface.
Theor. Comput. Sci. 361(2-3): 131-132 (2006) |
| 2005 |
|---|
| 25 | | Giuseppe Persiano,
Roberto Solis-Oba:
Approximation and Online Algorithms, Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers
Springer 2005 |
| 24 | EE | Aleksei V. Fishkin,
Olga Gerber,
Klaus Jansen,
Roberto Solis-Oba:
On Packing Squares with Resource Augmentation: Maximizing the Profit.
CATS 2005: 61-67 |
| 23 | EE | Lucian Ilie,
Roberto Solis-Oba,
Sheng Yu:
Reducing the Size of NFAs by Using Equivalences and Preorders.
CPM 2005: 310-321 |
| 22 | EE | Aleksei V. Fishkin,
Olga Gerber,
Klaus Jansen,
Roberto Solis-Oba:
Packing Weighted Rectangles into a Square.
MFCS 2005: 352-363 |
| 21 | EE | 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) |
| 20 | EE | Klaus Jansen,
Monaldo Mastrolilli,
Roberto Solis-Oba:
Approximation algorithms for flexible job shop problems.
Int. J. Found. Comput. Sci. 16(2): 361-379 (2005) |
| 2004 |
|---|
| 19 | | Klaus Jansen,
Roberto Solis-Oba:
Approximation and Online Algorithms, First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers
Springer 2004 |
| 2003 |
|---|
| 18 | EE | Klaus Jansen,
Roberto Solis-Oba:
Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints.
PPAM 2003: 105-112 |
| 17 | EE | Roberto Solis-Oba:
A Framework for Designing Approximation Algorithms for Scheduling Problems.
WEA 2003: 253-260 |
| 16 | EE | 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) |
| 15 | EE | Klaus Jansen,
Roberto Solis-Oba:
An asymptotic fully polynomial time approximation scheme for bin covering.
Theor. Comput. Sci. 306(1-3): 543-551 (2003) |
| 2002 |
|---|
| 14 | EE | Klaus Jansen,
Roberto Solis-Oba:
An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering.
ISAAC 2002: 175-186 |
| 2001 |
|---|
| 13 | EE | Klaus Jansen,
Monaldo Mastrolilli,
Roberto Solis-Oba:
Job Shop Scheduling Problems with Controllable Processing Times.
ICTCS 2001: 107-122 |
| 12 | | Peter Sanders,
Roberto Solis-Oba:
How Helpers Hasten h-Relations.
J. Algorithms 41(1): 86-98 (2001) |
| 11 | | Piotr Krysta,
Roberto Solis-Oba:
Approximation Algorithms for Bounded Facility Location Problems.
J. Comb. Optim. 5(2): 233-247 (2001) |
| 2000 |
|---|
| 10 | | Peter Sanders,
Roberto Solis-Oba:
How Helpers Hasten h-Relations.
ESA 2000: 392-402 |
| 9 | | Klaus Jansen,
Monaldo Mastrolilli,
Roberto Solis-Oba:
Approximation Algorithms for Flexible Job Shop Problems.
LATIN 2000: 68-77 |
| 1999 |
|---|
| 8 | EE | Piotr Krysta,
Roberto Solis-Oba:
Approximation Algorithms for Bounded Facility Location.
COCOON 1999: 241-250 |
| 7 | | Klaus Jansen,
Roberto Solis-Oba,
Maxim Sviridenko:
A Linear Time Approximation Scheme for the Job Shop Scheduling Problem.
RANDOM-APPROX 1999: 177-188 |
| 6 | EE | Klaus Jansen,
Roberto Solis-Oba,
Maxim Sviridenko:
Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme.
STOC 1999: 394-399 |
| 5 | | Greg N. Frederickson,
Roberto Solis-Oba:
Increasing the Weight of Minimum Spanning Trees.
J. Algorithms 33(2): 244-266 (1999) |
| 1998 |
|---|
| 4 | EE | Roberto Solis-Oba:
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves.
ESA 1998: 441-452 |
| 3 | EE | Greg N. Frederickson,
Roberto Solis-Oba:
Algorithms for Measuring Perturbability in Matroid Optimization.
Combinatorica 18(4): 503-518 (1998) |
| 1997 |
|---|
| 2 | | Greg N. Frederickson,
Roberto Solis-Oba:
Efficient Algorithms for Robustness in Matroid Optimization.
SODA 1997: 659-668 |
| 1996 |
|---|
| 1 | | Greg N. Frederickson,
Roberto Solis-Oba:
Increasing the Weight of Minimum Spanning Trees.
SODA 1996: 539-546 |
