Experts ranked by H-index.

1 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 887) 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;

2 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 455) 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;

3 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 219) Homepage: http://www-math.mit.edu/~vempala/
Expertise: Communication Complexity / Lower Bounds;   Combinatorial optimization problem / Linear Programming;

4 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 1184) Homepage: http://www.avglab.com/andrew/
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Combinatorial optimization problem / Linear Programming;   Dynamic Networks / Extended Abstract;

5 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 272) 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;

6 Nimrod Megiddo
	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;

7 Michel X. Goemans (Member , 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 1478) 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 Arjen K. Lenstra ( part-time professor , cryptology Technische Universiteit Eindhoven)
	H-index: 34; Papers: 76; Citation: 4968   highest-cited paper: Selecting Cryptographic Key Sizes (2001) at J. Cryptology(Cited By 726) Homepage: http://www.win.tue.nl/~klenstra/
Expertise: Signature Schemes / Authenticated Key Exchange Secure;   Communication Complexity / Lower Bounds;   Combinatorial optimization problem / Linear Programming;

9 Helmut Seidl
	H-index: 31; Papers: 113; Citation: 2399   highest-cited paper: Deciding Equivalence of Finite Tree Automata (1990) at SIAM J. Comput.(Cited By 120) 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;

10 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 407) Homepage: http://www.crt.umontreal.ca/~michelg/
Expertise: Scheduling problem / Search algorithm;   Combinatorial optimization problem / Linear Programming;   Constraint Programming / Combinatorial Search Problems;

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

12 David B. Shmoys (Professor )
	H-index: 28; Papers: 75; Citation: 5172   highest-cited paper: Approximation Algorithms for Scheduling Unrelated Parallel Machines (1990) at Math. Program.(Cited By 440) 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;

13 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 328) 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;

14 Pierre Hansen (Professeur titulaire)
	H-index: 27; Papers: 99; Citation: 3618   highest-cited paper: Variable neighborhood search (1997) at Computers OR(Cited By 815) 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 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 254) 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;

16 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 195) 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;

17 Martin Skutella (Universit?t Dortmund Fachbereich Mathematik Lehrstuhl f??r Diskrete Optimierung )
	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 127) Homepage: http://www.mathematik.uni-dortmund.de/~skutella/
Expertise: Approximation Algorithms / Perfect Graphs;   Combinatorial optimization problem / Linear Programming;   Genetic algorithm / Evolutionary Multi-objective Optimization;

18 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 887) Homepage: http://theory.stanford.edu/~tim/
Expertise: Communication Complexity / Lower Bounds;   Mechanism design / Learning Stochastic Finite Automata;   Combinatorial optimization problem / Linear Programming;

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 354) Homepage: http://pages.cs.wisc.edu/~olvi/
Expertise: Combinatorial optimization problem / Linear Programming;

20 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;

21 Lisa Fleischer (IBM TJ Watson Research Center)
	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 206) Homepage: http://www.cs.cornell.edu/courses/cs789/2005sp/Lisa_Fleischer.htm
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Combinatorial optimization problem / Linear Programming;

23 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 74) Homepage: http://www.ads.tuwien.ac.at/people/Mutzel.html
Expertise: Convex Polygons / Planar Arrangements;   Combinatorial optimization problem / Linear Programming;   Data Compression / Arithmetic Coding;

24 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 830) Homepage: http://www.ece.umn.edu/~luozq/
Expertise: Channel state information / Universal coding;   Wireless Networks / Cellular Systems;   Combinatorial optimization problem / Linear Programming;

25 Bernd Sturmfels (Professor , Dept. of Mathematics University of California Berkeley)
	H-index: 23; Papers: 55; Citation: 1330   highest-cited paper: Minimizing Polynomial Functions (2001) at Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science(Cited By 172) Homepage: http://math.berkeley.edu/~bernd/
Expertise: Finite Sets / New Designs;   Combinatorial optimization problem / Linear Programming;   Traditional method / Burgers equation;   Convex Polygons / Planar Arrangements;   Data Compression / Arithmetic Coding;

26 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 127) 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;

27 Refael Hassin (Department of Statistics and Operations Research Tel Aviv University )
	H-index: 21; Papers: 100; Citation: 1182   highest-cited paper: The Scheduling of Maintenance Service (1998) at Discrete Applied Mathematics(Cited By 67) Homepage: http://www.math.tau.ac.il/~hassin/
Expertise: Approximation Algorithms / Perfect Graphs;   Combinatorial optimization problem / Linear Programming;   Scheduling problem / Search algorithm;

28 Paolo Toth
	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 758) Homepage: http://www.or.deis.unibo.it/toth.html
Expertise: Combinatorial optimization problem / Linear Programming;

29 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 164)
Expertise: Scheduling problem / Search algorithm;   Combinatorial optimization problem / Linear Programming;   Random graph / Independence number;

30 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 200) Homepage: http://spot.colorado.edu/~glover/
Expertise: Scheduling problem / Search algorithm;   Combinatorial optimization problem / Linear Programming;   Simulation system / Manufacturing Systems;

31 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 161) 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;

32 Gregory B. Sorkin (Research staff member, Watson Research Center (Yorktown))
	H-index: 20; Papers: 43; Citation: 1251   highest-cited paper: Gadgets, Approximation, and Linear Programming (2000) at SIAM J. Comput.(Cited By 157) Homepage: http://domino.research.ibm.com/comm/research_people.nsf/pages/sorkin.index.html
Expertise: Communication Complexity / Lower Bounds;   Approximation Algorithms / Perfect Graphs;   Random graph / Independence number;   Combinatorial optimization problem / Linear Programming;

33 Alain Hertz (Professor, D??partement de Math??matiques et de g??nie industriel )
	H-index: 20; Papers: 72; Citation: 1198   highest-cited paper: The Tabu Search Metaheuristic: How we used it (1990) at Ann. Math. Artif. Intell.(Cited By 119) Homepage: http://www.gerad.ca/~alainh/
Expertise: Combinatorial optimization problem / Linear Programming;   Random graph / Independence number;   Scheduling problem / Search algorithm;   Constraint Programming / Combinatorial Search Problems;

34 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 1438) 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;

35 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 241) 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;

36 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 205) 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;

37 Ellis L. Johnson (Professor, Georgia Institute of Technology)
	H-index: 19; Papers: 44; Citation: 1354   highest-cited paper: Matching: A Well-Solved Class of Integer Linear Programs (2001) at Combinatorial Optimization(Cited By 208) Homepage: http://www.nae.edu/nae/naepub.nsf/Members+By+UNID/0A5419551295DC4485256937005460E6?opendocument
Expertise: Combinatorial optimization problem / Linear Programming;   Performance Management / Capacity Planning;   Simulation system / Manufacturing Systems;   Scheduling problem / Search algorithm;

38 Kazuhisa Makino (Department of Mathematical Informatics University of Tokyo )
	H-index: 19; Papers: 101; Citation: 1281   highest-cited paper: New Results on Monotone Dualization and Generating Hypergraph Transversals (2003) at SIAM J. Comput.(Cited By 76) Homepage: http://www.misojiro.t.u-tokyo.ac.jp/~makino/makinoe.html
Expertise: Approximation Algorithms / Perfect Graphs;   Combinatorial optimization problem / Linear Programming;   Default Logic / Description Logics;

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

40 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 265) 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;

41 Jean-Francois Cordeau (Professeur, la Côte-Sainte-Catherine)
	H-index: 18; Papers: 28; Citation: 1183   highest-cited paper: A Survey of Optimization Models for Train Routing and Scheduling (1998) at Short Topics in System Administration(Cited By 223) Homepage: http://www.hec.ca/profs/jean-francois.cordeau.html
Expertise: Scheduling problem / Search algorithm;   Combinatorial optimization problem / Linear Programming;

43 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 248) Homepage: http://www-micro.deis.unibo.it/cgi-bin/user?lodi
Expertise: Combinatorial optimization problem / Linear Programming;   Constraint Programming / Combinatorial Search Problems;   Reconfigurable Hardware;

44 Giuseppe Lancia (Associate Professor of Operations Research, Dipartimento di Matematica e Informatica )
	H-index: 17; Papers: 34; Citation: 1030   highest-cited paper: A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees (1999) at SIAM J. Comput.(Cited By 122) Homepage: http://www.dimi.uniud.it/lancia/
Expertise: Data Compression / Arithmetic Coding;   Combinatorial optimization problem / Linear Programming;   Approximation Algorithms / Perfect Graphs;

45 Hans-Jurgen Bandelt
	H-index: 17; Papers: 41; Citation: 965   highest-cited paper: Distance-hereditary graphs (1986) at J. Comb. Theory, Ser. B(Cited By 217) Homepage: http://www.fluxus-engineering.com/fluxe00h.htm
Expertise: Random graph / Independence number;   Combinatorial optimization problem / Linear Programming;

46 Franz Rendl ( Professor , University of Klagenfurt)
	H-index: 17; Papers: 29; Citation: 898   highest-cited paper: Semidefinite Programming Relaxations for the Quadratic Assignment Problem (1998) at J. Comb. Optim.(Cited By 130) Homepage: http://web.mit.edu/orc/www/seminars/2004f/bios/Rendl_bio.htm
Expertise: Combinatorial optimization problem / Linear Programming;

47 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 1273) Homepage: http://www.networkchinese.com/preserved-docs/university/jhopkins/jspang.html
Expertise: Combinatorial optimization problem / Linear Programming;   Mobile Robot / Hybrid Control;

48 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 758) Homepage: http://www.informs.org/Conf/DAL97/TALKS/C14.html
Expertise: Combinatorial optimization problem / Linear Programming;   Scheduling problem / Search algorithm;

49 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 363) Homepage: www.cs.concordia.ca/~chvatal/
Expertise: Random graph / Independence number;   Combinatorial optimization problem / Linear Programming;

50 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 363) Homepage: http://www.ifor.math.ethz.ch/~fukuda/
Expertise: Convex Polygons / Planar Arrangements;   Random graph / Independence number;   Combinatorial optimization problem / Linear Programming;