Experts ranked by Uptrend.

Nothing can catch people's eyes more than a rising star. We use uptrend to define the rising degree of a researcher. More Information.

If you find a bug, please Email to us.

Home

H-index

Citation

Uptrend

Activity

Longevity

Diversity

Sociability

New Star

Show all topics

2

Tim Roughgarden

(Assistant professor, Computer Science andManagement Science and Engineering Departments Stanford University)

Uptrend: 13.35; 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;

5

Chandra Chekuri

(Associate Professor, Algorithms/Theory Group Department of Computer Science University of Illinois Urbana-Champaign )

Uptrend: 8.08; 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;

12

Bo Chen

(The Chinese University of Hong Kong, Hong Kong, Hong Kong The Chinese Unversity of Hong kong, Hong Kong, Hong Kong )

Uptrend: 5.58; H-index: 1; Papers: 4; Citation: 3
highest-cited paper: Extracting discriminative concepts for domain adaptation in text mining (2009) at KDD(Cited By 2)

Expertise: Combinatorial optimization problem / Linear Programming;

16

Pierre Hansen

(Professeur titulaire, Service de l'enseignement des méthodes quantitatives de gestion )

Uptrend: 5.07; 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;

27

R. Chandrasekaran

(Professor, School of Engineering and Computer Science)

Uptrend: 3.53; H-index: 8; Papers: 28; Citation: 264
highest-cited paper: Pseudomatroids (1988) at Discrete Mathematics(Cited By 58)
Homepage: http://www.utdallas.edu/~chandra/

Expertise: Combinatorial optimization problem / Linear Programming; Wireless Networks / Priority Scheduling; Dynamic Networks / Extended Abstract;

29

Rene Sitters

(Department of Mathematics and Computer Science)

Uptrend: 3.37; H-index: 9; Papers: 25; Citation: 245
highest-cited paper: The Minimum Latency Problem Is NP-Hard for Weighted Trees (2002) at IPCO(Cited By 31)
Homepage: http://www.mpi-sb.mpg.de/~sitters/

Expertise: Combinatorial optimization problem / Linear Programming; Approximation Algorithms / Perfect Graphs;

31

Florian Jarre

(Full professor,, Mathematisches Institut Lehrstuhl für Mathematische Optimierung Universitätsstraße 1)

Uptrend: 3.18; H-index: 7; Papers: 10; Citation: 223
highest-cited paper: A QMR-based interior-point algorithm for solving linear programs (1996) at Math. Program.(Cited By 66)
Homepage: http://www.opt.uni-duesseldorf.de/~jarre/en/inhalt.html

Expertise: Combinatorial optimization problem / Linear Programming;

32

Jose Maria Sigarreta

Uptrend: 3.15; H-index: 5; Papers: 10; Citation: 43
highest-cited paper: On defensive alliances and line graphs (2006) at Appl. Math. Lett.(Cited By 13)

Expertise: Combinatorial optimization problem / Linear Programming;

35

Francois Margot

(Tepper School of Business Carnegie Mellon University 5000 Forbes Ave Pittsburgh, PA 15213-3890)

Uptrend: 3.11; H-index: 9; Papers: 20; Citation: 328
highest-cited paper: An algorithmic framework for convex mixed integer nonlinear programs (2008) at Discrete Optimization(Cited By 95)
Homepage: http://wpweb2.tepper.cmu.edu/fmargot/index.html

Expertise: Combinatorial optimization problem / Linear Programming; Convex Polygons / Planar Arrangements;

42

Bobby Bhattacharjee

(Associate Professor , Department of Computer Science Institute for Advanced Computer Studies Department of Electrical and Computer Engineering (affiliate) University of Maryland)

Uptrend: 2.91; 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;

49

Satoru Fujishige

(Professor, Research Institute for Mathematical Sciences Kyoto University )

Uptrend: 2.59; H-index: 12; Papers: 42; Citation: 675
highest-cited paper: A combinatorial strongly polynomial algorithm for minimizing submodular functions (2001) at J. ACM(Cited By 215)
Homepage: http://www.kurims.kyoto-u.ac.jp/~fujishig/

Expertise: Combinatorial optimization problem / Linear Programming; Approximation Algorithms / Perfect Graphs;

Experts ranked by Uptrend.

Which ranks do you think most useful