RESEARCH TEAM

COMBINATORICS OF EFFICIENT COMPUTATIONS

 
Our group studies various aspects of efficient computations, including for instance approximation algorithms, online algorithms, exact algorithms, combinatorial optimization, and data structures, from (mostly) structural perspectives. The approaches typically view computational problems as natural problems in combinatorics about certain discrete structures and approach the problems through the study of intrinsic properties of such structures. 

ACTIVITIES

CURRENT TEAM 

REMOTE RESEACHERS  
I am co-supervising the following students  
  • Andreas Schmid - PhD student at Max Planck Institute for Informatics (Germany)
  • Daniel Vaz - PhD student at Max Planck Institute for Informatics (Germany)  

VISITORS  

2017 
  • Fabrizio GrandoniResearch Professor at IDSIA, CH                                        [May 15 - 17]
  • Andreas SchmidPhD student at Max-planck-institut für Informatik, DE     [May 11-20]
  • Thatchaphol SaranurakPhD student at KTH, SE                                              [April 16- 20] 
  • Bundit LaekhanukitPostdoc at Weizmann Institute of Science, Israel         [Mar 26 - Apr 8] 
  • Daniel VazPhD student at Max-planck-institut für Informatik, DE                [Mar 20 - Apr 1]
  • Syamantak DasPostdoc at Universität Bremen, DE                                         [Mar 20-30]
  • Mayank GoswamiAssistant professor at CUNY, USA                                       [Jan 26-27] 
2016
  • Thatchaphol SaranurakPhD student at KTH, SE                                           [Sep 22-25, Oct 23-29]
  • Danupon NanongkaiAssistant professor at KTH, SE                                    [Sep 22-25]
  • Andreas SchmidPhD student at Max-planck-institut für Informatik, DE         [Sep 12-24]
  • Daniel VazPhD student at Max-planck-institut für Informatik, DE                   [Sep 12-24]



Subpages (1): PAST ACTIVITIES
Comments