Summer School on Operational Research and Applications

The Summer School on Operational Research and Applications will take place on May 22 – 26, 2016 in Nizhny Novgorod, Russia. The school is organized by the Laboratory of Algorithms and Technologies for Networks Analysis of the National Research University Higher School of Economics. The main topics of the school are related to Data Mining, Data Analytics, Big Data Algorithms.

The school is hosted by the National Research University Higher School of Economics in Nizhny Novgorod (Room 209, 136 Rodionova Str). The school follows the tradition of previous summer schools on operational research and applications 2009, 2010, 2011, 2012, 2013, 2014, 2015:

Summer school 2011
Summer school 2012
Summer school 2013
Summer school 2014
Summer school 2015

The school is organized for last-year bachelor, master and PhD students. To attend the school as a participant you must register before April 30, 2016.

Students are also encouraged to present the recent results of their research related to the topics of the summer school. Selected school papers will be published in a conference NET 2016 proceeding (Springer Proceedings in Mathematics and Statistics , indexed in Scopus).

If you have any questions, please do not hesitate to contact us: iutkina@hse.ru (Irina Utkina).

School Program

School venue
Presentations

Important Dates

Accommodation in Nizhny Novgorod

School Lecturers:

Panos Pardalos, University of Florida, USA

Opening lecture: Network Robustness from an Information Theory Perspective.

Ernesto Estrada , University of Strathclyde Glasgow, United Kingdom

Lecture 1: Walk-based methods to investigate networks I.
Lecture 2: Walk-based methods to investigate networks II.
Seminars: Path-Laplacian Operators on Networks.  

Dmitry Ignatov, National Research University Higher School of Economics
Lecture 1-2: Pattern Mining and Multi-modal Clustering: searching for optimal patterns.
Seminar: Practical Tools for Pattern Mining and Multi-modal Clustering.

Rene van Bevern , Novosibirsk State University

Lecture 1: Fixed-parameter algorithms: circumventing intractability by exploiting input structure. 
Lecture 2: Problem kernelization: polynomial-time data reduction with provable effect.
Seminar: Fixed-parameter linear-time algorithms for finding Colorful Independent Sets. 

Sergey Nikolenko, Laboratory for Internet Studies, National Research University Higher School of Economics,  Steklov Instiute of Mathematics at St. Petersburg
Lectures and seminar: Competitive Analysis in Buffer Management.

Oleg Prokopyev, University of Pittsburgh, USA

Lecture 1-2: Finding Influential (Central) Groups in Networks using Betweenness Centrality.

Seminar: Integer Programming for Finding Maximum Quasi-Cliques and Dense Subgraphs.

Organizing Committee

Panos M. Pardalos, University of Florida, USA;  NRU HSE, Russia
Valery Kalyagin, National Research University Higher School of Economics, Russia 
Fuad Aleskerov, National Research University Higher School of Economics, Russia
Natalia Aseeva, National Research University Higher School of Economics, Russia
Mikhail Batsyn, National Research University Higher School of Economics, Russia
Nikolay Zolotykh, Lobachevsky State University, Nizhny Novgorod
Yury Kochetov, Russian Academy of Sciences, Novosibirsk
Dmitriy Malyshev, National Research University Higher School of Economics, Russia
Timur Medvedev, National Research University Higher School of Economics, Russia
Oleg Prokopyev, University of Pittsburg, USA
Andrey Raigorodski, Moscow Institute of Physics and Technology, Moscow State University, Yandex
Fedor Fomin, Bergen University, Norway and St. Petersburg department of Steklov Mathematical Institute

Local organizers

Alexey Nikolaev (email: ainikolaev@hse.ru)
Irina Utkina (email: iutkina@hse.ru)
Ivan Grechikhin (email: igrechikhin@hse.ru)