Levent Tunçel

1.6k total citations
75 papers, 859 citations indexed

About

Levent Tunçel is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Computational Mechanics. According to data from OpenAlex, Levent Tunçel has authored 75 papers receiving a total of 859 indexed citations (citations by other indexed papers that have themselves been cited), including 61 papers in Computational Theory and Mathematics, 47 papers in Numerical Analysis and 14 papers in Computational Mechanics. Recurrent topics in Levent Tunçel's work include Advanced Optimization Algorithms Research (47 papers), Complexity and Algorithms in Graphs (25 papers) and Optimization and Variational Analysis (20 papers). Levent Tunçel is often cited by papers focused on Advanced Optimization Algorithms Research (47 papers), Complexity and Algorithms in Graphs (25 papers) and Optimization and Variational Analysis (20 papers). Levent Tunçel collaborates with scholars based in Canada, United States and China. Levent Tunçel's co-authors include Henry Wolkowicz, Masakazu Kojima, Motakuri V. Ramana, Naihua Xiu, Lingchen Kong, Michael J. Todd, Michel X. Goemans, Romy Shioda, Osman Güler and Bertrand Guenin and has published in prestigious journals such as European Journal of Operational Research, Mathematics of Computation and Mathematical Programming.

In The Last Decade

Levent Tunçel

71 papers receiving 770 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Levent Tunçel Canada	18	603	525	159	111	91	75	859
Akiko Yoshise Japan	13	932 1.5×	995 1.9×	149 0.9×	157 1.4×	57 0.6×	32	1.2k
Bahman Kalantari United States	19	437 0.7×	583 1.1×	173 1.1×	45 0.4×	66 0.7×	74	982
Clóvis C. Gonzaga Brazil	17	688 1.1×	795 1.5×	213 1.3×	193 1.7×	85 0.9×	43	993
Santosh N. Kabadi Canada	10	427 0.7×	296 0.6×	97 0.6×	142 1.3×	103 1.1×	20	851
Masakazu Muramatsu Japan	11	409 0.7×	455 0.9×	161 1.0×	156 1.4×	51 0.6×	36	694
C. Yalçın Kaya Australia	19	350 0.6×	304 0.6×	134 0.8×	533 4.8×	75 0.8×	51	1.0k
Simone Sagratella Italy	14	312 0.5×	202 0.4×	101 0.6×	58 0.5×	93 1.0×	35	646
H. Ratschek Germany	13	530 0.9×	227 0.4×	84 0.5×	134 1.2×	93 1.0×	42	783
Dmitrii V. Ṗasechnik Netherlands	14	448 0.7×	246 0.5×	66 0.4×	41 0.4×	161 1.8×	66	777
R. Hettich Germany	11	702 1.2×	646 1.2×	171 1.1×	361 3.3×	73 0.8×	23	1.1k

Countries citing papers authored by Levent Tunçel

Since Specialization

Citations

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

Fields of papers citing papers by Levent Tunçel

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Levent Tunçel

This figure shows the co-authorship network connecting the top 25 collaborators of Levent Tunçel. A scholar is included among the top collaborators of Levent Tunçel 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 Levent Tunçel. Levent Tunçel 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

Karimi, Mehdi & Levent Tunçel. (2024). Efficient Implementation of Interior-Point Methods for Quantum Relative Entropy. INFORMS journal on computing. 37(1). 3–21. 2 indexed citations

Karimi, Mehdi & Levent Tunçel. (2024). Code and Data Repository for Efficient Implementation of Interior-Point Methods for Quantum Relative Entropy. INFORMS journal on computing.

Cornuéjols, Gérard, et al.. (2024). Dyadic linear programming and extensions. Mathematical Programming. 213(1-2). 473–516.

Tunçel, Levent & Lieven Vandenberghe. (2023). Linear optimization over homogeneous matrix cones. Acta Numerica. 32. 675–747. 3 indexed citations

Cornuéjols, Gérard, et al.. (2023). Total dual dyadicness and dyadic generating sets. Mathematical Programming. 206(1-2). 125–143.

Karimi, Mehdi & Levent Tunçel. (2020). Primal–Dual Interior-Point Methods for Domain-Driven Formulations. Mathematics of Operations Research. 45(2). 591–621. 5 indexed citations

Cornuéjols, Gérard, et al.. (2014). On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs. Mathematical Programming. 150(2). 459–489. 2 indexed citations

Bianchi, Silvia, et al.. (2013). Some advances on Lovász–Schrijver semidefinite programming relaxations of the fractional stable set polytope. Discrete Applied Mathematics. 164. 460–469. 1 indexed citations

Kong, Lingchen, Levent Tunçel, & Naihua Xiu. (2013). s-Goodness for Low-Rank Matrix Recovery. Abstract and Applied Analysis. 2013. 1–9. 3 indexed citations

10.

Tunçel, Levent. (2010). Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization. American Mathematical Society eBooks. 23 indexed citations

11.

Tunçel, Levent, et al.. (2008). On the polyhedral lift-and-project methods and the fractional stable set polytope. Discrete Optimization. 6(2). 206–213. 3 indexed citations

12.

Cornuéjols, Gérard, Bertrand Guenin, & Levent Tunçel. (2008). Lehman matrices. Journal of Combinatorial Theory Series B. 99(3). 531–556. 6 indexed citations

13.

Tunçel, Levent & Henry Wolkowicz. (2005). Strengthened existence and uniqueness conditions for search directions in semidefinite programming. Linear Algebra and its Applications. 400. 31–60. 3 indexed citations

14.

Tunçel, Levent. (2001). Generalization of Primal—Dual Interior-Point Methods to Convex Optimization Problems in Conic Form. Foundations of Computational Mathematics. 1(3). 229–254. 26 indexed citations

15.

Todd, Michael J., Levent Tunçel, & Yinyu Ye. (2001). Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems. Mathematical Programming. 90(1). 59–69. 25 indexed citations

16.

Tunçel, Levent. (1999). Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard. Mathematical Programming. 86(1). 219–223. 22 indexed citations

17.

Todd, Michael J., et al.. (1998). Probabilistic analysis of two complexity measures for linear programming problems. eCommons (Cornell University). 9 indexed citations

18.

Cheriyan, Joseph, William H. Cunningham, Levent Tunçel, & Yaoguang Wang. (1996). A linear programming and rounding approach to max 2-SAT. 395–413. 13 indexed citations

19.

Tunçel, Levent. (1994). On the complexity of preflow-push algorithms for maximum-flow problems. Algorithmica. 11(4). 353–359. 6 indexed citations

20.

Tunçel, Levent. (1994). Constant potential primal—dual algorithms: A framework. Mathematical Programming. 66(1-3). 145–159. 12 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