Experts ranked by Total Citation Number.

1 Clifford Stein (Professor , IEOR Columbia University)
	H-index: 28; Papers: 45; Citation: 66081   highest-cited paper: Introduction to Algorithms, Second Edition (2001) (Cited By 32) Homepage: http://www.columbia.edu/~cs2035/
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Combinatorial optimization problem / Linear Programming;

2 Eva Tardos (Professor, Department of Computer Science)
	H-index: 42; Papers: 97; Citation: 8818   highest-cited paper: How bad is selfish routing? (2002) at J. ACM(Cited By 904) Homepage: http://www.cs.cornell.edu/home/eva/eva.html
Expertise: Communication Complexity / Lower Bounds;   Combinatorial optimization problem / Linear Programming;   Mechanism design / Learning Stochastic Finite Automata;   Random graph / Independence number;

3 Andrew V. Goldberg (Microsoft Research )
	H-index: 38; Papers: 86; Citation: 7456   highest-cited paper: A new approach to the maximum-flow problem (1988) at J. ACM(Cited By 1198) Homepage: http://www.avglab.com/andrew/
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Combinatorial optimization problem / Linear Programming;   Dynamic Networks / Extended Abstract;

4 Joseph Naor
	H-index: 40; Papers: 155; Citation: 6233   highest-cited paper: Small-Bias Probability Spaces: Efficient Constructions and Applications (1993) at SIAM J. Comput.(Cited By 454) Homepage: http://www.citidel.org/?op=getobj&identifier=people.P149286
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   ATM Networks;   Combinatorial optimization problem / Linear Programming;

5 Nimrod Megiddo (IBM Almaden Research Center)
	H-index: 34; Papers: 91; Citation: 6106   highest-cited paper: Linear-Time Algorithms for Linear Programming in R^3 and Related Problems (1982) at FOCS(Cited By 560) Homepage: http://theory.stanford.edu/~megiddo/
Expertise: Communication Complexity / Lower Bounds;   Approximation Algorithms / Perfect Graphs;   Combinatorial optimization problem / Linear Programming;   Machine Learning;

6 Fred Glover
	H-index: 12; Papers: 17; Citation: 5765   highest-cited paper: Tabu Search - Part II (1990) at INFORMS Journal on Computing(Cited By 3223) Homepage:
Expertise: Scheduling problem / Search algorithm;   Combinatorial optimization problem / Linear Programming;

7 Michel X. Goemans (Professor , MIT Department of Mathematics Cambridge )
	H-index: 34; Papers: 79; Citation: 5658   highest-cited paper: Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming (1995) at J. ACM(Cited By 1499) Homepage: http://math.mit.edu/~goemans/
Expertise: Combinatorial optimization problem / Linear Programming;   Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Random graph / Independence number;   ATM Networks;

8 David B. Shmoys (Professor , department of computer science)
	H-index: 28; Papers: 75; Citation: 5172   highest-cited paper: Approximation Algorithms for Scheduling Unrelated Parallel Machines (1990) at Math. Program.(Cited By 450) Homepage: http://www.cs.cornell.edu/annual_report/99-00/Shmoys.htm
Expertise: Communication Complexity / Lower Bounds;   Approximation Algorithms / Perfect Graphs;   Combinatorial optimization problem / Linear Programming;   Dynamic Networks / Extended Abstract;

9 Arjen K. Lenstra (Professor , Lucent Technologies and Department of Mathematics and Computing Science Eindhoven University of Technology)
	H-index: 34; Papers: 76; Citation: 4968   highest-cited paper: Selecting Cryptographic Key Sizes (2001) at J. Cryptology(Cited By 736) Homepage: http://www.win.tue.nl/~klenstra/
Expertise: Signature Schemes / Authenticated Key Exchange Secure;   Communication Complexity / Lower Bounds;   Combinatorial optimization problem / Linear Programming;

10 Tim Roughgarden (Assistant professor, Computer Science andManagement Science and Engineering Departments Stanford University)
	H-index: 26; Papers: 64; Citation: 4934   highest-cited paper: How bad is selfish routing? (2002) at J. ACM(Cited By 904) Homepage: http://theory.stanford.edu/~tim/
Expertise: Communication Complexity / Lower Bounds;   Mechanism design / Learning Stochastic Finite Automata;   Combinatorial optimization problem / Linear Programming;

11 Said Hanafi
	H-index: 5; Papers: 13; Citation: 4623   highest-cited paper: Tabu search and finite convergence (2002) at Discrete Applied Mathematics(Cited By 4694)
Expertise: Scheduling problem / Search algorithm;   Combinatorial optimization problem / Linear Programming;

12 Chandra Chekuri (Associate Professor, Algorithms/Theory Group Department of Computer Science University of Illinois Urbana-Champaign )
	H-index: 36; Papers: 100; Citation: 4133   highest-cited paper: Incremental Clustering and Dynamic Information Retrieval (2004) at SIAM J. Comput.(Cited By 269) Homepage: http://www.cs.uiuc.edu/homes/chekuri/
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Combinatorial optimization problem / Linear Programming;   Channel state information / Universal coding;

13 Santosh Vempala (Department of Mathematics MIT Cambridge)
	H-index: 39; Papers: 109; Citation: 3822   highest-cited paper: Fast monte-carlo algorithms for finding low-rank approximations (2004) at J. ACM(Cited By 222) Homepage: http://www-math.mit.edu/~vempala/
Expertise: Communication Complexity / Lower Bounds;   Combinatorial optimization problem / Linear Programming;

14 Pierre Hansen (Professeur titulaire, Service de l'enseignement des méthodes quantitatives de gestion )
	H-index: 27; Papers: 99; Citation: 3618   highest-cited paper: Variable neighborhood search (1997) at Computers OR(Cited By 843) Homepage: http://www.hec.ca/profs/pierre.hansen.html
Expertise: Combinatorial optimization problem / Linear Programming;   Random graph / Independence number;   Chemical Structure / Molecular graph;   Scheduling problem / Search algorithm;

15 Bobby Bhattacharjee (Associate Professor , Department of Computer Science Institute for Advanced Computer Studies Department of Electrical and Computer Engineering (affiliate) University of Maryland)
	H-index: 19; Papers: 53; Citation: 3408   highest-cited paper: Scalable application layer multicast (2002) at SIGCOMM(Cited By 1451) Homepage: http://www.cs.umd.edu/~bobby/
Expertise: Combinatorial optimization problem / Linear Programming;   Mechanism design / Learning Stochastic Finite Automata;   Knowledge-based data analysis / Medical Costs;   Gene Expression Analysis / Data Clustering;

16 Michel Gendreau (Chercheur Researcher , Centre de recherche sur les transports Universit?? de Montr??al)
	H-index: 29; Papers: 93; Citation: 3372   highest-cited paper: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows (1997) at Short Topics in System Administration(Cited By 416) Homepage: http://www.crt.umontreal.ca/~michelg/
Expertise: Scheduling problem / Search algorithm;   Combinatorial optimization problem / Linear Programming;   Constraint Programming / Combinatorial Search Problems;

17 Egon Balas ( Professor, Operations Research)
	H-index: 18; Papers: 44; Citation: 3334   highest-cited paper: Integer Programming (2009) at Encyclopedia of Optimization(Cited By 1) Homepage: http://www.math.cmu.edu/people/fac/balas.html
Expertise: Combinatorial optimization problem / Linear Programming;

18 Jong-Shi Pang (Professor, Department of Mathematical Sciences Johns Hopkins University)
	H-index: 16; Papers: 29; Citation: 3293   highest-cited paper: Finite-Dimensional Variational Inequality and Nonlinear Complementarity Problems: A Survey of Theory, Algorithms and Applications (1990) at Math. Program.(Cited By 1285) Homepage: http://www.networkchinese.com/preserved-docs/university/jhopkins/jspang.html
Expertise: Combinatorial optimization problem / Linear Programming;   Mobile Robot / Hybrid Control;

19 Olvi L. Mangasarian ( Professor , Computer Sciences Department University of Wisconsin )
	H-index: 26; Papers: 43; Citation: 3179   highest-cited paper: Multicategory Proximal Support Vector Machine Classifiers (2005) at Machine Learning(Cited By 367) Homepage: http://pages.cs.wisc.edu/~olvi/
Expertise: Combinatorial optimization problem / Linear Programming;

20 Paolo Toth (Professor, University of Bologna)
	H-index: 20; Papers: 44; Citation: 2930   highest-cited paper: The Granular Tabu Search and Its Application to the Vehicle-Routing Problem (2003) at INFORMS Journal on Computing(Cited By 780) Homepage: http://www.or.deis.unibo.it/toth.html
Expertise: Combinatorial optimization problem / Linear Programming;

21 Jack Edmonds (Univ. of Waterloo, Dept. of Combinatorics & Optimization)
	H-index: 6; Papers: 14; Citation: 2865   highest-cited paper: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems (2001) at Combinatorial Optimization(Cited By 1060) Homepage: http://fano.ics.uci.edu/cites/Author/Jack-Edmonds.html
Expertise: Combinatorial optimization problem / Linear Programming;   Random graph / Independence number;

22 Xiaotie Deng (Professor (Chair) of Computer Science, Department of Computer Science City University of Hong Kong)
	H-index: 27; Papers: 202; Citation: 2859   highest-cited paper: Settling the Complexity of Two-Player Nash Equilibrium (2006) at FOCS(Cited By 258) Homepage: http://www.cs.cityu.edu.hk/~deng/
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Signature Schemes / Authenticated Key Exchange Secure;   Combinatorial optimization problem / Linear Programming;   Mechanism design / Learning Stochastic Finite Automata;

23 Christoph Meinel (Scientific Director , Hasso-Plattner-Institut for IT-Systems Engineering (HPI). )
	H-index: 27; Papers: 330; Citation: 2834   highest-cited paper: Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications (1998) (Cited By 198) Homepage: http://www.hpi.uni-potsdam.de/meinel/biography.html
Expertise: Combinatorial optimization problem / Linear Programming;   Automata Theory / Slender Languages;   Database Systems / Programming Languages;   Learning Environment / Web Site;   Der Informatik / Zur Bedeutung von Modellen;

24 Selim G. Akl (professor , Queen's University School of Computing)
	H-index: 28; Papers: 178; Citation: 2760   highest-cited paper: Cryptographic Solution to a Problem of Access Control in a Hierarchy (1983) at ACM Trans. Comput. Syst.(Cited By 333) Homepage: http://www.cs.queensu.ca/~akl/
Expertise: Combinatorial optimization problem / Linear Programming;   Binary code / Error detection;   Mechanism design / Learning Stochastic Finite Automata;   E-learning Support System / Neural Networks;

25 Gerhard Reinelt (Universitaet Heidelberg)
	H-index: 13; Papers: 37; Citation: 2649   highest-cited paper: TSPLIB - A Traveling Salesman Problem Library (1991) at INFORMS Journal on Computing(Cited By 1023) Homepage: http://roso.epfl.ch/ismp97/ismp_pers2_308.html
Expertise: Combinatorial optimization problem / Linear Programming;   Convex Polygons / Planar Arrangements;

26 Daniele Vigo (Chair Address: Univ. of Bologna, DEIS, Viale Risorgimento 2, Bologna, 40136 , Italy)
	H-index: 16; Papers: 27; Citation: 2644   highest-cited paper: The Granular Tabu Search and Its Application to the Vehicle-Routing Problem (2003) at INFORMS Journal on Computing(Cited By 780) Homepage: http://www.informs.org/Conf/DAL97/TALKS/C14.html
Expertise: Combinatorial optimization problem / Linear Programming;   Scheduling problem / Search algorithm;

27 Martin Grotschel (Konrad-Zuse-Zentrum f??r Informationstechnik Berlin (ZIB) Technische Universit?t Berlin DFG-Forschungszentrum Matheon "Mathematik f??r Schl??sseltechnologien" Technische Universit?t Berlin Institut f??r Mathematik )
	H-index: 11; Papers: 27; Citation: 2532   highest-cited paper: George Dantzig's contributions to integer programming (2008) at Discrete Optimization(Cited By 3) Homepage: http://www.zib.de/groetschel/
Expertise: Combinatorial optimization problem / Linear Programming;   Random graph / Independence number;   Approximation Algorithms / Perfect Graphs;   Digital government / Case Study;   Convex Polygons / Planar Arrangements;

28 Helmut Seidl (professor, Institut für Informatik, I2 Technische Universität München )
	H-index: 31; Papers: 113; Citation: 2399   highest-cited paper: Deciding Equivalence of Finite Tree Automata (1990) at SIAM J. Comput.(Cited By 125) Homepage: http://www2.in.tum.de/~seidl/
Expertise: Automata Theory / Slender Languages;   Functional Programming / Binding-Time Analysis;   Combinatorial optimization problem / Linear Programming;   Logic Programs / Algebraic Semantics;   Theorem Proving / General-Purpose Automated Reasoning;

29 Zhi-Quan Luo (Professor, Dept of ECE University of Minnesota)
	H-index: 23; Papers: 54; Citation: 2197   highest-cited paper: Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints (1996) at Math. Program.(Cited By 845) Homepage: http://www.ece.umn.edu/~luozq/
Expertise: Channel state information / Universal coding;   Wireless Networks / Cellular Systems;   Combinatorial optimization problem / Linear Programming;

30 Yinyu Ye (Professor, Management Science and Engineering Electrical Engineering Industrial Affiliates Program, MS&E)
	H-index: 26; Papers: 82; Citation: 2135   highest-cited paper: An O(n3L) potential reduction algorithm for linear programming (1991) at Math. Program.(Cited By 185) Homepage: http://www.stanford.edu/~yyye/
Expertise: Combinatorial optimization problem / Linear Programming;   Mechanism design / Learning Stochastic Finite Automata;   Communication Complexity / Lower Bounds;

31 Laurent El Ghaoui (Associate Professor, Department of Electrical Engineering and Computer Sciences )
	H-index: 13; Papers: 29; Citation: 2113   highest-cited paper: Learning the Kernel Matrix with Semidefinite Programming (2004) at Journal of Machine Learning Research(Cited By 775) Homepage: http://www.eecs.berkeley.edu/~elghaoui/
Expertise: Machine Learning;   Optimal control;   Wireless Networks;   Wireless Networks / Algorithmic Complexity;   Combinatorial optimization problem / Linear Programming;

32 Andras Prekopa (Professor, Rutgers University)
	H-index: 9; Papers: 18; Citation: 2094   highest-cited paper: Static Stochastic Programming Models: Conditional Expectations (2009) at Encyclopedia of Optimization(Cited By 664) Homepage: http://rutcor.rutgers.edu/~prekopa/
Expertise: Combinatorial optimization problem / Linear Programming;

33 Martin Skutella (professor, Institut für Mathematik, Sekr. MA 5-2 Technische Universität Berlin )
	H-index: 27; Papers: 66; Citation: 1863   highest-cited paper: Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates (1999) at FOCS(Cited By 130) Homepage: http://www.math.tu-berlin.de/coga/people/skutella/index.xhtml
Expertise: Approximation Algorithms / Perfect Graphs;   Combinatorial optimization problem / Linear Programming;   Genetic algorithm / Evolutionary Multi-objective Optimization;

34 Vasek Chvatal (Canada Research Chair , Department of Computer Science and Software Engineering Concordia University)
	H-index: 16; Papers: 34; Citation: 1781   highest-cited paper: Many Hard Examples for Resolution (1988) at J. ACM(Cited By 359) Homepage: www.cs.concordia.ca/~chvatal/
Expertise: Random graph / Independence number;   Combinatorial optimization problem / Linear Programming;

35 Lisa Fleischer (Associate Professor, Computer Science Dartmouth )
	H-index: 25; Papers: 45; Citation: 1686   highest-cited paper: A combinatorial strongly polynomial algorithm for minimizing submodular functions (2001) at J. ACM(Cited By 215) Homepage: http://www.cs.dartmouth.edu/~lkf/
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Combinatorial optimization problem / Linear Programming;

36 Xin Chen
	H-index: 4; Papers: 8; Citation: 1685   highest-cited paper: TRANSFAC: an integrated system for gene expression regulation (2000) at Nucleic Acids Research(Cited By 1376) Homepage:
Expertise: Combinatorial optimization problem / Linear Programming;   Neural Networks;

37 Stephen P. Boyd (Professor, Information Systems Laboratory, Department of Electrical Engineering, Stanford University)
	H-index: 19; Papers: 38; Citation: 1663   highest-cited paper: Simultaneous routing and resource allocation via dual decomposition (2004) at IEEE Transactions on Communications(Cited By 243) Homepage: http://www.stanford.edu/~boyd/
Expertise: Power optimization / Synchronous Sequential Circuits;   Channel state information / Universal coding;   Machine Learning;   Combinatorial optimization problem / Linear Programming;   Sensor Networks / Outdoor wireless;   Optimal control;

38 Cynthia A. Phillips (Sandia National Laboratories)
	H-index: 18; Papers: 38; Citation: 1654   highest-cited paper: A Graph-based System for Network-vulnerability Analysis (1998) at Workshop on New Security Paradigms(Cited By 272) Homepage: http://www.cs.sandia.gov/~caphill/
Expertise: Approximation Algorithms / Perfect Graphs;   Data Compression / Arithmetic Coding;   Communication Complexity / Lower Bounds;   Combinatorial optimization problem / Linear Programming;   Security Views / New Denial;   Control system / Neural Networks;

39 Endre Boros ( State University of New Jersey)
	H-index: 19; Papers: 115; Citation: 1650   highest-cited paper: Pseudo-Boolean optimization (2002) at Discrete Applied Mathematics(Cited By 210) Homepage: http://rutcor.rutgers.edu/~boros/
Expertise: Approximation Algorithms / Perfect Graphs;   Combinatorial optimization problem / Linear Programming;   Random graph / Independence number;   Constraint Programming / Combinatorial Search Problems;   Finite Sets / New Designs;

40 Komei Fukuda (Institute for Operations Research)
	H-index: 16; Papers: 43; Citation: 1647   highest-cited paper: Reverse Search for Enumeration (1996) at Discrete Applied Mathematics(Cited By 376) Homepage: http://www.ifor.math.ethz.ch/~fukuda/
Expertise: Convex Polygons / Planar Arrangements;   Random graph / Independence number;   Combinatorial optimization problem / Linear Programming;

42 T. C. Edwin Cheng
	H-index: 20; Papers: 142; Citation: 1628   highest-cited paper: A concise survey of scheduling with time-dependent processing times (2004) at European Journal of Operational Research(Cited By 165)
Expertise: Scheduling problem / Search algorithm;   Combinatorial optimization problem / Linear Programming;   Random graph / Independence number;

43 Maxim Sviridenko ( postdoc , IBM T. J. Watson Research Center )
	H-index: 22; Papers: 88; Citation: 1614   highest-cited paper: Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates (1999) at FOCS(Cited By 130) Homepage: http://www.research.ibm.com/people/s/sviri/sviridenko.html
Expertise: Combinatorial optimization problem / Linear Programming;   Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;

44 Petra Mutzel
	H-index: 24; Papers: 89; Citation: 1507   highest-cited paper: A Linear Time Implementation of SPQR-Trees (2000) at Graph Drawing(Cited By 76) Homepage: http://www.ads.tuwien.ac.at/people/Mutzel.html
Expertise: Convex Polygons / Planar Arrangements;   Combinatorial optimization problem / Linear Programming;   Data Compression / Arithmetic Coding;

45 Philippe L. Toint (Director , Department of Mathematics The University of Namur (FUNDP))
	H-index: 14; Papers: 22; Citation: 1488   highest-cited paper: CUTE: Constrained and Unconstrained Testing Environment (1995) at ACM Trans. Math. Softw.(Cited By 479) Homepage: http://perso.fundp.ac.be/~phtoint/
Expertise: Combinatorial optimization problem / Linear Programming;

46 Fred Glover
	H-index: 20; Papers: 58; Citation: 1468   highest-cited paper: Genetic algorithms and tabu search: Hybrids for optimization (1995) at Computers OR(Cited By 203) Homepage: http://spot.colorado.edu/~glover/
Expertise: Scheduling problem / Search algorithm;   Combinatorial optimization problem / Linear Programming;   Simulation system / Manufacturing Systems;

47 Frank K. Hwang (Department of Statistics, Tsinghua(Chinghua) University)
	H-index: 20; Papers: 158; Citation: 1429   highest-cited paper: A Proof of the Gilbert-Pollak Conjecture on the Steiner Ratio (1992) at Algorithmica(Cited By 162) Homepage: http://www.ctr.nctu.edu.tw/lee_mti/member/Mathematical/FrankKHwang.htm
Expertise: Finite Sets / New Designs;   Combinatorial optimization problem / Linear Programming;   Random graph / Independence number;

48 David S. Cohen
	H-index: 2; Papers: 2; Citation: 1420   highest-cited paper: Feature extraction from faces using deformable templates (1992) at International Journal of Computer Vision(Cited By 1394)
Expertise: Combinatorial optimization problem / Linear Programming;   Object Recognition / Two-View Motion Estimation;

50 Andrea Lodi (consultant)
	H-index: 17; Papers: 61; Citation: 1418   highest-cited paper: Two-dimensional packing problems: A survey (2002) at European Journal of Operational Research(Cited By 254) Homepage: http://www-micro.deis.unibo.it/cgi-bin/user?lodi
Expertise: Combinatorial optimization problem / Linear Programming;   Constraint Programming / Combinatorial Search Problems;   Reconfigurable Hardware;