default search action
Edward Gimadi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j11]Eduard Kh. Gimadi, Alexandr A. Shtepa:
On Asymptotically Optimal Approach for Finding of the Minimum Total Weight of Edge-Disjoint Spanning Trees with a Given Diameter. Autom. Remote. Control. 84(7): 772-787 (2023) - [c26]Edward Khairutdinovich Gimadi
, Alexandr A. Shtepa
The Problem of Finding Several Given Diameter Spanning Trees of Maximum Total Weight in a Complete Graph. AIST 2023: 341-348 - 2021
- [c25]Eduard Kh. Gimadi
On Several Edge-Disjoint MSTs with Given Diameter in Undirected Graph with Exponentially Distributed Edge Weights. AIST (Supplement) 2021: 195-206 - [c24]Alexander A. Ageev
How Fast Can the Uniform Capacitated Facility Location Problem Be Solved on Path Graphs. AIST 2021: 303-314 - [c23]Edward Kh. Gimadi
On Asymptotically Optimal Approach for the Problem of Finding Several Edge-Disjoint Spanning Trees of Given Diameter in an Undirected Graph with Random Edge Weights. MOTOR 2021: 67-78 - 2020
- [c22]Edward Gimadi
On Asymptotically Optimal Solvability of Euclidean Max m-k-Cycles Cover Problem. AIST (Supplement) 2020: 257-266 - [c21]Edward Kh. Gimadi
An Effective Algorithm for the Three-Stage Facility Location Problem on a Tree-Like Network. AIST (Supplement) 2020: 267-274 - [c20]Eduard Kh. Gimadi
Lower Bound Polynomial Fast Procedure for the Resource-Constrained Project Scheduling Problem Tested on PSPLIB Instances. AIST 2020: 407-420 - [c19]Edward Kh. Gimadi
On Asymptotically Optimal Solvability of Max m-k-Cycles Cover Problem in a Normed Space. MOTOR 2020: 85-97 - [c18]Edward Kh. Gimadi
A Given Diameter MST on a Random Graph. OPTIMA 2020: 110-121
2010 – 2019
- 2019
- [c17]Edward Kh. Gimadi
Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs. LION 2019: 201-207 - [c16]Edward Kh. Gimadi, Ekaterina Yu. Shin:
On Given Diameter MST Problem on Random Input Data. MOTOR (2) 2019: 30-38 - 2018
- [c15]Edward Kh. Gimadi
On Modification of an Asymptotically Optimal Algorithm for the Maximum Euclidean Traveling Salesman Problem. AIST 2018: 283-293 - [c14]Edward Kh. Gimadi
Asymptotically Optimal Algorithm for the Maximum m-Peripatetic Salesman Problem in a Normed Space. LION 2018: 402-410 - 2017
- [c13]Edward Gimadi
An Exact Polynomial Algorithm for the Outerplanar Facility Location Problem with Improved Time Complexity. AIST 2017: 295-303 - [c12]Edward Kh. Gimadi
Approximation Algorithms for the Maximum m-Peripatetic Salesman Problem. AIST 2017: 304-312 - 2016
- [c11]Edward Khairutdinovich Gimadi, Alexey M. Istomin, Ekaterina Shin:
On Algorithm for the Minimum Spanning Trees Problem with Diameter Bounded Below. DOOR (Supplement) 2016: 11-17 - [c10]Edward Khairutdinovich Gimadi, Anna A. Kurochkina, Elena A. Nagornaya:
Probabilistic Analysis of an Algorithm for the Uncapacitated Facility Location Problem on Unbounded Above Random Input Data. DOOR (Supplement) 2016: 18-27 - [c9]Edward Kh. Gimadi
On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random Inputs. DOOR 2016: 136-147 - [c8]Edward Gimadi
Efficient Randomized Algorithm for a Vector Subset Problem. DOOR 2016: 148-158 - [c7]Edward Gimadi, Evgenii N. Goncharov, Valentin V. Leonov:
On Formulation and Software Implementation of Some Financial Management and Barter Transactions Problems. DOOR (Supplement) 2016: 713-722 - 2015
- [j10]Edward Gimadi
Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph. Appl. Math. Comput. 255: 84-91 (2015) - [j9]Eduard Kh. Gimadi
Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph. Discret. Appl. Math. 196: 54-61 (2015) - 2011
- [j8]Eduard Kh. Gimadi:
On some Hard-to-Solve versions of the Assignment Problem. Stud. Inform. Univ. 9(3): 65-78 (2011)
2000 – 2009
- 2009
- [j7]Alexey Baburin, Federico Della Croce
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2. Discret. Appl. Math. 157(9): 1988-1992 (2009) - 2006
- [j6]Edward Gimadi
NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors. Electron. Notes Discret. Math. 27: 29-31 (2006) - [j5]Edward Gimadi
Asymptotically optimal approach for solving some hard discrete optimization problems. Electron. Notes Discret. Math. 27: 33-34 (2006) - [j4]Yury Glazkov, Alexey Baburin, Edward Gimadi
Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2. Electron. Notes Discret. Math. 27: 35-36 (2006) - [c6]Alexey Baburin, Edward Gimadi
Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning Subgraphs of Extreme Total Edge Weight. OR 2006: 215-220 - 2005
- [c5]Edward Gimadi
On Some Probability Inequalities for Some Discrete Optimization Problems. OR 2005: 283-289 - 2004
- [j3]Eduard Kh. Gimadi
On finding a cyclic tour and a vehicle loading plan yielding maximum profit. Discret. Appl. Math. 135(1-3): 105-111 (2004) - [c4]Alexey Baburin, Edward Gimadi
Approximation Algorithms for Finding a Maximum-Weight Spanning Connected Subgraph with given Vertex Degrees. OR 2004: 343-351 - 2002
- [c3]Edward Gimadi
On Solvability of the Project Scheduling Problem with Accumulative Resources of an Arbitrary Sign. OR 2002: 241-246 - 2001
- [j2]Eduard Kh. Gimadi
On the connectedness property of service areas for the Network Facility Location Problem. Electron. Notes Discret. Math. 10: 121-124 (2001) - [j1]Edward Gimadi
Multi-index axial assignment problem on single-cyclic permutations. Electron. Notes Discret. Math. 10: 125-128 (2001) - [c2]Edward Gimadi
On the project scheduling problem under stored resource constraints. ETFA (2) 2001: 703-705 - [c1]Edward Gimadi
Multi-index assignment problem: an asymptotically optimal approach. ETFA (2) 2001: 707-709
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: