Stefan Ratschan

995 total citations
29 papers, 377 citations indexed

About

Stefan Ratschan is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Stefan Ratschan has authored 29 papers receiving a total of 377 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Computational Theory and Mathematics, 8 papers in Artificial Intelligence and 7 papers in Computer Networks and Communications. Recurrent topics in Stefan Ratschan's work include Formal Methods in Verification (16 papers), Numerical Methods and Algorithms (9 papers) and Constraint Satisfaction and Optimization (7 papers). Stefan Ratschan is often cited by papers focused on Formal Methods in Verification (16 papers), Numerical Methods and Algorithms (9 papers) and Constraint Satisfaction and Optimization (7 papers). Stefan Ratschan collaborates with scholars based in Czechia, Germany and Austria. Stefan Ratschan's co-authors include Zhikun She, Tino Teige, Christian Herde, Martin Fränzle, Tobias Schubert, Laurent Hardouin, Luc Jaulin, Piotr Zgliczyński, Ernst Moritz Hahn and Josep Vehı́ and has published in prestigious journals such as SIAM Journal on Control and Optimization, Journal of Pediatric Surgery and Lecture notes in computer science.

In The Last Decade

Stefan Ratschan

24 papers receiving 351 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Stefan Ratschan Czechia	9	269	121	106	89	48	29	377
Naijun Zhan China	12	256 1.0×	136 1.1×	143 1.3×	99 1.1×	80 1.7×	75	450
Colas Le Guernic France	7	174 0.6×	133 1.1×	63 0.6×	74 0.8×	36 0.8×	8	332
Jürgen Wolff von Gudenberg Germany	9	101 0.4×	30 0.2×	103 1.0×	87 1.0×	27 0.6×	40	306
Christian Herde Germany	7	251 0.9×	32 0.3×	107 1.0×	122 1.4×	125 2.6×	13	327
Olivier Bournez France	11	260 1.0×	85 0.7×	102 1.0×	22 0.2×	26 0.5×	39	390
Henny B. Sipma United States	13	402 1.5×	33 0.3×	289 2.7×	194 2.2×	104 2.2×	25	513
Abolfazl Lavaei United Kingdom	11	183 0.7×	180 1.5×	81 0.8×	56 0.6×	26 0.5×	55	352
Djamila Sam-Haroud Switzerland	11	113 0.4×	43 0.4×	103 1.0×	16 0.2×	14 0.3×	29	361
Jan Komenda Czechia	13	469 1.7×	79 0.7×	51 0.5×	16 0.2×	93 1.9×	86	542
William J. Older Canada	8	119 0.4×	22 0.2×	128 1.2×	32 0.4×	40 0.8×	11	289

Countries citing papers authored by Stefan Ratschan

Since Specialization

Citations

This map shows the geographic impact of Stefan Ratschan's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Stefan Ratschan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stefan Ratschan more than expected).

Fields of papers citing papers by Stefan Ratschan

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Stefan Ratschan. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Stefan Ratschan. The network helps show where Stefan Ratschan may publish in the future.

Co-authorship network of co-authors of Stefan Ratschan

This figure shows the co-authorship network connecting the top 25 collaborators of Stefan Ratschan. A scholar is included among the top collaborators of Stefan Ratschan based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Stefan Ratschan. Stefan Ratschan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Lipparini, E. & Stefan Ratschan. (2025). Satisfiability of Non-linear Transcendental Arithmetic as a Certificate Search Problem. Journal of Automated Reasoning. 69(1).

Ratschan, Stefan, et al.. (2024). Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic. 47–58.

Ratschan, Stefan, et al.. (2022). Computing Funnels Using Numerical Optimization Based Falsifiers. 2022 International Conference on Robotics and Automation (ICRA). 4318–4324. 1 indexed citations

Ratschan, Stefan, et al.. (2015). Quasi-decidability of a Fragment of the First-Order Theory of Real Numbers. Journal of Automated Reasoning. 57(2). 157–185. 5 indexed citations

Hladík, Milan & Stefan Ratschan. (2014). Efficient Solution of a Class of Quantified Constraints with Quantifier Prefix Exists-Forall. Mathematics in Computer Science. 8(3-4). 329–340.

Ratschan, Stefan. (2013). Safety verification of non-linear hybrid systems is quasi-decidable. Formal Methods in System Design. 44(1). 71–90. 6 indexed citations

Ratschan, Stefan & Zhikun She. (2010). Providing a Basin of Attraction to a Target Region of Polynomial Systems by Computation of Lyapunov-Like Functions. SIAM Journal on Control and Optimization. 48(7). 4377–4394. 74 indexed citations

Ratschan, Stefan, et al.. (2009). How to Capture Hybrid Systems Evolution Into Slices of Parallel Hyperplanes. IFAC Proceedings Volumes. 42(17). 274–279. 1 indexed citations

Fränzle, Martin, Christian Herde, Tino Teige, Stefan Ratschan, & Tobias Schubert. (2007). Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure1. 1(3-4). 209–236. 143 indexed citations

10.

Ratschan, Stefan, et al.. (2007). Estimating the region of attraction of ordinary differential equations by quantified constraint solving. Journal of Pediatric Surgery. 35(7). 241–246. 8 indexed citations

11.

She, Zhikun & Stefan Ratschan. (2006). Providing a Basin of Attraction to a Target Region by Computation of Lyapunov-like Functions. Max Planck Institute for Plasma Physics. 245–249. 7 indexed citations

12.

Ratschan, Stefan. (2006). Efficient solving of quantified inequality constraints over the real numbers. ACM Transactions on Computational Logic. 7(4). 723–748. 2 indexed citations

13.

Ratschan, Stefan & Zhikun She. (2006). Providing a Basin of Attraction to a Target Region by Computation of Lyapunov-like Functions. 3927. 1–5. 4 indexed citations

14.

Ratschan, Stefan. (2006). Efficient solving of quantified inequality constraints over the real numbers. ACM Transactions on Computational Logic. 7(4). 723–748. 47 indexed citations

15.

Ratschan, Stefan & Zhikun She. (2005). Safety Verification of Hybrid Systems by Constraint Propagation Based Abstraction Refinement. Lecture notes in computer science. 6(1). 573–589. 12 indexed citations

16.

Jaulin, Luc, Stefan Ratschan, & Laurent Hardouin. (2003). Set Computation for Nonlinear Control. Reliable Computing. 10(1). 1–26. 8 indexed citations

17.

Ratschan, Stefan. (2002). Continuous First-Order Constraint Satisfactionwith Equality and Disequality Constraints. 680–685. 2 indexed citations

18.

Ratschan, Stefan. (2002). Continuous First-Order Constraint Satisfaction With Equality And Disequality Constraints. 1 indexed citations

19.

Ratschan, Stefan. (2002). Quantified Constraints Under Perturbation. Journal of Symbolic Computation. 33(4). 493–505. 13 indexed citations

20.

Ratschan, Stefan. (2002). Search Heuristics for Box Decomposition Methods. Journal of Global Optimization. 24(1). 35–49. 7 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact