• A
  • A
  • A
  • АБВ
  • АБВ
  • АБВ
  • A
  • A
  • A
  • A
  • A
Обычная версия сайта
  • RU
  • EN
  • HSE University
  • Publications
  • Articles
  • Эффективный поиск минимального дерева на точках пространства в $l_1$-норме
  • RU
  • EN
Расширенный поиск
Высшая школа экономики
Национальный исследовательский университет
Priority areas
  • business informatics
  • economics
  • engineering science
  • humanitarian
  • IT and mathematics
  • law
  • management
  • mathematics
  • sociology
  • state and public administration
by year
  • 2028
  • 2027
  • 2026
  • 2025
  • 2024
  • 2023
  • 2022
  • 2021
  • 2020
  • 2019
  • 2018
  • 2017
  • 2016
  • 2015
  • 2014
  • 2013
  • 2012
  • 2011
  • 2010
  • 2009
  • 2008
  • 2007
  • 2006
  • 2005
  • 2004
  • 2003
  • 2002
  • 2001
  • 2000
  • 1999
  • 1998
  • 1997
  • 1996
  • 1995
  • 1994
  • 1993
  • 1992
  • 1991
  • 1990
  • 1989
  • 1988
  • 1987
  • 1986
  • 1985
  • 1984
  • 1983
  • 1982
  • 1981
  • 1980
  • 1979
  • 1978
  • 1977
  • 1976
  • 1975
  • 1974
  • 1973
  • 1972
  • 1971
  • 1970
  • 1969
  • 1968
  • 1967
  • 1966
  • 1965
  • 1964
  • 1963
  • 1958
  • More
Subject
News
September 7, 2026
Biologists Discover 'Molecular Fingerprint' of Preeclampsia
Researchers at HSE University employed a new method to model hypoxia in placental cells during pregnancies complicated by preeclampsia and identified molecular markers of tissue hypoxia. Since hypoxia is one of the key mechanisms underlying preeclampsia, these findings are important for a more accurate and timely diagnosis of the disease and for the development of effective treatment methods. The paper has been published in Placenta.
September 7, 2026
‘Speech, Facial Expressions, and Gestures Cannot Lie
Would you like to know whether a speaker’s trembling voice or an accidental gesture can give them away? At HSE University in Nizhny Novgorod, researchers are developing an algorithm that analyses speech, facial expressions, and gestures, and determines whether information is truthful with 92% accuracy. The project has applications ranging from forensic examination and bank recruitment to fundamental research. Anna Khomenko, head of the research group and Senior Research Fellow at the Centre for Language and Brain at the HSE Faculty of Humanities in Nizhny Novgorod, explains how students and researchers are working together to create a corpus of video recordings, train a classifier, and prepare to introduce computer vision technology.
September 4, 2026
Time to Showcase Your Research: Applications Are Now Open for Student Research Paper Competition 2026
Taking part in the Student Research Paper Competition (SRPC) gives you an opportunity to present your research to experts, receive an independent assessment, and determine the future direction of your work. The competition is open to students graduating in 2026 not only from HSE University but from universities in Russia and abroad. Papers may be submitted in Russian and English, and in some fields also in French, German, and Spanish.

 

Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!

Publications
  • Books
  • Articles
  • Chapters of books
  • Working papers
  • Report a publication
  • Research at HSE

?

Эффективный поиск минимального дерева на точках пространства в $l_1$-норме

Математические заметки. 2025. Т. 117. № 5. С. 672–679.
Kaimakov K., Malyshev D.
Research target: Computer Science Mathematics
Language: Russian
Full text
DOI
Text on another site
Keywords: эффективный алгоритмefficient algorithmcomputational geometryвычислительная геометриязадача о минимальном остовном деревеminimum spanning tree problem
Similar publications
Rational p-adic Hodge theory for d-de Rham-proper stacks
Prikhodko Artem, Kubrak D., Compositio Mathematica 2026 Vol. 162 No. 6 P. 1377–1438
In this follow-up paper we show that smooth Hodge-proper stacks over O𝐾 are ℚ𝑝-locally acyclic: namely the natural map between étale ℚ𝑝-cohomology of the algebraic and Raynaud generic fibers is an equivalence. This establishes the ℚ𝑝-case of general conjectures made in D. Kubrak and A. Prikhodko [p-adic Hodge theory for Artin stacks, Mem. Amer. Math. ...
Added: September 7, 2026
Lower Bounds on the Measure of the Support of Positive and Negative Parts of Trigonometric Polynomials
Ismailov A., Constructive Approximation 2026
The measure of the positivity set {x ∈ [0; 2π] | f (x) > 0} of a trigonometric polynomial f  is bounded from below by the Motzkin density. We generalize the bound to polynomials in several variables and almost periodic functions. We then use these generalizations to extend known results on Taikov’s problem. ...
Added: September 7, 2026
Pupillometry and autonomic nervous system responses to cognitive load and false feedback: an unsupervised machine learning approach
Alshanskaia E., Portnova G., Liaukovich K. et al., Frontiers in Neuroscience 2024 Vol. 18
Added: September 7, 2026
Oil Spill Segmentation in SAR Data Using ViT-UNet: Performance and Practical Insights
Зуенко Д. О., Trofimova E., Хайдарова И., IEEE Access 2026 Vol. 14 P. 121339–121357
Oil spill segmentation in Synthetic Aperture Radar (SAR) images is limited by noisy annotations in publicly available datasets and by architectural choices that interact with label quality in opposing directions. First, we introduce a manually refined version of the Deep-SAR Oil Spill (SOS) dataset, in which 36.25% of masks are corrected for false positives, missed ...
Added: September 7, 2026
Конечные последовательности и перестановки, ими порождаемые
Kucheryavyy P., Математические заметки 2026 Т. 2026 № 120 С. 380–401
В работе изучаются перестановки, возникающие при упорядочивании по возрастанию дробных долей произведений элементов фиксированной целочисленной последовательности на вещественный параметр. Исследуется количество различных перестановок, которые можно получить таким образом при изменении этого параметра от нуля до единицы. ...
Added: September 7, 2026
Scalable machine learning approach to disordered s-wave superconductors
Неверов В. Д., Красавин А. В., Vagov A. et al., Physical Review B: Condensed Matter and Materials Physics 2026 Vol. 113 P. 1–6
We develop a neural network approach to solve the self-consistent Bogoliubov-de Gennes equations in strongly disordered s-wave superconductors. The method accurately reproduces inhomogeneous gap distributions and generalizes to system sizes far larger than those used in training. It reduces computational scaling from O(N6 ) to O(N2), enabling quantitative analysis of percolation phenomena and the superconductor-insulator ...
Added: September 5, 2026
On the rate of Gaussian approximation for online linear regression problems
Sheshukova M., Durmus A., Khusainov M. et al., Statistics 2026 P. 1–25
In this paper, we consider the problem of Gaussian approximation for the online linear regression task. We derive the corresponding rates for the setting of a constant stepsize and study the explicit dependence of the convergence rate on the problem dimension d and quantities related to the design matrix. When the number of iterations n is known in advance, ...
Added: September 4, 2026
Proceedings of the 42nd Conference on Uncertainty in Artificial Intelligence (UAI), PMLR Volume 337, 17-21 August 2026, KIT, Amsterdam, the Netherlands
Proceedings of Machine Learning Research , 2026.
Added: September 4, 2026
Относительные аналитические законы взаимности
Осипов Д.В., Математический сборник 2026 Т. 217 № 9 С. 130–146
Изучаются законы взаимности, связанные с комплексными линейными расслоениями на расслоениях на ориентируемые окружности. В частности, доказывается следующий закон взаимности. Пусть B – комплексное многообразие и πi:Mi→B – расслоение на ориентируемые окружности, где индекс i пробегает конечное множество. Пусть Li и Ni – комплексные линейные расслоения на каждом многообразии Mi. Закон взаимности утверждает, что сумма всех элементов (πi)∗(c1(Li)∪c1(Ni)), где (πi)∗ – ...
Added: September 3, 2026
A unified frequency-domain framework for tilted slice localization and ischemic stroke detection
Khodadoust J., Kulikova S., Khodadoust F., Biomedical Signal Processing and Control 2027 Vol. 129 P. 111284–111284
Acute ischemic stroke (AIS) analysis from two-dimensional (2D) clinical imaging is hindered by uncontrolled slice tilt and geometric inconsistencies that violate the assumptions of pose-agnostic deep learning (DL) models. This paper proposes a unified geometry-aware, frequency-domain framework for tilted slice localization and ischemic stroke segmentation that explicitly decouples pose estimation from lesion analysis. The method ...
Added: September 2, 2026
Proceedings of the 2026 Fourth International Conference on Distributed Computing and High Performance Computing (DCHPC)
IEEE, 2026.
On behalf of the Organizing Committee, it is my great pleasure to extend a warm welcome to all participants of the Fourth International IEEE Conference on Distributed Computing and High-Performance Computing (DCHPC 2026), held in Tehran from May 10–11, 2026. This conference is jointly organized by the School of Computer Science at the Institute for Research in Fundamental Sciences (IPM) ...
Added: September 2, 2026
Orbifold Saito theory of A and D type singularities
Basalaev A., Rarovskii A., Journal of Singularities 2026 Vol. 30 P. 61–80
Saito theory associates to an isolated singularity rich structure that plays an important role in mirror symmetry. In this note we construct Saito theory for A and D type Landau-Ginzburg orbifolds. Namely, for the pairs (f,G), where f defines an isolated singularity of A and D type and G is a group of symmetries of ...
Added: September 1, 2026
Non-axiomatizability of modal predicate logics of Dedekind-complete linear orders with constant domains
Rybakov M., Shkatov D., Journal of Logic and Computation 2026 Vol. 36 No. 6 Article exag026
We prove Pi-1-1-hardness, and thus lack of recursive axiomatizability, of constant-domain modal predicate logics defined by a class of Dedekind complete linear Kripke frames containing a frame with an infinitely increasing chain of worlds. The result holds even for the language with one unary predicate letter, one propositional letter, and two individual variables. ...
Added: September 1, 2026
An efficient algorithm for the eigenvalue problem of a Hermitian quaternion matrix in quantum chemistry
Guo Z., Jiang T., Wang G. et al., Journal of Computational and Applied Mathematics 2025 Vol. 463
The introduction of quaternions in the quantum chemistry framework provides new ideas for solving some of the difficulties encountered in traditional approaches and is expected to expand the scope of quantum chemistry research. This paper investigates the eigenvalue problem of a Hermitian quaternion matrix by means of the complex representation of a quaternion matrix. This ...
Added: December 16, 2024
Efficient online sensitivity analysis for the injective bottleneck path problem
Kirill V. Kaymakov, Dmitry S. Malyshev, Optimization Letters 2025 Vol. 19 P. 1441–1454
The tolerance of an element of a combinatorial optimization problem with respect to a given optimal solution is the maximum change, i.e., decrease or increase, of its cost, such that this solution remains optimal. The bottleneck path problem, for given an edge-capacitated graph, a source, and a target, is to find the max-min value of ...
Added: November 5, 2024
Приближенный поиск k-ого порядкового расстояния в системе точек единичного квадрата
Kaimakov K., Malyshev D., Математические заметки 2024 Т. 116 № 4 С. 504–509
Для заданных $P=(p_1,\ldots,p_n)$ --- набора точек единичного квадрата и числа $1\leq k\leq \binom{n}{2}$ в данной работе рассматривается задача поиска $k$-ого порядкового расстояния между элементами $P$ в $l_s$-норме, где $s\in \{1,\infty\}$. Иными словами, рассматривается задача поиска такого минимального $d_k$, что выполнено $\sum\limits_{i<j}\indicator(\|p_i,p_j\|_{s} \leq d_k)\geq k$, где $\indicator$ --- индикаторная функция и $s\in \{1,\infty\}$. В настоящей работе ...
Added: May 31, 2024
Многомерные калейдоскопы: геометрия, алгебра и комбинаторика
Мещеряков М. В., Математика в высшем образовании 2022 № 20 С. 53–68
Статья содержит наглядное изложение элементов теории групп, порождённых отражениями в конечномерных евклидовых пространствах, основанное на естественнонаучном понятии калейдоскопа. Она предназначена преподавателям линейной алгебры и геометрии, дискретной математики, учителям специализированных физико-математических классов школ и студентам факультетов математики и информатики различных направлений подготовки, включая ряд физических и инженерных специальностей. Через рассмотрение калейдоскопов отмечаются взаимосвязи между несколькими различными ...
Added: October 12, 2023
Топологическая сопряженность градиентно-подобных потоков на поверхностях и эффективные алгоритмы ее различения
Kruglov V., Pochinka O., Современная математика. Фундаментальные направления 2022 Т. 68 № 3 С. 467–487
Gradient-like flows on surfaces have simple dynamics, which inspired many mathematicians to search for invariants of their topological equivalence. Under assumptions of different generality on the class of gradient-like flows under consideration, such classical invariants as the Leontovich– Mayer scheme, the Peixoto graph, the equipped Peixoto graph, the two-color Wang graph, the threecolor Oshemkov–Sharko graph, the Fleitas circular ...
Added: October 17, 2022
ICLR 2021 Challenge for Computational Geometry & Topology: Design and Results
Miolane N., Caorsi M., Lupo U. et al., / Series CS "arxiv.org". 2021. No. 2108.09810.
This paper presents the computational challenge on differential geometry and topology that happened within the ICLR 2021 workshop "Geometric and Topological Representation Learning". The competition asked participants to provide creative contributions to the fields of computational geometry and topology through the open-source repositories Geomstats and Giotto-TDA. The challenge attracted 16 teams in its two month ...
Added: October 16, 2021
О новых алгоритмических приемах для задачи о взвешенной вершинной раскраске
Razvenskaya O., Журнал Средневолжского математического общества 2020 Т. 22 № 4 С. 442–448
Классическая NP-трудная задача о взвешенной вершинной раскраске состоит в минимизации количества цветов в раскрасках вершин задаваемого графа так, что для каждой вершины назначаются цвета, количество которых равно задаваемому весу вершины, причем смежным вершинам назначаются различные цвета. Соответствующее наименьшее количество цветов называется взвешенным хроматическим числом графа. Известно несколько полиномиальных алгоритмических приемов для построения эффективных алгоритмов для ...
Added: December 16, 2020
Computer Science – Theory and Applications 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020, Proceedings
Springer, 2020.
This book constitutes the proceedings of the 15th International Computer Science Symposium in Russia, CSR 2020, held in Yekaterinburg, Russia, in June 2020. The 25 full papers and 6 invited papers were carefully reviewed and selected from 49 submissions. The papers cover a broad range of topics, such as: algorithms and data structures; computational complexity, including ...
Added: September 4, 2020
NP-Hardness of the Problem of Optimal Box Positioning
Galatenko A. V., Nersisyan S. A., Zhuk D., Mathematics 2019 Vol. 7 No. 8 P. 711
We consider the problem of finding a position of a d-dimensional box with given edge lengths that maximizes the number of enclosed points of the given finite set P⊂Rd , i.e., the problem of optimal box positioning. We prove that while this problem is polynomial for fixed values of d, it is NP-hard in the general case. The proof ...
Added: June 15, 2020
NP-hardness of the problem of optimal box positioning
Galatenko A. V., Nersisyan S., Zhuk D., Mathematics 2019 Vol. 7 No. 8 P. 711
We consider the problem of finding a position of a d-dimensional box with given edge lengths that maximizes the number of enclosed points of the given finite set P⊂Rd , i.e., the problem of optimal box positioning. We prove that while this problem is polynomial for fixed values of d, it is NP-hard in the ...
Added: April 28, 2020
Fundamentals of Computation Theory, 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings
Springer, 2019.
Added: August 4, 2019
  • About
  • About
  • Key Figures & Facts
  • Sustainability at HSE University
  • Faculties & Departments
  • International Partnerships
  • Faculty & Staff
  • HSE Buildings
  • HSE University for Persons with Disabilities
  • Public Enquiries
  • Studies
  • Admissions
  • Programme Catalogue
  • Undergraduate
  • Graduate
  • Exchange Programmes
  • Summer University
  • Summer Schools
  • Semester in Moscow
  • Business Internship
  • Research
  • International Laboratories
  • Research Centres
  • Research Projects
  • Monitoring Studies
  • Conferences & Seminars
  • Academic Jobs
  • Yasin (April) International Academic Conference on Economic and Social Development
  • Media & Resources
  • Publications by staff
  • HSE Journals
  • Publishing House
  • iq.hse.ru: commentary by HSE experts
  • Library
  • Economic & Social Data Archive
  • Video
  • HSE Repository of Socio-Economic Information
  • HSE1993–2026
  • Contacts
  • Copyright
  • Privacy Policy
  • Site Map
Edit