Indo-German Workshop on Algorithms

Transcription

1 Indo-German Workshop on Algorithms Advanced and Microelectronics Unit, Indian Statistical Institute, Kolkata 9-13 March, 2015 Programme Schedule All talks will be held at the Auditorium of Platinum Jubilee Academic Building Day 1 (Monday, March 9, 2015) 9:30-10:00 10: :50 10: :30-17:10 Big data Big data Big data & Networks Registration Inauguration Analytics for crowd sourced data Funding opportunities for Indo-German research cooperation Algorithms for big data research topics in the Big Data priority program SPP1736 Selection under model restrictions Approximation schemes for maximum weight independent set of geometric objects Estimating Network Parameters Bimal K. Roy Alexander Hansen DFG, India Ulrich Meyer Goethe University Venkatesh Raman IMSc, Chennai Andreas Wiese MPI Saarbrücken Anirban Dasgupta IIT, Gandhinagar

2 Day 2 (Tuesday, March 10, 2015) :30 12: & Algorithm Engineering Algorithm engineering for route planning in transportation in public transportation Algorithmic aspects in finding evenly spaced approximations of pareto frontiers A bicriteria approach to robust optimization New techniques for randomized rounding De-preferential attachment random graphs Dorothea Wagner Karlsruhe Institute of Technology Anita Schöbel Göttingen Günter Rudolph TU Dortmund Marc Goerigk Technical University Kaiserslautern Sandeep Sen IIT, Delhi Antar Bandyopadhyay ISI, Delhi

3 Day 3 (Wednesday, March 11, 2015) - 11:10 11: :10 12: Graph Drawing Algorithm Engineering Derandomized algorithms for discrete packing and covering problems - engineering and analysis Erdős- Rényi sequences and deterministic construction of expanding Cayley graphs Dynamic matching under preferences Uniformity of point samples in metric spaces using gap-ratio An introduction to and recent results in graph drawing Ranking verification counter-examples: An invariant guided approach Anand Srivastav Kiel University Partha Mukhopadhyay Chennai Mathematical Institute Martin Hoefer MPI Saarbrücken Arijit Bishnu Alexander Wolff Wurzburg Ansuman Banerjee

4 Day 4 (Thursday, March 12, 2015) - 11:10 11: :10 12: Geometry Geometry and Graph Drawing Old and new algorithms for guarding polygons Independent set and hitting sets of geometric objects Box contact representations of graphs Geometric center problems Coping with uncertainty in project scheduling: New developments and applications Parallel graph partitioning for complex networks Subir Ghosh TIFR, Mumbai Sathish Govindarajan IISc, Bangalore Alexander Wolff Wurzburg Sandip Das Rolf Möhring Technical University, Berlin Christian Schulz Karlsruhe Institute of Technology

5 Day 5 (Friday, March 13, 2015) 09: :30 12: Algorithm Engineering and Big data Distribution-aware sampling and weighted model counting for propositional formulas Facility location problems in the read-only memory with constant work-space Algorithms for graph streaming Algorithms for distributed swarm robots Heterogeneous Algorithms Generalized graph coloring for spectrum efficient frequency assignment in cellular networks Supratik Chakraborty IIT, Bombay Subhas C. Nandy Lasse Kliemann Kiel University Krishnendu Mukhopadhyaya Arobinda Gupta IIT, Kharagpur Sasthi C Ghosh