Attila Benko

Optimal algorithms for online scheduling with bounded rearrangement at the end

Xin Chen, Xin Han, Yan Lan, 2011, Theor. Comput. Sci..

2D knapsack: Packing squares

Xin Han, Yan Lan, György Dósa, 2013, Theor. Comput. Sci..

Bin Packing/Covering with Delivery, solved with the evolution of algorithms

Zsolt Tuza, György Dósa, Attila Benko, 2010, 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA).

Bin covering with a general profit function: approximability results

Zsolt Tuza, György Dósa, Attila Benko, 2013, Central Eur. J. Oper. Res..

2D Knapsack: Packing Squares

Min Chen, Xin Han, György Dósa, 2011, FAW-AAIM.

Online scheduling with one rearrangement at the end: Revisited

He Guo, Xin Han, Yuxin Wang, 2012, Inf. Process. Lett..

History of Artificial Intelligence

Cecilia Sik Lanyi, Attila Benko, 2009 .

Ambient Intelligence in Multimeda and Virtual Reality Environments for the rehabilitation

Attila Benko, Sik Lanyi Cecilia, 2009, Multimedia Techniques for Device and Ambient Intelligence.