CS-Motivated Problems

Generating Test Suites/Covering Arrays

Declustering Schemes

Others

  • The Multi-Spreader Crane Scheduling Problem: Partitions and Supersequences. With M. Petering and Y. Wu.  Discrete Applied Mathematics, Vol 281, pages 207-218, January 2021.
  • Balanced Matching of Buyers and Sellers in E-Marketplaces: The Barter Trade Exchange Model. With P. Haddawy, N. Rujikeadkumjorn and K. Dhananaiyapergse. Electronic Commerce Research and Applications 4:4 (2005) pp. 299-314. A preliminary version of the paper appeared in the Proceedings of the 6th International Conference on Electronic Commerce (ICEC ’04), (2004).
  • Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings. SIAM Journal on Discrete Mathematics 17:3 (2004) pp. 384-402. A preliminary version of the paper appeared in the Proceedings of the 2nd Approximation Algorithms for Combinatorial Optimization (APPROX ’99) (1999) pp.209-220.
  • SLALoM: A Scalable Location Management Scheme for Large Mobile Ad-hoc Networks. With H. Lemberg, S. Philip, E. van den Berg, T. Zhang.  Proceedings of Wireless Communications and Networking Conference (WCNC ’02), (2002).
  • Location Prediction Algorithms for Mobile Wireless Systems. With R. Jain and E. van den Berg. In Wireless Internet Handbook: Technologies, Standards and Applications, M. Ilyas and B. Furht (eds.) CRC Press, 2003, pp. 245-264.