| Publication | Date of Publication | Type |
|---|
| A Tale on the Optimal Splitting of a Cake Among Seven People with Three Cuts | 2024-10-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6201767 | 2024-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6044644 | 2023-05-22 | Paper |
| On the Performance of a Novel Class of Linear System Solvers and Comparison with State-of-The-Art Algorithms | 2023-04-24 | Paper |
| A Family of Iteration Functions for General Linear Systems | 2023-04-10 | Paper |
| Solution of Real Cubic Equations without Cardano's Formula | 2023-03-30 | Paper |
| Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries | 2023-03-22 | Paper |
| Characterization of local optima of polynomial modulus over a disc | 2022-05-11 | Paper |
| How many real attractive fixed points can a polynomial have? | 2021-11-23 | Paper |
| Robust vertex enumeration for convex hulls in high dimensions | 2021-01-07 | Paper |
| A Geometric Algorithm for Solving Linear Systems | 2020-04-27 | Paper |
| A Globally Convergent Newton Method for Polynomials | 2020-02-29 | Paper |
| Newton–Ellipsoid polynomiography | 2020-01-21 | Paper |
| Collatz polynomials: an introduction with bounds on their zeros | 2019-12-30 | Paper |
| A Spectral Generalization of Von Neumann Minimax Theorem | 2019-05-23 | Paper |
| An algorithmic separating hyperplane theorem and its applications | 2019-02-21 | Paper |
| How Many Real Attractive Fixed Points Can A Polynomial Have? | 2016-05-25 | Paper |
| A characterization theorem and an algorithm for a convex hull problem | 2015-04-23 | Paper |
| THREE CONVEX HULL THEOREMS ON TRIANGLES AND CIRCLES | 2015-03-03 | Paper |
| Algorithms for quaternion polynomial root-finding | 2014-02-03 | Paper |
| Solving Cubic Equations By the Quadratic Formula | 2014-01-20 | Paper |
| The State of the Art of Voronoi Diagram Research | 2013-12-17 | Paper |
| On Properties of Forbidden Zones of Polygons and Polytopes | 2013-12-17 | Paper |
| Polynomiography and Chaos | 2013-12-03 | Paper |
| Solving Linear System of Equations Via A Convex Hull Algorithm | 2012-10-29 | Paper |
| Mollified Zone Diagrams and Their Computation | 2012-03-09 | Paper |
| A Geometric Modulus Principle for Polynomials | 2011-12-28 | Paper |
| Alternating sign matrices and polynomiography | 2011-11-22 | Paper |
| Polynomial root-finding methods whose basins of attraction approximate Voronoi diagram | 2011-06-10 | Paper |
| A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity | 2010-06-08 | Paper |
| Polynomial root-finding and polynomiography | 2008-12-04 | Paper |
| On the complexity of general matrix scaling and entropy minimization via the RAS algorithm | 2008-01-07 | Paper |
| On general convergence in extracting radicals via a fundamental family of iteration functions | 2007-06-29 | Paper |
| A procedure of Chvátal for testing feasibility in linear programming and matrix scaling | 2006-07-20 | Paper |
| Symmetric functions and root-finding algorithms | 2005-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668906 | 2005-04-15 | Paper |
| An infinite family of bounds on zeros of analytic functions and relationship to Smale’s bound | 2005-03-01 | Paper |
| On extraneous fixed-points of the basic family of iteration functions | 2003-12-04 | Paper |
| Semidefinite programming and matrix scaling over the semidefinite cone. | 2003-12-04 | Paper |
| A computational comparison of the first nine members of a determinantal family of root-finding methods | 2003-06-02 | Paper |
| A determinantal lower bound | 2002-02-12 | Paper |
| Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications | 2001-10-25 | Paper |
| Newton's method and generation of a determinantal family of iteration functions | 2001-02-08 | Paper |
| New formulas for approximation of \(\pi\) and other transcendental numbers | 2000-11-22 | Paper |
| On the order of convergence of a determinantal family of root-finding methods | 1999-04-13 | Paper |
| On the Complexity of Matrix Balancing | 1998-02-03 | Paper |
| A basic family of iteration functions for polynomial root finding and its characterizations | 1997-11-10 | Paper |
| Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP | 1997-10-30 | Paper |
| High order iterative methods for approximating square roots | 1997-09-17 | Paper |
| A general class of heuristics for minimum weight perfect matching and fast special cases with doubly and triply logarithmic errors | 1997-07-23 | Paper |
| On linear programming and matrix scaling over the algebraic numbers | 1997-01-01 | Paper |
| On the complexity of nonnegative-matrix scaling | 1996-06-30 | Paper |
| A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices | 1996-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858968 | 1996-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858969 | 1995-12-20 | Paper |
| On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms | 1994-04-06 | Paper |
| A greedy heuristic for a minimum-weight forest problem | 1994-03-24 | Paper |
| A generalized hypergreedy algorithm for weighted perfect matching | 1994-01-31 | Paper |
| Generalization of Karmarkar's algorithm to convex homogeneous functions | 1993-01-16 | Paper |
| Diagonal Matrix Scaling and Linear Programming | 1993-01-13 | Paper |
| Karmarkar's algorithm with improved steps | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5202848 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4729611 | 1989-01-01 | Paper |
| Approximating the diameter of a set of points in the Euclidean space | 1989-01-01 | Paper |
| A new class of heuristic algorithms for weighted perfect matching | 1988-01-01 | Paper |
| Penalty formulation for zero-one nonlinear programming | 1987-01-01 | Paper |
| An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions | 1987-01-01 | Paper |
| Construction of large-scale global minimum concave quadratic test problems | 1986-01-01 | Paper |
| A lower bound to the complexity of Euclidean and rectilinear matching algorithms | 1986-01-01 | Paper |
| Quadratic functions with exponential number of local maxima | 1986-01-01 | Paper |
| An algorithm for the traveling salesman problem with pickup and delivery customers | 1985-01-01 | Paper |
| Technical Note—Construction of Difficult Linearly Constrained Concave Minimization Problems | 1985-01-01 | Paper |
| Penalty for zero–one integer equivalent problem | 1982-01-01 | Paper |
| Algorithms and Polynomiography for Solving Quaternion Quadratic Equations | N/A | Paper |
| A One-Line Proof of the Fundamental Theorem of Algebra with Newton's Method as a Consequence | N/A | Paper |
| Newton-Ellipsoid Method and its Polynomiography | N/A | Paper |
| A Necessary and Sufficient Condition for Local Maxima of Polynomial Modulus Over Unit Disc | N/A | Paper |
