• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

The 11th International Conference on Network Analysis

The 11th International Conference on Network Analysis will take place on October 2021 in distant format in Zoom.The conference is organized by the Laboratory of Algorithms and Technologies for Networks Analysis of the Higher School of Economics and by the Laboratory of Advanced Combinatorics and Network Applications of Moscow Institute of Physics and Technology. The Conference is dedicated to the 10-th anniversary of the lab LATNA. It is connected with International Conference ‘Cultural transfer: formation of creative human capital’ dedicated to 25-th anniversary of HSE NN.

The purpose of this conference is to bring together scientists and engineers from industry, government, and universities to exchange knowledge and results in a broad range of topics relevant to the theory and practice of network analysis. Topics of the Conference also include algorithms on networks, discrete optimization and applications. Contributions are also sought that address the reliability of complex networks, software, theory, methodology and applications. The conference follows previous conferences 2011, 20122013201420152016201720182019, 2020. 

The conference will take place October 18-20 in distant format in Zoom. Conference sessions are planned everyday October 18-20 for 15:00 -19:00 (Moscow time).

The conference talks are organized by invitations.

ProgramNET_2021_Program 

Schedule: NET_2021_Schedule

Paper Submission
Selected papers will be considered for submission to special issues of some international journals

Plenary speakers
Fuad Aleskerov (HSE Moscow)
Polarization of the society and patterns of electoral behavior
(the lecture is given October 19 at 10:30 in the framework of International Conference ‘Cultural transfer: formation of creative human capital’ dedicated to 25-th anniversary of HSE NN)

Sumi Helal (University of Florida, USA)
Internet-of-Things: From Networking to Meaningful Interactions

Eric Maskin (Harvard University, USA)
Arrow’s Theorem, May’s Axioms, and Borda’s Rule
(the lecture is given October 19 at 21:00 in the framework of International Conference ‘Cultural transfer: formation of creative human capital’ dedicated to 25-th anniversary of HSE NN)

Cristina Masoller (Universitat Politecnica de Catalunya, Spain)
Application of network techniques to ophthalmic image analysis and outlier detection

Giovanni Stracquadanio (University of Edinburgh, UK)
Discovering cancer driver genes and pathways using stochastic block model graph neural networks

Confirmed invited speakers
Vladimir Batagelj (University of Ljubljana, Slovenia and HSE Moscow)
Network multiplication and derived networks

Roman Belavkin (Middlesex University, UK)
Entropy, Free Energy and Phase Transitions in Power-Law Graphs

Evgenii Burashnikov (LATNA lab, HSE NN)
A recent approach to optimization of computational graphs for deep learning models

Vladimir Boginski (University of Central Floroda, USA)
Graph-based Exploration and Clustering Analysis of Semantic Spaces

Ilya Chernykh (Sobolev Institute of Mathematics, Novosibirsk)
Instance reduction and problem transformation as a way of research simplification in scheduling

Egor Churaev (HSE NN)
User-dependent Adaptation of Neural Network Model in Video-based Facial Emotion Recognition

Alex Dainiak (Moscow Institute of Physics and Technology)
Visualizing hypergraphs: a survey

Polina Demochkina (HSE NN)
Neural network model for fast video-based emotion recognition

Mario Guarracino (University of Cassino and ICAR-CNR, Italy)
On resiliency and robustness of whole graph embedding

Anuška Ferligoj (University of Ljubljana, Slovenia and HSE Moscow)
Connecting cluster analysis and network analysis

Dmitry Ignatov (HSE, Moscow)
On the optimal Boolean Matrix Factorization algorithm for contranomial scales and its outcomes for recommender systems

Mikhail Khachai (Ural Federal University, Ekaterinburg, RF)
Problem-specific Branch-and-Bound algorithms for the Precedence Constrained Generalized Traveling Salesman Problem

Ilias Kotsireas (Wilfrid Laurier University, Waterloo, Canada)
20 years of Legendre Pairs

Daniil Musatov (Moscow Institute of Physics and Technology)
Fair division on graphs and hypergraphs

Mauricio Rezende (Amazon, and University of Washington, USA)
Multi-parent biased random-key genetic algorithm with implicit path-relinking and some real-world applications

Leonidas Pitsoulis (University of Thessaloniki, Greece)
Graphs and Data Science in Industry

Oleg Prokopyev (University of Pittsburg, USA)
On Exact Solution Approaches for a Class of Bilevel Fractional Programs

Andrey Shilov (LATNA, HSE NN)
Optimization of computational graphs for deep learning models

Theodore Trafalis (University of Oklahoma, USA)
Affinely adjustable robust optimization under dynamic uncertainty set for a novel robust closed-loop supply chain

Viktor Zamaraev (University of Liverpool, UK)
Sharp Thresholds in Random Simple Temporal Graphs

Ivan Shumilov (Lobachevskii State University, Nizhny Novgorod)
Simple bound on integer vertices of general Δ-modular polyhedra

Conference chair
Panos M. Pardalos
, University of Florida, USA and LATNA, NRU HSE 

Program Committee 

Fuad AleskerovNRU HSE

Mikhail BatsynNRU HSE

Fedor FominBergen University, Norway and St Petersburg department of Steklov Mathematical Institute

Valery KalyaginNRU HSE

Yury Kochetov, Russian Academy of Sciences, Novosibirsk

Alexander KoldanovNRU HSE

Valentina KuskovaNRU HSELaboratory of Applied Network Research
Dmitriy MalyshevNRU HSE

Oleg Prokopyev, University of Pittsburgh, USA

Andrey Raigorodskii, Moscow Institute of Physics and Technology, Moscow State University, Yandex 

Nikolay Zolotykh, Lobachevsky State University, Nizhny Novgorod

Andrey SavchenkoNRU HSE 

Conference Organizers
Panos M. Pardalos
, University of Florida, USA
Andrey Raigorodski, MIPT – Yandex, Russia
Valery Kalyagin, National Research University Higher School of Economics, Russia


 

Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!
To be used only for spelling or punctuation mistakes.