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
45
Submodular Function Minimization under Covering Constraints
Satoru Iwata, Kiyohito Nagano · 2009 · 130 citations
1–5 of 45
74
8
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 74
63

Kyoto University
Kyoto, Japan
5 h-index
5 publications
352 citations
The University of Tokyo
Tokyo, Japan
5 h-index
7 publications
198 citations
Tokyo Metropolitan University
Tokyo, Japan
4 h-index
6 publications
180 citations
Institute of Economics
Yekaterinburg, Russia
3 h-index
3 publications
194 citations

University of Sulaimani
Sulaymaniyah, Iraq
3 h-index
3 publications
69 citations

Central Economics and Mathematics Institute
Moscow, Russia
3 h-index
3 publications
194 citations

Yokohama National University
Yokohama, Japan
2 h-index
2 publications
38 citations

Government College University, Faisalabad
Faisalabad, Pakistan
2 h-index
5 publications
82 citations
1–8 of 63
4 publications · 185 citations
4
h-index
3 publications · 72 citations
3
h-index
3 publications · 54 citations
3
h-index
2 publications · 45 citations
2
h-index
2 publications · 65 citations
2
h-index
1–5