FAW2016, Qingdao,

China, June 30-July 2,2016

Thomas Erlebach


Title: Algorithms for Queryable Uncertainty


Brief Biography:

Thomas Erlebach received a PhD in Computer Science from Technische Universität München in 1999. From 2000 to 2004 he was an Assistant Professor in Theory of Communication Networks at ETH Zürich. Since September 2004 he has been with the Department of Computer Science at University of Leicester, first as Reader and then, from April 2007, as Professor. His research interests lie in approximation and online algorithms for combinatorial optimisation problems, algorithmic aspects of communication networks, and computing with uncertainty. He is a member of the Editorial Board of Theoretical Computer Science, has served on over 50 program committees of international conferences and has published more than 120 papers in refereed conferences and journals.



Jianer Chen


Title: On Relating Parameterized Tractability and Polynomial-Time Approximability


Brief Biography:

Jianer Chen received a Ph.D. degree in Computer Science from Courant Institute, New York University, and a Ph.D. degree in Mathematics from Columbia University. Currently, he is a Professor of Computer Science and Engineering at Texas A&M University. He has received numerous awards for his teaching and research in Computer Science and Engineering, including the Janet Fabri Award for the Best Ph.D. Dissertation in New York University, NSF Research Initiation Award, Eugene E. Webb'43 Faculty Fellow Award, E.D. Brockett Professorship Award, and the AFS Distinguished Faculty Achievement Award (university Level), from Texas A&M University. He is serving as an Associate Editor for IEEE Transactions on Computers, Journal of Computer and System Sciences, and Science China Information Sciences. He has been a keynote speaker and program committee chair for numerous international conferences, and was a Distinguished Lecturer for the Canadian PIMS Distinguished Lecture Series. His research interests include algorithms and their applications, network optimization, computational biology, and computer graphics. He has published extensively in these areas.



Binhai Zhu


Title: genomic scaffold filling and the related algorithms


Brief Biography:

Binhai Zhu is currently a professor in computer science at Montana State University, Bozeman, MT, USA. He obtained a PhD in computer science McGill University in 1994. His research interests are in algorithms, computational biology, computational geometry and combinatorial optimization; and he has published over 160 papers in these areas.

News/Updating
Submission deadline extended to February 15th.
Notification of acceptance extended to March 21th.
Important Dates
Submission deadline: February 1, 2016 Notification of acceptance: March 7, 2016 Final version due: April 13, 2016 Conference Dates: June 30-July 2, 2016
Sponsors