Roberto Solis-Oba

Selected publications

• Daniel Page* and Roberto Solis-Oba. (2019). Approximation algorithms for the graph balancing problem with two speeds and two job lengths. Journal of Combinatorial Optimization. 37(3): 1045-1070.
• Roberto Solis-Oba, Paul Bonsma, and Stefanie Lowski. (2017). A 2-approximation algorithm for finding a spanning tree with maximum number of leaves. Algorithmica. 77(2): 374-388.
• Zhendong Shao* and Roberto Solis-Oba. (2018). Labeling Mycielski graphs with a condition at distance two. Ars Combinatoria. 140: 337-349.
• Nasim Samei* and Roberto Solis-Oba. (2015). Analysis of a local search algorithm for the k-facility location problem. RAIRO Theoretical Informatics and Applications. 49(4): 285-306.
• Lucian Ilie, Bahlul Haider*, Mike Molnar*, Roberto Solis-Oba. (2014). SAGE: String overlap assembly of genomes. BMC Bioinformatics. 15: 302-310.
• Jansen and R. Solis-Oba. A polynomial time OPT +1 algorithm for the cutting stock problem with a constant number of object lengths. In Mathematics of Operations Research, 36(4), 743–753, 2011.
• 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.
• Jansen, R. Solis-Oba, and M. Sviridenko. Makespan minimization in job shops: a polynomial time approximation scheme. In SIAM Journal on Discrete Mathematics, 16(2), 2003, pp. 288–300.
• Sanders and R. Solis-Oba. How helpers hasten h-relations. In Journal of Algorithms, 41, 2001, pp. 86-98.
• Frederickson and R. Solis-Oba. Increasing the weight of minimum spanning trees. In Journal of Algorithms, 33, 1999, pp. 244-266.