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.

Home

H-index

Citation

Uptrend

Activity

Longevity

Diversity

Sociability

New Star

Show all topics

502

Detlef Seese

(Professor, Institut fuer Angewandte Informatik und Formale Beschreibungsverfahren - AIFB Universitaet Karlsruhe)

H-index: 11; Papers: 34; Citation: 721
highest-cited paper: An Algebraic Theory of Graph Reduction (1993) at J. ACM(Cited By 134)
Homepage: http://www.aifb.uni-karlsruhe.de/Personen/viewPersonenglish?id_db=2

Expertise: Automata Theory / Slender Languages; Logic Programs / Algebraic Semantics; Approximation Algorithms / Perfect Graphs; Fuzzy interval data / Bayesian model choice;

503

Achi Brandt

(Prof., Department of Applied Mathematics & Computer Science The Weizmann Institute of Science)

H-index: 11; Papers: 19; Citation: 693
highest-cited paper: Fast Multiscale Image Segmentation (2000) at CVPR(Cited By 161)
Homepage: http://www.wisdom.weizmann.ac.il/~achi/

Expertise: Object Recognition / Two-View Motion Estimation; Finite element method / Error estimation; Approximation Algorithms / Perfect Graphs; Scheduling problem / Search algorithm;

506

Adele A. Rescigno

(associate professor, Dipartimento di Informatica ed Applicazioni )

H-index: 11; Papers: 24; Citation: 578
highest-cited paper: Efficient Collective Communication in Optical Networks (1996) at ICALP(Cited By 131)
Homepage: http://www.dia.unisa.it/professori/rescigno/

Expertise: Parallel Algorithms / Wormhole Networks; Approximation Algorithms / Perfect Graphs;

508

Debora Donato

(La Sapienza Universita degli Studi Roma Dipartimento di Informatica e Sistemistica)

H-index: 11; Papers: 29; Citation: 537
highest-cited paper: Finding high-quality content in social media (2008) at WSDM(Cited By 119)
Homepage: http://www.dis.uniroma1.it/~donato/

Expertise: Web Mining; XML Data; Data mining; Approximation Algorithms / Perfect Graphs;

510

Daniele Frigioni

(Associate Professor , Dip. di Ingegneria Elettrica e dell'Informazione Universit?? degli Studi di L'Aquila)

H-index: 11; Papers: 42; Citation: 519
highest-cited paper: Fully Dynamic Algorithms for Maintaining Shortest Paths Trees (2000) at J. Algorithms(Cited By -1)
Homepage: http://www.diel.univaq.it/frigioni/

Expertise: Approximation Algorithms / Perfect Graphs;

515

Jens Gustedt

(research director, Institut National de Recherche en Informatique et en Automatique)

H-index: 11; Papers: 37; Citation: 473
highest-cited paper: Efficient and Practical Modular Decomposition (1997) at SODA(Cited By 119)
Homepage: http://www.loria.fr/~gustedt/

Expertise: Approximation Algorithms / Perfect Graphs;

517

Volkan Isler

(I am an assistant professor in the Department of Computer Science at RPI. My research interests are centered on Robotics, Sensor Networks and Computer Vision)

H-index: 11; Papers: 27; Citation: 456
highest-cited paper: The sensor selection problem for bounded uncertainty sensing models (2005) at IPSN(Cited By 82)
Homepage: http://www.cs.rpi.edu/~isler/

Expertise: Mobile Robot / Hybrid Control; Object Recognition / Two-View Motion Estimation; Approximation Algorithms / Perfect Graphs; Wireless Networks / Priority Scheduling;

518

Riko Jacob

H-index: 11; Papers: 30; Citation: 453
highest-cited paper: Cache oblivious search trees via binary trees of small height (2002) at SODA(Cited By 101)
Homepage:

Expertise: Approximation Algorithms / Perfect Graphs;

521

Jun Tarui

(Department of Information and Communication Eng University of Electro-Communications )

H-index: 11; Papers: 27; Citation: 439
highest-cited paper: On ACC (1994) at Computational Complexity(Cited By 127)
Homepage: http://www.jtlab.ice.uec.ac.jp/~tarui/

Expertise: Communication Complexity / Lower Bounds; Approximation Algorithms / Perfect Graphs; Automata Theory / Slender Languages;

522

Lap Chi Lau

(Assistant Professor, Computer Science and Enginnering Chinese University of Hong Kong)

H-index: 11; Papers: 22; Citation: 430
highest-cited paper: On achieving optimal throughput with network coding (2005) at INFOCOM(Cited By 86)
Homepage: http://www.cse.cuhk.edu.hk/~chi/

Expertise: Communication Complexity / Lower Bounds; Approximation Algorithms / Perfect Graphs; Random graph / Independence number; ATM Networks;

527

Piotr Krysta

( CTAG group University of Liverpool )

H-index: 11; Papers: 29; Citation: 420
highest-cited paper: Selfish traffic allocation for server farms (2002) at STOC(Cited By 106)
Homepage: http://ls2-www.cs.uni-dortmund.de/~krysta/

Expertise: Approximation Algorithms / Perfect Graphs;

528

Xiao Zhou

(Associate Professor, Graduate School of Information Sciences Tohoku University)

H-index: 11; Papers: 59; Citation: 419
highest-cited paper: Edge-Coloring Partial k-Trees (1996) at J. Algorithms(Cited By 32)
Homepage: http://www.nishizeki.ecei.tohoku.ac.jp/nszk/zhou/

Expertise: Approximation Algorithms / Perfect Graphs;

531

Weizhao Wang

(PhD Candidate, Dept. Computer Science Illinois Institute of Technology)

H-index: 11; Papers: 36; Citation: 389
highest-cited paper: Truthful multicast routing in selfish wireless networks (2004) at MOBICOM(Cited By 81)
Homepage: http://www.iit.edu/~wangwei4/

Expertise: Wireless Networks / Priority Scheduling; Approximation Algorithms / Perfect Graphs;

535

Vincenzo Liberatore

( Electrical Engineering and Computer Science Department Case Western Reserve University )

H-index: 11; Papers: 37; Citation: 357
highest-cited paper: On Broadcast Disk Paging (2000) at SIAM J. Comput.(Cited By 39)
Homepage: http://vorlon.case.edu/~vxl11/

Expertise: Approximation Algorithms / Perfect Graphs; Web Mining;

537

Amin Coja-Oghlan

(visiting researcher Privatdozent , Department of Mathematical Sciences Carnegie Mellon University Pittsburgh Computer Science Department Humboldt-Universit?t zu Berlin)

H-index: 11; Papers: 52; Citation: 344
highest-cited paper: A spectral heuristic for bisecting random graphs (2006) at Random Struct. Algorithms(Cited By 25)
Homepage: http://web.mac.com/aminco/iWeb/Amin%20Coja-Oghlan/Start.html

Expertise: Communication Complexity / Lower Bounds; Approximation Algorithms / Perfect Graphs; Random graph / Independence number; Logic Programs / Algebraic Semantics;

540

Conrado Martinez

(Professor , Departament de Llenguatges i Sistemes Inform??tics Universitat Polit??cnica de Catalunya )

H-index: 11; Papers: 28; Citation: 329
highest-cited paper: Analysis of Hoare's FIND algorithm with Median-of-three partition (1997) at Random Struct. Algorithms(Cited By 42)
Homepage: http://www.lsi.upc.edu/~conrado/

Expertise: Approximation Algorithms / Perfect Graphs; Automata Theory / Slender Languages;

544

Hung Q. Ngo

(Associate Professor, Department of Computer Science and Engineering, SUNY at Buffalo)

H-index: 11; Papers: 34; Citation: 318
highest-cited paper: Towards a Theory of Insider Threat Assessment (2005) at DSN(Cited By 48)
Homepage: http://www.cse.buffalo.edu/~hungngo/

Expertise: Approximation Algorithms / Perfect Graphs; ATM Networks; Wireless Networks / Priority Scheduling; Mesh Generation / Two-Dimensional Unstructured Meshes;

546

Peter Sanders

H-index: 11; Papers: 27; Citation: 307
highest-cited paper: Fast Priority Queues for Cached Memory (1999) at ALENEX(Cited By 72)
Homepage:

Expertise: Approximation Algorithms / Perfect Graphs;

548

(I am now a senior lecturer the school of Computer Science and Math at Netanya Academic College and a research fellow at the Institute of Evolution at Haifa University. Before that I was a postdoc with Lior Pachter at the Math dept. and with Satish Rao at the Computer Science dept., UC Berkeley)

H-index: 11; Papers: 26; Citation: 300
highest-cited paper: Maximum likelihood of phylogenetic networks (2007) at Bioinformatics(Cited By 43)
Homepage: http://math.berkeley.edu/~ssagi/

Expertise: Data Compression / Arithmetic Coding; Approximation Algorithms / Perfect Graphs;

550

Harald Hempel

(Ernst-Abbe-Platz 3 Zimmer 3335 )

H-index: 11; Papers: 44; Citation: 293
highest-cited paper: A Downward Collapse within the Polynomial Hierarchy (1999) at CoRR(Cited By 0)
Homepage: http://www.minet.uni-jena.de/~hempel/

Expertise: Automata Theory / Slender Languages; Approximation Algorithms / Perfect Graphs;

Experts ranked by H-index.

Which ranks do you think most useful