Werner Schachinger

436 total citations
25 papers, 265 citations indexed

About

Werner Schachinger is a scholar working on Numerical Analysis, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Werner Schachinger has authored 25 papers receiving a total of 265 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Numerical Analysis, 10 papers in Computational Theory and Mathematics and 7 papers in Artificial Intelligence. Recurrent topics in Werner Schachinger's work include Advanced Optimization Algorithms Research (8 papers), Matrix Theory and Algorithms (5 papers) and graph theory and CDMA systems (4 papers). Werner Schachinger is often cited by papers focused on Advanced Optimization Algorithms Research (8 papers), Matrix Theory and Algorithms (5 papers) and graph theory and CDMA systems (4 papers). Werner Schachinger collaborates with scholars based in Austria, Italy and Israel. Werner Schachinger's co-authors include Immanuel M. Bomze, Florian Jarre, Naomi Shaked-Monderer, Peter Grandits, Bernardetta Addis, Abraham Berman, Fabio Schoen, Paul Tseng, Walter Schachermayer and Rudolf Bauer and has published in prestigious journals such as Mathematical Programming, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Werner Schachinger

24 papers receiving 244 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Werner Schachinger Austria 11 156 126 50 40 36 25 265
Grigori Litvinov Russia 6 231 1.5× 36 0.3× 31 0.6× 10 0.3× 25 0.7× 10 323
José A. Adell Spain 12 44 0.3× 126 1.0× 57 1.1× 8 0.2× 38 1.1× 70 450
Jean-Paul Delahaye France 9 96 0.6× 76 0.6× 64 1.3× 29 0.7× 15 0.4× 34 276
Gottlieb Pirsic Austria 9 28 0.2× 116 0.9× 57 1.1× 22 0.6× 11 0.3× 22 191
Alexander Vladimirov Russia 11 118 0.8× 46 0.4× 13 0.3× 16 0.4× 10 0.3× 26 266
F. Twilt Netherlands 9 255 1.6× 211 1.7× 11 0.2× 10 0.3× 25 0.7× 21 386
Charles Hobby United States 9 100 0.6× 54 0.4× 80 1.6× 54 1.4× 36 1.0× 26 394
John P. May United States 7 183 1.2× 23 0.2× 49 1.0× 12 0.3× 61 1.7× 11 230
Irina Shevtsova Russia 9 22 0.1× 30 0.2× 77 1.5× 22 0.6× 12 0.3× 58 321
Walter Wenzel Germany 11 306 2.0× 25 0.2× 23 0.5× 74 1.9× 18 0.5× 42 430

Countries citing papers authored by Werner Schachinger

Since Specialization
Citations

This map shows the geographic impact of Werner Schachinger'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 Werner Schachinger with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Werner Schachinger more than expected).

Fields of papers citing papers by Werner Schachinger

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Werner Schachinger. 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 Werner Schachinger. The network helps show where Werner Schachinger may publish in the future.

Co-authorship network of co-authors of Werner Schachinger

This figure shows the co-authorship network connecting the top 25 collaborators of Werner Schachinger. A scholar is included among the top collaborators of Werner Schachinger 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 Werner Schachinger. Werner Schachinger is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Schachinger, Werner. (2020). Lower bounds for maximal cp-ranks of completely positive matrices and tensors. Electronic Journal of Linear Algebra. 36(36). 519–541. 2 indexed citations
2.
Bomze, Immanuel M., Werner Schachinger, & Jörgen W. Weibull. (2020). Does moral play equilibrate?. Economic Theory. 71(1). 305–315. 3 indexed citations
3.
Sammer, Gerd, et al.. (2015). An Innovative Integration Methodology of Independent Data Sources to Improve the Quality of Freight Transport Surveys. Transportation research procedia. 11. 515–530. 5 indexed citations
4.
Bomze, Immanuel M., et al.. (2014). From seven to eleven: Completely positive matrices with high cp-rank. Linear Algebra and its Applications. 459. 208–221. 23 indexed citations
5.
Shaked-Monderer, Naomi, Abraham Berman, Immanuel M. Bomze, Florian Jarre, & Werner Schachinger. (2014). New results on the cp-rank and related properties of co(mpletely )positive matrices. Linear and Multilinear Algebra. 63(2). 384–396. 20 indexed citations
6.
Shaked-Monderer, Naomi, Immanuel M. Bomze, Florian Jarre, & Werner Schachinger. (2013). On the cp-Rank and Minimal cp Factorizations of a Completely Positive Matrix. SIAM Journal on Matrix Analysis and Applications. 34(2). 355–368. 24 indexed citations
7.
Schachinger, Werner & Immanuel M. Bomze. (2009). A Conic Duality Frank–Wolfe-Type Theorem via Exact Penalization in Quadratic Optimization. Mathematics of Operations Research. 34(1). 83–91. 7 indexed citations
8.
Addis, Bernardetta & Werner Schachinger. (2009). Improved bounds for interatomic distance in Morse clusters. Operations Research Letters. 37(4). 290–294. 2 indexed citations
9.
Bomze, Immanuel M. & Werner Schachinger. (2009). Multi-Standard Quadratic Optimization: interior point methods and cone programming reformulation. Computational Optimization and Applications. 45(2). 237–256. 12 indexed citations
10.
Addis, Bernardetta & Werner Schachinger. (2008). Morse potential energy minimization: Improved bounds for optimal configurations. Computational Optimization and Applications. 47(1). 129–131. 3 indexed citations
11.
Schachinger, Werner, Bernardetta Addis, Immanuel M. Bomze, & Fabio Schoen. (2007). New results for molecular formation under pairwise potential minimization. Computational Optimization and Applications. 38(3). 329–349. 10 indexed citations
12.
Schachinger, Werner. (2004). Distributional Results for Costs of Partial Match Queries in Asymmetric K-Dimensional Tries. SIAM Journal on Computing. 33(4). 952–983.
13.
Schachinger, Werner. (2004). Concentration of Size and Path Length of Tries. Combinatorics Probability Computing. 13(4-5). 763–793. 3 indexed citations
14.
Schachinger, Werner. (2001). Asymptotic normality of recursive algorithms via martingale difference arrays. Discrete Mathematics & Theoretical Computer Science. Vol. 4 no. 2. 5 indexed citations
15.
Grandits, Peter & Werner Schachinger. (2001). Leland's Approach to Option Pricing: The Evolution of a Discontinuity. Mathematical Finance. 11(3). 347–355. 15 indexed citations
16.
Schachinger, Werner. (2000). Limiting distributions for the costs of partial match retrievals in multidimensional tries. Random Structures and Algorithms. 17(3-4). 428–459. 17 indexed citations
17.
Schachinger, Werner, et al.. (2000). Is There a Predictable Criterion for Mutual Singularity of Two Probability Measures on a Filtered Space?. Theory of Probability and Its Applications. 44(1). 51–59. 3 indexed citations
18.
Schachermayer, Walter & Werner Schachinger. (1999). Is there a predictable criterion for mutual singularity of two probability measures on a filtered space?. Теория вероятностей и ее применения. 44(1). 101–110. 3 indexed citations
19.
Schachinger, Werner. (1995). On the variance of a class of inductive valuations of data structures for digital search. Theoretical Computer Science. 144(1-2). 251–275. 12 indexed citations
20.
Schachinger, Werner. (1995). The variance of a partial match retrieval in a multidimensional symmetric trie. Random Structures and Algorithms. 7(1). 81–95. 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

Rankless by CCL
2026