Publications

	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.
	Approximation schemes for scheduling problems with controllable processing times, Klaus Jansen, Monaldo Mastrolilli, and Roberto Solis-Oba, submitted.
	Finding a spanning tree with bounded weight , Manuscript, 1998.
	Minimum (k,k')-cuts , Manuscript, 1997.