Edit Profile (opens in new tab) Cheriyan, Joseph Compute Distance To: Compute Author ID: cheriyan.joseph Published as: Cheriyan, Joseph; Cheriyan, J.; cheriyan, joseph Documents Indexed: 63 Publications since 1988 Co-Authors: 49 Co-Authors with 59 Joint Publications 1,553 Co-Co-Authors all top 5 Co-Authors 3 single-authored 7 Vetta, Adrian R. 6 Gao, Zhihan 4 Laekhanukit, Bundit 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 Hagerup, Torben 3 Jordán, Tibor 3 Szigeti, Zoltán 2 de Carvalho, Marcelo H. 2 Friggstad, Zachary 2 Georgiou, Konstantinos 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 1 Bland, Robert G. 1 Chandran, L. Sunil 1 Cunningham, William H. 1 de Gevigney, Olivier Durand 1 Dippel, J. 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 4 Operations Research Letters 4 SIAM Journal on Discrete Mathematics 3 Combinatorica 3 ACM Transactions on Algorithms 2 Information Processing Letters 2 Journal of Combinatorial Theory. Series B 2 Journal of Algorithms 2 Mathematical Programming. Series A. Series B 1 Discrete Mathematics 1 Networks 1 SIAM Journal on Optimization 1 Discrete Optimization all top 5 Fields 48 Computer science (68-XX) 39 Combinatorics (05-XX) 37 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 48 Publications have been cited 339 times in 278 Documents Cited by ▼ Year ▼ Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. Zbl 0672.05056Cheriyan, J.; Maheshwari, S. N. 47 1988 Approximating minimum-size \(k\)-connected spanning subgraphs via matching. Zbl 1049.90104Cheriyan, Joseph; Thurimella, Ramakrishna 23 2000 Approximating the single-sink link-installation problem in network design. Zbl 1010.90002Salman, F. S.; Cheriyan, J.; Ravi, R.; Subramanian, S. 23 2000 Analysis of preflow push algorithms for maximum network flow. Zbl 0692.68028Cheriyan, J.; Maheshwari, S. N. 18 1989 On 2-coverings and 2-packings of laminar families. Zbl 0945.05014Cheriyan, Joseph; Jordán, Tibor; Ravi, R. 17 1999 Scan-first search and sparse certificates: An improved parallel algorithm for \(k\)-vertex connectivity. Zbl 0767.68048Cheriyan, Joseph; Kao, Ming-Yang; Thurimella, Ramakrishna 15 1993 An approximation algorithm for the minimum-cost \(k\)-vertex connected subgraph. Zbl 1029.68158Cheriyan, Joseph; Vempala, Santosh; Vetta, Adrian 14 2003 On the integrality ratio for tree augmentation. Zbl 1155.90466Cheriyan, J.; Karloff, H.; Khandekar, R.; Könemann, J. 13 2008 A linear programming and rounding approach to max 2-sat. Zbl 0864.90102Cheriyan, J.; Cunningham, W. H.; Tunçel, L.; Wang, Y. 10 1996 Can a maximum flow be computed in \(o(nm)\) time? Zbl 0768.90020Cheriyan, Joseph; Hagerup, Torben; Mehlhorn, Kurt 9 1990 Approximation algorithms for network design with metric costs. Zbl 1154.68110Cheriyan, Joseph; Vetta, Adrian 9 2007 Network design via iterative rounding of setpair relaxations. Zbl 1109.68136Cheriyan, Joseph; Vempala, Santosh; Vetta, Adrian 9 2006 An \(o(n^ 3)\)-time maximum-flow algorithm. Zbl 0864.68019Cheriyan, Joseph; Hagerup, Torben; Mehlhorn, Kurt 8 1996 Approximating minimum-cost \(k\)-node connected subgraphs via independence-free graphs. Zbl 1303.05097Cheriyan, Joseph; Végh, László A. 7 2014 Fast algorithms for \(k\)-shredders and \(k\)-node connectivity augmentation. Zbl 0946.68104Cheriyan, Joseph; Thurimella, Ramakrishna 7 1999 Algorithms for dense graphs and networks on the random access computer. Zbl 0848.68070Cheriyan, J.; Mehlhorn, K. 7 1996 Approximating directed multicuts. Zbl 1080.05039Cheriyan, Joseph; Karloff, Howard; Yuval, Rabani 7 2005 Packing of rigid spanning subgraphs and spanning trees. Zbl 1300.05247Cheriyan, Joseph; Durand de Gevigney, Olivier; Szigeti, Zoltán 6 2014 Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph. Zbl 0972.05028Cheriyan, J.; Sebö, A.; Szigeti, Z. 5 2001 Fast algorithms for \(k\)-shredders and \(k\)-node connectivity augmentation. (Extended abstract). Zbl 0924.68100Cheriyan, Joseph; Thurimella, Ramakrishna 5 1996 Approximation algorithms for minimum-cost \(k\)-vertex connected subgraphs. Zbl 1192.68883Cheriyan, Joseph; Vempala, Santosh; Vetta, Adrian 5 2002 Buy-at-bulk network design, approximating the single-sink edge installation problem. Zbl 1321.68321Salman, F. S.; Cheriyan, J.; Ravi, R.; Subramanian, S. 5 1997 Approximating minimum-cost connected \(T\)-joins. Zbl 1322.68264Cheriyan, Joseph; Friggstad, Zachary; Gao, Zhihan 5 2015 A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs. Zbl 1258.90057Aazami, Ashkan; Cheriyan, Joseph; Laekhanukit, Bundit 5 2013 Approximating (unweighted) tree augmentation via lift-and-project. II. Zbl 1395.90233Cheriyan, Joseph; Gao, Zhihan 5 2018 An \(O(VE)\) algorithm for ear decompositions of matching-covered graphs. Zbl 1321.05200Carvalho, Marcelo H. De; cheriyan, joseph 4 2005 An empirical study of min cost flow algorithms. Zbl 0787.90019Bland, R. G.; Cheriyan, J.; Jensen, D. L.; Ladányi, L. 4 1993 On rooted node-connectivity problems. Zbl 0983.68147Cheriyan, J.; Jordán, T.; Nutov, Z. 4 2001 Hardness and approximation results for packing Steiner trees. Zbl 1117.68054Cheriyan, Joseph; Salavatipour, Mohammad R. 4 2006 Packing element-disjoint Steiner trees. Zbl 1142.68605Cheriyan, Joseph; Salavatipour, Mohammad R. 4 2005 Approximating rooted Steiner networks. Zbl 1398.68664Cheriyan, Joseph; Laekhanukit, Bundit; Naves, Guyslain; Vetta, Adrian 3 2014 Hardness and approximation results for packing Steiner trees. Zbl 1111.68781Cheriyan, Joseph; Salavatipour, Mohammad R. 3 2004 Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs. Zbl 1236.68076Aazami, A.; Cheriyan, J.; Jampani, K. R. 3 2012 Approximation algorithms for minimum-cost \(k\)-\((S,T)\) connected digraphs. Zbl 1278.05114Cheriyan, J.; Laekhanukit, B. 3 2013 Approximating minimum-cost connected \(T\)-joins. Zbl 1322.68263Cheriyan, Joseph; Friggstad, Zachary; Gao, Zhihan 3 2012 Analysis of preflow push algorithms for maximum network flow. Zbl 0659.90042Cheriyan, J.; Maheshwari, S. N. 2 1988 A randomized maximum-flow algorithm. Zbl 0827.68049Cheriyan, Joseph; Hagerup, Torben 2 1995 An improved approximation algorithm for minimum size 2-edge connected spanning subgraphs. Zbl 0909.90262Cheriyan, Joseph; Sebő, András; Szigeti, Zoltán 2 1998 Edge covers of setpairs and the iterative rounding method. Zbl 1010.90520Cheriyan, Joseph; Vempala, Santosh 2 2001 An analysis of the highest-level selection rule in the preflow-push max-flow algorithm. Zbl 1338.68097Cheriyan, Joseph; Mehlhorn, Kurt 2 1999 On Eulerian orientations of even-degree hypercubes. Zbl 1476.05102Levit, Maxwell; Chandran, L. Sunil; Cheriyan, Joseph 2 2018 The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm. Zbl 1452.90309Cheriyan, J.; Dippel, J.; Grandoni, F.; Khan, A.; Narayan, V. V. 2 2020 On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy. Zbl 1346.90569Cheriyan, Joseph; Gao, Zhihan; Georgiou, Konstantinos; Singla, Sahil 1 2016 Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity. Zbl 0810.05048Cheriyan, Joseph; Reif, John H. 1 1994 Approximation algorithms for network design with metric costs. Zbl 1192.68884Cheriyan, Joseph; Vetta, Adrian 1 2005 Approximating rooted Steiner networks. Zbl 1421.68202Cheriyan, Joseph; Laekhanukit, Bundit; Naves, Guyslain; Vetta, Adrian 1 2012 On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy. Zbl 1336.90072Cheriyan, Joseph; Gao, Zhihan; Georgiou, Konstantinos; Singla, Sahil 1 2013 Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP. Zbl 1395.90232Cheriyan, Joseph; Gao, Zhihan 1 2018 The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm. Zbl 1452.90309Cheriyan, J.; Dippel, J.; Grandoni, F.; Khan, A.; Narayan, V. V. 2 2020 Approximating (unweighted) tree augmentation via lift-and-project. II. Zbl 1395.90233Cheriyan, Joseph; Gao, Zhihan 5 2018 On Eulerian orientations of even-degree hypercubes. Zbl 1476.05102Levit, Maxwell; Chandran, L. Sunil; Cheriyan, Joseph 2 2018 Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP. Zbl 1395.90232Cheriyan, Joseph; Gao, Zhihan 1 2018 On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy. Zbl 1346.90569Cheriyan, Joseph; Gao, Zhihan; Georgiou, Konstantinos; Singla, Sahil 1 2016 Approximating minimum-cost connected \(T\)-joins. Zbl 1322.68264Cheriyan, Joseph; Friggstad, Zachary; Gao, Zhihan 5 2015 Approximating minimum-cost \(k\)-node connected subgraphs via independence-free graphs. Zbl 1303.05097Cheriyan, Joseph; Végh, László A. 7 2014 Packing of rigid spanning subgraphs and spanning trees. Zbl 1300.05247Cheriyan, Joseph; Durand de Gevigney, Olivier; Szigeti, Zoltán 6 2014 Approximating rooted Steiner networks. Zbl 1398.68664Cheriyan, Joseph; Laekhanukit, Bundit; Naves, Guyslain; Vetta, Adrian 3 2014 A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs. Zbl 1258.90057Aazami, Ashkan; Cheriyan, Joseph; Laekhanukit, Bundit 5 2013 Approximation algorithms for minimum-cost \(k\)-\((S,T)\) connected digraphs. Zbl 1278.05114Cheriyan, J.; Laekhanukit, B. 3 2013 On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy. Zbl 1336.90072Cheriyan, 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.68076Aazami, A.; Cheriyan, J.; Jampani, K. R. 3 2012 Approximating minimum-cost connected \(T\)-joins. Zbl 1322.68263Cheriyan, Joseph; Friggstad, Zachary; Gao, Zhihan 3 2012 Approximating rooted Steiner networks. Zbl 1421.68202Cheriyan, Joseph; Laekhanukit, Bundit; Naves, Guyslain; Vetta, Adrian 1 2012 On the integrality ratio for tree augmentation. Zbl 1155.90466Cheriyan, J.; Karloff, H.; Khandekar, R.; Könemann, J. 13 2008 Approximation algorithms for network design with metric costs. Zbl 1154.68110Cheriyan, Joseph; Vetta, Adrian 9 2007 Network design via iterative rounding of setpair relaxations. Zbl 1109.68136Cheriyan, Joseph; Vempala, Santosh; Vetta, Adrian 9 2006 Hardness and approximation results for packing Steiner trees. Zbl 1117.68054Cheriyan, Joseph; Salavatipour, Mohammad R. 4 2006 Approximating directed multicuts. Zbl 1080.05039Cheriyan, Joseph; Karloff, Howard; Yuval, Rabani 7 2005 An \(O(VE)\) algorithm for ear decompositions of matching-covered graphs. Zbl 1321.05200Carvalho, Marcelo H. De; cheriyan, joseph 4 2005 Packing element-disjoint Steiner trees. Zbl 1142.68605Cheriyan, Joseph; Salavatipour, Mohammad R. 4 2005 Approximation algorithms for network design with metric costs. Zbl 1192.68884Cheriyan, Joseph; Vetta, Adrian 1 2005 Hardness and approximation results for packing Steiner trees. Zbl 1111.68781Cheriyan, Joseph; Salavatipour, Mohammad R. 3 2004 An approximation algorithm for the minimum-cost \(k\)-vertex connected subgraph. Zbl 1029.68158Cheriyan, Joseph; Vempala, Santosh; Vetta, Adrian 14 2003 Approximation algorithms for minimum-cost \(k\)-vertex connected subgraphs. Zbl 1192.68883Cheriyan, Joseph; Vempala, Santosh; Vetta, Adrian 5 2002 Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph. Zbl 0972.05028Cheriyan, J.; Sebö, A.; Szigeti, Z. 5 2001 On rooted node-connectivity problems. Zbl 0983.68147Cheriyan, J.; Jordán, T.; Nutov, Z. 4 2001 Edge covers of setpairs and the iterative rounding method. Zbl 1010.90520Cheriyan, Joseph; Vempala, Santosh 2 2001 Approximating minimum-size \(k\)-connected spanning subgraphs via matching. Zbl 1049.90104Cheriyan, Joseph; Thurimella, Ramakrishna 23 2000 Approximating the single-sink link-installation problem in network design. Zbl 1010.90002Salman, F. S.; Cheriyan, J.; Ravi, R.; Subramanian, S. 23 2000 On 2-coverings and 2-packings of laminar families. Zbl 0945.05014Cheriyan, Joseph; Jordán, Tibor; Ravi, R. 17 1999 Fast algorithms for \(k\)-shredders and \(k\)-node connectivity augmentation. Zbl 0946.68104Cheriyan, Joseph; Thurimella, Ramakrishna 7 1999 An analysis of the highest-level selection rule in the preflow-push max-flow algorithm. Zbl 1338.68097Cheriyan, Joseph; Mehlhorn, Kurt 2 1999 An improved approximation algorithm for minimum size 2-edge connected spanning subgraphs. Zbl 0909.90262Cheriyan, Joseph; Sebő, András; Szigeti, Zoltán 2 1998 Buy-at-bulk network design, approximating the single-sink edge installation problem. Zbl 1321.68321Salman, F. S.; Cheriyan, J.; Ravi, R.; Subramanian, S. 5 1997 A linear programming and rounding approach to max 2-sat. Zbl 0864.90102Cheriyan, J.; Cunningham, W. H.; Tunçel, L.; Wang, Y. 10 1996 An \(o(n^ 3)\)-time maximum-flow algorithm. Zbl 0864.68019Cheriyan, Joseph; Hagerup, Torben; Mehlhorn, Kurt 8 1996 Algorithms for dense graphs and networks on the random access computer. Zbl 0848.68070Cheriyan, J.; Mehlhorn, K. 7 1996 Fast algorithms for \(k\)-shredders and \(k\)-node connectivity augmentation. (Extended abstract). Zbl 0924.68100Cheriyan, Joseph; Thurimella, Ramakrishna 5 1996 A randomized maximum-flow algorithm. Zbl 0827.68049Cheriyan, Joseph; Hagerup, Torben 2 1995 Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity. Zbl 0810.05048Cheriyan, Joseph; Reif, John H. 1 1994 Scan-first search and sparse certificates: An improved parallel algorithm for \(k\)-vertex connectivity. Zbl 0767.68048Cheriyan, Joseph; Kao, Ming-Yang; Thurimella, Ramakrishna 15 1993 An empirical study of min cost flow algorithms. Zbl 0787.90019Bland, R. G.; Cheriyan, J.; Jensen, D. L.; Ladányi, L. 4 1993 Can a maximum flow be computed in \(o(nm)\) time? Zbl 0768.90020Cheriyan, Joseph; Hagerup, Torben; Mehlhorn, Kurt 9 1990 Analysis of preflow push algorithms for maximum network flow. Zbl 0692.68028Cheriyan, J.; Maheshwari, S. N. 18 1989 Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. Zbl 0672.05056Cheriyan, J.; Maheshwari, S. N. 47 1988 Analysis of preflow push algorithms for maximum network flow. Zbl 0659.90042Cheriyan, J.; Maheshwari, S. N. 2 1988 all cited Publications top 5 cited Publications all top 5 Cited by 445 Authors 28 Nutov, Zeev 11 Chang, Jou-Ming 10 Yang, Jinn-Shyong 9 Cheriyan, Joseph 8 Kortsarz, Guy 7 Nagamochi, Hiroshi 6 Hajiaghayi, Mohammad Taghi 6 Vygen, Jens 5 Chekuri, Chandra S. 5 Fan, Jianxi 5 Gao, Zhihan 5 Jia, Xiaohua 4 Czumaj, Artur 4 Egawa, Yoshimi 4 González Martín, Carlos 4 Jordán, Tibor 4 Lingas, Andrzej 4 Mehlhorn, Kurt 4 Morsy, Ehab 4 Ravi, Ramamoorthi 4 Wang, Yue-Li 3 Cheng, Baolei 3 Cohen, Nachshon 3 Fukunaga, Takuro 3 Gabow, Harold N. 3 Georgiadis, Loukas 3 Goldberg, Andrew V. 3 Gu, Xiaofeng 3 Hasunuma, Toru 3 Hsieh, Sun-Yuan 3 Igarashi, Yoshihide 3 Italiano, Giuseppe Francesco 3 Khandekar, Rohit 3 Könemann, Jochen 3 Laekhanukit, Bundit 3 Lau, Lap Chi 3 Salavatipour, Mohammad R. 3 Schmidt, Jens M. 3 Solomon, Shay 3 Wang, Yan 2 Adamaszek, Anna 2 Adjiashvili, David 2 Ahuja, Ravindra K. 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 Gąsieniec, Leszek Antoni 2 Haddadan, Arash 2 Holzer, Markus 2 Hommelsheim, Felix 2 Huck, Andreas 2 Iwasaki, Yukihiro 2 Jaberi, Raed 2 Jansson, Jesper 2 Jothi, Raja 2 Kajiwara, Yuka 2 Karanasiou, Aikaterini 2 Király, Tamás 2 Krishnaswamy, Ravishankar 2 Li, Xianyue 2 Maletti, Andreas 2 Manthey, Bodo 2 Manyà, Felip 2 Mirrokni, Vahab S. 2 Miyauchi, Atsushi 2 Mkrtchyan, Vahan V. 2 Mühlenthaler, Moritz 2 Newman, Alantha 2 Obokata, Koji 2 Orlin, James B. 2 Pai, Kung-Jui 2 Papadopoulos, Charis 2 Parekh, Ojas D. 2 Parotsidis, Nikos 2 Peleg, David 2 Pettie, Seth 2 Raghavachari, Balaji 2 Raman, Venkatesh 2 Rukkanchanunt, Thapanapong 2 Sau, Ignasi 2 Schlipf, Lena 2 Sedeño-Noda, Antonio 2 Shalom, Mordechai 2 Shen, Haiou 2 Tang, Shyue-Ming 2 Tardos, Éva 2 Tarjan, Robert Endre 2 Terlaky, Tamás 2 Traub, Vera 2 Tunçel, Levent 2 Vannelli, Anthony 2 Wang, Xiumei 2 Williamson, David P. ...and 345 more Authors all top 5 Cited in 58 Serials 26 Discrete Applied Mathematics 25 Algorithmica 20 Information Processing Letters 17 Theoretical Computer Science 14 Journal of Combinatorial Optimization 13 SIAM Journal on Discrete Mathematics 11 Mathematical Programming. Series A. Series B 9 Discrete Mathematics 9 SIAM Journal on Computing 8 Operations Research Letters 8 Journal of Discrete Algorithms 7 Journal of Combinatorial Theory. Series B 7 Networks 6 Journal of Computer and System Sciences 6 European Journal of Operational Research 5 Computers & Operations Research 4 Information Sciences 4 Theory of Computing Systems 3 Applied Mathematics and Computation 3 Combinatorica 3 International Journal of Foundations of Computer Science 3 Discrete Optimization 2 Journal of Graph Theory 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 Programming and Computer Software 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 Computer Mathematics 1 SIAM Review 1 Distributed Computing 1 Cybernetics and Systems Analysis 1 Computational Optimization and Applications 1 Combinatorics, Probability and Computing 1 Top 1 Annals of Mathematics and Artificial Intelligence 1 Journal of Heuristics 1 INFORMS Journal on Computing 1 Mathematical Problems in Engineering 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 Journal of Industrial and Management Optimization 1 Science China. Information Sciences 1 RAIRO. Theoretical Informatics and Applications 1 Journal of the Operations Research Society of China 1 Journal of Mathematical Modelling and Algorithms in Operations Research all top 5 Cited in 13 Fields 173 Computer science (68-XX) 159 Combinatorics (05-XX) 110 Operations research, mathematical programming (90-XX) 4 Convex and discrete geometry (52-XX) 4 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 1 Mathematical logic and foundations (03-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 Systems theory; control (93-XX) 1 Information and communication theory, circuits (94-XX) Citations by Year