Georgy Sokolov

According to our database, Georgy Sokolov authored at least 6 papers between 2023 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

More on the Erd\H os-Kleitman problem on matchings in set families.

Andrey Kupavskii, Georgy Sokolov

CoRR, May, 2026

Families without s-matchings: the other end.

Andrey Kupavskii, Georgy Sokolov

CoRR, May, 2026

2025

A complete solution of the Erdős-Kleitman matching problem for n≤3s.

Andrey Kupavskii, Georgy Sokolov

CoRR, November, 2025

Self-Directed Node Classification on Graphs.

Georgy Sokolov, Maximilian Thiessen, Margarita Akhmejanova, Fabio Vitale, Francesco Orabona

Proceedings of the International Conference on Algorithmic Learning Theory, 2025

2024

Self-Directed Learning of Convex Labelings on Graphs.

Georgy Sokolov, Maximilian Thiessen, Margarita Akhmejanova, Fabio Vitale, Francesco Orabona

CoRR, 2024

2023

An Exponential Envy-Free Cake Cutting Protocol for n Agents.

Georgy Sokolov

CoRR, 2023