Indo-German Spring School on

Algorithms for Big Data

February 18 ‒ 22, 2019

Venue : F.C. Kohli Auditorium,
Kanwal Rekhi Building (KReSIT),
IIT Bombay, Mumbai, India

 

German Research Foundation


Home     |     Program     |     Registration     |     Information     |     Organization

Time February 18
Monday
Time February 19
Tuesday
February 20
Wednesday
February 21
Thursday
February 22
Friday
0800 Registration 0800
- 0900
-- -- -- --
0830
- 0915
Inauguration
0915 Inaugural talk by
Amit Kumar

Online algorithms for packing and covering problems

Session chair :
Sharat Chandran
0900 Dorothea Wagner
Algorithmic Challenges in Power Grids

Session chair :
Abhiram Ranade
Ulrich Meyer
Traversal and generation of very large graphs in memory hierarchies.

Session chair :
Sachin Patkar
Madhav Marathe
Massively interacting socio-technical networks: HPC-enable pervasive, personalized and precision analytics

Session chair :
Dorothea Wagner
Anand Srivastav
Computing Eulerian Tours in Streaming Models

Session chair :
Sudhir Ghorpade
1005 Tea Break 0950 Tea Break
1030 Giuseppe ( Pino ) Italiano
2-Connectivity in Directed Graphs

Session chair :
Dorothea Wagner
1030 John Iacono
Locality

Session chair :
Abhiram Ranade
Excursion Riko Jacob
Models for Algorithms on Big Data

Session chair :
Ulrich Meyer
Industry track :
Samik Datta

Recurrent Recommendations in Flipkart

Session chair :
Abhiram Ranade
1120 Student Presentations
Session chair :
Ulrich Meyer
1120 Student Presentations
Session chair :
Sachin Patkar
Guy Even
On the design of adaptive filters

Session chair :
Ulrich Meyer
Discussion and
Closing Session

Session chair :
Abhiram Ranade
1210 1210 --
1220 1220 Kavitha Telikepalli
Popular Matchings: A Tale of Two Classes

Session chair :
Ulrich Meyer
1330 Lunch Break Lunch Break
1430 Andrew McGregor
Analyzing Massive Graph via Streams and Sketches

Session chair :
Anand Srivastav
1430 Sunita Sarawagi
Training and Inference of Sequence Prediction Models: the old and the new

Session chair :
Anand Srivastav
Soumen Chakrabarti
Learning New Type Representations from Knowledge Graphs

Session chair :
Nutan Limaye
---
1520 Tea Break 1520 Tea Break Tea Break
1610
-
1700
Sumit Ganguly
Sketching and Sampling for Numerical Linear Algebra

Session chair :
Anand Srivastav
1610
-
1700
Devdatt Dubhashi
Basic Concepts of Large Scale Optimization for Machine Learning

Session chair :
Anand Srivastav
Chellapilla Patvardhan
Heuristics and meta-heuristics for the Bounded Diameter Minimum Spanning Tree (BDMST) Problem

Session chair :
Virendra Singh
1930
-
2230
-- -- -- -- Banquet

Download the above schedule as a .pdf file.





Following is the list of confirmed speakers. Apart from these, 20 German and 10 Indian students would make presentations.

Ulrich Meyer [Biography]
Goethe University Frankfurt am Main, Germany
Traversal and generation of very large graphs in memory hierarchies.

Top

Anand Srivastav [Biography]
Kiel University, Germany
Computing Eulerian Tours in Streaming Models

Top

Dorothea Wagner [Biography]
Karlsruhe Institut für Technologie, Germany
Algorithmic Challenges in Power Grids

Top

Amit Kumar [Biography]
IIT Delhi
Online algorithms for packing and covering problems

Top

Christopher Barrett [Biography]
University of Virginia, USA

Top

Samik Datta [Biography]
Flipkart, India
Recurrent Recommendations in Flipkart

Top

Soumen Chakrabarti [Biography]
IIT Bombay, Mumbai, India
Learning New Type Representations from Knowledge Graphs

Top

Sunita Sarawagi [Biography]
IIT Bombay, Mumbai, India
Training and Inference of Sequence Prediction Models: the old and the new

Top

Devdatt Dubhashi [Biography]
Chalmers University of Technology, Sweden
Basic Concepts of Large Scale Optimization for Machine Learning

Top

Guy Even [Biography]
Tel Aviv University, Israel
On the design of adaptive filters

Top

Sumit Ganguly [Biography]
IIT Kanpur, India
Sketching and Sampling for Numerical Linear Algebra

Top

John Iacono [Biography]
Université libre de Bruxelles, Belgium
Locality

Top

Giuseppe ( Pino ) Italiano [Biography]
LUISS University, Italy
2-Connectivity in Directed Graphs

Top

Riko Jacob [Biography]
IT University of Copenhagen, Denmark
Models for Algorithms on Big Data

Top

Madhav Marathe [Biography]
University of Virginia, USA
Massively interacting socio-technical networks: HPC-enable pervasive, personalized and precision analytics

Top

Andrew McGregor [Biography]
UMass, Amherst, USA
Analyzing Massive Graph via Streams and Sketches

Top

Chellapilla Patvardhan [Biography]
DEI, Agra, INDIA
Heuristics and meta-heuristics for the Bounded Diameter Minimum Spanning Tree (BDMST) Problem

Top

Kavitha Telikepalli [Biography]
TIFR, Mumbai, India
Popular Matchings: A Tale of Two Classes

Top

Students Presentations (Feb 18, 2019)
  • Angriman, Eugenio (HU Berlin): Research Overview
  • Bingmann, Timo (Karlsruhe): Thrill : Pipelined External Memory Processing in the Cloud with C++
  • Gottesbüren, Lars(Karlsruhe): Hypergraph Partitioning
  • Hespe, Demian (Karlsruhe): Practical Kernelization Techniques for the Maximum Cut Problem
  • Hübschle-Schneider, Lorenz (Karlsruhe): Communication Efficient Algorithms
  • Klaus, Julien (FSU, Jena): Visualization Support for Developing a Matrix Calculus Algorithm
  • Penschuck, Manuel (GU Frankfurt): Generating Hyperbolic Random Graphs
  • Tran, Khai van (TU Berlin): Quickest Transshipments, Black Boxes, and Custom-made Tools
  • Wedemeyer, Axel (CAU, Uni Kiel): Algorithms for Genome Assembly
  • Schnelle, Niklas; Florian Kramer; Johannes Kalmbach (Uni Freiburg): Live Demo of QLever: A Query Engine for Efficient SPARQL+Text Search

Top

Students Presentations (Feb 19, 2019)
  • Manas Jyoti Kashyop (CSE, IIT Madras): Fully Dynamic Maximal Matching without 3 length augmenting paths in O(√n) expected amortized update time
  • Apoorv Garg (CSE, IIT Bombay) : Scheduling Trains on a Unidirectional Line Complexity and Algorithms
  • K Sandesh Kamath (Chennai Mathematical Institute): Neural Networks and Adversarial Robustness
  • Tirtharaj Dash (BITS Pilani, Goa Campus): Learning in Presence of Expert Knowledge (A talk on Inductive Logic Programming)
  • Vishwambhar Pathak (Asst. Prof., Dept of CSE BIT MESRA Jaipur Campus): Scalable Machine Perception - A Case of Big Data
  • Sparsa Roychowdhury (CSE, IIT Bombay): Analyzing Reachability of Timed Systems
  • Ankita Tiwari (Dept. of EEE, IIT Guwahati): Big Data Analytics and its Impact in E-Commerce
  • Diksha Chaudhary (Dept of Computational & Data Sciences Center for Brain Research, Indian Institute of Science, Bangalore): Big Data & Genomics
  • Amit Kumar Singh (Dept. of EEE, IIT Guwahati): Design of Artificial Intelligence enabled Parallel and Scalable Very Efficient Device Analyzer (VEDA)

Top