Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Sergey Neshchadim
Observed names:
S. M. Neshchadim,
S. Neshchadim,
S.M. Neshchadim
Institutions:
Novosibirsk State University,
Sobolev Institute of Mathematics,
Siberian Branch of the Russian Academy of Sciences
Observed institutions:
Novosibirsk State University,
Sobolev Institute of Mathematics,
Siberian Branch of the Russian Academy of Sciences
ORCID:
0000-0002-3181-4037
Observed ORCID:
0000-0002-3181-4037
OpenAlex ID:
A5045008778
Max-Min Problems of Searching for Two Disjoint Subsets
2021
·
Vladimir Khandeev
, Sergey Neshchadim
·
Lecture notes in computer science
·
4
Approximate Algorithms for Some Maximin Clustering Problems
2022
·
Vladimir Khandeev
, Sergey Neshchadim
·
Communications in computer and information science
·
3
Constant-Factor Approximation Algorithms for Some Maximin Multi-clustering Problems
2023
·
Vladimir Khandeev
, Sergey Neshchadim
·
Lecture notes in computer science
·
2
The group of generalized transposition classes and its automorphisms
2025
·
M.V. Neshchadim
, S.M. Neshchadim
·
Matematicheskie trudy
·
1
PDF
Fast approximation algorithms for some maximin clustering problems
2023
·
V. Khandeev
, S. Neshchadim
·
Yugoslav journal of operations research
·
1
PDF
Pseudo-polynomial Algorithms for Some Problems of Searching for the Largest Subsets
2024
·
Vladimir Khandeev
, Sergey Neshchadim
·
Communications in computer and information science
Show more works
View as search
Works count:
7
Citation count:
11
H-index:
2
I10-index:
Year
Topic
Type