WALCOM 2021: Cyclic Shift Problems on Graphs

WALCOM 2021: A New Transportation Problem on a Graph with Sending and Bringing-Back OperationsПодробнее

WALCOM 2021: Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting TreesПодробнее

WALCOM 2021: Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic GraphsПодробнее

WALCOM 2022: Reverse Shortest Path Problem in Weighted Unit-Disk Graphs (Best Student Paper)Подробнее

An Improvement of Reed's Treewidth Approximation. Mahdi Belbasi and Martin Fürer - WALCOM 2021Подробнее

Geometry of Interaction for ZX-Diagrams - Kostia ChardonnetПодробнее

Computational graphs for matrix functions - Max Fasi, July 7, 2022Подробнее

Halpern Iteration and Equilibria ProblemsПодробнее

08/25/20 - Anton Bernshteyn - Distributed algorithms and infinite graphsПодробнее

KDD 2025 - Revisiting Graph Adversarial Attack: A Perspective of Budget OptimizationПодробнее

OHBM2022 Combining graph theory and machine learningПодробнее

SEM2021: Медведев Алексей "MultiSage: Empowering GCN with Contextualized Multi-Embeddings ..."Подробнее

Olivér Janzer - "On the Zarankiewicz problem for graphs with bounded VC-dimension" | CGD IIIПодробнее

Reparameterizing Discontinuous Integrands for Differentiable RenderingПодробнее