 |
R. Solis-Oba, P. Bonsma, and S. Lowski. A 2-approximation algorithm for finding a spanning
tree with maximum number of leaves.
In Algorithmica, 77(2), 2017, pp. 374-388.
|
|
K. Jansen and R. Solis-Oba. Packing squares with profits. In SIAM Journal on Discrete
Mathematics, 26(1), 2012, pp. 263-279.
|
|
K. Jansen and R. Solis-Oba. Packing squares with profits. In SIAM Journal on Discrete
Mathematics, 26(1), 2012, pp. 263-279.
|
|
K. Jansen and R. Solis-Oba. A simple OP T + 1 algorithm for cutting stock under the modified
integer round-up property assumption. In Information Processing Letters, 111, 2011,
479–482
|
|
K. Jansen and R. Solis-Oba. Approximation schemes for scheduling jobs with chain precedence
constraints. In International Journal of Foundations of Computer Science, 21 (1),
2010, 27–49.
|
|
K. Jansen and R. Solis-Oba. Approximation schemes for scheduling jobs with chain precedence
constraints. In International Journal of Foundations of Computer Science, 21 (1),
2010, 27–49.
|
|
K. Jansen and R. Solis-Oba. Rectangle packing with one-dimensional resource augmentation.
In Discrete Optimization, 6, 2009, 310–323.
|
|
A. Fishkin, O. Gerber, K. Jansen, and R. Solis-Oba. On packing rectangles with resource
augmentation: maximizing the profit. In Algorithmic Operations Research, 3 (1), 2008,
1–12.
|
|
K. Jansen, M. Mastrolilli, and R. Solis-Oba. Job shop scheduling problems with controllable
processing times. In European Journal of Operational Research, 167 (2), 2005, 297–319.
|
|
K. Jansen, M. Mastrolilli, and R. Solis-Oba. Approximation algorithms for flexible job shop
problems. In In
|
|
L. Ilie, B. Haider, M. Molnar, and R. Solis-Oba. SAGE: String overlap assembly of genomes.
In BMC Bioinformatics, 15, 2014, 302–310.
|
|
G. Frederickson and R. Solis-Oba. Efficient algorithms for robustness in resource allocation.
In Theoretical Computer Science, 352, 2006, 250–265.
|
|
M. Maack, D. Page, and R. Solis-Oba. Makespan minimization on unrelated parallel ma-
chines with simple job-intersection structure and bounded job assignments. In Theoretical
Computer Science,
|
|
D. Page and R. Solis-Oba. Makespan minimization on unrelated parallel machines with few
bags. In Theoretical Computer Science
|
|
N. Samei and R. Solis-Oba. Analysis of a local search algorithm for the k-facility location
problem. In RAIRO-Theoretical Informatics and Applications, 49 (4), 2015, 285–306.
|
|
D.R. Page and R. Solis-Oba. A 3/2-approximation algorithm for the graph balancing problem
with two weights. In Algorithms, 9 (38), 11 pages, doi:10.3390/a9020038.
|
|
D.R. Page and R. Solis-Oba. Approximation Algorithms for the Graph Balancing Problem
with Two Speeds and Two Job Lengths. In Journal of Combinatorial Optimization,
37(3), 2019, 1045–1070.
|
|
R. Solis-Oba, Igor Averbakh and Z. Shao. L(2,1)-Labeling of Kneser graphs and coloring
squares of Kneser graphs. In Discrete Applied Mathematics, 221, 2017, 106–114.
|
|
R. Solis-Oba and Z. Shao. A new characterization of disk graphs and its application. In Ars
Combinatoria, 127, 2016, 421–434.
|
|
R. Solis-Oba and Z. Shao. On some results on the L(2, 1)-labeling of Cartesian sum graphs.
In Ars Combinatoria, 124, 2016, 365-377.
|
|
R. Solis-Oba and Z. Shao. Labeling Total graphs with a condition at distance two. In Ars
Combinatoria, 140, 2018, 97-111.
|
|
R. Solis-Oba and Z. Shao. Labeling Mycielski graphs with a condition at distance two. In Ars
Combinatoria, 140, 2018, 337-349.
|
|
R. Solis-Oba and Z. Shao. L(2,1)-Labelings on the modular product of two graphs. In Theo-
retical Computer Science, 487, 2013, Pages 74–81.
|
|
R. Solis-Oba and S. Zhao. L(2,1)-labelings on the compositions of n graphs. In Theoretical
Computer Science, 411, 2010, 3287–3292.
|
|
K. Jansen, M. Maack, and R. Solis-Oba. Structural Parameters for Scheduling with As-
signment Restrictions. In International Conference on Algorithms and Complexity
(CIAC 2017): Algorithms and Complexity, 2017, 357–368.
|
|
K. Jansen and R. Solis-Oba. An OPT+1 algorithm for the cutting stock problem with constant
number of object lengths. In The 14th Conference on Integer Programming and
Combinatorial Optimization (IPCO), 2010, 438–449.
|
|
K. Jansen and R. Solis-Oba. A polynomial time approximation scheme for the square packing
problem. In The 13th Conference on Integer Programming and Combinatorial
Optimization (IPCO), 2008, LNCS 5035, pp. 184-198.
|
|
K. Jansen and R. Solis-Oba. New approximability results for 2-dimensional packing problems.
In 32nd International Symposium on Mathematical Foundations of Computer
Science, 2007, LNCS 4708, pp. 103-114.
|
|
A.F. Fishkin, O. Gerber, K. Jansen, and R. Solis-Oba. Packing weighted rectangles into a
square. In Mathematical Foundations of Computer Science, 2005, LNCS 3618, pp.
352-363.
|
|
L. Ilie, R. Solis-Oba, and S. Yu. Reducing the size of NFAs by using equivalences and pre-
orders. In Sixteenth Annual Symposium on Combinatorial Pattern Matching, 2005,
LNCS 3537, pp. 310–321.
|
|
K. Jansen and R. Solis-Oba. A (2 + ǫ)-asymptotic approximation algorithm for 3D-strip
packing. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006, pp.
143–152.
|
|
A.F. Fishkin, O. Gerber, K. Jansen, and R. Solis-Oba. On packing squares with resource
augmentation: maximizing the profit. In Computing: The Australasian Theory Sym-
posium, 2005, Volume 41, Conferences in Research and Practice in Information Technology,
pp. 61–67.
|
|
K. Jansen and R. Solis-Oba. Approximation algorithms for scheduling jobs with chain prece-
dence constraints. In Fifth International Conference on Parallel Processing and
Applied Mathematics (PPAM), 2004, LNCS 3019, pp. 105-112.
|
|
R. Solis-Oba. A framework for designing approximation schemes for scheduling problems.
In Second International Workshop on Experimental and Efficient Algorithms
(WEA), 2003, LNCS 2647, pp. 253-260.
|
|
E.R.M. Debenham and R. Solis-Oba. New Algorithms for Computing Field of Vision over 2D
Grids . In 6th International Conference on Computer Science, Engineering And
Applications (CSEA 2020), 2020, AIRCC Publishing Corporation, Volume 10, number
18, 1–18.
|
|
D.R. Page, Roberto Solis-Oba and Marten Maack. Makespan minimization on unrelated
parallel machines with simple job-intersection structure and machine capacities. In The
12th International Conference on Combinatorial Optimization and Applications
(COCOA), 2018, LNCS 11346, 341–356.
|
|
D.R. Page and R.Solis-Oba. Makespan minimization on unrelated parallel machines with
a few bags. In The Twelfth International Conference on Algorithmic Aspects in
Information and Management (AAIM), 2018, LNCS 11343, 24–35.
|
|
G. Mei and R. Solis-Oba. Subject-driven community mining in online social networks. In
The 2011 International Conference on Internet Computing (ICOMP), 2011, 84–89.
|
|
G. Mei and R. Solis-Oba. Improvements on Existing Search Engines Through Categorization.
In The 2010 International Conference on Internet Computing (ICOMP), 2010,
71–76.
|
|
Q. Liu and R. Solis-Oba. Improving the performance of online mapping applications with
prefetching. In The 2009 International Conference on Internet Computing (ICOMP),
2009, pp. 180-186.
|
|
Q. Liu and R. Solis-Oba. Web Prefetching with Machine Learning Algorithms. In The 2008
International Conference on Internet Computing (ICOMP2008), 2008, pp. 142-148.
|
|
Q. Liu and R. Solis-Oba. Web prefetching with high accuracy and low memory cost. In
Applied Computing Conference (ACC), 2008, pp. 114-119.
|
|
R. Solis-Oba and A. Alhenshiri. Improving web search results for short queries using preserved
query knowledge. In First International Conference on Digital Communications and
Computer Applications, 2007, electronic proceedings.
|
|
R. Solis-Oba. Local Search. In Handbook on Approximation Algorithms and Meta-
heuristics, T. Gonzalez editor. Book chapter, Chapman and Hall/CRC Press, Florida, 2007.
|
|
R. Solis-Oba. Approximation algorithms for the k-median problem. In Approximation
Algorithms in Combinatorial Optimization, K. Jansen, E. Bampis, and C. Kenyon,
editors. Book chapter, LNCS 3484, 292-320, 2006.
|
|
N. Samei and R. Solis-Oba. Local Search. In Handbook on Approximation Algorithms
and Metaheuristics, Second Edition, T. Gonzalez editor. Chapter 16, pages 277-298.
Chapman and Hall/CRC, 2018.
|
 |
Scheduling jobs with chain precedence constraints ,
Klaus Jansen and Roberto Solis-Oba,
Parallel Processing and Applied Mathematics, PPAM 2003, LNCS 3019,
105-112.
|
|
An asymptotic fully polynomial time approximation scheme for bin
covering,
Klaus Jansen and Roberto Solis-Oba,
13th International Symposium on Algorithms and Computation
(ISAAC 2002), 2002, LNCS 2518, pp. 175-186. |
|
Job shop scheduling problems with controllable processing times,
Klaus Jansen, Monaldo Mastrolilli, and Roberto Solis-Oba,
Proceedings of the Seventh Italian Conference on
Theoretical Computer Science (ICTCS 2001), 2001, LNCS 2202,
pp. 107--122. |
|
How helpers hasten $h$-relations ,
Peter Sanders and Roberto Solis-Oba,
Proceedings of the 8th Annual European Symposium on
Algorithms (ESA), Saarbrucken, Germany, 2000, LNCS 1879,
pp. 392-402. Journal of Algorithms, 41, 2001, pp. 86-98.
|
|
Approximation algorithms for flexible job shop problems ,
Klaus Jansen, Monaldo Mastrolilli, and Roberto Solis-Oba,
Proceedings of Latin American Theoretical Informatics
(LATIN), 2000, LNCS 1776, pp. 68-77. |
|
Linear time approximation schemes for shop scheduling problems.
Klaus Jansen, Maxim Sviridenko, and Roberto Solis-Oba, in
Approximation and Complexity in Numerical
Optimization, Panos Pardalos (Editor), 1999, pp. 338-346.
|
|
A linear time approximation scheme for the job shop scheduling
problem,
Klaus Jansen, Maxim Sviridenko, and Roberto Solis-Oba,
Proceedings of the Second International Workshop on
Approximation Algorithms (APPROX), Berkeley, 1999, LNCS 1671,
pp. 177-188. |
|
Makespan minimization in job shops: a polynomial time approximation
scheme,
Klaus Jansen, Maxim Sviridenko, and Roberto Solis-Oba,
Proceedings of the 31st Annual ACM Symposium on
Theory of Computing (STOC), pp. 394-399.
1999 |
|
Approximation algorithms for bounded facility location,
,
Piotr Krysta and Roberto Solis-Oba,
Proceedings of the Fifth Annual International
Computing and Combinatorics Conference (COCOON), 1999,
LNCS 1627, pp. 241-250. Also in Journal of Combinatorial
Optimization, 5, 2001, pp. 2-16. |
|
2-Approximation algorithm for finding a spanning tree with
maximum number of leaves,
Proceedings of the 6th Annual European Symposium on
Algorithms (ESA), 1998, LNCS 1461, pp. 441-452. |
|
Rooted spanning trees with small weight and average length
,
Greg Frederickson and Roberto Solis-Oba,
Theoretical Computer Science
(P. Degano, U. Vaccaro, and G.
Pirillo, editors), World Scientific, Singapore, 1998, pp. 114-125.
|
|
|
Increasing the weight of minimum
spanning trees,
Greg Frederickson and Roberto Solis-Oba,
Journal of Algorithms 33 (1999) pp. 394-399.
A preliminary version of the paper appeared in the
Proceedings
of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA), 1996, pp. 539-546. |
|
Algorithms for measuring perturbability in matroid
optimization,
Greg Frederickson and Roberto Solis-Oba,
Combinatorica, 18(4), 1998, 503-518.
|
|
Robustness analysis in combinatorial optimization,
Greg Frederickson and Roberto Solis-Oba,
Technical Report MPI-I-98-1-011, Max Planck Institut
für Informatik, Germany. |
|
|
Efficient algorithms for robustness
in matroid optimization,
Greg Frederickson and Roberto Solis-Oba,
Proceedings of the Eight Annual ACM-SIAM Symposium
on Discrete Algorithms (SODA), 1997, pp. 659-668. |
|
|
Efficient algorithms for robustness
in resource allocation and scheduling problems,
Greg Frederickson and Roberto Solis-Oba,
Full version submitted to Algorithmica
A preliminary version of the paper appeared in the
Proceedings of the Eight Annual ACM-SIAM Symposium on Discrete
Algorithms (SODA), 1997, pp. 659-668. |