Gábor Pataki

1.3k total citations
19 papers, 515 citations indexed

About

Gábor Pataki is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Artificial Intelligence. According to data from OpenAlex, Gábor Pataki has authored 19 papers receiving a total of 515 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Computational Theory and Mathematics, 9 papers in Numerical Analysis and 5 papers in Artificial Intelligence. Recurrent topics in Gábor Pataki's work include Advanced Optimization Algorithms Research (9 papers), Complexity and Algorithms in Graphs (6 papers) and Optimization and Variational Analysis (5 papers). Gábor Pataki is often cited by papers focused on Advanced Optimization Algorithms Research (9 papers), Complexity and Algorithms in Graphs (6 papers) and Optimization and Variational Analysis (5 papers). Gábor Pataki collaborates with scholars based in United States and Canada. Gábor Pataki's co-authors include Levent Tunçel, Elizabeth Bullitt, J. S. Marron, Burcu Aydın, Haonan Wang, Milind Dawande, Egon Balas, François Margot, Sebastián Ceria and Henry Wolkowicz and has published in prestigious journals such as Operations Research, Journal of Mathematical Analysis and Applications and Mathematical Programming.

In The Last Decade

Gábor Pataki

18 papers receiving 459 citations

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author						Papers	Cites
Gábor Pataki	232	216	151	68	62	19	515
Tao Pham Dinh	212 0.9×	177 0.8×	185 1.2×	26 0.4×	41 0.7×	26	451
L. G. Casado	155 0.7×	238 1.1×	24 0.2×	115 1.7×	54 0.9×	60	511
Masakazu Muramatsu	455 2.0×	409 1.9×	161 1.1×	10 0.1×	68 1.1×	36	694
Takahito Kuno	529 2.3×	479 2.2×	64 0.4×	118 1.7×	50 0.8×	48	791
Soon‐Yi Wu	458 2.0×	608 2.8×	183 1.2×	15 0.2×	33 0.5×	69	847
Amitabh Basu	43 0.2×	100 0.5×	23 0.2×	61 0.9×	61 1.0×	45	332
Lyle Ramshaw	37 0.2×	113 0.5×	233 1.5×	36 0.5×	11 0.2×	12	548
Julien Ugon	93 0.4×	93 0.4×	62 0.4×	12 0.2×	77 1.2×	59	567
Mikhail Posypkin	82 0.4×	114 0.5×	27 0.2×	87 1.3×	23 0.4×	72	357
Evanthia Papadopoulou	42 0.2×	84 0.4×	44 0.3×	51 0.8×	93 1.5×	50	461

Countries citing papers authored by Gábor Pataki

Since Specialization

Citations

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

Fields of papers citing papers by Gábor Pataki

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Gábor Pataki

This figure shows the co-authorship network connecting the top 25 collaborators of Gábor Pataki. A scholar is included among the top collaborators of Gábor Pataki 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 Gábor Pataki. Gábor Pataki 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:

19 of 19 papers shown

Pataki, Gábor, et al.. (2024). How Do Exponential Size Solutions Arise in Semidefinite Programming?. SIAM Journal on Optimization. 34(1). 977–1005. 1 indexed citations

Pataki, Gábor, et al.. (2022). An Echelon Form of Weakly Infeasible Semidefinite Programs and Bad Projections of the psd Cone. Foundations of Computational Mathematics. 24(2). 347–384.

Pataki, Gábor, et al.. (2019). Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs. Mathematical Programming Computation. 11(3). 503–586. 11 indexed citations

Pataki, Gábor, et al.. (2017). Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming. Mathematical Programming. 167(2). 435–480. 13 indexed citations

Pataki, Gábor, et al.. (2015). Exact Duality in Semidefinite Programming Based on Elementary Reformulations. SIAM Journal on Optimization. 25(3). 1441–1454. 9 indexed citations

Drusvyatskiy, Dmitriy, Gábor Pataki, & Henry Wolkowicz. (2015). Coordinate Shadows of Semidefinite and Euclidean Distance Matrices. SIAM Journal on Optimization. 25(2). 1160–1178. 15 indexed citations

Pataki, Gábor. (2012). On the connection of facially exposed and nice cones. Journal of Mathematical Analysis and Applications. 400(1). 211–221. 18 indexed citations

Aydın, Burcu, et al.. (2012). New Approaches to Principal Component Analysis for Trees. Statistics in Biosciences. 4(1). 132–156. 1 indexed citations

Aydın, Burcu, Gábor Pataki, Haonan Wang, et al.. (2011). Visualizing the structure of large trees. Electronic Journal of Statistics. 5(none). 11 indexed citations

10.

Krishnamoorthy, Bala & Gábor Pataki. (2009). Column basis reduction and decomposable knapsack problems. Discrete Optimization. 6(3). 242–270. 8 indexed citations

11.

Aydın, Burcu, Gábor Pataki, Haonan Wang, Elizabeth Bullitt, & J. S. Marron. (2009). A principal component analysis for trees. The Annals of Applied Statistics. 3(4). 37 indexed citations

12.

Pataki, Gábor. (2007). On the Closedness of the Linear Image of a Closed Convex Cone. Mathematics of Operations Research. 32(2). 395–412. 32 indexed citations

13.

Gavirneni, Srinagesh, et al.. (2004). Schlumberger Optimizes Receiver Location for Automated Meter Reading. INFORMS Journal on Applied Analytics. 34(3). 208–214. 7 indexed citations

14.

Pataki, Gábor, Alexander Tropsha, J. Scott Provan, Jeffrey Roach, & Bala Krishnamoorthy. (2004). Pre-conditioning integer programs using column basis reduction and geometry and topology of protein structure. 1 indexed citations

15.

Pataki, Gábor. (2003). Teaching Integer Programming Formulations Using the Traveling Salesman Problem. SIAM Review. 45(1). 116–123. 63 indexed citations

16.

Pataki, Gábor & Levent Tunçel. (2001). On the generic properties of convex optimization problems in conic form. Mathematical Programming. 89(3). 449–457. 27 indexed citations

17.

Balas, Egon, Sebastián Ceria, Milind Dawande, François Margot, & Gábor Pataki. (2001). Octane: A New Heuristic for Pure 0–1 Programs. Operations Research. 49(2). 207–225. 40 indexed citations

18.

Pataki, Gábor. (1998). On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues. Mathematics of Operations Research. 23(2). 339–358. 220 indexed citations

19.

Pataki, Gábor. (1960). THE TIME DEPENDENCE OF IRREVERSIBLE PROCESSES IN KNUDSEN GAS. Acta Physica Academiae Scientiarum Hungaricae. 1 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