• Kissi M, Pont M, Levine J and Tierny J. (2024). A Practical Solver for Scalar Data Topological Simplification. IEEE Transactions on Visualization and Computer Graphics. 31:1. (97-107). Online publication date: 1-Jan-2025.

    https://doi.org/10.1109/TVCG.2024.3456345

  • Le Guillou E, Will M, Guillou P, Lukasczyk J, Fortin P, Garth C and Tierny J. (2024). TTK is Getting MPI-Ready. IEEE Transactions on Visualization and Computer Graphics. 30:8. (5875-5892). Online publication date: 1-Aug-2024.

    https://doi.org/10.1109/TVCG.2024.3390219

  • Guillou P, Vidal J and Tierny J. (2024). Discrete Morse Sandwich: Fast Computation of Persistence Diagrams for Scalar Data – An Algorithm and a Benchmark. IEEE Transactions on Visualization and Computer Graphics. 30:4. (1897-1915). Online publication date: 1-Apr-2024.

    https://doi.org/10.1109/TVCG.2023.3238008

  • Dixon P, Pavan A, Woude J and Vinodchandran N. Pseudodeterminism: promises and lowerbounds. Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. (1552-1565).

    https://doi.org/10.1145/3519935.3520043

  • Huchette J and Vielma J. (2019). A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints. Mathematics of Operations Research. 44:3. (793-820). Online publication date: 1-Aug-2019.

    https://doi.org/10.1287/moor.2018.0946

  • Singh K, Shen Q and Yong S. Mesh-Based Affine Abstraction of Nonlinear Systems with Tighter Bounds. 2018 IEEE Conference on Decision and Control (CDC). (3056-3061).

    https://doi.org/10.1109/CDC.2018.8618714

  • Hošek R. (2018). Construction and Shape Optimization of Simplicial Meshes in d-Dimensional Space. Discrete & Computational Geometry. 59:4. (972-989). Online publication date: 1-Jun-2018.

    https://doi.org/10.1007/s00454-017-9963-y

  • López-Rubio E and Muñoz-Pérez J. (2015). Probability density function estimation with the frequency polygon transform. Information Sciences: an International Journal. 298:C. (136-158). Online publication date: 20-Mar-2015.

    https://doi.org/10.1016/j.ins.2014.12.014

  • Baek J, Adams A and Dolson J. (2013). Lattice-Based High-Dimensional Gaussian Filtering and the Permutohedral Lattice. Journal of Mathematical Imaging and Vision. 46:2. (211-237). Online publication date: 1-Jun-2013.

    https://doi.org/10.1007/s10851-012-0379-2

  • Harrison J. (2013). The HOL Light Theory of Euclidean Space. Journal of Automated Reasoning. 50:2. (173-190). Online publication date: 1-Feb-2013.

    https://doi.org/10.1007/s10817-012-9250-9

  • Deng X, Qi Q and Saberi A. (2012). Algorithmic Solutions for Envy-Free Cake Cutting. Operations Research. 60:6. (1461-1476). Online publication date: 1-Nov-2012.

    /doi/10.5555/2448473.2448478

  • Edelsbrunner H and Kerber M. (2012). Dual Complexes of Cubical Subdivisions of źn. Discrete & Computational Geometry. 47:2. (393-414). Online publication date: 1-Mar-2012.

    /doi/10.5555/3115956.3116024

  • Deng X, Qi Q, Saberi A and Zhang J. (2011). Discrete Fixed Points. Mathematics of Operations Research. 36:4. (636-652). Online publication date: 1-Nov-2011.

    https://doi.org/10.1287/moor.1110.0511

  • Edelsbrunner H and Kerber M. Covering and packing with spheres by diagonal distortion in Rn. Rainbow of computer science. (20-35).

    /doi/10.5555/2001113.2001116

  • Poggi T, Comaschi F and Storace M. (2010). Digital circuit realization of piecewise-affine functions with nonuniform resolution. IEEE Transactions on Circuits and Systems II: Express Briefs. 57:2. (131-135). Online publication date: 1-Feb-2010.

    https://doi.org/10.1109/TCSII.2010.2040316

  • Deng X, Qi Q and Zhang J. Direction Preserving Zero Point Computing and Applications. Proceedings of the 5th International Workshop on Internet and Network Economics. (410-421).

    https://doi.org/10.1007/978-3-642-10841-9_37

  • Weiss K and De Floriani L. Diamond hierarchies of arbitrary dimension. Proceedings of the Symposium on Geometry Processing. (1289-1300).

    /doi/10.5555/1735603.1735609

  • Karátson J, Korotov S and Kříek M. (2007). On discrete maximum principles for nonlinear elliptic problems. Mathematics and Computers in Simulation. 76:1-3. (99-108). Online publication date: 1-Oct-2007.

    https://doi.org/10.1016/j.matcom.2007.01.011

  • Harrison J. A HOL theory of euclidean space. Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics. (114-129).

    https://doi.org/10.1007/11541868_8

  • Brandts J, Korotov S and Křížek M. The strengthened cauchy-Bunyakowski-Schwarz inequality for n-simplicial linear finite elements. Proceedings of the Third international conference on Numerical Analysis and its Applications. (203-210).

    https://doi.org/10.1007/978-3-540-31852-1_23

  • Min C. (2003). Simplicial isosurfacing in arbitrary dimension and codimension. Journal of Computational Physics. 190:1. (295-310). Online publication date: 1-Sep-2003.

    https://doi.org/10.1016/S0021-9991(03)00275-4

  • Garcke J and Griebel M. (2002). Classification with sparse grids using simplicial basis functions. Intelligent Data Analysis. 6:6. (483-502). Online publication date: 1-Dec-2002.

    /doi/10.5555/1293927.1293928

  • Garcke J and Griebel M. Data mining with sparse grids using simplicial basis functions. Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining. (87-96).

    https://doi.org/10.1145/502512.502528

  • Suter E. A strategy for the construction of piecewise linear prewavelets over Type-1 triangulations in any space dimension. Mathematical Methods for Curves and Surfaces. (477-486).

    /doi/10.5555/570828.570868

  • Edelsbrunner H and Grayson D. (2000). Edgewise Subdivision of a Simplex. Discrete & Computational Geometry. 24:4. (707-719). Online publication date: 1-Dec-2000.

    https://doi.org/10.1007/s4540010063

  • Edelsbrunner H and Grayson D. Edgewise subdivision of a simplex. Proceedings of the fifteenth annual symposium on Computational geometry. (24-30).

    https://doi.org/10.1145/304893.304897

  • Ong M. (1994). Uniform Refinement of a Tetrahedron. SIAM Journal on Scientific Computing. 15:5. (1134-1144). Online publication date: 1-Sep-1994.

    https://doi.org/10.1137/0915070

  • Freund R. (1986). Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube. Mathematics of Operations Research. 11:1. (169-179). Online publication date: 1-Feb-1986.

    /doi/10.5555/2839357.2839373

  • (1984). Variable Dimension Complexes Part II. Mathematics of Operations Research. 9:4. (498-509). Online publication date: 1-Nov-1984.

    https://doi.org/10.1287/moor.9.4.498

  • (1984). Variable Dimension Complexes Part I. Mathematics of Operations Research. 9:4. (479-497). Online publication date: 1-Nov-1984.

    https://doi.org/10.1287/moor.9.4.479

  • Dahmen W and Micchelli C. (1982). On the Linear Independence of Multivariate B-Splines, I. Triangulations of Simploids. SIAM Journal on Numerical Analysis. 19:5. (993-1012). Online publication date: 1-Oct-1982.

    https://doi.org/10.1137/0719072

  • van der Laan G and Talman A. (1982). On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games. Mathematics of Operations Research. 7:1. (1-13). Online publication date: 1-Feb-1982.

    https://doi.org/10.1287/moor.7.1.1

  • Reiser P. (1981). A Modified Integer Labeling for Complementarity Algorithms. Mathematics of Operations Research. 6:1. (129-139). Online publication date: 1-Feb-1981.

    /doi/10.5555/2781650.2781662

  • Laan G and Talman A. (1980). A new subdivision for computing fixed points with a homotopy algorithm. Mathematical Programming: Series A and B. 19:1. (78-91). Online publication date: 1-Dec-1980.

    https://doi.org/10.1007/BF01581629

  • Allgower E and Georg K. (2006). Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations. SIAM Review. 22:1. (28-85). Online publication date: 1-Jan-1980.

    https://doi.org/10.1137/1022003

  • Kojima M. (1979). A Complementary Pivoting Approach to Parametric Nonlinear Programming. Mathematics of Operations Research. 4:4. (464-477). Online publication date: 1-Nov-1979.

    https://doi.org/10.1287/moor.4.4.464

  • (1978). Studies on Piecewise-Linear Approximations of Piecewise-C1 Mappings in Fixed Points and Complementarity Theory. Mathematics of Operations Research. 3:1. (17-36). Online publication date: 1-Feb-1978.

    https://doi.org/10.1287/moor.3.1.17

  • Fisher M and Tolle J. (1977). The Nonlinear Complementarity Problem. SIAM Journal on Control and Optimization. 15:4. (612-624). Online publication date: 1-Jul-1977.

    https://doi.org/10.1137/0315039

  • (1977). On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting. Mathematics of Operations Research. 2:2. (108-124). Online publication date: 1-May-1977.

    https://doi.org/10.1287/moor.2.2.108

  • Kojima M, Nishino H and Sekine T. (1976). An Extension of Lemke’s Method to the Piecewise Linear Complementarity Problem. SIAM Journal on Applied Mathematics. 31:4. (600-613). Online publication date: 1-Dec-1976.

    https://doi.org/10.1137/0131053

  • Todd M. (1976). On triangulations for computing fixed points. Mathematical Programming: Series A and B. 10:1. (322-346). Online publication date: 1-Dec-1976.

    https://doi.org/10.1007/BF01580679

  • Fisher M and Gould F. (1974). A simplicial algorithm for the nonlinear complementarity problem. Mathematical Programming: Series A and B. 6:1. (281-300). Online publication date: 1-Dec-1974.

    https://doi.org/10.1007/BF01580246

  • Eaves B and Saigal R. (1972). Homotopies for computation of fixed points on unbounded regions. Mathematical Programming: Series A and B. 3:1. (225-237). Online publication date: 1-Dec-1972.

    https://doi.org/10.1007/BF01584991

  • Eaves B. (1972). Homotopies for computation of fixed points. Mathematical Programming: Series A and B. 3:1. (1-22). Online publication date: 1-Dec-1972.

    https://doi.org/10.1007/BF01584975

  • Eaves B. (1971). Computing Kakutani Fixed Points. SIAM Journal on Applied Mathematics. 21:2. (236-244). Online publication date: 1-Sep-1971.

    https://doi.org/10.1137/0121027