Edit Profile (opens in new tab) Young, Neal E. Compute Distance To: Compute Author ID: young.neal-e Published as: Young, Neal E.; Young, Neal; Young, N. E.; Young, N. more...less External Links: MGP Documents Indexed: 61 Publications since 1991 1 Contribution as Editor Co-Authors: 47 Co-Authors with 53 Joint Publications 2,109 Co-Co-Authors all top 5 Co-Authors 9 single-authored 13 Khuller, Samir 11 Raghavachari, Balaji 9 Chrobak, Marek 7 Golin, Mordecai J. 6 Kenyon, Claire M. 6 Koufogiannakis, Christos 4 Klein, Philip N. 3 Munro, J. Ian 3 Stein, Clifford 2 Bienkowski, Marcin 2 Byrka, Jarosław 2 Dobbs, Neil B. 2 Fekete, Sándor P. 2 Karger, David R. 2 Klemmstein, Monika 2 Lupton, Robert H. 2 Mathieu, Claire 2 Miller Maley, F. 2 Noga, John 2 Sviridenko, Maxim I. 2 Świrszcz, Grzegorz M. 2 Thorup, Mikkel 2 Vishkin, Uzi 2 Yousefi, Arman 1 Aslam, Javed A. 1 Fiat, Amos 1 Hakimi, Seifollah Louis 1 Karp, Richard Manning 1 Keogh, Eamonn J. 1 Khare, Monik 1 Kolliopoulos, Stavros G. 1 Lipton, Richard Jay 1 Luby, Michael G. 1 Marx, Dániel 1 Matias, Yossi 1 McGeoch, Lyle A. 1 Mueen, Abdullah 1 Orlin, James B. 1 Rasala, April 1 Schabanel, Nicolas 1 Schmeichel, Edward F. 1 Sheldon, Daniel R. 1 Sloane, Neil James Alexander 1 Tarjan, Robert Endre 1 Vassilevska Williams, Virginia 1 Vitter, Jeffrey Scott 1 Zakaria, Jesin all top 5 Serials 6 SIAM Journal on Computing 5 Journal of Algorithms 5 Algorithmica 3 Information Processing Letters 1 Acta Informatica 1 Discrete Applied Mathematics 1 Journal of Combinatorial Theory. Series A 1 Journal of Computer and System Sciences 1 Mathematics of Operations Research 1 Networks 1 Information and Computation 1 Distributed Computing 1 Journal of Scheduling 1 Data Mining and Knowledge Discovery 1 ACM Transactions on Algorithms 1 Theory of Computing all top 5 Fields 52 Computer science (68-XX) 28 Operations research, mathematical programming (90-XX) 15 Combinatorics (05-XX) 6 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 4 Information and communication theory, circuits (94-XX) 2 Numerical analysis (65-XX) 1 General and overarching topics; collections (00-XX) 1 Statistics (62-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 52 Publications have been cited 519 times in 426 Documents Cited by ▼ Year ▼ Competitive paging algorithms. Zbl 0753.68018Fiat, Amos; Karp, Richard M.; Luby, Michael; McGeoch, Lyle A.; Sleator, Daniel D.; Young, Neal E. 64 1991 Rounding algorithms for a geometric embedding of minimum multiway cut. Zbl 1082.90149Karger, David R.; Klein, Philip; Stein, Cliff; Thorup, Mikkel; Young, Neal E. 39 2004 Faster parametric shortest path and minimum-balance algorithms. Zbl 0719.90087Young, Neal E.; Tarjan, Robert E.; Orlin, James B. 35 1991 Balancing minimum spanning trees and shortest-path trees. Zbl 0833.68096Khuller, S.; Raghavachari, B.; Young, N. 31 1995 Randomized rounding without solving the linear program. Zbl 0849.90100Young, Neal E. 25 1995 Approximating the minimum equivalent digraph. Zbl 0830.68100Khuller, Samir; Raghavachari, Balaji; Young, Neal 20 1995 Approximation algorithms for covering/packing integer programs. Zbl 1082.68128Kolliopoulos, Stavros G.; Young, Neal E. 18 2005 Low-degree spanning trees of small weight. Zbl 0849.05022Khuller, Samir; Raghavachari, Balaji; Young, Neal 16 1996 Incremental medians via online bidding. Zbl 1216.90057Chrobak, Marek; Kenyon, Claire; Noga, John; Young, Neal E. 16 2008 Simple strategies for large zero-sum games with applications to complexity theory. Zbl 1345.68175Lipton, Richard J.; Young, Neal E. 15 1994 On-line file caching. Zbl 0994.68182Young, N. E. 15 2002 A network-flow technique for finding low-weight bounded-degree spanning trees. Zbl 0895.68107Fekete, Sándor P.; Khuller, Samir; Klemmstein, Monika; Raghavachari, Balaji; Young, Neal 15 1997 A new operation on sequences: The boustrophedon transform. Zbl 0858.05007Millar, J.; Sloane, N. J. A.; Young, N. E. 15 1996 Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost. Zbl 1285.68215Koufogiannakis, Christos; Young, Neal E. 13 2013 Improved bicriteria existence theorems for scheduling. Zbl 1052.90549Aslam, Javed; Rasala, April; Stein, Cliff; Young, Neal 11 1999 Rounding algorithms for a geometric embedding of minimum multiway cut. Zbl 1345.90095Karger, David R.; Klein, Philip; Stein, Cliff; Thorup, Mikkel; Young, Neal E. 10 1999 On strongly connected digraphs with bounded cycle length. Zbl 0859.05057Khuller, Samir; Raghavachari, Balaji; Young, Neal 10 1996 On-line paging against adversarially biased random inputs. Zbl 0971.68073Young, Neal E. 10 2000 Orienting graphs to optimize reachability. Zbl 1337.68130Hakimi, S. Louis; Schmeichel, Edward F.; Young, Neal E. 9 1997 Distributed algorithms for covering, packing and maximum weighted matching. Zbl 1231.68276Koufogiannakis, Christos; Young, Neal E. 9 2011 Balancing minimum spanning and shortest path trees. Zbl 0801.68134Khuller, Samir; Raghavachari, Balaji; Young, Neal 9 1993 Greedy \(\Delta\)-approximation algorithm for covering with arbitrary constraints and submodular cost. Zbl 1248.68561Koufogiannakis, Christos; Young, Neal E. 9 2009 On-line file caching. Zbl 0930.68002Young, Neal E. 8 1998 Distributed fractional packing and maximum weighted b-matching via tail-recursive duality. Zbl 1261.68168Koufogiannakis, Christos; Young, Neal E. 8 2009 \(K\)-medians, facility location, and the Chernoff-Wald bound. Zbl 0952.90023Young, Neal E. 7 2000 On-line caching as cache size varies. Zbl 0800.68461Young, Neal 7 1991 A primal-dual parallel approximation technique applied to weighted set and vertex covers. Zbl 0938.68946Khuller, Samir; Vishkin, Uzi; Young, Neal 6 1994 Bounding the diffusive adversary. Zbl 0938.68913Young, Neal E. 5 1998 On the number of iterations for Dantzig-Wolfe optimization and packing-covering approximation algorithms. Zbl 0954.90004Klein, Philip; Young, Neal 5 1999 Designing multi-commodity flow trees. Zbl 0803.68087Khuller, Samir; Raghavachari, Balaji; Young, Neal 5 1994 Oblivious medians via online bidding. (Extended abstract). Zbl 1145.68583Chrobak, Marek; Kenyon, Claire; Noga, John; Young, Neal E. 5 2006 A nearly linear-time PTAS for explicit fractional packing and covering linear programs. Zbl 1311.90071Koufogiannakis, Christos; Young, Neal E. 5 2014 Low degree spanning trees of small weight. Zbl 1345.90077Khuller, Samir; Raghavachari, Balaji; Young, Neal 4 1994 Distributed and parallel algorithms for weighted vertex cover and other covering problems. Zbl 1291.05160Koufogiannakis, Christos; Young, Neal E. 4 2009 Polynomial-time approximation scheme for data broadcast. Zbl 1296.68194Kenyon, Claire; Schabanel, Nicolas; Young, Neal 4 2000 Optimal search trees with 2-way comparisons. Zbl 1472.68044Chrobak, Marek; Golin, Mordecai; Munro, J. Ian; Young, Neal E. 3 2015 Approximation algorithms for the joint replenishment problem with deadlines. Zbl 1333.90015Bienkowski, Marcin; Byrka, Jarosław; Chrobak, Marek; Dobbs, Neil; Nowicki, Tomasz; Sviridenko, Maxim; Świrszcz, Grzegorz; Young, Neal E. 3 2015 Data collection for the sloan digital sky survey – a network-flow heuristic. Zbl 0905.68161Lupton, Robert; Maley, F. Miller; Young, Neal 3 1998 Huffman coding with unequal letter costs. Zbl 1192.68899Golin, Mordecai J.; Kenyon, Claire; Young, Neal E. 3 2002 The reverse greedy algorithm for the metric \(K\)-median problem. Zbl 1128.90549Chrobak, Marek; Kenyon, Claire; Young, Neal E. 2 2005 Approximate data structures with applications. Zbl 1114.68387Matias, Yossi; Vitter, Jeffrey Scott; Young, Neal E. 2 1994 The reverse greedy algorithm for the metric k-median problem. Zbl 1184.68631Chrobak, Marek; Kenyon, Claire; Young, Neal 2 2006 Approximation algorithms for the joint replenishment problem with deadlines. Zbl 1336.68289Bienkowski, Marcin; Byrka, Jaroslaw; Chrobak, Marek; Dobbs, Neil; Nowicki, Tomasz; Sviridenko, Maxim; Świrszcz, Grzegorz; Young, Neal E. 2 2013 The \(K\)-server dual and loose competitiveness for paging. Zbl 0800.68488Young, Neal 2 1992 A primal-dual parallel approximation technique applied to weighted set and vertex cover. Zbl 0968.68568Khuller, Samir; Vishkin, Uzi; Young, Neal 2 1993 Huffman coding with letter costs: a linear-time approximation scheme. Zbl 1248.94045Golin, Mordecai J.; Mathieu, Claire; Young, Neal E. 2 2012 On the number of iterations for Dantzig-Wolfe optimization and packing-covering approximation algorithms. Zbl 1329.68126Klein, Philip; Young, Neal E. 1 2015 Data collection for the Sloan digital sky survey – a network-flow heuristic. Zbl 0845.90133Lupton, Robert; Miller Maley, F.; Young, Neal 1 1996 Prefix codes: Equiprobable words, unequal letter costs. Zbl 0876.68053Golin, Mordecai J.; Young, Neal 1 1996 Approximating the minimum equivalent digraph. Zbl 0867.05070Khuller, Samir; Raghavachari, Balaji; Young, Neal 1 1994 On a linear program for minimum-weight triangulation. Zbl 1311.68191Yousefi, Arman; Young, Neal E. 1 2014 On the cost of unsuccessful searches in search trees with two-way comparisons. Zbl 07433284Chrobak, Marek; Golin, Mordecai; Munro, J. Ian; Young, Neal E. 1 2021 On the cost of unsuccessful searches in search trees with two-way comparisons. Zbl 07433284Chrobak, Marek; Golin, Mordecai; Munro, J. Ian; Young, Neal E. 1 2021 Optimal search trees with 2-way comparisons. Zbl 1472.68044Chrobak, Marek; Golin, Mordecai; Munro, J. Ian; Young, Neal E. 3 2015 Approximation algorithms for the joint replenishment problem with deadlines. Zbl 1333.90015Bienkowski, Marcin; Byrka, Jarosław; Chrobak, Marek; Dobbs, Neil; Nowicki, Tomasz; Sviridenko, Maxim; Świrszcz, Grzegorz; Young, Neal E. 3 2015 On the number of iterations for Dantzig-Wolfe optimization and packing-covering approximation algorithms. Zbl 1329.68126Klein, Philip; Young, Neal E. 1 2015 A nearly linear-time PTAS for explicit fractional packing and covering linear programs. Zbl 1311.90071Koufogiannakis, Christos; Young, Neal E. 5 2014 On a linear program for minimum-weight triangulation. Zbl 1311.68191Yousefi, Arman; Young, Neal E. 1 2014 Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost. Zbl 1285.68215Koufogiannakis, Christos; Young, Neal E. 13 2013 Approximation algorithms for the joint replenishment problem with deadlines. Zbl 1336.68289Bienkowski, Marcin; Byrka, Jaroslaw; Chrobak, Marek; Dobbs, Neil; Nowicki, Tomasz; Sviridenko, Maxim; Świrszcz, Grzegorz; Young, Neal E. 2 2013 Huffman coding with letter costs: a linear-time approximation scheme. Zbl 1248.94045Golin, Mordecai J.; Mathieu, Claire; Young, Neal E. 2 2012 Distributed algorithms for covering, packing and maximum weighted matching. Zbl 1231.68276Koufogiannakis, Christos; Young, Neal E. 9 2011 Greedy \(\Delta\)-approximation algorithm for covering with arbitrary constraints and submodular cost. Zbl 1248.68561Koufogiannakis, Christos; Young, Neal E. 9 2009 Distributed fractional packing and maximum weighted b-matching via tail-recursive duality. Zbl 1261.68168Koufogiannakis, Christos; Young, Neal E. 8 2009 Distributed and parallel algorithms for weighted vertex cover and other covering problems. Zbl 1291.05160Koufogiannakis, Christos; Young, Neal E. 4 2009 Incremental medians via online bidding. Zbl 1216.90057Chrobak, Marek; Kenyon, Claire; Noga, John; Young, Neal E. 16 2008 Oblivious medians via online bidding. (Extended abstract). Zbl 1145.68583Chrobak, Marek; Kenyon, Claire; Noga, John; Young, Neal E. 5 2006 The reverse greedy algorithm for the metric k-median problem. Zbl 1184.68631Chrobak, Marek; Kenyon, Claire; Young, Neal 2 2006 Approximation algorithms for covering/packing integer programs. Zbl 1082.68128Kolliopoulos, Stavros G.; Young, Neal E. 18 2005 The reverse greedy algorithm for the metric \(K\)-median problem. Zbl 1128.90549Chrobak, Marek; Kenyon, Claire; Young, Neal E. 2 2005 Rounding algorithms for a geometric embedding of minimum multiway cut. Zbl 1082.90149Karger, David R.; Klein, Philip; Stein, Cliff; Thorup, Mikkel; Young, Neal E. 39 2004 On-line file caching. Zbl 0994.68182Young, N. E. 15 2002 Huffman coding with unequal letter costs. Zbl 1192.68899Golin, Mordecai J.; Kenyon, Claire; Young, Neal E. 3 2002 On-line paging against adversarially biased random inputs. Zbl 0971.68073Young, Neal E. 10 2000 \(K\)-medians, facility location, and the Chernoff-Wald bound. Zbl 0952.90023Young, Neal E. 7 2000 Polynomial-time approximation scheme for data broadcast. Zbl 1296.68194Kenyon, Claire; Schabanel, Nicolas; Young, Neal 4 2000 Improved bicriteria existence theorems for scheduling. Zbl 1052.90549Aslam, Javed; Rasala, April; Stein, Cliff; Young, Neal 11 1999 Rounding algorithms for a geometric embedding of minimum multiway cut. Zbl 1345.90095Karger, David R.; Klein, Philip; Stein, Cliff; Thorup, Mikkel; Young, Neal E. 10 1999 On the number of iterations for Dantzig-Wolfe optimization and packing-covering approximation algorithms. Zbl 0954.90004Klein, Philip; Young, Neal 5 1999 On-line file caching. Zbl 0930.68002Young, Neal E. 8 1998 Bounding the diffusive adversary. Zbl 0938.68913Young, Neal E. 5 1998 Data collection for the sloan digital sky survey – a network-flow heuristic. Zbl 0905.68161Lupton, Robert; Maley, F. Miller; Young, Neal 3 1998 A network-flow technique for finding low-weight bounded-degree spanning trees. Zbl 0895.68107Fekete, Sándor P.; Khuller, Samir; Klemmstein, Monika; Raghavachari, Balaji; Young, Neal 15 1997 Orienting graphs to optimize reachability. Zbl 1337.68130Hakimi, S. Louis; Schmeichel, Edward F.; Young, Neal E. 9 1997 Low-degree spanning trees of small weight. Zbl 0849.05022Khuller, Samir; Raghavachari, Balaji; Young, Neal 16 1996 A new operation on sequences: The boustrophedon transform. Zbl 0858.05007Millar, J.; Sloane, N. J. A.; Young, N. E. 15 1996 On strongly connected digraphs with bounded cycle length. Zbl 0859.05057Khuller, Samir; Raghavachari, Balaji; Young, Neal 10 1996 Data collection for the Sloan digital sky survey – a network-flow heuristic. Zbl 0845.90133Lupton, Robert; Miller Maley, F.; Young, Neal 1 1996 Prefix codes: Equiprobable words, unequal letter costs. Zbl 0876.68053Golin, Mordecai J.; Young, Neal 1 1996 Balancing minimum spanning trees and shortest-path trees. Zbl 0833.68096Khuller, S.; Raghavachari, B.; Young, N. 31 1995 Randomized rounding without solving the linear program. Zbl 0849.90100Young, Neal E. 25 1995 Approximating the minimum equivalent digraph. Zbl 0830.68100Khuller, Samir; Raghavachari, Balaji; Young, Neal 20 1995 Simple strategies for large zero-sum games with applications to complexity theory. Zbl 1345.68175Lipton, Richard J.; Young, Neal E. 15 1994 A primal-dual parallel approximation technique applied to weighted set and vertex covers. Zbl 0938.68946Khuller, Samir; Vishkin, Uzi; Young, Neal 6 1994 Designing multi-commodity flow trees. Zbl 0803.68087Khuller, Samir; Raghavachari, Balaji; Young, Neal 5 1994 Low degree spanning trees of small weight. Zbl 1345.90077Khuller, Samir; Raghavachari, Balaji; Young, Neal 4 1994 Approximate data structures with applications. Zbl 1114.68387Matias, Yossi; Vitter, Jeffrey Scott; Young, Neal E. 2 1994 Approximating the minimum equivalent digraph. Zbl 0867.05070Khuller, Samir; Raghavachari, Balaji; Young, Neal 1 1994 Balancing minimum spanning and shortest path trees. Zbl 0801.68134Khuller, Samir; Raghavachari, Balaji; Young, Neal 9 1993 A primal-dual parallel approximation technique applied to weighted set and vertex cover. Zbl 0968.68568Khuller, Samir; Vishkin, Uzi; Young, Neal 2 1993 The \(K\)-server dual and loose competitiveness for paging. Zbl 0800.68488Young, Neal 2 1992 Competitive paging algorithms. Zbl 0753.68018Fiat, Amos; Karp, Richard M.; Luby, Michael; McGeoch, Lyle A.; Sleator, Daniel D.; Young, Neal E. 64 1991 Faster parametric shortest path and minimum-balance algorithms. Zbl 0719.90087Young, Neal E.; Tarjan, Robert E.; Orlin, James B. 35 1991 On-line caching as cache size varies. Zbl 0800.68461Young, Neal 7 1991 all cited Publications top 5 cited Publications all top 5 Cited by 873 Authors 10 Chrobak, Marek 10 Young, Neal E. 8 Epstein, Leah 6 Levin, Asaf 6 Nagamochi, Hiroshi 6 Ran, Yingli 6 Zhang, Peng 6 Zhang, Zhao 5 Angel, Eric 5 Bampis, Evripidis 5 Bérczi, Kristóf 5 Buchbinder, Niv 5 Chandrasekaran, Karthekeyan 5 Nagarajan, Viswanath 5 Ravi, Ramamoorthi 4 Bienkowski, Marcin 4 Ehrenborg, Richard 4 Fiat, Amos 4 Király, Tamás 4 Könemann, Jochen 4 Naor, Joseph Seffi 4 Noga, John 4 Pilipczuk, Marcin L. 4 Ruzika, Stefan 4 Segev, Danny 4 Sgall, Jiří 4 Thielen, Clemens 4 van Stee, Rob 3 Albers, Susanne 3 Bang-Jensen, Jørgen 3 Bein, Wolfgang W. 3 Borodin, Allan B. 3 Chekuri, Chandra S. 3 Dai, Wenqiang 3 Dorrigiv, Reza 3 Dürr, Christoph 3 Elkin, Michael 3 Even, Guy 3 Folwarczný, Lukáš 3 Fotakis, Dimitris A. 3 Golin, Mordecai J. 3 Gupta, Anupam 3 Hajiaghayi, Mohammad Taghi 3 Holzhauser, Michael 3 Ibaraki, Toshihide 3 Imreh, Csanád 3 Jansen, Klaus 3 Jeż, Łukasz 3 Kaporis, Alexis C. 3 Katz, Matthew J. 3 Khuller, Samir 3 Kolliopoulos, Stavros G. 3 Koufogiannakis, Christos 3 Královič, Rastislav 3 Kratsch, Stefan 3 Krumke, Sven Oliver 3 Leonardi, Stefano 3 López-Ortiz, Alejandro 3 Makino, Kazuhisa 3 Marx, Dániel 3 McCormick, S. Thomas 3 Molinaro, Marco 3 Morsy, Ehab 3 Moruz, Gabriel 3 Munro, J. Ian 3 Nagy-György, Judit 3 Negoescu, Andrei 3 Parekh, Ojas D. 3 Raghavachari, Balaji 3 Rawitz, Dror 3 Schmid, Stefan 3 Schwartz, Roy 3 Sharan, Roded 3 Spirakis, Paul G. 3 Vygen, Jens 3 Wahlström, Magnus 3 Zhao, Liang 2 Ageev, Aleksandr Aleksandrovich 2 Andersen, Patrick John 2 Angelopoulos, Spyros 2 Armon, Amitai 2 Ashur, Stav 2 Avidor, Adi 2 Avin, Chen 2 Bar-Noy, Amotz 2 Bartal, Yair 2 Biniaz, Ahmad 2 Böhm, Martin 2 Bonomo-Braberman, Flavia 2 Bopardikar, Shaunak D. 2 Boros, Endre 2 Boyar, Joan F. 2 Burzyn, Pablo 2 Byrka, Jarosław 2 Carmi, Paz 2 Chakaravarthy, Venkatesan T. 2 Chakrabarty, Deeparnab 2 Chan, Timothy Moon-Yew 2 Chaudhuri, Kamalika 2 Chitnis, Rajesh Hemant ...and 773 more Authors all top 5 Cited in 88 Serials 50 Theoretical Computer Science 45 Algorithmica 33 Discrete Applied Mathematics 22 Journal of Combinatorial Optimization 21 Information Processing Letters 15 Mathematical Programming. Series A. Series B 14 Journal of Computer and System Sciences 14 Theory of Computing Systems 9 Operations Research Letters 8 SIAM Journal on Computing 8 Discrete & Computational Geometry 8 European Journal of Operational Research 6 Discrete Optimization 5 Discrete Mathematics 5 Information and Computation 5 Distributed Computing 5 Journal of Scheduling 5 Journal of Discrete Algorithms 4 Networks 4 Computers & Operations Research 4 SIAM Journal on Discrete Mathematics 4 Computational Geometry 3 Mathematics of Operations Research 3 Algorithms 2 Artificial Intelligence 2 Israel Journal of Mathematics 2 Physica A 2 Automatica 2 Computing 2 European Journal of Combinatorics 2 Annals of Operations Research 2 Real-Time Systems 2 International Journal of Computational Geometry & Applications 2 Games and Economic Behavior 2 Linear Algebra and its Applications 2 Mathematical Methods of Operations Research 2 Annals of Combinatorics 2 Optimization Letters 1 Acta Informatica 1 Journal of Mathematical Biology 1 Mathematical Methods in the Applied Sciences 1 Applied Mathematics and Computation 1 Journal of Applied Probability 1 Journal of Combinatorial Theory. Series A 1 Journal of Combinatorial Theory. Series B 1 Journal of Graph Theory 1 Operations Research 1 Ricerche di Matematica 1 Advances in Applied Mathematics 1 Annals of Pure and Applied Logic 1 Order 1 International Journal of Approximate Reasoning 1 Asia-Pacific Journal of Operational Research 1 Mathematical and Computer Modelling 1 SIAM Journal on Matrix Analysis and Applications 1 Journal of Parallel and Distributed Computing 1 The Annals of Applied Probability 1 Journal of Global Optimization 1 Aequationes Mathematicae 1 Elemente der Mathematik 1 ZOR. Zeitschrift für Operations Research 1 SIAM Journal on Optimization 1 Computational Complexity 1 SIAM Journal on Scientific Computing 1 The Electronic Journal of Combinatorics 1 Top 1 The Journal of Artificial Intelligence Research (JAIR) 1 INFORMS Journal on Computing 1 Mathematical Problems in Engineering 1 Doklady Mathematics 1 Soft Computing 1 RAIRO. Theoretical Informatics and Applications 1 Optimization and Engineering 1 Applied Sciences 1 Journal of Applied Mathematics and Computing 1 ACM Journal of Experimental Algorithmics 1 Acta Numerica 1 International Journal of Operations Research (Taichung) 1 Logical Methods in Computer Science 1 Discrete Mathematics, Algorithms and Applications 1 Mathematical Programming Computation 1 Science China. Information Sciences 1 RAIRO. Theoretical Informatics and Applications 1 Diskretnyĭ Analiz i Issledovanie Operatsiĭ 1 Theory of Computing 1 Journal of the Operations Research Society of China 1 Computer Science Review 1 ACM Transactions on Computation Theory all top 5 Cited in 21 Fields 297 Computer science (68-XX) 185 Operations research, mathematical programming (90-XX) 119 Combinatorics (05-XX) 35 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 7 Biology and other natural sciences (92-XX) 6 Convex and discrete geometry (52-XX) 6 Numerical analysis (65-XX) 5 Mathematical logic and foundations (03-XX) 4 Probability theory and stochastic processes (60-XX) 3 Order, lattices, ordered algebraic structures (06-XX) 3 Number theory (11-XX) 3 Linear and multilinear algebra; matrix theory (15-XX) 3 Information and communication theory, circuits (94-XX) 2 History and biography (01-XX) 2 General topology (54-XX) 2 Systems theory; control (93-XX) 1 Special functions (33-XX) 1 Functional analysis (46-XX) 1 Calculus of variations and optimal control; optimization (49-XX) 1 Statistics (62-XX) 1 Statistical mechanics, structure of matter (82-XX) Citations by Year