Y. Amirgaliyev, V. Berikov, L. Cherikbayeva, K. Latuta, and K. Bekturgan.
Group approach to solving the tasks of recognition.
Yugoslav Journal of Operations Research, 2018.
[ bib |
DOI ]
A. Kononov, P. Kononova, and A. Gordeev.
Branch-and-bound approach for optima localization in scheduling
multiprocessor jobs.
International Transactions in Operational Research.
[ bib |
DOI ]
A. Oblaukhov.
A lower bound on the size of the largest metrically regular subset of
the boolean cube.
Cryptography and Communications, 2018.
[ bib |
DOI ]
M. Bentert, R. van Bevern, and R. Niedermeier.
Inductive k-independent graphs and c-colorable subgraphs in
scheduling: A review.
Journal of Scheduling, 22(1):3–20, 2019.
[ bib |
DOI |
http ]
R. A. van Bevern, A. V. Pyatkin, and S. V. Sevastyanov.
An algorithm with parameterized complexity of constructing the
optimal schedule for the routing open shop problem with unit execution times.
Siberian Electronic Mathematical Reports, 16:42–84, 2019.
[ bib |
DOI |
.pdf ]
A. Eremeev, A. Kononov, and I. Ziegler.
On complexity and exact solution of production groups formation
problem.
In Proceedings of the 9th International Conference on
Optimization and Applications (OPTIMA 2019), volume 974 of
Communications in Computer and Information Science, pages 111–122, Cham,
2019. Springer.
[ bib ]
A. Erzin and R. Plotnikov.
The accuracy of one polynomial algorithm for the convergecast
scheduling problem on a square grid with rectangular obstacles.
In Revised Selected Papers of the 12th International Conference
on Learning and Intelligent Optimization (LION 2018), Kalamata, Greece, June
10–15, 2018, volume 11353 of Lecture Notes in Computer Science,
pages 131–140, Cham, 2019. Springer.
[ bib |
DOI ]
E. Kh. Gimadi and O. Yu. Tsidulko.
Asymptotically optimal algorithm for the maximum m-peripatetic
salesman problem in a normed space.
In Revised Selected Papers of the 12th International Conference
on Learning and Intelligent Optimization (LION 2018), Kalamata, Greece, June
10–15, 2018, volume 11353 of Lecture Notes in Computer Science,
pages 402–410, Cham, 2019. Springer.
[ bib |
DOI ]
A. Kel'manov, S. Khamidullin, V. Khandeev, and A. Pyatkin.
Exact algorithms for two quadratic euclidean problems of searching
for the largest subset and longest subsequence.
In Revised Selected Papers of the 12th International Conference
on Learning and Intelligent Optimization (LION 2018), Kalamata, Greece, June
10–15, 2018, volume 11353 of Lecture Notes in Computer Science,
pages 326–336. Springer, 2019.
[ bib |
DOI ]
R. Plotnikov, A. Erzin, and V. Zalyubovskiy.
Genetic local search for conflict-free minimum-latency aggregation
scheduling in wireless sensor networks.
In Proceedings of the 9th International Conference on
Optimization and Applications (OPTIMA 2019), volume 974 of
Communications in Computer and Information Science, pages 216–231, Cham,
2019. Springer.
[ bib |
DOI ]
E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, and M. Sviridenko.
Energy-efficient scheduling and routing via randomized rounding.
Journal of Scheduling, 21(1):35–51, 2018.
[ bib |
DOI ]
R. van Bevern, T. Fluschnik, G. B. Mertzios, H. Molter, M. Sorge, and O. Suchý.
The parameterized complexity of finding secluded solutions to some
classical optimization problems on graphs.
Discrete Optimzation, 30:20–50, 2018.
[ bib |
DOI |
http ]
R. van Bevern, V. Froese, and C. Komusiewicz.
Parameterizing edge modification problems above lower bounds.
Theory of Computing Systems, 62(3):739–770, 2018.
CSR'16 special issue.
[ bib |
DOI |
slides |
http ]
I. Davydov, Y. Kochetov, and S. Dempe.
Local search approach for the competitive facility location problem
in mobile networks.
International Journal of Artificial Intelligence,
16(1):130–143, 2018.
[ bib ]
H. Gu, A. Kononov, J. Memar, and Y. Zinder.
Efficient lagrangian heuristics for the two-stage flow shop with job
dependent buffer requirements.
Journal of Discrete Algorithms, 52-53:143–155, 2018.
[ bib |
DOI ]
A. V. Kel'manov, S. A. Khamidullin, V. I. Khandeev, and A. V. Pyatkin.
An exact algorithm of searching for the largest cluster in an
integer-valued problem of 2-partitioning a sequence.
Pattern Recognition and Image Analysis, 28(4):703–711, 2018.
[ bib |
DOI ]
A. V. Kel'manov, S. A. Khamidullin, V. I. Khandeev, A. V. Pyatkin, Y. V.
Shamardin, and V. V. Shenmaier.
A polynomial-time approximation algorithm for one problem simulating
the search in a time series for the largest subsequence of similar elements.
Pattern Recognition and Image Analysis, 28(3):363–370, 2018.
[ bib |
DOI ]
A. V. Kel'manov and A. V. Motkova.
Approximation scheme for a quadratic euclidean weighted 2-clustering
problem.
Pattern Recognition and Image Analysis, 28(1):17–23, 2018.
[ bib |
DOI ]
A. V. Kel'manov and A. V. Motkova.
Polynomial-time approximation algorithm for the problem of
cardinality-weighted variance-based 2-clustering with a given center.
Computational Mathematics and Mathematical Physics,
58(1):130–136, 2018.
[ bib |
DOI ]
A. V. Kel'manov and A. V. Pyatkin.
Np-hardness of some euclidean problems of partitioning a finite set
of points.
Computational Mathematics and Mathematical Physics,
(5):822–826, May 2018.
[ bib |
DOI ]
A. V. Kutsenko.
The hamming distance spectrum between self-dual maiorana–mcfarland
bent functions.
Journal of Applied and Industrial Mathematics, 12(1):112–125,
2018.
[ bib |
DOI ]
M. Mnich and R. van Bevern.
Parameterized complexity of machine scheduling: 15 open problems.
Computers & Operations Research, 100:254–261, 2018.
[ bib |
DOI |
http ]
S. Ospichev and D. Ponomarev.
On the complexity of formulas in semantic programming.
Siberian Electronic Mathematical Reports, 15:987–995, 2018.
[ bib |
DOI ]
N. Tokareva, A. Gorodilova, S. Agievich, V. Idrisova, N. Kolomeec, A. Kutsenko,
A. Oblaukhov, and G. Shushuev.
Mathematical methods in solutions of the problems presented at the
third international students' olympiad in cryptography.
Prikladnaya Diskretnaya Matematika, (40):34–58, 2018.
[ bib |
DOI ]
L. Arantes, E. Bampis, A. V. Kononov, M. Letsios, G. Lucarelli, and P. Sens.
Scheduling under uncertainty: A query-based approach.
In Proceedings of the 27th International Joint Conference on
Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden.,
pages 4646–4652, 2018.
[ bib |
DOI ]
V. Berikov and T. Vinogradova.
Regression analysis with cluster ensemble and kernel function.
In Revised Selected Papers of the 7th International Conference
on Analysis of Images, Social Networks and Texts (AIST 2018), Moscow, Russia,
July 5–7, 2018, volume 11179 of Lecture Notes in Computer Science,
pages 211–220. Springer, 2018.
[ bib |
DOI ]
V. B. Berikov and L. S. Cherikbayeva.
Searching for optimal classifier using a combination of cluster
ensemble and kernel method.
In Proceedings of the School-Seminar on Optimization Problems
and their Applications (OPTA-SCL 2018), volume 2098 of CEUR Workshop
Proceedings, pages 45–60, 2018.
[ bib |
.pdf ]
R. van Bevern, T. Fluschnik, and O. Yu. Tsidulko.
Parameterized algorithms and data reduction for safe convoy routing.
In Proceedings of the 18th Workshop on Algorithmic Approaches
for Transportation Modeling, Optimization, and Systems, volume 65 of
OpenAccess Series in Informatics (OASIcs), pages 10:1–10:19. Schloss
Dagstuhl–Leibniz-Zentrum fuer Informatik, 2018.
[ bib |
DOI |
http ]
P. Emelyanov.
On two kinds of dataset decomposition.
In Proceedings of the 18th International Conference on
Computational Science (ICCS 2018), Wuxi, China, June 11-13, 2018, volume
10681 of Lecture Notes in Computer Science, pages 171–183. Springer,
2018.
[ bib |
DOI ]
P. Emelyanov and D. Ponomaryov.
On a polytime factorization algorithm for multilinear polynomials
over GF(2).
In Proceedings of the 20th International Workshop on Computer
Algebra in Scientific Computing (CASC 2018), volume 11077 of Lecture
Notes in Computer Science, pages 164–176. Springer, 2018.
[ bib |
DOI ]
A. V. Eremeev, A. V. Kelmanov, A. V. Pyatkin, and I. A. Ziegler.
On finding maximum cardinality subset of vectors with a constraint on
normalized squared length of vectors sum.
In Revised Selected Papers of the 6th International Conference
on Analysis of Images, Social Networks and Texts (AIST 2017), Moscow, Russia,
July 27–29, 2017, volume 10716 of Lecture Notes in Computer Science,
pages 142–151. Springer, 2018.
[ bib |
DOI ]
E. Kh. Gimadi and O. Yu. Tsidulko.
Approximation algorithms for the maximum m-peripatetic salesman
problem.
In Revised Selected Papers of the 6th International Conference
on Analysis of Images, Social Networks and Texts (AIST 2017), Moscow, Russia,
July 27–29, 2017, volume 10716 of Lecture Notes in Computer Science,
pages 304–312. Springer, 2018.
[ bib |
DOI ]
E. Kh. Gimadi and O. Yu. Tsidulko.
On modification of an asymptotically optimal algorithm for the
maximum euclidean traveling salesman problem.
In Revised Selected Papers of the 7th International Conference
on Analysis of Images, Social Networks and Texts (AIST 2018), Moscow, Russia,
July 5–7, 2018, volume 11179 of Lecture Notes in Computer Science,
pages 283–293. Springer, 2018.
[ bib |
DOI ]
A. Kel'manov, S. Khamidullin, and V. Khandeev.
A randomized algorithm for 2-partition of a sequence.
In Revised Selected Papers of the 6th International Conference
on Analysis of Images, Social Networks and Texts (AIST 2017), Moscow, Russia,
July 27–29, 2017, volume 10716 of Lecture Notes in Computer Science,
pages 313–322. Springer, 2018.
[ bib ]
A. Kel'manov, V. Khandeev, and A. Panasenko.
Exact algorithms for the special cases of two hard to solve problems
of searching for the largest subset.
In Revised Selected Papers of the 7th International Conference
on Analysis of Images, Social Networks and Texts (AIST 2018), Moscow, Russia,
July 5–7, 2018, volume 11179 of Lecture Notes in Computer Science,
pages 294–304. Springer, 2018.
[ bib |
DOI ]
A. Kel'manov, V. Khandeev, and A. Panasenko.
Randomized algorithms for some clustering problems.
In Revised Selected Papers of the 7th International Conference
on Optimization Problems and Their Applications (OPTA 2018), Omsk, Russia,
July 8-14, volume 781 of Communications in Computer and Information
Science, pages 109–119. Springer, 2018.
[ bib |
DOI ]
A. Kel'manov, L. Mikhailova, and S. Romanchenko.
On a problem of choosing elements in a family of sequences.
In Proceedings of the School-Seminar on Optimization Problems
and their Applications (OPTA-SCL 2018), volume 2098 of CEUR Workshop
Proceedings, pages 181–188, 2018.
[ bib |
.pdf ]
A. Kel'manov, L. Mikhailova, and S. Romanchenko.
On a problem of summing elements chosen from the family of finite
numerical sequences.
In Revised Selected Papers of the 7th International Conference
on Analysis of Images, Social Networks and Texts (AIST 2018), Moscow, Russia,
July 5–7, 2018, volume 11179 of Lecture Notes in Computer Science,
pages 305–317. Springer, 2018.
[ bib |
DOI ]
A. Kel'manov, A. Pyatkin, S. Khamidullin, V. Khandeev, Y. V. Shamardin, and
V. Shenmaier.
An approximation polynomial algorithm for a problem of searching for
the longest subsequence in a finite sequence of points in euclidean space.
In Revised Selected Papers of the 7th International Conference
on Optimization Problems and Their Applications (OPTA 2018), Omsk, Russia,
July 8-14, volume 781 of Communications in Computer and Information
Science, pages 120–130. Springer, 2018.
[ bib |
DOI ]
A. Kel’manov, A. Motkova, and V. Shenmaier.
An approximation scheme for a weighted two-cluster partition problem.
In Revised Selected Papers of the 6th International Conference
on Analysis of Images, Social Networks and Texts (AIST 2017), Moscow, Russia,
July 27–29, 2017, volume 10716 of Lecture Notes in Computer Science,
pages 323–333. Springer, 2018.
[ bib |
DOI ]
A. Kondakov and Y. Kochetov.
A core heuristic and the branch-and-price method for a bin packing
problem with a color constraint.
In Proceedings of the 7th International Conference on
Optimization Problems and Their Applications (OPTA 2018), Omsk; Russian
Federation; June 8-14, 2018, volume 781 of Communications in Computer
and Information Science, pages 309–320. Springer, 2018.
[ bib |
DOI ]
A. V. Kononov, A. A. Panin, and A. V. Plyasunov.
A new model of competitive location and pricing with the uniform
split of the demand.
In Revised Selected Papers of the 7th International Conference
on Optimization Problems and Their Applications (OPTA 2018), Omsk, Russia,
July 8-14, volume 781 of Communications in Computer and Information
Science, pages 16–28. Springer, 2018.
[ bib |
DOI ]
L. Mozheikina and P. Emelyanov.
Mobile applications as tools of alternative communication,
diagnostics and language development for children with language disorders.
In Proceedings of the 10th International Conference on Social
Informatics (SocInfo 2018), St. Petersburg, Russia, September 25-28, 2018,
Part II, volume 11186 of Lecture Notes in Computer Science, pages
75–84, Cham, 2018. Springer.
[ bib |
DOI ]
D. Ponomaryov and S. Yakovenko.
Defind: A protege plugin for computing concept definitions in
el-ontologies.
In Proceedings of the 8th Joint International Conference on
Semantic Technology (JIST 2018), Awaji, Japan, November 26–28, 2018,
volume 11341 of Lecture Notes in Computer Science, pages 235–243.
Springer, 2018.
[ bib |
DOI ]
A. O. Zakharov and Y. V. Kovalenko.
Reduction of the pareto set in bicriteria asymmetric traveling
salesman problem.
In A. Eremeev, M. Khachay, Y. Kochetov, and P. Pardalos, editors,
Optimization Problems and Their Applications, volume 781 of
Communications in Computer and Information Science, pages 93–105. Springer
International Publishing, 2018.
[ bib ]
A. A. Zyryanov, Y. A. Kochetov, and S. M. Lavlinskii.
Stochastic local search for the strategic planning public-private
partnership.
In Proceedings of the School-Seminar on Optimization Problems
and their Applications (OPTA-SCL 2018), volume 2098 of CEUR Workshop
Proceedings, pages 446–463, 2018.
[ bib |
.pdf ]
G. Behnke, F. Nielsen, M. Schiller, D. Ponomaryov, P. Bercher, B. Glimm,
W. Minker, and S. Biundo.
To plan for the user is to plan with the user: Integrating user
interaction into the planning process.
In Companion Technology, Cognitive Technologies, pages
123–144. Springer, 2017.
[ bib |
DOI ]
A. A. Ageev, A. V. Kel’manov, A. V. Pyatkin, S. A. Khamidullin, and V. V.
Shenmaier.
Approximation polynomial algorithm for the data editing and data
cleaning problem.
Pattern Recognition and Image Analysis, 27(3):365–370, 2017.
[ bib |
DOI ]
S. Agievich, A. Gorodilova, V. Idrisova, N. Kolomeec, G. Shushuev, and
N. Tokareva.
Mathematical problems of the second international students’
olympiad in cryptography.
Cryptologia, 41(6):534–565, 2017.
[ bib |
DOI ]
E. Alekseeva, Y. Kochetov, and E.-G. Talbi.
A matheuristic for the discrete bilevel problem with multiple
objectives at the lower level.
International Transactions in Operational Research,
24(5):959–981, 2017.
[ bib |
DOI |
http ]
V. Berikov and I. Pestunov.
Ensemble clustering based on weighted co-association matrices: Error
bound and convergence properties.
Pattern Recognition, 63:427–436, 2017.
[ bib |
DOI ]
V. B. Berikov.
Construction of an optimal collective decision in cluster analysis on
the basis of an averaged co-association matrix and cluster validity indices.
Pattern Recognition and Image Analysis, 27(2):153–165, 2017.
[ bib |
DOI ]
R. van Bevern, R. Bredereck, L. Bulteau, J. Chen, V. Froese, R. Niedermeier, and
G. J. Woeginger.
Partitioning perfect graphs into stars.
Journal of Graph Theory, 85(2):297–335, 2017.
[ bib |
DOI |
http ]
R. van Bevern, R. Bredereck, M. Chopin, S. Hartung, F. Hüffner, A. Nichterlein,
and O. Suchý.
Fixed-parameter algorithms for DAG partitioning.
Discrete Applied Mathematics, 220:134–160, 2017.
[ bib |
DOI |
http ]
R. van Bevern, C. Komusiewicz, and M. Sorge.
A parameterized approximation algorithm for the mixed and windy
capacitated arc routing problem: theory and experiments.
Networks, 70(3):262–278, 2017.
[ bib |
DOI |
slides |
prototype |
http ]
R. van Bevern, R. Niedermeier, and O. Suchý.
A parameterized complexity view on non-preemptively scheduling
interval-constrained jobs: few machines, small looseness, and small slack.
Journal of Scheduling, 20(3):255–265, 2017.
[ bib |
DOI |
slides |
http ]
A. I. Erzin, N. Mladenovic, and R. V. Plotnikov.
Variable neighborhood search variants for min-power symmetric
connectivity problem.
Computers and Operations Research, 78:557–563, 2017.
[ bib |
DOI ]
A. E. Galashov and A. V. Kel'manov.
Pseudopolynomial time solvability of a quadratic euclidean problem of
finding a family of disjoint subsets.
Numerical Analysis and Applications, 10(1):11–16, 2017.
[ bib |
DOI ]
E. Kh. Gimadi and O. Yu. Tsidulko.
An asymptotically optimal algorithm for the m-peripatetic salesman
problem on random inputs with discrete distribution.
Journal of Applied and Industrial Mathematics, 11(3):354–361,
2017.
[ bib |
DOI ]
A. V. Kel'manov, S. A. Khamidullin, and V. I. Khandeev.
Exact pseudopolynomial algorithm for one sequence partitioning
problem.
Automation and Remote Control, 78(1):67–74, 2017.
[ bib |
DOI ]
A. V. Kel'manov, L. V. Mikhailova, S. A. Khamidullin, and V. I. Khandeev.
An approximation algorithm for a problem of partitioning a sequence
into clusters with constraints on their cardinalities.
Proceedings of the Steklov Institute of Mathematics,
299(1):88–96, 2017.
[ bib |
DOI ]
A. V. Kel'manov, S. M. Romanchenko, and S. A. Khamidullin.
An approximation scheme for the problem of finding a subsequence.
Numerical Analysis and Applications, 10(4):313–323, 2017.
[ bib |
DOI ]
A. V. Kel’manov, L. V. Mikhailova, S. A. Khamidullin, and V. I. Khandeev.
Approximation algorithm for the problem of partitioning a sequence
into clusters.
Computational Mathematics and Mathematical Physics,
57(8):1376–1383, 2017.
[ bib |
DOI ]
Y. Kochetov and A. Kondakov.
VNS matheuristic for a bin packing problem with a color constraint.
Electronic Notes in Discrete Mathematics, 58:39–46, 2017.
[ bib |
DOI ]
Y. A. Kochetov, A. A. Panin, and A. V. Plyasunov.
Genetic local search and hardness of approximation for the server
load balancing problem.
Automation and Remote Control, 78(3):425–434, 2017.
[ bib |
DOI ]
D. Ponomaryov and M. Soutchanski.
Progression of decomposed local-effect action theories.
ACM Transactions on Computational Logic, 18(2):16:1–16:41,
2017.
[ bib |
DOI ]
V. V. Tatarnikov, I. A. Pestunov, and V. B. Berikov.
Centroid averaging algorithm for a clustering ensemble.
Computer Optics, 41(5):712–718, 2017.
[ bib |
DOI ]
A. Ageev, A. Kel'manov, A. Pyatkin, S. Khamidullin, and V. Shenmaier.
1/2-approximation polynomial-time algorithm for a problem of
searching a subset.
In Proceedings of the 2017 International Multi-Conference on
Engineering, Computer and Information Sciences (SIBIRCON 2017), pages 8–12,
2017.
[ bib |
DOI ]
A. A. Ageev, A. V. Kel'manov, A. V. Pyatkin, S. A. Khamidullin, and V. V.
Shenmaier.
Approximation algorithm for a quadratic Euclidean problem of
searching a subset with the largest cardinality.
In Proceedings of the 8th International Conference on
Optimization and Applications (OPTIMA'17), volume 1987 of CEUR
Workshop Proceedings, pages 19–23. CEUR-WS.org, 2017.
[ bib ]
M. Bentert, R. van Bevern, A. Nichterlein, and R. Niedermeier.
Parameterized algorithms for power-efficient connected symmetric
wireless sensor networks.
In Proceedings of the 13th International Symposium on Algorithms
and Experiments for Wireless Networks (ALGOSENSORS'17), Wien, Austria,
volume 10718 of Lecture Notes in Computer Science, pages 26–40.
Springer, 2017.
[ bib |
DOI |
http ]
V. Berikov, N. Karaev, and A. Tewari.
Semi-supervised classification with cluster ensemble.
In Proceedings of the 2017 International Multi-Conference on
Engineering, Computer and Information Sciences (SIBIRCON 2017), pages
245–250, 2017.
[ bib |
DOI ]
V. B. Berikov, I. A. Pestunov, N. M. Karaev, and A. Tewari.
Recognition of hyperspectral images with use of cluster ensemble and
semisupervised learning.
In Proceedings of the 2017 All-Russian Conference "Spatial Data
Processing for Monitoring of Natural and Anthropogenic Processes" (SDM
2017), volume 2033 of CEUR Workshop Proceedings, pages 60–64, 2017.
[ bib |
.pdf ]
R. van Bevern, T. Fluschnik, G. B. Mertzios, H. Molter, M. Sorge, and O. Suchý.
Finding Secluded Places of Special Interest in Graphs.
In Proceedings of the 11th International Symposium on
Parameterized and Exact Computation (IPEC'16), Aarhus, Denmark, volume 63 of
Leibniz International Proceedings in Informatics (LIPIcs), pages
5:1–5:16. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2017.
[ bib |
DOI |
http ]
P. Emelyanov and D. Ponomaryov.
Cartesian decomposition in data analysis.
In Proceedings of the 2017 Siberian Symposium on Data Science
and Engineering (SSDSE 2017), pages 55–60. IEEE, 2017.
[ bib |
DOI ]
A. V. Eremeev, A. V. Kel'manov, and A. V. Pyatkin.
On complexity of searching a subset of vectors with shortest average
under a cardinality restriction.
In Revised Selected Papers of the 5th International Conference
on Analysis of Images, Social Networks and Texts (AIST 2016), volume 661 of
Communications in Computer and Information Science, pages 51–57.
Springer, 2017.
[ bib |
DOI ]
A. Erzin.
Energy-efficient monitoring of the strip by identical one side
directed devices.
In Proceedings of the 2017 International Multi-Conference on
Engineering, Computer and Information Sciences (SIBIRCON 2017), pages
58–62, 2017.
[ bib |
DOI ]
A. Erzin.
Solution of the convergecast scheduling problem on a square unit grid
when the transmission range is 2.
In Proceedings of the 11th International Conference on Learning
and Intelligent Optimization (LION'17), pages 50–63. Springer, 2017.
[ bib |
DOI ]
A. Erzin and R. Plotnikov.
Conflict-free data aggregation on a square grid when transmission
distance is not less than 3.
In Proceedings of the 13th International Symposium on Algorithms
and Experiments for Wireless Networks (ALGOSENSORS'17), Wien, Austria,
volume 10718 of Lecture Notes in Computer Science, pages 141–154.
Springer, 2017.
[ bib |
DOI ]
A. Erzin and R. Plotnikov.
Efficient algorithm for the convergecast scheduling problem on a
square grid with obstacles.
In Proceedings of the 8th International Conference on
Optimization and Applications (OPTIMA'17), volume 1987 of CEUR
Workshop Proceedings, pages 187–193. CEUR-WS.org, 2017.
[ bib ]
E. Kh. Gimadi, A. Kurochkina, and O. Tsidulko.
On exact solvability of the restricted capacitated facility location
problem.
In Proceedings of the 8th International Conference on
Optimization and Applications (OPTIMA'17), volume 1987 of CEUR
Workshop Proceedings, pages 209–216. CEUR-WS.org, 2017.
[ bib ]
Y. Kazakov and D. Ponomaryov.
On the complexity of semantic integration of OWL ontologies.
In Proceedings of the 30th International Workshop on Description
Logics (DL'17), volume 1879 of CEUR Workshop Proceedings, 2017.
[ bib ]
A. Kel'manov.
Efficient approximation algorithms for some NP-hard problems of
partitioning a set and a sequence.
In Proceedings of the 2017 International Multi-Conference on
Engineering, Computer and Information Sciences (SIBIRCON 2017), pages
87–90, 2017.
[ bib |
DOI ]
A. Kel'manov.
On some euclidean clustering problems: NP-hardness and efficient
approximation algorithms.
In Proceedings of the 8th International Conference on
Optimization and Applications (OPTIMA'17), volume 1987 of CEUR
Workshop Proceedings, pages 291–297. CEUR-WS.org, 2017.
[ bib ]
A. Kel'manov and V. Khandeev.
Algorithms with performance guarantee for some quadratic Euclidean
problems of 2-partitioning a set and a sequence.
In Proceedings of the 8th International Conference on
Optimization and Applications (OPTIMA'17), volume 1987 of CEUR
Workshop Proceedings, pages 298–303. CEUR-WS.org, 2017.
[ bib ]
A. Kel'manov and V. Khandeev.
Some algorithms with guaranteed accuracy for 2-clustering problems
with given center of one cluster.
In Proceedings of the 2017 International Multi-Conference on
Engineering, Computer and Information Sciences (SIBIRCON 2017), pages
91–93, 2017.
[ bib |
DOI ]
A. Kel'manov and A. Motkova.
Algorithms with performance guarantee for a weighted 2-partition
problem.
In Proceedings of the 8th International Conference on
Optimization and Applications (OPTIMA'17), volume 1987 of CEUR
Workshop Proceedings, pages 304–309. CEUR-WS.org, 2017.
[ bib ]
A. Kel'manov and A. Motkova.
An approximation polynomial-time algorithm for a cardinality-weighted
2-clustering problem.
In Proceedings of the 2017 International Multi-Conference on
Engineering, Computer and Information Sciences (SIBIRCON 2017), pages
94–96, 2017.
[ bib |
DOI ]
A. Kel'manov and A. Pyatkin.
On some finite set clustering problems in Euclidean space.
In Proceedings of the 8th International Conference on
Optimization and Applications (OPTIMA'17), volume 1987 of CEUR
Workshop Proceedings, pages 310–315. CEUR-WS.org, 2017.
[ bib ]
A. Kononov and Y. Kovalenko.
An approximation algorithm for preemptive speed scaling scheduling of
parallel jobs with migration.
In Proceedings of the 11th International Conference on Learning
and Intelligent Optimization (LION'17), pages 351–357. Springer, 2017.
[ bib |
DOI ]
I. A. Pestunov, S. A. Rylov, Y. N. Sinyavskiy, and V. B. Berikov.
Computationally efficient methods of clustering ensemble construction
for satellite image segmentation.
In Proceedings of the 2017 International Conference Information
Technology and Nanotechnology (IPGTIS-ITNT'17), Samara, Russian Federation,
24-27 April 2017, volume 1901 of CEUR Workshop Proceedings, pages
194–200, 2017.
[ bib ]
R. Plotnikov, A. Erzin, and V. Zalyubovskiy.
Convergecast with unbounded number of channels.
In Proceedings of the 21st International Conference on Circuits,
Systems, Communications and Computers (CSCC'17), volume 125 of MATEC
Web of Conferences, 2017.
[ bib |
DOI ]
E. Angel, E. Bampis, A. V. Kononov, D. Paparas, E. Pountourakis, and
V. Zissimopoulos.
Clustering on k-edge-colored graphs.
Discrete Applied Mathematics, 211:15–22, 2016.
[ bib |
DOI ]
R. van Bevern, C. Komusiewicz, R. Niedermeier, M. Sorge, and T. Walsh.
H-index manipulation by merging articles: Models, theory, and
experiments.
Artificial Intelligence, 240:19–35, 2016.
[ bib |
DOI |
prototype |
http ]
A. Dolgushev, A. Kel’manov, and V. Shenmaier.
Polynomial-time approximation scheme for a problem of partitioning a
finite set into two clusters.
Proceedings of the Steklov Institute of Mathematics,
295:47–56, 2016.
[ bib |
DOI ]
A. Dugarzhapov and A. Kononov.
A polynomial-time algorithm for the preemptive mixed-shop problem
with two unit operations per job.
Journal of Scheduling, 19(1):61–72, 2016.
[ bib |
DOI ]
A. V. Eremeev, A. V. Kel'manov, and A. V. Pyatkin.
On the complexity and approximability of some euclidean optimal
summing problems.
Computational Mathematics and Mathematical Physics,
56(10):1813–1817, 2016.
[ bib |
DOI ]
A. V. Eremeev, A. V. Kel'manov, and A. V. Pyatkin.
On the complexity of some euclidean optimal summing problems.
Doklady Mathematics, 93(3):286–288, 2016.
[ bib |
DOI ]
V. Froese, R. van Bevern, R. Niedermeier, and M. Sorge.
Exploiting hidden structure in selecting dimensions that distinguish
vectors.
Journal of Computer and System Sciences, 82(3):521–535, 2016.
[ bib |
DOI |
http ]
A. A. Gorodilova.
Characterization of almost perfect nonlinear functions in terms of
subfunctions.
Discrete Mathematics and Applications, 26(4):193–202, 2016.
[ bib |
DOI ]
A. A. Gorodilova.
From cryptanalysis to cryptographic property of a boolean function.
Prikladnaya Diskretnaya Matematika, 33(3):16–44, 2016.
[ bib |
DOI ]
A. V. Kel'manov, S. A. Khamidullin, and V. I. Khandeev.
A fully polynomial-time approximation scheme for a sequence 2-cluster
partitioning problem.
Journal of Applied and Industrial Mathematics, 10(2):209–219,
2016.
[ bib |
DOI ]
A. V. Kel'manov and V. I. Khandeev.
Fully polynomial-time approximation scheme for a special case of a
quadratic euclidean 2-clustering problem.
Computational Mathematics and Mathematical Physics,
56(2):334–341, 2016.
[ bib |
DOI ]
A. V. Kel'manov and A. V. Motkova.
Exact pseudopolynomial algorithms for a balanced 2-clustering
problem.
Journal of Applied and Industrial Mathematics, 10(3):349–355,
2016.
[ bib |
DOI ]
A. V. Kel'manov and A. V. Pyatkin.
On the complexity of some euclidean problems of partitioning a finite
set of points.
Doklady Mathematics, 94(3):635–638, 2016.
[ bib |
DOI ]
A. V. Kel'manov and A. V. Pyatkin.
On the complexity of some quadratic euclidean 2-clustering problems.
Computational Mathematics and Mathematical Physics,
56(3):491–497, 2016.
[ bib |
DOI ]
O. Khamisov, Y. Kochetov, and A. S. Strekalovsky.
Special issue: XVI baikal international school-seminar
«Optimization Methods and Their Applications».
Journal on Global Optimization, 66(1):1, 2016.
[ bib |
DOI ]
A. V. Kononov and P. A. Kononova.
On minimizing dataset transfer time in an acyclic network with four
servers.
Journal of Applied and Industrial Mathematics, 10(4):494–504,
2016.
[ bib |
DOI ]
B. M. T. Lin, F. J. Hwang, and A. V. Kononov.
Relocation scheduling subject to fixed processing sequences.
Journal of Scheduling, 19(2):153–163, 2016.
[ bib |
DOI ]
V. B. Berikov.
Cluster ensemble with averaged co-association matrix maximizing the
expected margin.
In Supplementary Proceedings of the 9th International Conference
on Discrete Optimization and Operations Research and Scientific School
(DOOR'16), Vladivostok, Russia, September 19-23, 2016, volume 1623 of
CEUR Workshop Proceedings, pages 489–500. CEUR-WS.org, 2016.
[ bib |
.pdf ]
R. van Bevern, R. Bredereck, L. Bulteau, C. Komusiewicz, N. Talmon, and G. J.
Woeginger.
Precedence-constrained scheduling problems parameterized by partial
order width.
In Proceedings of the 9th International Conference on Discrete
Optimization and Operations Research (DOOR'16), Vladivostok, Russian
Federation, volume 9869 of Lecture Notes in Computer Science, pages
105–120. Springer, 2016.
[ bib |
DOI |
slides |
http ]
R. van Bevern, V. Froese, and C. Komusiewicz.
Parameterizing edge modification problems above lower bounds.
In Proceedings of the 11th International Computer Science
Symposium in Russia (CSR'16), St. Petersburg, Russian Federation, volume
9691 of Lecture Notes in Computer Science, pages 57–72. Springer,
2016.
[ bib |
DOI |
slides |
http ]
R. van Bevern, I. Kanj, C. Komusiewicz, R. Niedermeier, and M. Sorge.
Twins in subdivision drawings of hypergraphs.
In Proceedings of the 24th International Symposium on Graph
Drawing and Network Visualization (GD'16), Athens, Greece, volume 9801 of
Lecture Notes in Computer Science, pages 67–80. Springer, 2016.
[ bib |
DOI |
http ]
R. van Bevern, C. Komusiewicz, H. Molter, R. Niedermeier, M. Sorge, and
T. Walsh.
H-index manipulation by undoing merges.
In Proceedings of the 22nd European Conference on Artificial
Intelligence (ECAI'16), The Hague, Holland, volume 285 of Frontiers in
Artificial Intelligence and Applications, pages 895–903, 2016.
[ bib |
DOI |
http ]
R. van Bevern and A. V. Pyatkin.
Completing partial schedules for open shop with unit processing times
and routing.
In Proceedings of the 11th International Computer Science
Symposium in Russia (CSR'16), St. Petersburg, Russian Federation, volume
9691 of Lecture Notes in Computer Science, pages 73–87. Springer,
2016.
[ bib |
DOI |
slides |
http ]
D. D. Cvokic, Y. A. Kochetov, and A. V. Plyasunov.
A leader-follower hub location problem under fixed markups.
In Proceedings of the 9th International Conference on Discrete
Optimization and Operations Research (DOOR'16), Vladivostok, Russia,
September 19-23, 2016, volume 9869 of Lecture Notes in Computer
Science, pages 350–363. Springer, 2016.
[ bib |
DOI ]
P. Emelyanov.
AND–decomposition of boolean polynomials with prescribed shared
variables.
In Proceedings of the 2nd International Conference on Algorithms
and Discrete Applied Mathematics (CALDAM 2016), volume 9602 of Lecture
Notes in Computer Science, pages 164–175. Springer, 2016.
[ bib |
DOI ]
A. Eremeev, A. Kelmanov, and A. Pyatkin.
On a quadratic euclidean problem of vector subset choice: Complexity
and algorithmic approach.
In Supplementary Proceedings of the 9th International Conference
on Discrete Optimization and Operations Research and Scientific School
(DOOR'16), Vladivostok, Russia, September 19-23, 2016, volume 1623 of
CEUR Workshop Proceedings, pages 526–535. CEUR-WS.org, 2016.
[ bib |
.pdf ]
A. Erzin and L. Osotova.
Comparative analysis of regular covers with one or two types of
sectors.
In Proceedings of the 2nd International Conference on Numerical
Computations: Theory and Algorithms (NUMTA'16), volume 1776 of AIP
Conference Proceedings. American Institute of Physics Inc., 2016.
[ bib |
DOI ]
A. Erzin, N. Shabelnikova, and Y. Amirgaliyev.
Wireless sensor networks and covering of the stripe with equal
sectors.
In Proceedings of the 12th International Conference on
Electronics Computer and Computation (ICECCO'15). IEEE, 2016.
[ bib |
DOI ]
A. I. Erzin.
Cost-effective strip covering with identical directed sensors.
In Supplementary Proceedings of the 9th International Conference
on Discrete Optimization and Operations Research and Scientific School
(DOOR'16), Vladivostok, Russia, September 19-23, 2016., volume 1623 of
CEUR Workshop Proceedings, pages 701–712. CEUR-WS.org, 2016.
[ bib |
.pdf ]
A. I. Erzin and Y. A. Kochetov.
Preface to the special session intractable problems and approximation
algorithms.
In Proceedings of the 2nd International Conference on Numerical
Computations: Theory and Algorithms (NUMTA'16), volume 1776 of AIP
Conference Proceedings. American Institute of Physics Inc., 2016.
[ bib |
DOI ]
A. I. Erzin and A. Pyatkin.
Convergecast scheduling problem in case of given aggregation tree:
The complexity status and some special cases.
In Proceedings of the 10th International Symposium on
Communication Systems, Networks and Digital Signal Processing (CSNDSP'2016),
Prague, Czech Republic, July 20-22, 2016, pages 1–6. IEEE, 2016.
[ bib |
DOI ]
A. I. Erzin, N. Shabelnikova, and V. V. Zalyubovskiy.
Covering the plane with equal sectors.
In Proceedings of the 10th International Conference on
Ubiquitous Information Management and Communication, IMCOM 2016, Danang,
Vietnam, January 4-6, 2016, pages 9:1–9:8. ACM, 2016.
[ bib |
DOI ]
A. Galashov and A. Kelmanov.
An exact pseudopolynomial algorithm for a problem of finding a family
of disjoint subsets.
In Supplementary Proceedings of the 9th International Conference
on Discrete Optimization and Operations Research and Scientific School
(DOOR'16), Vladivostok, Russia, September 19-23, 2016, volume 1623 of
CEUR Workshop Proceedings, pages 501–509. CEUR-WS.org, 2016.
[ bib |
.pdf ]
E. Kh. Gimadi, A. M. Istomin, and O. Yu. Tsidulko.
On asymptotically optimal approach to the m-peripatetic salesman
problem on random inputs.
In Proceedings of the 9th International Conference on Discrete
Optimization and Operations Research (DOOR'16), Vladivostok, Russia,
September 19-23, 2016, volume 9869 of Lecture Notes in Computer
Science, pages 136–147, 2016.
[ bib |
DOI ]
E. Kh. Gimadi, I. Rykov, and O. Tsidulko.
The TSP-approach to approximate solving the m-cycles cover
problem.
In Proceedings of the 2nd International Conference on Numerical
Computations: Theory and Algorithms (NUMTA'16), volume 1776 of AIP
Conference Proceedings. American Institute of Physics Inc., 2016.
[ bib |
DOI ]
A. Gordeev, A. Kononov, and P. Kononova.
Optima localization in scheduling multi-processor jobs.
In Supplementary Proceedings of the 9th International Conference
on Discrete Optimization and Operations Research and Scientific School
(DOOR'16), Vladivostok, Russia, September 19-23, 2016, volume 1623 of
CEUR Workshop Proceedings, pages 350–357. CEUR-WS.org, 2016.
[ bib |
.pdf ]
V. P. Il'ev, S. Il'eva, and A. Kononov.
Short survey on graph correlation clustering with minimization
criteria.
In Proceedings of the 9th International Conference on Discrete
Optimization and Operations Research (DOOR'16), Vladivostok, Russia,
September 19-23, 2016, volume 9869 of Lecture Notes in Computer
Science, pages 25–36. Springer, 2016.
[ bib |
DOI ]
A. Kelmanov, S. Khamidullin, and S. Romanchenko.
Fully polynomial-time approximation scheme for a problem of finding a
subsequence.
In Supplementary Proceedings of the 9th International Conference
on Discrete Optimization and Operations Research and Scientific School
(DOOR'16), Vladivostok, Russia, September 19-23, 2016, volume 1623 of
CEUR Workshop Proceedings, pages 516–525. CEUR-WS.org, 2016.
[ bib |
.pdf ]
A. Kel'manov, L. Mikhailova, S. Khamidullin, and V. Khandeev.
An approximation algorithm for a problem of partitioning a sequence
into clusters with restrictions on their cardinalities.
In Proceedings of the 9th International Conference on Discrete
Optimization and Operations Research (DOOR'16), Vladivostok, Russia,
September 19-23, 2016, volume 9869 of Lecture Notes in Computer
Science, pages 171–181. Springer, 2016.
[ bib |
DOI ]
A. Kel'manov and A. Motkova.
A fully polynomial-time approximation scheme for a special case of a
balanced 2-clustering problem.
In Proceedings of the 9th International Conference on Discrete
Optimization and Operations Research (DOOR'16), Vladivostok, Russia,
September 19-23, 2016, volume 9869 of Lecture Notes in Computer
Science, pages 182–192. Springer, 2016.
[ bib |
DOI ]
Y. Kochetov, E. Alekseeva, and M. Mezmaz.
Local search heuristic for the discrete leader-follower problem with
multiple follower objectives.
In Proceedings of the 2nd International Conference on Numerical
Computations: Theory and Algorithms (NUMTA'16), volume 1776 of AIP
Conference Proceedings, 2016.
[ bib |
DOI ]
Y. Kochetov, A. Panin, and A. Plyasunov.
Genetic local search for the servers load balancing problem.
In Supplementary Proceedings of the 9th International Conference
on Discrete Optimization and Operations Research and Scientific School
(DOOR'16), Vladivostok, Russia, September 19-23, 2016, volume 1623 of
CEUR Workshop Proceedings, pages 453–463. CEUR-WS.org, 2016.
[ bib |
.pdf ]
Y. Kochetov, I. Sokolova, S. Amirgaliyeva, and Z. Amirgaliyeva.
Alternating heuristic and exact method for the leader-follower
facility location and design problem.
In Proceedings of the 12th International Conference on
Electronics Computer and Computation (ICECCO'15). IEEE, 2016.
[ bib |
DOI ]
A. Kononov and Y. Kovalenko.
On speed scaling scheduling of parallel jobs with preemption.
In Proceedings of the 9th International Conference on Discrete
Optimization and Operations Research (DOOR'16), Vladivostok, Russia,
September 19-23, 2016, volume 9869 of Lecture Notes in Computer
Science, pages 309–321. Springer, 2016.
[ bib |
DOI ]
A. Kononov and I. N. Lushchakova.
Scheduling of two parallel machines with linear decreasing time slot
costs to minimize total weighted completion time.
In Supplementary Proceedings of the 9th International Conference
on Discrete Optimization and Operations Research and Scientific School
(DOOR'16), Vladivostok, Russia, September 19-23, 2016, volume 1623 of
CEUR Workshop Proceedings, pages 344–349. CEUR-WS.org, 2016.
[ bib |
.pdf ]
L. Mozheikina and P. Emelyanov.
Personal issues of social networks: Towards safe surfing.
In Proceedings of the 20th World Multi-Conference on Systemics,
Cybernetics and Informatics (WMSCI 2016), volume 1, pages 260–265, 2016.
[ bib |
.pdf ]
R. Plotnikov, A. Erzin, and N. Mladenovic.
Approximation algorithms for the min-power symmetric connectivity
problem.
In Proceedings of the 2nd International Conference on Numerical
Computations: Theory and Algorithms (NUMTA'16), volume 1776 of AIP
Conference Proceedings. American Institute of Physics Inc., 2016.
[ bib |
DOI ]
R. V. Plotnikov, A. I. Erzin, and N. Mladenovic.
Variable neighborhood search-based heuristics for min-power symmetric
connectivity problem in wireless networks.
In Proceedings of the 9th International Conference on Discrete
Optimization and Operations Research (DOOR'16), Vladivostok, Russia,
September 19-23, 2016, volume 9869 of Lecture Notes in Computer
Science, pages 220–232. Springer, 2016.
[ bib |
DOI ]