Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable. - Peter Franek; Stefan Ratschan; Piotr Zgliczynski (MFCS, 2011)

Shapley's Game Value Axiomatic with restricted symmetry - Ales Antonin Kubena; Peter Franek (CoRR, 2012)

Symmetries of Quasi-Values. - Ales Antonin Kubena; Peter Franek (SAGT, 2013)

Cohomotopy groups capture robust properties of zero sets. - Peter Franek; Marek Krcál (CoRR, 2015)

Robust Satisfiability of Systems of Equations. - Peter Franek; Marek Krcál (J. ACM, 2015)

Effective topological degree computation based on interval arithmetic. - Peter Franek; Stefan Ratschan (Math. Comput., 2015)

On Computability and Triviality of Well Groups. - Peter Franek; Marek Krcál (Discret. Comput. Geom., 2016)

Quasi-decidability of a Fragment of the First-Order Theory of Real Numbers. - Peter Franek; Stefan Ratschan; Piotr Zgliczynski (J. Autom. Reason., 2016)

Computing simplicial representatives of homotopy group element. - Marek Filakovský; Peter Franek; Uli Wagner 001; Stephan Zhechev (CoRR, 2017)

Proving the existence of loops in robot trajectories. - Simon Rohou; Peter Franek; Clément Aubry; Luc Jaulin (Int. J. Robotics Res., 2018)

Computing simplicial representatives of homotopy group elements. - Marek Filakovský; Peter Franek; Uli Wagner 001; Stephan Zhechev (J. Appl. Comput. Topol., 2018)

Solving equations and optimization problems with uncertainty. - Peter Franek; Marek Krcál; Hubert Wagner (J. Appl. Comput. Topol., 2018)