Edit Profile (opens in new tab) Cheriyan, Joseph Co-Author Distance Author ID: cheriyan.joseph Published as: Cheriyan, Joseph; Cheriyan, J.; cheriyan, joseph more...less Documents Indexed: 72 Publications since 1988 Co-Authors: 59 Co-Authors with 69 Joint Publications 2,092 Co-Co-Authors all top 5 Co-Authors 3 single-authored 7 Vetta, Adrian R. 6 Gao, Zhihan 5 Laekhanukit, Bundit 5 Szigeti, Zoltán 4 Boyd, Sylvia C. 4 Cummings, Robert 4 Ibrahimpur, Sharat 4 Maheshwari, Shachindra N. 4 Mehlhorn, Kurt 4 Ravi, Ramamoorthi 4 Salavatipour, Mohammad R. 4 Thurimella, Ramakrishna 4 Vempala, Santosh S. 3 Aazami, Ashkan 3 Dippel, Jack 3 Grout, Logan 3 Hagerup, Torben 3 Jordán, Tibor 3 Yu, Bo 2 de Carvalho, Marcelo H. 2 Friggstad, Zachary 2 Georgiou, Konstantinos 2 Haddadan, Arash 2 Jampani, Krishnam Raju 2 Karloff, Howard J. 2 Naves, Guyslain 2 Nutov, Zeev 2 Reif, John H. 2 Salman, F. Sibel 2 Sebo, András 2 Singla, Sahil 2 Wang, Lu 2 Zhu, Jasper 1 Bendayan, Salomon 1 Bland, Robert G. 1 Chandran, L. Sunil 1 Cheung, Kevin K. H. 1 Cunningham, William H. 1 de Gevigney, Olivier Durand 1 Grandoni, Fabrizio 1 Hajebi, Sepehr 1 Haxell, Penny E. 1 Jensen, David L. 1 Kao, Ming-Yang 1 Khan, Arindam 1 Khandekar, Rohit 1 Könemann, Jochen 1 Kotlov, Andreĭ V. 1 Ladanyi, Laszlo 1 Levit, Maxwell 1 Narayan, Vishnu V. 1 Qu, Zishen 1 Skutella, Martin 1 Spirkl, Sophie Theresa 1 Tunçel, Levent 1 Végh, László A. 1 Wang, Yaoguang 1 Yuval, Rabani 1 Zou, Chenglong all top 5 Serials 8 SIAM Journal on Computing 7 Algorithmica 6 Operations Research Letters 6 SIAM Journal on Discrete Mathematics 3 Combinatorica 3 Mathematical Programming. Series A. Series B 3 ACM Transactions on Algorithms 2 Information Processing Letters 2 Journal of Combinatorial Theory. Series B 2 Journal of Algorithms 1 Discrete Mathematics 1 Networks 1 SIAM Journal on Optimization 1 Discrete Optimization all top 5 Fields 55 Computer science (68-XX) 45 Combinatorics (05-XX) 44 Operations research, mathematical programming (90-XX) 2 Convex and discrete geometry (52-XX) 1 Probability theory and stochastic processes (60-XX) 1 Numerical analysis (65-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 52 Publications have been cited 449 times in 353 Documents Cited by ▼ Year ▼ Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. Zbl 0672.05056 Cheriyan, J.; Maheshwari, S. N. 55 1988 Approximating minimum-size \(k\)-connected spanning subgraphs via matching. Zbl 1049.90104 Cheriyan, Joseph; Thurimella, Ramakrishna 27 2000 Approximating the single-sink link-installation problem in network design. Zbl 1010.90002 Salman, F. S.; Cheriyan, J.; Ravi, R.; Subramanian, S. 25 2000 On the integrality ratio for tree augmentation. Zbl 1155.90466 Cheriyan, J.; Karloff, H.; Khandekar, R.; Könemann, J. 25 2008 On 2-coverings and 2-packings of laminar families. Zbl 0945.05014 Cheriyan, Joseph; Jordán, Tibor; Ravi, R. 24 1999 Analysis of preflow push algorithms for maximum network flow. Zbl 0692.68028 Cheriyan, J.; Maheshwari, S. N. 21 1989 Scan-first search and sparse certificates: An improved parallel algorithm for \(k\)-vertex connectivity. Zbl 0767.68048 Cheriyan, Joseph; Kao, Ming-Yang; Thurimella, Ramakrishna 19 1993 An approximation algorithm for the minimum-cost \(k\)-vertex connected subgraph. Zbl 1029.68158 Cheriyan, Joseph; Vempala, Santosh; Vetta, Adrian 13 2003 An \(o(n^ 3)\)-time maximum-flow algorithm. Zbl 0864.68019 Cheriyan, Joseph; Hagerup, Torben; Mehlhorn, Kurt 12 1996 Can a maximum flow be computed in \(o(nm)\) time? Zbl 0768.90020 Cheriyan, Joseph; Hagerup, Torben; Mehlhorn, Kurt 11 1990 Approximating (unweighted) tree augmentation via lift-and-project. II. Zbl 1395.90233 Cheriyan, Joseph; Gao, Zhihan 11 2018 Network design via iterative rounding of setpair relaxations. Zbl 1109.68136 Cheriyan, Joseph; Vempala, Santosh; Vetta, Adrian 11 2006 A linear programming and rounding approach to max 2-sat. Zbl 0864.90102 Cheriyan, J.; Cunningham, W. H.; Tunçel, L.; Wang, Y. 11 1996 Approximating minimum-cost \(k\)-node connected subgraphs via independence-free graphs. Zbl 1303.05097 Cheriyan, Joseph; Végh, László A. 11 2014 Algorithms for dense graphs and networks on the random access computer. Zbl 0848.68070 Cheriyan, J.; Mehlhorn, K. 10 1996 Packing of rigid spanning subgraphs and spanning trees. Zbl 1300.05247 Cheriyan, Joseph; Durand de Gevigney, Olivier; Szigeti, Zoltán 10 2014 Approximation algorithms for network design with metric costs. Zbl 1154.68110 Cheriyan, Joseph; Vetta, Adrian 10 2007 Approximating directed multicuts. Zbl 1080.05039 Cheriyan, Joseph; Karloff, Howard; Yuval, Rabani 9 2005 Hardness and approximation results for packing Steiner trees. Zbl 1117.68054 Cheriyan, Joseph; Salavatipour, Mohammad R. 8 2006 Fast algorithms for \(k\)-shredders and \(k\)-node connectivity augmentation. Zbl 0946.68104 Cheriyan, Joseph; Thurimella, Ramakrishna 8 1999 Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph. Zbl 0972.05028 Cheriyan, J.; Sebö, A.; Szigeti, Z. 8 2001 Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP. Zbl 1395.90232 Cheriyan, Joseph; Gao, Zhihan 7 2018 Fast algorithms for \(k\)-shredders and \(k\)-node connectivity augmentation. (Extended abstract). Zbl 0924.68100 Cheriyan, Joseph; Thurimella, Ramakrishna 7 1996 Approximating minimum-cost connected \(T\)-joins. Zbl 1322.68264 Cheriyan, Joseph; Friggstad, Zachary; Gao, Zhihan 7 2015 Approximating rooted Steiner networks. Zbl 1398.68664 Cheriyan, Joseph; Laekhanukit, Bundit; Naves, Guyslain; Vetta, Adrian 7 2014 Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs. Zbl 1236.68076 Aazami, A.; Cheriyan, J.; Jampani, K. R. 6 2012 An empirical study of min cost flow algorithms. Zbl 0787.90019 Bland, R. G.; Cheriyan, J.; Jensen, D. L.; Ladányi, L. 5 1993 Buy-at-bulk network design, approximating the single-sink edge installation problem. Zbl 1321.68321 Salman, F. S.; Cheriyan, J.; Ravi, R.; Subramanian, S. 5 1997 Approximation algorithms for minimum-cost \(k\)-vertex connected subgraphs. Zbl 1192.68883 Cheriyan, Joseph; Vempala, Santosh; Vetta, Adrian 5 2002 A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs. Zbl 1258.90057 Aazami, Ashkan; Cheriyan, Joseph; Laekhanukit, Bundit 5 2013 The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm. Zbl 1452.90309 Cheriyan, J.; Dippel, J.; Grandoni, F.; Khan, A.; Narayan, V. V. 5 2020 On rooted node-connectivity problems. Zbl 0983.68147 Cheriyan, J.; Jordán, T.; Nutov, Z. 4 2001 Packing element-disjoint Steiner trees. Zbl 1142.68605 Cheriyan, Joseph; Salavatipour, Mohammad R. 4 2005 An \(O(VE)\) algorithm for ear decompositions of matching-covered graphs. Zbl 1321.05200 Carvalho, Marcelo H. De; cheriyan, joseph 4 2005 Approximation algorithms for minimum-cost \(k\)-\((S,T)\) connected digraphs. Zbl 1278.05114 Cheriyan, J.; Laekhanukit, B. 4 2013 A randomized maximum-flow algorithm. Zbl 0827.68049 Cheriyan, Joseph; Hagerup, Torben 3 1995 Hardness and approximation results for packing Steiner trees. Zbl 1111.68781 Cheriyan, Joseph; Salavatipour, Mohammad R. 3 2004 Approximating minimum-cost connected \(T\)-joins. Zbl 1322.68263 Cheriyan, Joseph; Friggstad, Zachary; Gao, Zhihan 3 2012 On Eulerian orientations of even-degree hypercubes. Zbl 1476.05102 Levit, Maxwell; Chandran, L. Sunil; Cheriyan, Joseph 3 2018 Approximation algorithms for feasible cut and multicut problems. Zbl 1512.68253 Yu, Bo; Cheriyan, Joseph 3 1995 Analysis of preflow push algorithms for maximum network flow. Zbl 0659.90042 Cheriyan, J.; Maheshwari, S. N. 2 1988 An improved approximation algorithm for minimum size 2-edge connected spanning subgraphs. Zbl 0909.90262 Cheriyan, Joseph; Sebő, András; Szigeti, Zoltán 2 1998 Randomized \(\widetilde O(M(| V|))\) algorithms for problems in matching theory. Zbl 0885.68119 Cheriyan, Joseph 2 1997 Edge covers of setpairs and the iterative rounding method. Zbl 1010.90520 Cheriyan, Joseph; Vempala, Santosh 2 2001 Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity. Zbl 0810.05048 Cheriyan, Joseph; Reif, John H. 2 1994 An analysis of the highest-level selection rule in the preflow-push max-flow algorithm. Zbl 1338.68097 Cheriyan, Joseph; Mehlhorn, Kurt 2 1999 Approximation algorithms for network design with metric costs. Zbl 1192.68884 Cheriyan, Joseph; Vetta, Adrian 2 2005 Packing element-disjoint Steiner trees. Zbl 1445.68155 Cheriyan, Joseph; Salavatipour, Mohammad R. 2 2007 Approximating rooted Steiner networks. Zbl 1421.68202 Cheriyan, Joseph; Laekhanukit, Bundit; Naves, Guyslain; Vetta, Adrian 1 2012 Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs. Zbl 1489.05081 Cheriyan, Joseph; Hajebi, Sepehr; Qu, Zishen; Spirkl, Sophie 1 2022 On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy. Zbl 1346.90569 Cheriyan, Joseph; Gao, Zhihan; Georgiou, Konstantinos; Singla, Sahil 1 2016 On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy. Zbl 1336.90072 Cheriyan, Joseph; Gao, Zhihan; Georgiou, Konstantinos; Singla, Sahil 1 2013 Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs. Zbl 1489.05081 Cheriyan, Joseph; Hajebi, Sepehr; Qu, Zishen; Spirkl, Sophie 1 2022 The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm. Zbl 1452.90309 Cheriyan, J.; Dippel, J.; Grandoni, F.; Khan, A.; Narayan, V. V. 5 2020 Approximating (unweighted) tree augmentation via lift-and-project. II. Zbl 1395.90233 Cheriyan, Joseph; Gao, Zhihan 11 2018 Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP. Zbl 1395.90232 Cheriyan, Joseph; Gao, Zhihan 7 2018 On Eulerian orientations of even-degree hypercubes. Zbl 1476.05102 Levit, Maxwell; Chandran, L. Sunil; Cheriyan, Joseph 3 2018 On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy. Zbl 1346.90569 Cheriyan, Joseph; Gao, Zhihan; Georgiou, Konstantinos; Singla, Sahil 1 2016 Approximating minimum-cost connected \(T\)-joins. Zbl 1322.68264 Cheriyan, Joseph; Friggstad, Zachary; Gao, Zhihan 7 2015 Approximating minimum-cost \(k\)-node connected subgraphs via independence-free graphs. Zbl 1303.05097 Cheriyan, Joseph; Végh, László A. 11 2014 Packing of rigid spanning subgraphs and spanning trees. Zbl 1300.05247 Cheriyan, Joseph; Durand de Gevigney, Olivier; Szigeti, Zoltán 10 2014 Approximating rooted Steiner networks. Zbl 1398.68664 Cheriyan, Joseph; Laekhanukit, Bundit; Naves, Guyslain; Vetta, Adrian 7 2014 A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs. Zbl 1258.90057 Aazami, Ashkan; Cheriyan, Joseph; Laekhanukit, Bundit 5 2013 Approximation algorithms for minimum-cost \(k\)-\((S,T)\) connected digraphs. Zbl 1278.05114 Cheriyan, J.; Laekhanukit, B. 4 2013 On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy. Zbl 1336.90072 Cheriyan, Joseph; Gao, Zhihan; Georgiou, Konstantinos; Singla, Sahil 1 2013 Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs. Zbl 1236.68076 Aazami, A.; Cheriyan, J.; Jampani, K. R. 6 2012 Approximating minimum-cost connected \(T\)-joins. Zbl 1322.68263 Cheriyan, Joseph; Friggstad, Zachary; Gao, Zhihan 3 2012 Approximating rooted Steiner networks. Zbl 1421.68202 Cheriyan, Joseph; Laekhanukit, Bundit; Naves, Guyslain; Vetta, Adrian 1 2012 On the integrality ratio for tree augmentation. Zbl 1155.90466 Cheriyan, J.; Karloff, H.; Khandekar, R.; Könemann, J. 25 2008 Approximation algorithms for network design with metric costs. Zbl 1154.68110 Cheriyan, Joseph; Vetta, Adrian 10 2007 Packing element-disjoint Steiner trees. Zbl 1445.68155 Cheriyan, Joseph; Salavatipour, Mohammad R. 2 2007 Network design via iterative rounding of setpair relaxations. Zbl 1109.68136 Cheriyan, Joseph; Vempala, Santosh; Vetta, Adrian 11 2006 Hardness and approximation results for packing Steiner trees. Zbl 1117.68054 Cheriyan, Joseph; Salavatipour, Mohammad R. 8 2006 Approximating directed multicuts. Zbl 1080.05039 Cheriyan, Joseph; Karloff, Howard; Yuval, Rabani 9 2005 Packing element-disjoint Steiner trees. Zbl 1142.68605 Cheriyan, Joseph; Salavatipour, Mohammad R. 4 2005 An \(O(VE)\) algorithm for ear decompositions of matching-covered graphs. Zbl 1321.05200 Carvalho, Marcelo H. De; cheriyan, joseph 4 2005 Approximation algorithms for network design with metric costs. Zbl 1192.68884 Cheriyan, Joseph; Vetta, Adrian 2 2005 Hardness and approximation results for packing Steiner trees. Zbl 1111.68781 Cheriyan, Joseph; Salavatipour, Mohammad R. 3 2004 An approximation algorithm for the minimum-cost \(k\)-vertex connected subgraph. Zbl 1029.68158 Cheriyan, Joseph; Vempala, Santosh; Vetta, Adrian 13 2003 Approximation algorithms for minimum-cost \(k\)-vertex connected subgraphs. Zbl 1192.68883 Cheriyan, Joseph; Vempala, Santosh; Vetta, Adrian 5 2002 Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph. Zbl 0972.05028 Cheriyan, J.; Sebö, A.; Szigeti, Z. 8 2001 On rooted node-connectivity problems. Zbl 0983.68147 Cheriyan, J.; Jordán, T.; Nutov, Z. 4 2001 Edge covers of setpairs and the iterative rounding method. Zbl 1010.90520 Cheriyan, Joseph; Vempala, Santosh 2 2001 Approximating minimum-size \(k\)-connected spanning subgraphs via matching. Zbl 1049.90104 Cheriyan, Joseph; Thurimella, Ramakrishna 27 2000 Approximating the single-sink link-installation problem in network design. Zbl 1010.90002 Salman, F. S.; Cheriyan, J.; Ravi, R.; Subramanian, S. 25 2000 On 2-coverings and 2-packings of laminar families. Zbl 0945.05014 Cheriyan, Joseph; Jordán, Tibor; Ravi, R. 24 1999 Fast algorithms for \(k\)-shredders and \(k\)-node connectivity augmentation. Zbl 0946.68104 Cheriyan, Joseph; Thurimella, Ramakrishna 8 1999 An analysis of the highest-level selection rule in the preflow-push max-flow algorithm. Zbl 1338.68097 Cheriyan, Joseph; Mehlhorn, Kurt 2 1999 An improved approximation algorithm for minimum size 2-edge connected spanning subgraphs. Zbl 0909.90262 Cheriyan, Joseph; Sebő, András; Szigeti, Zoltán 2 1998 Buy-at-bulk network design, approximating the single-sink edge installation problem. Zbl 1321.68321 Salman, F. S.; Cheriyan, J.; Ravi, R.; Subramanian, S. 5 1997 Randomized \(\widetilde O(M(| V|))\) algorithms for problems in matching theory. Zbl 0885.68119 Cheriyan, Joseph 2 1997 An \(o(n^ 3)\)-time maximum-flow algorithm. Zbl 0864.68019 Cheriyan, Joseph; Hagerup, Torben; Mehlhorn, Kurt 12 1996 A linear programming and rounding approach to max 2-sat. Zbl 0864.90102 Cheriyan, J.; Cunningham, W. H.; Tunçel, L.; Wang, Y. 11 1996 Algorithms for dense graphs and networks on the random access computer. Zbl 0848.68070 Cheriyan, J.; Mehlhorn, K. 10 1996 Fast algorithms for \(k\)-shredders and \(k\)-node connectivity augmentation. (Extended abstract). Zbl 0924.68100 Cheriyan, Joseph; Thurimella, Ramakrishna 7 1996 A randomized maximum-flow algorithm. Zbl 0827.68049 Cheriyan, Joseph; Hagerup, Torben 3 1995 Approximation algorithms for feasible cut and multicut problems. Zbl 1512.68253 Yu, Bo; Cheriyan, Joseph 3 1995 Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity. Zbl 0810.05048 Cheriyan, Joseph; Reif, John H. 2 1994 Scan-first search and sparse certificates: An improved parallel algorithm for \(k\)-vertex connectivity. Zbl 0767.68048 Cheriyan, Joseph; Kao, Ming-Yang; Thurimella, Ramakrishna 19 1993 An empirical study of min cost flow algorithms. Zbl 0787.90019 Bland, R. G.; Cheriyan, J.; Jensen, D. L.; Ladányi, L. 5 1993 Can a maximum flow be computed in \(o(nm)\) time? Zbl 0768.90020 Cheriyan, Joseph; Hagerup, Torben; Mehlhorn, Kurt 11 1990 Analysis of preflow push algorithms for maximum network flow. Zbl 0692.68028 Cheriyan, J.; Maheshwari, S. N. 21 1989 Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. Zbl 0672.05056 Cheriyan, J.; Maheshwari, S. N. 55 1988 Analysis of preflow push algorithms for maximum network flow. Zbl 0659.90042 Cheriyan, J.; Maheshwari, S. N. 2 1988 all cited Publications top 5 cited Publications all top 5 Cited by 596 Authors 31 Nutov, Zeev 12 Chang, Jou-Ming 11 Cheriyan, Joseph 10 Yang, Jinn-Shyong 8 Kortsarz, Guy 8 Nagamochi, Hiroshi 7 Hajiaghayi, Mohammad Taghi 7 Vygen, Jens 6 Laekhanukit, Bundit 6 Ravi, Ramamoorthi 5 Chekuri, Chandra S. 5 Fan, Jianxi 5 Gao, Zhihan 5 Goldberg, Andrew V. 5 Italiano, Giuseppe Francesco 5 Jia, Xiaohua 5 Jordán, Tibor 5 Morsy, Ehab 4 Czumaj, Artur 4 Egawa, Yoshimi 4 González Martín, Carlos 4 Hommelsheim, Felix 4 Hsieh, Sun-Yuan 4 Lau, Lap Chi 4 Lingas, Andrzej 4 Mehlhorn, Kurt 4 Mühlenthaler, Moritz 4 Salavatipour, Mohammad R. 4 Wang, Yue-Li 3 Adjiashvili, David 3 Cheng, Baolei 3 Cohen, Nachshon 3 Fukunaga, Takuro 3 Gabow, Harold N. 3 Georgiadis, Loukas 3 Grandoni, Fabrizio 3 Gu, Xiaofeng 3 Haddadan, Arash 3 Hasunuma, Toru 3 Igarashi, Yoshihide 3 Jaberi, Raed 3 Kawaguchi, Kimio 3 Khandekar, Rohit 3 Könemann, Jochen 3 Parekh, Ojas D. 3 Schmidt, Jens M. 3 Sebo, András 3 Solomon, Shay 3 Traub, Vera 3 Wada, Koichi 3 Wang, Yan 2 Acuña, Vicente 2 Adamaszek, Anna 2 Ahuja, Ravindra K. 2 Ameli, Afrouz Jabal 2 An, Hyung-Chan 2 Ando, Kiyoshi 2 Arulselvan, Ashwin 2 Bertsekas, Dimitri Panteli 2 Calinescu, Gruia 2 Chang, Yu-Huei 2 Chen, Xiebin 2 Cheng, Eddie 2 Czyzowicz, Jurek 2 Duan, Ran 2 Elkin, Michael 2 Even, Shimon 2 Gálvez, Waldo 2 Garg, Naveen Kumar 2 Gąsieniec, Leszek Antoni 2 Holzer, Markus 2 Hörsch, Florian 2 Huang, Chien-Chung 2 Huck, Andreas 2 Itkis, Gene 2 Iwasaki, Yukihiro 2 Jansson, Jesper 2 Jothi, Raja 2 Kajiwara, Yuka 2 Kao, Shih-Shun 2 Karanasiou, Aikaterini 2 Kim, Kangsan 2 Király, Tamás 2 Klasing, Ralf 2 Krishnaswamy, Ravishankar 2 Kumar, Nikhil 2 Li, Jianping 2 Li, Xianyue 2 Lichen, Junran 2 Maletti, Andreas 2 Manthey, Bodo 2 Manyà, Felip 2 Mirrokni, Vahab S. 2 Miyauchi, Atsushi 2 Mkrtchyan, Vahan V. 2 Newman, Alantha 2 Obokata, Koji 2 Orlin, James B. 2 Ozeki, Kenta 2 Pai, Kung-Jui ...and 496 more Authors all top 5 Cited in 67 Serials 28 Discrete Applied Mathematics 28 Algorithmica 22 Theoretical Computer Science 20 Information Processing Letters 15 SIAM Journal on Discrete Mathematics 15 Mathematical Programming. Series A. Series B 15 Journal of Combinatorial Optimization 13 SIAM Journal on Computing 12 Operations Research Letters 11 Discrete Mathematics 10 Networks 8 Journal of Combinatorial Theory. Series B 8 Journal of Discrete Algorithms 7 Journal of Computer and System Sciences 7 European Journal of Operational Research 5 Computers & Operations Research 5 Discrete Optimization 4 Information Sciences 4 Theory of Computing Systems 3 Applied Mathematics and Computation 3 Journal of Graph Theory 3 Combinatorica 3 International Journal of Foundations of Computer Science 2 Journal of Optimization Theory and Applications 2 Naval Research Logistics 2 Graphs and Combinatorics 2 Journal of Parallel and Distributed Computing 2 Journal of Global Optimization 2 Journal of the ACM 1 Journal of Mathematical Analysis and Applications 1 Physica A 1 Programming and Computer Software 1 European Journal of Combinatorics 1 Order 1 Information and Computation 1 Annals of Operations Research 1 Random Structures & Algorithms 1 Japan Journal of Industrial and Applied Mathematics 1 International Journal of Computational Geometry & Applications 1 International Journal of Computer Mathematics 1 SIAM Review 1 Distributed Computing 1 SIAM Journal on Optimization 1 Computational Optimization and Applications 1 Combinatorics, Probability and Computing 1 Top 1 Annals of Mathematics and Artificial Intelligence 1 Discussiones Mathematicae. Graph Theory 1 Journal of Heuristics 1 INFORMS Journal on Computing 1 Mathematical Problems in Engineering 1 Journal of Graph Algorithms and Applications 1 Discrete Mathematics and Theoretical Computer Science. DMTCS 1 RIMS Kokyuroku 1 Bulletin of the Malaysian Mathematical Sciences Society. Second Series 1 Journal of Machine Learning Research (JMLR) 1 Journal of Applied Mathematics and Computing 1 ACM Transactions on Computational Logic 1 Parallel Processing Letters 1 Journal of Industrial and Management Optimization 1 Science China. Information Sciences 1 RAIRO. Theoretical Informatics and Applications 1 ACM Transactions on Algorithms 1 Journal of the Operations Research Society of China 1 Journal of Mathematical Modelling and Algorithms in Operations Research 1 DML. Discrete Mathematics Letters 1 SN Operations Research Forum all top 5 Cited in 14 Fields 220 Computer science (68-XX) 197 Combinatorics (05-XX) 139 Operations research, mathematical programming (90-XX) 7 Convex and discrete geometry (52-XX) 5 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 1 Mathematical logic and foundations (03-XX) 1 Order, lattices, ordered algebraic structures (06-XX) 1 Linear and multilinear algebra; matrix theory (15-XX) 1 Operator theory (47-XX) 1 Statistics (62-XX) 1 Numerical analysis (65-XX) 1 Quantum theory (81-XX) 1 Statistical mechanics, structure of matter (82-XX) 1 Information and communication theory, circuits (94-XX) Citations by Year