Discrete Convexity

Discrete Convexity is a mathematical framework within convex geometry that characterizes the structural and combinatorial properties of convex sets in discrete spaces by imposing integrality and separation conditions that distinguish it from classical convexity defined over continuous domains.

45

Publications

1.5K

Citations

74

Authors

63

Institutions

Publications per year

2017–2026

14

Authors

74

  1. KM
    Kazuo Murota

    The University of Tokyo, Japan

    8 publications · 381 citations

    8

    h-index

  2. PO
    Pshtiwan Othman Mohammed

    University of Sulaimani, Iraq

    3 publications · 69 citations

    3

    h-index

  3. SM
    Satoko Moriguchi

    Tokyo Metropolitan University, Japan

    3 publications · 60 citations

    3

    h-index

  4. GK
    Gleb Koshevoy

    Central Economics and Mathematics Institute, Russia

    3 publications · 194 citations

    3

    h-index

  5. AS
    Akiyoshi Shioura

    Tohoku University, Japan

    3 publications · 113 citations

    3

    h-index

1–5 of 74

Venues

  1. Discrete Applied Mathematics

    4 publications · 185 citations

    4

    h-index

  2. Mathematics of Operations Research

    3 publications · 72 citations

    3

    h-index

  3. 3

    h-index

  4. 2

    h-index

  5. Mathematical Programming

    2 publications · 65 citations

    2

    h-index

1–5