LADIST is a project funded by European Research Council (ERC) as a consolidator grant. Its principal investigator is Daniel Kráľ, and the full name of the project is "Large Discrete Structures". The project started on December 1, 2015 and will last until November 30, 2020. From September 1, 2018, the project is hosted by Masaryk University and implemented in cooperation with Jagiellonian University and the University of Warwick.
The project seeks to introduce new methods to analyze and approximate large graphs and other discrete structures and to apply the developed methods to solve specific open problems. A need for such methods comes from computer science where the sizes of input structures are often enormous.
The project aims at advancing the recently emerged theory of combinatorial limits by developing new insights in the structure of limit objects and by proposing a robust theory bridging the sparse and dense cases. The analytic methods from the theory of combinatorial limits will be used to analyze the possible asymptotic behavior of large graphs and they will be applied in conjunction with structural arguments to provide solutions to specific problems in extremal combinatorics. The obtained insights will also be combined with methods from discrete optimization and logic to provide new algorithmic frameworks.
The project also partly contributed to funding the workshop on Algorithms, Logic and Structure and the workshop on Structural Sparsity, Logic and Algorithms organized in December 2016 and in June 2018 on the campus of the University of Warwick.
|This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 648509).|