Publications in Venue "Theoretical Computer Science"
| 1. | L. Liu, Y. Chen, J. Dong, R. Goebel, G. Lin, Y. Luo, G. Ni, B. Su, Y. Xu, A. Zhang. "Approximation algorithms for three-machine proportionate mixed shop scheduling". Theoretical Computer Science, 803, pp 57-70, January 2020.   |
| 2. | Y. Chen, R. Goebel, G. Lin, B. Su, A. Zhang. "Open-shop scheduling for unit jobs under precedence constraints". Theoretical Computer Science, 803, pp 144-151, January 2019. |
| 3. | W. Tong, E. Miyano, R. Goebel, G. Lin. "An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops". Theoretical Computer Science, 734, pp 24-31, July 2018. |
| 4. | W. Tong, R. Goebel, G. Lin. "Smoothed heights of tries and patricia tries". Theoretical Computer Science, 609(Part 3), pp 620-626, January 2016. |
| 5. | W. Tong, R. Goebel, T. Liu, G. Lin. "Approximating the Maximum Multiple RNA Interaction Problem". Theoretical Computer Science, 556, pp 63-70, October 2014. |
| 6. | Z. Chen, B. Fu, R. Goebel, G. Lin, W. Tong, J. Xu, B. Yang, Z. Zhao, B. Zhu. "On the approximability of the exemplar adjacency number problem for genomes with gene repetitions". Theoretical Computer Science, 550, pp 59-65, September 2014. |
| 7. | Z. Cai, R. Goebel, G. Lin. "Size-constrained Tree Partitioning: Approximating the Multicast k-tree Routing Problem". Theoretical Computer Science, 412(3), pp 240-245, January 2011. |
| 8. | A. Junghanns, J. Schaeffer. "Sokoban: Improving the Search with Relevance Cuts". Theoretical Computer Science, 252(1-2), pp 151-175, June 1999. |
| 9. | R. Holte, L. Rosier, I. Tulchinsky. "Pinwheel Scheduling with Two Distinct Numbers". Theoretical Computer Science, Part A: 100(1), pp 106-135, June 1992. |
