RUS  ENG
Full version
PEOPLE

Kobylkin Konstantin Sergeevich

Presentations in Math-Net.Ru

  1. Complexity and inapproximability for problems of finding minimum set of stabbing objects on geometric graphs
    K. S. Kobylkin
    Seminar for Optimization Laboratory
    November 13, 2015 11:30


© Steklov Math. Inst. of RAS, 2024