Penalty for zero-one integer equivalent problem. - Bahman Kalantari; J. Ben Rosen (Math. Program., 1982)

Technical Note - Construction of Difficult Linearly Constrained Concave Minimization Problems. - Bahman Kalantari (Oper. Res., 1985)

A Lower Bound to the Complexity of Euclidean and Rectilinear Matching Algorithms. - Michael D. Grigoriadis; Bahman Kalantari (Inf. Process. Lett., 1986)

Penalty formulation for zero-one nonlinear programming. - Bahman Kalantari; J. Ben Rosen (Discret. Appl. Math., 1987)

An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions. - Bahman Kalantari; J. Ben Rosen (Math. Oper. Res., 1987)

A new class of heuristic algorithms for weighted perfect matching. - Michael D. Grigoriadis; Bahman Kalantari (J. ACM, 1988)

Approximating the Diameter of a Set of Points in the Euclidean Space. - Ömer Egecioglu; Bahman Kalantari (Inf. Process. Lett., 1989)

Karmarkar's Algorithm with Improved Steps. - Bahman Kalantari (Math. Program., 1990)

Generalization of Karmarkar's algorithm to convex homogeneous functions. - Bahman Kalantari (Oper. Res. Lett., 1992)

Diagonal Matrix Scaling and Linear Programming. - Leonid Khachiyan; Bahman Kalantari (SIAM J. Optim., 1992)

A Generalized Hypergreedy Algorithm for Weighted Perfect Matching. - Celina Imielinska; Bahman Kalantari (BIT, 1993)

A greedy heuristic for a minimum-weight forest problem. - Celina Imielinska; Bahman Kalantari; Leonid Khachiyan (Oper. Res. Lett., 1993)

On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms. - Bahman Kalantari; Leonid Khachiyan (Oper. Res. Lett., 1993)

Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP. - Bahman Kalantari; Gholamreza B. Khosrovshahi (Networks, 1996)

A General Class of Heuristics for Minimum Weight Perfect Matching and Fast Special Cases with Doubly and Triply Logarithmic Errors. - Celina Imielinska; Bahman Kalantari (Algorithmica, 1997)

On the Complexity of Matrix Balancing. - Bahman Kalantari; Leonid Khachiyan; Ali Shokoufandeh (SIAM J. Matrix Anal. Appl., 1997)

On homogeneous linear recurrence relations and approximation of zeros of complex polynomials. - Bahman Kalantari (Unusual Applications of Number Theory, 2000)

New formulas for approximation of π and other transcendental numbers. - Bahman Kalantari (Numer. Algorithms, 2000)

Animation of mathematical concepts using polynomiography. - Bahman Kalantari; Iraj Kalantari; Fedor Andreev (SIGGRAPH Educators Program, 2004)

Polynomiography and applications in art, education, and science. - Bahman Kalantari (Comput. Graph., 2004)

Symmetric functions and root-finding algorithms. - Yi Jin; Bahman Kalantari (Adv. Appl. Math., 2005)

An infinite family of bounds on zeros of analytic functions and relationship to Smale's bound. - Bahman Kalantari (Math. Comput., 2005)

Corrigendum to "An infinite family of bounds on zeros of analytic functions and relationship to Smale's bound". - Bahman Kalantari (Math. Comput., 2005)

On the complexity of general matrix scaling and entropy minimization via the RAS algorithm. - Bahman Kalantari; Isabella Lari; Federica Ricca; Bruno Simeone (Math. Program., 2008)

Voronoi Diagrams and Polynomial Root-Finding. - Bahman Kalantari (ISVD, 2009)

Maximal Zone Diagrams and their Computation. - Sergio Coutinho de Biasi; Bahman Kalantari; Iraj Kalantari (ISVD, 2010)

Alternating Sign Matrices and Polynomiography. - Bahman Kalantari (Electron. J. Comb., 2011)

Polynomial Root-Finding Methods Whose Basins of Attraction Approximate Voronoi Diagram. - Bahman Kalantari (Discret. Comput. Geom., 2011)

A Geometric Modulus Principle for Polynomials. - Bahman Kalantari (Am. Math. Mon., 2011)

Mollified Zone Diagrams and Their Computation. - Sergio Coutinho de Biasi; Bahman Kalantari; Iraj Kalantari (Trans. Comput. Sci., 2011)

Finding a Lost Treasure in Convex Hull of Points From Known Distances. - Bahman Kalantari (CCCG, 2012)

Voronoi Diagram Properties in Polynomials with Polynomiography Applications and Extensions. - Bahman Kalantari (ISVD, 2012)

Solving Linear System of Equations Via A Convex Hull Algorithm - Bahman Kalantari (CoRR, 2012)

Algorithms for quaternion polynomial root-finding. - Bahman Kalantari (J. Complex., 2013)

On Properties of Forbidden Zones of Polygons and Polytopes. - Ross Berkowitz; Bahman Kalantari; Iraj Kalantari; David Menendez (Trans. Comput. Sci., 2013)

The State of the Art of Voronoi Diagram Research. - Bahman Kalantari (Trans. Comput. Sci., 2013)

Fast Approximation and Randomized Algorithms for Diameter. - Sharareh Alipour; Bahman Kalantari; Hamid Homapour (CoRR, 2014)

Algorithms and Polynomiography for Solving Quaternion Quadratic Equations. - Fedor Andreev; Bahman Kalantari (CoRR, 2014)

Solving Cubic Equations By the Quadratic Formula. - Bahman Kalantari (CoRR, 2014)

A One-Line Proof of the Fundamental Theorem of Algebra with Newton's Method as a Consequence. - Bahman Kalantari (CoRR, 2014)

Randomized Triangle Algorithms for Convex Hull Membership. - Bahman Kalantari (CoRR, 2014)

Newton-Ellipsoid Method and its Polynomiography. - Bahman Kalantari; Eric Lee (CoRR, 2014)

A characterization theorem and an algorithm for a convex hull problem. - Bahman Kalantari (Ann. Oper. Res., 2015)

How Many Real Attractive Fixed Points Can A Polynomial Have? - Terence Coelho; Bahman Kalantari (CoRR, 2016)

A Comparison of the Triangle Algorithm and SMO for Solving the Hard Margin Problem. - Mayank Gupta; Bahman Kalantari (CoRR, 2016)

A Necessary and Sufficient Condition for Local Maxima of Polynomial Modulus Over Unit Disc. - Bahman Kalantari (CoRR, 2016)

An Invitation to Polynomiography via Exponential Series. - Bahman Kalantari (CoRR, 2017)

The Multilinear Minimax Relaxation of Bimatrix Games and Comparison with Nash Equilibria via Lemke-Howson. - Bahman Kalantari; Chun Lau (CoRR, 2018)

An O(1/ε)-Iteration Triangle Algorithm for A Convex Hull Membership. - Bahman Kalantari (CoRR, 2018)

A Triangle Algorithm for Semidefinite Version of Convex Hull Membership Problem. - Bahman Kalantari (CoRR, 2019)

On the Equivalence of SDP Feasibility and a Convex Hull Relaxation for System of Quadratic Equations. - Bahman Kalantari (CoRR, 2019)

An algorithmic separating hyperplane theorem and its applications. - Bahman Kalantari (Discret. Appl. Math., 2019)

Robust vertex enumeration for convex hulls in high dimensions. - Pranjal Awasthi; Bahman Kalantari; Yikai Zhang 003 (Ann. Oper. Res., 2020)

A Globally Convergent Newton Method for Polynomials. - Bahman Kalantari (CoRR, 2020)

A Geometric Algorithm for Solving Linear Systems. - Bahman Kalantari; Chun Lau; Yikai Zhang 003 (CoRR, 2020)

Characterization of local optima of polynomial modulus over a disc. - Bahman Kalantari; Fedor Andreev; Chun Lau (Numer. Algorithms, 2022)

Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries. - Bahman Kalantari; Yikai Zhang 003 (ACM Trans. Math. Softw., 2022)

Solution of Real Cubic Equations without Cardano's Formula. - Bahman Kalantari (CoRR, 2023)

A Family of Iteration Functions for General Linear Systems. - Bahman Kalantari (CoRR, 2023)

On the Performance of a Novel Class of Linear System Solvers and Comparison with State-of-The-Art Algorithms. - Chun Lau; Bahman Kalantari (CoRR, 2023)