C. K. Mesztenyi
- Computational Theory and Mathematics top 5%
- Computational Mechanics top 10%
- Electrical and Electronic Engineering
- Numerical Analysis top 10%
- Signal Processing top 10%
- Co-authors
- Werner C. RheinboldtChristoph WitzgallJohn HartJohn R. RiceE. W. CheneyC. L. LawsonHans J. MaehlyIvo Babuška
- Topics
- Graph Theory and Algorithms (3 papers)Model-Driven Software Engineering Techniques (2 papers)Manufacturing Process and Optimization (1 paper)
- Cited by
- Computer Graphics and Computer-Aided DesignNumerical AnalysisComputational Theory and Mathematics
- Journals
- Communications of the ACMMathematics of ComputationACM Transactions on Mathematical Software
- Partner nations
- United States
In The Last Decade
C. K. Mesztenyi
12 papers receiving 294 citations
Peers
Comparison fields: 5 of 72
- Computational Theory and Mathematics 114
- Computational Mechanics 101
- Electrical and Electronic Engineering 60
- Numerical Analysis 52
- Signal Processing 44
Countries citing papers authored by C. K. Mesztenyi
This map shows the geographic impact of C. K. Mesztenyi'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 C. K. Mesztenyi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites C. K. Mesztenyi more than expected).
Fields of papers citing papers by C. K. Mesztenyi
This network shows the impact of papers produced by C. K. Mesztenyi. 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 C. K. Mesztenyi. The network helps show where C. K. Mesztenyi may publish in the future.
Co-authorship network of co-authors of C. K. Mesztenyi
This figure shows the co-authorship network connecting the top 25 collaborators of C. K. Mesztenyi. A scholar is included among the top collaborators of C. K. Mesztenyi 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 C. K. Mesztenyi. C. K. Mesztenyi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | FEARS User's Manual for UNIVAC 1100. | 5 |
| 2 | 91 | |
| 3 | 2 | |
| 4 | Self-adaptive refinements in the finite element method | 11 |
| 5 | 4 | |
| 6 | 12 | |
| 7 | FGRAAL: Technical documentation | 2 |
| 8 | FGRAAL: FORTRAN extended graph algorithmic language | 5 |
| 9 | FORMAL - A formula manipulation language | 1 |
| 10 | 2 | |
| 11 | 209 | |
| 12 | 14 |
About C. K. Mesztenyi
C. K. Mesztenyi is a scholar working on Software, Computational Theory and Mathematics and Hardware and Architecture, having authored 12 papers that have together received 358 indexed citations. Recurring topics across this work include Graph Theory and Algorithms (3 papers), Model-Driven Software Engineering Techniques (2 papers) and Manufacturing Process and Optimization (1 paper). The work is most often cited by research in Computer Graphics and Computer-Aided Design (37 citations), Numerical Analysis (52 citations) and Computational Theory and Mathematics (114 citations). C. K. Mesztenyi has collaborated with scholars based in United States. Frequent co-authors include Werner C. Rheinboldt, Christoph Witzgall, John Hart, John R. Rice, E. W. Cheney, C. L. Lawson, Hans J. Maehly, Ivo Babuška, Victor R. Basili and James S. Vandergraft. Their work appears in journals such as Communications of the ACM, Mathematics of Computation and ACM Transactions on Mathematical Software.
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.