Joseph Cheriyan

1.8k total citations
62 papers, 917 citations indexed

About

Joseph Cheriyan is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Joseph Cheriyan has authored 62 papers receiving a total of 917 indexed citations (citations by other indexed papers that have themselves been cited), including 56 papers in Computational Theory and Mathematics, 36 papers in Computer Networks and Communications and 10 papers in Electrical and Electronic Engineering. Recurrent topics in Joseph Cheriyan's work include Complexity and Algorithms in Graphs (46 papers), Advanced Graph Theory Research (41 papers) and Optimization and Search Problems (28 papers). Joseph Cheriyan is often cited by papers focused on Complexity and Algorithms in Graphs (46 papers), Advanced Graph Theory Research (41 papers) and Optimization and Search Problems (28 papers). Joseph Cheriyan collaborates with scholars based in Canada, United States and Germany. Joseph Cheriyan's co-authors include Sachin Maheshwari, Ramakrishna Thurimella, Adrian Vetta, Santosh Vempala, Kurt Mehlhorn, R. Ravi, Sairam Subramanian, F. Sibel Salman, Mohammad R. Salavatipour and Torben Hagerup and has published in prestigious journals such as Mathematical Programming, SIAM Journal on Computing and SIAM Journal on Optimization.

In The Last Decade

Joseph Cheriyan

58 papers receiving 816 citations

Peers

Joseph Cheriyan

CTM

CNC

EEE

CGCD

Zeev Nutov Israel

Lap Chi Lau Hong Kong

Arthur L. Liestman Canada

Thomas Rothvoß United States

Friedrich Eisenbrand Switzerland

Farhad Shahrokhi United States

Fǎnicǎ Gavril Israel

Olivier Goldschmidt United States

David Lichtenstein United States

Ralph Tindell United States

Zeev Nutov Israel

Joseph Cheriyan

639 ×0.9

CTM

517 ×0.9

CNC

114 ×0.6

EEE

52 ×0.5

68 ×0.9

CGCD

Citations per year, relative to Joseph Cheriyan Joseph Cheriyan (= 1×) peers Zeev Nutov

Countries citing papers authored by Joseph Cheriyan

Since Specialization

Citations

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

Fields of papers citing papers by Joseph Cheriyan

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Joseph Cheriyan

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

Cheriyan, Joseph, et al.. (2023). An Improved Approximation Algorithm for the Matching Augmentation Problem. SIAM Journal on Discrete Mathematics. 37(1). 163–190. 3 indexed citations

Cheriyan, Joseph & Zhihan Gao. (2017). Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part I: Stemless TAP. Algorithmica. 80(2). 530–559. 10 indexed citations

Cheriyan, Joseph, et al.. (2013). Packing of rigid spanning subgraphs and spanning trees. Journal of Combinatorial Theory Series B. 105. 17–25. 8 indexed citations

Cheriyan, Joseph & László A. Végh. (2013). Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs. 30–39. 5 indexed citations

Cheriyan, Joseph, et al.. (2012). Approximating rooted Steiner networks. Symposium on Discrete Algorithms. 1499–1511. 6 indexed citations

Aazami, Ashkan, Joseph Cheriyan, & Bundit Laekhanukit. (2012). A bad example for the iterative rounding method for mincost k-connected spanning subgraphs. Discrete Optimization. 10(1). 25–41. 8 indexed citations

Cheriyan, Joseph, et al.. (2012). On orienting graphs for connectivity: Projective planes and Halin graphs. Operations Research Letters. 40(5). 337–341.

Cheriyan, Joseph & Mohammad R. Salavatipour. (2006). Hardness and approximation results for packing steiner trees. Algorithmica. 45(1). 21–43. 26 indexed citations

Cheriyan, Joseph, et al.. (2005). An O(VE) algorithm for ear decompositions of matching-covered graphs. Symposium on Discrete Algorithms. 415–423. 6 indexed citations

10.

Cheriyan, Joseph, Torben Hagerup, & Kurt Mehlhorn. (2005). Can a maximum flow be computed in o(nm) time?. Lecture notes in computer science. 235–248.

11.

Cheriyan, Joseph & Ramakrishna Thurimella. (2002). Approximating minimum-size k-connected spanning subgraphs via matching. Electronic colloquium on computational complexity. 5. 292–301. 2 indexed citations

12.

Salman, F. Sibel, Joseph Cheriyan, R. Ravi, & Sairam Subramanian. (2001). Approximating the Single-Sink Link-Installation Problem in Network Design. SIAM Journal on Optimization. 11(3). 595–610. 50 indexed citations

13.

Cheriyan, Joseph, Tibor Jordán, & Zeev Nutov. (2001). On Rooted Node-Connectivity Problems. Algorithmica. 30(3). 353–375. 22 indexed citations

14.

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

15.

Cheriyan, Joseph & Ramakrishna Thurimella. (1996). Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract).. 292–301. 4 indexed citations

16.

Cheriyan, Joseph & Ramakrishna Thurimella. (1996). Fast algorithms for k-shredders and k-node connectivity augmentation (extended abstract). 37–46. 8 indexed citations

17.

Cheriyan, Joseph. (1994). A Las Vegas O(n2.38 algorithm for the cardinality of a maximum matching. Symposium on Discrete Algorithms. 442–451. 1 indexed citations

18.

Cheriyan, Joseph. (1993). Random Weighted Laplacians, Lovász minimum digraphs and finding minimum separators. Symposium on Discrete Algorithms. 31–40. 2 indexed citations

19.

Cheriyan, Joseph, Ming‐Yang Kao, & Ramakrishna Thurimella. (1993). Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity. SIAM Journal on Computing. 22(1). 157–174. 42 indexed citations

20.

Cheriyan, Joseph & John H. Reif. (1992). Directed s-t numberings, rubber bands, and testing digraph k-vertex connectivity. eCommons (Cornell University). 335–344. 4 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