Skip to main content
AkademIndex

Products

For developers

AkademBaseOpen API for the ecosystem
← Back to work

Works citing this work

5 works

Work: Lower bound for the advantage coefficient in the search problem on graphs

  1. The pursuit-evasion game on the 1-skeleton graph of a regular polyhedron. I

    Абдулла Азамов, A. Sh. Kuchkarov, A. G. Holboyev

    ArticleGuidance and Control SystemsAutomation and Remote Control20176 citations
    ABI

  2. A Pursuit–Evasion Differential Game with Slow Pursuers on the Edge Graph of a Simplex. I

    Абдулла Азамов, Tolanbay Ibaydullayev

    ArticleGuidance and Control SystemsAutomation and Remote Control20213 citations
    ABI

  3. Differential Game with Slow Pursuers on the Edge Graph of a Simplex

    Абдулла Азамов, Tolanbay Ibaydullaev, Gafurjan Ibragimov

    ArticleGuidance and Control SystemsInternational Game Theory Review20212 citations
    ABI

  4. Pursuit Differential Game with Slow Pursuers on the 1-Skeleton Graph of the Icosahedron

    Gafurjan Ibragimov, A. G. Holboyev, Tolanbay Ibaydullaev +1

    ArticleGuidance and Control SystemsMathematics20221 citations
    ABI

  5. Game with Slow Pursuers on the Edge Graphs of Regular Simplexes

    Абдулла Азамов, Tolanbay Ibaydullaev, Gafurjan Ibragimov

    ChapterGuidance and Control SystemsTrends in mathematics20210 citations
    ABI