| 2008 | ||
|---|---|---|
| j5 | B. Kalantari, Isabella Lari, Federica Ricca, Bruno Simeone: On the complexity of general matrix scaling and entropy minimization via the RAS algorithm. Math. Program. 112(2): 371-401 (2008) | |
| 1996 | ||
| j4 | B. Kalantari, Gholamreza B. Khosrovshahi: Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP. Networks 28(4): 211-219 (1996) | |
| 1990 | ||
| j3 | ||
| 1988 | ||
| j2 | Michael D. Grigoriadis, B. Kalantari: A new class of heuristic algorithms for weighted perfect matching. J. ACM 35(4): 769-776 (1988) | |
| 1986 | ||
| j1 | Michael D. Grigoriadis, B. Kalantari: A Lower Bound to the Complexity of Euclidean and Rectilinear Matching Algorithms. Inf. Process. Lett. 22(2): 73-76 (1986) | |
| 1 | Michael D. Grigoriadis | |
| 2 | Gholamreza B. Khosrovshahi | |
| 3 | Isabella Lari | |
| 4 | Federica Ricca | |
| 5 | Bruno Simeone |
Data released under the ODC-BY 1.0 license — See also our legal information page