Experts ranked by H-index.


An expert has index h if h of his or her N papers have at least h citations each, and the other (N - h) papers have at most h citations each. More Information.

If you find a bug, please Email to us.

Show all topics
251 A. Panconesi (Full Professor)
H-index: 28; Papers: 87; Citation: 2828  
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Web Mining   Dynamic Networks / Extended Abstract  
252 C. Thomassen (Professor, Institut for Matematik Danmarks Tekniske Universitet )
H-index: 28; Papers: 103; Citation: 2818  
Homepage: http://www2.mat.dtu.dk/people/dk?id=34
Expertise: Random graph / Independence number   Approximation Algorithms / Perfect Graphs  
253 C. Scheideler (Assistant Professor, Department of Computer Science Johns Hopkins University )
H-index: 28; Papers: 114; Citation: 2166  
Homepage: http://www.cs.jhu.edu/~scheideler/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Dynamic Networks / Extended Abstract  
254 Andreas Schulz (Professor, Massachusetts Institute of Technology)
H-index: 28; Papers: 76; Citation: 2075  
Homepage: http://web.mit.edu/schulz/
Expertise: Approximation Algorithms / Perfect Graphs   Combinatorial optimization problem / Linear Programming   Molecular geometries / Order rate equation   Coordination model / Applications Track Editorial  
255 Lisa Zhang (Member of Technical Staff, Algorithms Research at Bell Laboratories, Lucent Technologies Bell Labs)
H-index: 28; Papers: 74; Citation: 1906  
Homepage: http://www.cs.bell-labs.com/who/ylz/
Expertise: Communication Complexity / Lower Bounds   ATM Networks   Approximation Algorithms / Perfect Graphs  
256 A. L. Buchsbaum (Member of Technical Staff, Member of Technical Staff)
H-index: 28; Papers: 51; Citation: 1719  
Homepage: http://adambuchsbaum.com/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs  
257 M. Fredman
H-index: 27; Papers: 52; Citation: 8293  
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs  
258 Robert Sedgewick (Professor, Department of Computer Science Princeton University)
H-index: 27; Papers: 64; Citation: 4307  
Homepage: http://www.cs.princeton.edu/~rs/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Computer / Systems   Convex Polygons / Planar Arrangements  
259 B. A. Reed (Canada Research Chair in Graph Theory School of Computer Science McGill University )
H-index: 27; Papers: 117; Citation: 3983  
Homepage: http://cgm.cs.mcgill.ca/~breed/
Expertise: Communication Complexity / Lower Bounds   Random graph / Independence number   Approximation Algorithms / Perfect Graphs   Combinatorial optimization problem / Linear Programming  
260 Jan Leeuwen (Professor of Computer Science, Department of Information&computing Sciences)
H-index: 27; Papers: 112; Citation: 3958  
Homepage: http://www.cs.uu.nl/~jan/
Expertise: Communication Complexity / Lower Bounds   Parallel Algorithm / Optimal Edge Search   Approximation Algorithms / Perfect Graphs   Automata Theory / Slender Languages   Finite Languages / Database Queries   Database Systems / Programming Languages  
261 R. El-Yaniv (Associate professor, Computer Science Department Technion - Israel Institute of Technology)
H-index: 27; Papers: 62; Citation: 3936  
Homepage: http://www.cs.technion.ac.il/~rani/main.html
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Dynamic Networks / Extended Abstract   Machine Learning  
262 E. Gafni (Computer Science Department UCLA )
H-index: 27; Papers: 92; Citation: 2982  
Homepage: http://www.cs.ucla.edu/~eli/eli.html
Expertise: Approximation Algorithms / Perfect Graphs   Dynamic Networks / Extended Abstract  
263 Guoliang Xue (Professor, Department of Computer Science and Engineering Arizona State University)
H-index: 27; Papers: 150; Citation: 2929  
Homepage: http://optimization.asu.edu/~xue/
Expertise: ATM Networks   Approximation Algorithms / Perfect Graphs   Wireless Networks / Priority Scheduling  
264 Nicole Immorlica (Assistant Professor, Northwestern University,)
H-index: 27; Papers: 60; Citation: 2803  
Homepage: http://www.ece.northwestern.edu/~nickle/
Expertise: Mechanism design / Learning Stochastic Finite Automata   Communication Complexity / Lower Bounds   ATM Networks   Approximation Algorithms / Perfect Graphs  
265 Henning Fernau (Prof. Dr., Theoretische Informatik, Universität Trier)
H-index: 27; Papers: 192; Citation: 2754  
Homepage: http://www.uni-trier.de/?id=6697
Expertise: Mechanism design / Learning Stochastic Finite Automata   Approximation Algorithms / Perfect Graphs   Automata Theory / Slender Languages  
266 O. Waarts
H-index: 27; Papers: 40; Citation: 2504  
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Dynamic Networks / Extended Abstract  
267 P. Flocchini (Professor,University Research Chair , School of Information Technology and Engineering (SITE) University of Ottawa )
H-index: 27; Papers: 132; Citation: 2494  
Homepage: http://www.site.uottawa.ca/~flocchin/
Expertise: Approximation Algorithms / Perfect Graphs   Dynamic Networks / Extended Abstract  
268 D. Z. Chen (Professor, Department of Computer Science and Engineering University of Notre Dame )
H-index: 27; Papers: 196; Citation: 2482  
Homepage: http://www.cse.nd.edu/~dchen
Expertise: Approximation Algorithms / Perfect Graphs   Power optimization / Synchronous Sequential Circuits   Convex Polygons / Planar Arrangements  
269 Bermond Jean-Claude (Head of MASCOTTE, CNRS, INRIA, UNS INRIA Sophia Antipolis and I3S laboratory )
H-index: 27; Papers: 93; Citation: 2401  
Homepage: http://www-sop.inria.fr/mascotte/Jean-Claude.Bermond/
Expertise: Random graph / Independence number   Approximation Algorithms / Perfect Graphs   Reutilisation de l / Une application   Dynamic Networks / Extended Abstract   Parallel Algorithms / Wormhole Networks  
270 Y. Aumann (Senior Lecturer, Bar-Ilan University, department of Computer Science)
H-index: 27; Papers: 77; Citation: 2340  
Homepage: http://www.cs.biu.ac.il/~aumann/yonatan_aumann.htm
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Data Compression / Arithmetic Coding   Data mining   Dynamic Networks / Extended Abstract   Signature Schemes / Authenticated Key Exchange Secure  
271 Michael Kaufmann (Professor, Wilhelm-Schickard-Institut für Informatik Universität Tübingen)
H-index: 27; Papers: 131; Citation: 2222  
Homepage: http://www-pr.informatik.uni-tuebingen.de/~mk/
Expertise: Expression data / Microarray experiment   Approximation Algorithms / Perfect Graphs   Convex Polygons / Planar Arrangements  
272 Guy Even (Professor, School of Electrical Engineering - Systems Tel-Aviv University)
H-index: 27; Papers: 90; Citation: 2203  
Homepage: http://www.eng.tau.ac.il/~guy/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Chip Design / Analog Systems   Logic Networks / Fault Simulation  
273 Steve Kremer (LSV)
H-index: 27; Papers: 57; Citation: 2172  
Homepage: http://www.lsv.ens-cachan.fr/~kremer/
Expertise: Approximation Algorithms / Perfect Graphs   Theorem Proving / General-Purpose Automated Reasoning   Logic Programs / Algebraic Semantics   Signature Schemes / Authenticated Key Exchange Secure   Security Views / New Denial  
274 Refael Hassin (Department of Statistics and Operations Research Tel Aviv University)
H-index: 27; Papers: 113; Citation: 2099  
Homepage: http://www.math.tau.ac.il/~hassin/
Expertise: Approximation Algorithms / Perfect Graphs   Combinatorial optimization problem / Linear Programming  
275 P. Jacquet (Research Director, scientific leader of HIPERCOM research team , INRIA, computer science )
H-index: 27; Papers: 83; Citation: 2097  
Homepage: http://hipercom.inria.fr/~jacquet/Jacquet.htm
Expertise: Wireless network / End-to-end Routing Behavior   Channel state information / Universal coding   Approximation Algorithms / Perfect Graphs   Wireless Networks / Priority Scheduling  
276 Jason D. Hartline (Assistant Professor, CAA - Computing, Algorithms & Applications )
H-index: 27; Papers: 49; Citation: 2053  
Homepage: http://www.eecs.northwestern.edu/myprofile/userprofile/hartline.html
Expertise: Mechanism design / Learning Stochastic Finite Automata   Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs  
277 Ioannis Z. Emiris (Professor, Lab of Geometric & Algebraic Algorithms Department of Informatics & Telecommunications National Kapodistrian University of Athens)
H-index: 27; Papers: 78; Citation: 2048  
Homepage: http://cgi.di.uoa.gr/~emiris/index-eng.html
Expertise: Approximation Algorithms / Perfect Graphs   Traditional method / Burgers equation   Convex Polygons / Planar Arrangements  
278 Michael A. Langston (Professor, Department of Computer Science University of Tennessee)
H-index: 27; Papers: 97; Citation: 2005  
Homepage: http://www.cs.utk.edu/~langston/
Expertise: Parallel Algorithm / Optimal Edge Search   Approximation Algorithms / Perfect Graphs   Programming Language / Multiprogramming System  
279 Daniel Dominic Sleator (Professor, Department of Computer Science Carnegie Mellon University)
H-index: 26; Papers: 36; Citation: 10947  
Homepage: http://www.cs.cmu.edu/~sleator/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs  
280 Eugene W. Myers (Group leader, new Janelia Farm Research Campus of the Howard Hughes Medical Institute)
H-index: 26; Papers: 68; Citation: 5419  
Homepage: http://research.janelia.org/myers/
Expertise: Expression data / Microarray experiment   Approximation Algorithms / Perfect Graphs   Data Compression / Arithmetic Coding   DNA sequence / ENZYME database   Functional Programming / Binding-Time Analysis  
281 E. Koutsoupias (Professor, University of Athens Dept. of Informatics and Telecommunications)
H-index: 26; Papers: 65; Citation: 5363  
Homepage: http://cgi.di.uoa.gr/~elias/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Dynamic Networks / Extended Abstract  
282 Tatsuya Akutsu (Professor, Bioinformatics Center Institute for Chemical Research Kyoto University)
H-index: 26; Papers: 145; Citation: 3632  
Homepage: http://www.bic.kyoto-u.ac.jp/takutsu/members/takutsu/
Expertise: Gene Expression Analysis / Data Clustering   Parallel Algorithm / Optimal Edge Search   Expression data / Microarray experiment   Approximation Algorithms / Perfect Graphs   Data Compression / Arithmetic Coding  
283 Ting Chen (Associate Professor, Computer Science and Mathematics University of Southern California )
H-index: 26; Papers: 45; Citation: 3589  
Homepage: http://www.cmb.usc.edu/people/tingchen/
Expertise: Approximation Algorithms / Perfect Graphs   Data Compression / Arithmetic Coding  
284 G. Calinescu (Research associate, Computer Science Department Illinois Institute of Technology)
H-index: 26; Papers: 71; Citation: 3392  
Homepage: http://www.cs.iit.edu/~calinesc/
Expertise: Approximation Algorithms / Perfect Graphs   Wireless Networks / Priority Scheduling  
285 G. Gutin (Professor)
H-index: 26; Papers: 190; Citation: 3329  
Homepage: http://www.cs.rhul.ac.uk/~gutin/
Expertise: Random graph / Independence number   Wireless Networks / Algorithmic Complexity   Scheduling problem / Search algorithm   Approximation Algorithms / Perfect Graphs   Combinatorial optimization problem / Linear Programming   Genetic algorithm / Evolutionary Multi-objective Optimization  
286 Kamesh Munagala (Associate Professor, Computer Science Duke University)
H-index: 26; Papers: 74; Citation: 3192  
Homepage: http://www.cs.duke.edu/~kamesh/
Expertise: Wireless network / End-to-end Routing Behavior   Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   XML Data  
287 F. F. Yao (Principal Scientist, Department of Computer Science City University of Hong Kong)
H-index: 26; Papers: 62; Citation: 3191  
Homepage: http://www.cityu.edu.hk/cityu/about/professors/fse-cs-fyao.htm
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Wireless Networks / Priority Scheduling   Convex Polygons / Planar Arrangements  
288 S. S. Ravi (Professor, Computer Science Department, LI 67A University at Albany - State University of New York )
H-index: 26; Papers: 106; Citation: 3101  
Homepage: http://www.cs.albany.edu/FacultyStaff/profiles/ravi.htm
Expertise: Approximation Algorithms / Perfect Graphs   Wireless Networks / Priority Scheduling   Data mining  
289 Giovanni Manzini (Professor, computer science University of "Piemonte Orientale" (Eastern Piedmont))
H-index: 26; Papers: 70; Citation: 2958  
Homepage: http://www.mfn.unipmn.it/~manzini/
Expertise: Approximation Algorithms / Perfect Graphs   Automata Theory / Slender Languages  
290 Endre Boros (State University of New Jersey)
H-index: 26; Papers: 143; Citation: 2856  
Homepage: http://rutcor.rutgers.edu/~boros/
Expertise: Random graph / Independence number   Approximation Algorithms / Perfect Graphs   Combinatorial optimization problem / Linear Programming   Constraint Programming / Combinatorial Search Problems   Finite Sets / New Designs  
291 Siu-Ming Yiu (Assistant Professor, Department of computer science University of Hong Kong)
H-index: 26; Papers: 166; Citation: 2670  
Homepage: http://www.cs.hku.hk/people/profile.jsp?teacher=smyiu
Expertise: Gene Expression Analysis / Data Clustering   Approximation Algorithms / Perfect Graphs   Signature Schemes / Authenticated Key Exchange Secure   Control System / Data Security   Data Mining / Query Processing  
292 U. Brandes (Full Professor, Department of Computer & Information Science, University of Konstanz Department of Mathematics & Computer Science, University of Passau)
H-index: 26; Papers: 106; Citation: 2667  
Homepage: http://www.inf.uni-konstanz.de/~brandes/
Expertise: Approximation Algorithms / Perfect Graphs   Convex Polygons / Planar Arrangements  
293 Harry B. Hunt III (Professor, Computer Science Department University at Albany)
H-index: 26; Papers: 101; Citation: 2498  
Homepage: http://www.cs.albany.edu/FacultyStaff/profiles/hunt.htm
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Finite Languages / Database Queries  
294 K. Iwama (Professor, Department of Communications and Computer Engineering School of Informatics Kyoto University)
H-index: 26; Papers: 185; Citation: 2393  
Homepage: http://www.lab2.kuis.kyoto-u.ac.jp/~iwama/souran-e.html
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Automata Theory / Slender Languages  
295 R. N. Wright (Professor Deputy Director, Department of Computer Science DIMACS Rutgers University)
H-index: 26; Papers: 71; Citation: 2348  
Homepage: http://www.cs.rutgers.edu/~rebecca.wright/
Expertise: Approximation Algorithms / Perfect Graphs   Data mining   Dynamic Networks / Extended Abstract   Signature Schemes / Authenticated Key Exchange Secure   Security Views / New Denial  
296 J. Spinrad (Associate Professor, Computer Science Vanderbilt University)
H-index: 26; Papers: 69; Citation: 2230  
Homepage: http://www.vuse.vanderbilt.edu/~spin/persinfo.html
Expertise: Random graph / Independence number   Approximation Algorithms / Perfect Graphs  
297 Kunihiko Sadakane (Associate Professor, Department of Computer Science and Communication Engineering Faculty of Information Science and Electrical Engineering)
H-index: 26; Papers: 85; Citation: 2215  
Homepage: http://tcslab.csce.kyushu-u.ac.jp/~sada/
Expertise: Approximation Algorithms / Perfect Graphs   Data Compression / Arithmetic Coding  
298 Peter Rossmanith (Lehrgebiet Theoretische Informatik)
H-index: 26; Papers: 85; Citation: 2123  
Homepage: http://www-lti.informatik.rwth-aachen.de/~rossmani/
Expertise: Approximation Algorithms / Perfect Graphs   Automata Theory / Slender Languages  
299 Sotiris Nikoletseas (Faculty Member, Computer Engineering and Informatics Department of Patras University )
H-index: 26; Papers: 165; Citation: 2096  
Homepage: http://www.cti.gr/RD1/nikole/index.html
Expertise: Sensor Networks / Outdoor wireless   Approximation Algorithms / Perfect Graphs   Wireless Networks / Priority Scheduling   Dynamic Networks / Extended Abstract   Legal Information Systems / Knowledge System Design  
300 Judit Bar-Ilan (Professor, Department of Information Science, Bar-Ilan University)
H-index: 26; Papers: 72; Citation: 2060  
Homepage: http://www.biu.ac.il/faculty/Judit/
Expertise: Approximation Algorithms / Perfect Graphs   Information Retrieval / Probabilistic Indexing   Dynamic Networks / Extended Abstract  
Give us feedbacks: feedback@arnetminer.org.