|
Hanka Řada I am a Ph. D. student at FNSPE, CTU in Prague and my research topic there are the multidimensional continued fraction. This topic is strongly connected with combinatroics on words and number theory. I am also very interested in graph theory and I am now participating on a project which includes research about embedding trees in host graphs. |
|
Mariia Shyian Mariia is getting training in graph theory. Due to the war in Ukraine, she relocated her studies to the Czech Republic. |
|
|
Pedro Campos Araújo
My research focuses on extremal and probabilistic combinatorics. In particular, I am interested in the study of Ramsey Theory, random graphs, pseudo-random structures and tree embeddings. There has been a drift of my studies towards subjects with deeper probabilistic roots as I study different models of random graphs. |
|
(Moved to Vilnius University) Tomas obtained his PhD from the University of Memphis under the supervision of Béla Bollobás. His interests include concentration of measure, small ball probability, and extremal combinatorics. |
|
|
(moved to University of Concepción) My research interests lie in the field of combinatorics and graph theory, mostly in extremal graph and hypergraph theory. I have studied Turán, Ramsey and embedding problems of tight cycles and paths in hypergraphs. |
|
|
Akbar Davoodi I have a wide range of research interests, mainly in the areas of extremal and probabilistic combinatorics. In particular, I am interested in extremal graph theory, graph colorings, graph decompositions, large networks, Ramsey theory, hypergraphs, clustering and community detection. |
|
Maria Saumell
My main research areas area Computational Geometry and Graph Drawing, with an emphasis on proximity graphs and Voronoi diagrams, visibility and interval graphs. Recently I have also become interested in Extremal Graph Theory and I have started to work on problems involving graph tilings and graph limits. |
|
|
(Moved to IIIT Raichur)
My main area of research interest is Geometric Approximation Algorithms. As a researcher, I would like to contribute to the field of geometric algorithms and advance my future research towards the modeling of real-world problems through the perspective of computational geometry, and associated approximation algorithms. |
|
|
(Moved to IIT (ISM) Dhanbad)
My research interests lie broadly in Advanced Data Structures, Algorithms, Computational Geometry, Approximation Algorithms. Recently, I am working in Terrain Visibility problems and Problems with Imprecision, for the project titled "Structural properties of visibility in terrains and farthest color Voronoi diagrams". |
|
(Moved to Charles University)
My research interests include graph theory, classical combinatorics, Ramsey theory, and combinatorial geometry. In particular, I study Ramsey numbers of ordered graphs and hypergraphs and their connections to problems from discrete geometry such as Erdős-Szekeres-type problems. |
|
|
(Moved to industry) My main research interests are extremal and probabilistic combinatorics. I have worked on problems involving moderate deviations on the count of arithmetic progressions in random sets and recently I have become interested in problems involving graph limits, graphons and inhomogeneous random graphs. |
|
(Moved to The University of Warwick) I am a PhD student at the Charles University, my supervisor is David Chodounsky. My interests lie in descriptive set theory and its application to other parts of mathematics such as borel equivalence relations, ergodic theory, borel combinatorics, forcing, graphons etc. |
|
Christos Pelekis (Moved to National Technical University of Athens ) I work in combinatorics, probability and game theory. An example of a question I have been considering, which arose in the analysis of a particular allocation game, is the following: Suppose that you want to poison your mother-in-law. You know she is going to eat k biscuits from a tray that contains n biscuits in total, but you do not know which biscuit she is going to choose. Each biscuit has the same probability of being chosen. You possess h>1 grams of arsenic whose lethal dose is one gramme. How should you distribute the poison in order to maximize the probability that your mother-in-law gets the lethal dose? My research interests include probabilistic and geometric analogues of this question. |
|
|
(Moved to industry)
My research is in the area of Spectral Graph Theory. I am interested in understanding how eigenvectors portray the structure of networks, such as community formation, connectivity, partitioning, etc. Besides, I conduct research on extremal problems in Spectral Graph Theory, such as characterizing graphs that achieve extremal values of algebraic connectivity, energy, etc. Spectral techniques have been used for decades to successfully reveal the underlying properties of graphs. From graphs with a specific design to random graphs, and from finite to infinite graphs, I have been applying semidefinite optimization, probability theory, and matrix theory to expose such properties. |
|
(Moved to study at ETH Zurich)
I am an undergraduate student interested in extremal graph theory and graph limits. My current research includes using Szemeredi regularity lemma as a tool for proving certain asymptotic extremal results regarding embedding trees in a host graph. Recently I got very interested in theory of graphons. |
|
|
(Moved to Charles University)
Tereza is interested in a variety of problems in combinatorics. During her PhD she focused on using analytical tools for studying large discrete structures and algorithms for large inputs. This area is closely related to extremal combinatorics, using many tools from it, most notably Szemeredi regularity lemma. She has also been working on problems related to minors and immersions of graphs. |
|
(Moved to Hanoi University of Science and Technology)
My research interests lie in combinatorics, particularly in probabilistic combinatorics,
extremal combinatorics and positional games, as well as its applications to other areas of mathematics. |
|
