Experts ranked by Activity.

1 Haim Kaplan (School of Computer Science Tel Aviv University )
	Activity: 19.05; H-index: 36; Papers: 148; Citation: 4475   highest-cited paper: A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals (1999) at SIAM J. Comput.(Cited By 261) Homepage: http://www.cs.tau.ac.il/~haimk/
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Convex Polygons / Planar Arrangements;   Wireless network / End-to-end Routing Behavior;   Data Compression / Arithmetic Coding;

2 Xuemin Lin (Professor , School of Computer Science and Engineering University of New South Wales )
	Activity: 16.29; H-index: 21; Papers: 107; Citation: 1652   highest-cited paper: Efficient Computation of the Skyline Cube (2005) at VLDB(Cited By 155) Homepage: http://www.cse.unsw.edu.au/~lxue/
Expertise: XML Data;   Data Mining / Query Processing;   Fuzzy approach / Random set;   Convex Polygons / Planar Arrangements;

3 Micha Sharir (Professor, Tel Aviv University)
	Activity: 15.96; H-index: 66; Papers: 411; Citation: 14231   highest-cited paper: Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons (1987) at Algorithmica(Cited By 381) Homepage: http://www.math.tau.ac.il/~michas/
Expertise: Convex Polygons / Planar Arrangements;

4 Ke Yi (Assistant Professor, Department of Computer Science and Engineering Hong Kong University of Science and Technology)
	Activity: 14.62; H-index: 14; Papers: 35; Citation: 591   highest-cited paper: The priority R-tree: A practically efficient and worst-case optimal R-tree (2008) at ACM Transactions on Algorithms(Cited By 71) Homepage: http://www.cse.ust.hk/~yike/
Expertise: XML Data;   Approximation Algorithms / Perfect Graphs;   Convex Polygons / Planar Arrangements;

5 Mihai Patrascu (PhD student , MIT)
	Activity: 13.22; H-index: 16; Papers: 46; Citation: 579   highest-cited paper: Time-space trade-offs for predecessor search (2006) at STOC(Cited By 49) Homepage: http://web.mit.edu/~mip/www/numbers.html
Expertise: Communication Complexity / Lower Bounds;   Approximation Algorithms / Perfect Graphs;   Convex Polygons / Planar Arrangements;

6 Sajal K. Das (Professor, Department of Computer Science and Engineering University Texas at Arlington )
	Activity: 12.68; H-index: 32; Papers: 381; Citation: 4528   highest-cited paper: WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks (2002) at Cluster Computing(Cited By 583) Homepage: http://www-cse.uta.edu/~das/
Expertise: Wireless Networks / Priority Scheduling;   Convex Polygons / Planar Arrangements;   Approximation Algorithms / Perfect Graphs;

7 Hiroshi Nagamochi (Professor , Department of Applied Mathematics and Physics Graduate School of Informatics Kyoto University )
	Activity: 12.35; H-index: 18; Papers: 157; Citation: 1638   highest-cited paper: Computing Edge-Connectivity in Multiple and Capacitated Graphs (1990) at SIGAL International Symposium on Algorithms(Cited By 278) Homepage: http://www-or.amp.i.kyoto-u.ac.jp/~nag/index-e.html
Expertise: Approximation Algorithms / Perfect Graphs;   Convex Polygons / Planar Arrangements;

8 Amit Sahai (Associate Professor of Computer Science , Center for Information and Computation Security )
	Activity: 12.09; H-index: 38; Papers: 87; Citation: 5304   highest-cited paper: On the (Im)possibility of Obfuscating Programs (2001) at CRYPTO(Cited By 434) Homepage: http://www.cs.ucla.edu/~sahai/
Expertise: Signature Schemes / Authenticated Key Exchange Secure;   Communication Complexity / Lower Bounds;   Convex Polygons / Planar Arrangements;

9 Michael T. Goodrich (Director, Department of Computer Science University of California )
	Activity: 11.83; H-index: 42; Papers: 226; Citation: 5759   highest-cited paper: External-Memory Graph Algorithms (1995) at SODA(Cited By 291) Homepage: http://www.ics.uci.edu/~goodrich/
Expertise: Convex Polygons / Planar Arrangements;   Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Security Views / New Denial;

10 Gautam Das (Associate Professor and Head, Database Exploration Laboratory (DBXLAB) Computer Science and Engineering Department University of Texas at Arlington )
	Activity: 11.65; H-index: 31; Papers: 82; Citation: 3572   highest-cited paper: Rule Discovery from Time Series (1998) at KDD(Cited By 456) Homepage: http://ranger.uta.edu/~gdas/
Expertise: Convex Polygons / Planar Arrangements;   XML Data;   Data mining;   Approximation Algorithms / Perfect Graphs;

12 Joachim Gudmundsson (postdoc in computational geometry , computational geometry Faculty of Mathematics and Computing Science Eindhoven)
	Activity: 11.05; H-index: 19; Papers: 109; Citation: 1213   highest-cited paper: Constructing Plane Spanners of Bounded Degree and Low Weight (2005) at Algorithmica(Cited By 57) Homepage: http://www.win.tue.nl/~hgudmund/
Expertise: Convex Polygons / Planar Arrangements;   Approximation Algorithms / Perfect Graphs;   Spatial data;

13 Mohammad Taghi Hajiaghayi (Senior Researcher , Algorithms and Theoretical Computer Science group AT&T Labs - Research)
	Activity: 11.02; H-index: 28; Papers: 87; Citation: 1927   highest-cited paper: Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks (2006) at Wireless Networks(Cited By 136) Homepage: http://www.mit.edu/~hajiagha/
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Convex Polygons / Planar Arrangements;   Random graph / Independence number;

14 Ming C. Lin (Professor)
	Activity: 10.96; H-index: 41; Papers: 144; Citation: 6554   highest-cited paper: OBBTree: A Hierarchical Structure for Rapid Interference Detection (1996) at SIGGRAPH(Cited By -1) Homepage: http://www.cs.unc.edu/~lin/
Expertise: Interactive Visualization / Computer graphics;   Virtual Environments;   Convex Polygons / Planar Arrangements;   Mobile Robot / Hybrid Control;

15 Khaled M. Elbassioni (Max-Planck-Institut für Informatik Department 1:Algorithms and Complexity)
	Activity: 10.41; H-index: 14; Papers: 75; Citation: 600   highest-cited paper: Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities (2002) at SIAM J. Comput.(Cited By 52) Homepage: http://www.mpi-inf.mpg.de/~elbassio/
Expertise: Approximation Algorithms / Perfect Graphs;   Convex Polygons / Planar Arrangements;

16 Christian Sohler (Junior professor assistant professor, Heinz Nixdorf Institut Universit?0?1t Paderborn)
	Activity: 10.14; H-index: 17; Papers: 51; Citation: 741   highest-cited paper: Encoding a triangulation as a permutation of its point set (1997) at CCCG(Cited By 63) Homepage: http://www.uni-paderborn.de/cs/csohler.html
Expertise: Convex Polygons / Planar Arrangements;   Communication Complexity / Lower Bounds;   Approximation Algorithms / Perfect Graphs;

17 Csaba D. Toth (Instructor, Applied Mathematics Massachusetts Institute of Technology )
	Activity: 10.10; H-index: 14; Papers: 78; Citation: 625   highest-cited paper: Selfish Load Balancing and Atomic Congestion Games (2007) at Algorithmica(Cited By 80) Homepage: http://www-math.mit.edu/~toth/
Expertise: Convex Polygons / Planar Arrangements;   Random graph / Independence number;

18 Paz Carmi (Ph.D)
	Activity: 10.00; H-index: 9; Papers: 45; Citation: 213   highest-cited paper: Private Approximation of Search Problems (2008) at SIAM J. Comput.(Cited By 19) Homepage: http://www.cs.bgu.ac.il/faculty/person/carmip
Expertise: Convex Polygons / Planar Arrangements;   Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;

19 Adrian Dumitrescu (Associate Professor, Computer Science University of Wisconsin-Milwaukee)
	Activity: 9.83; H-index: 12; Papers: 77; Citation: 415   highest-cited paper: Approximation algorithms for TSP with neighborhoods in the plane (2001) at SODA(Cited By 60) Homepage: http://www.cs.uwm.edu/faculty/ad/
Expertise: Convex Polygons / Planar Arrangements;   Approximation Algorithms / Perfect Graphs;

20 MohammadTaghi Hajiaghayi (Senior Researcher , Member, AT&T Labs - Research)
	Activity: 9.46; H-index: 9; Papers: 28; Citation: 419   highest-cited paper: Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks (2006) at Wireless Networks(Cited By 136) Homepage: http://www.mit.edu/~hajiagha/
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Convex Polygons / Planar Arrangements;

21 Bettina Speckmann (assistant professor member, Algorithms group Department of Mathematics and Computer Science Department of Mathematics and Computer Science of the Technical University of Eindhoven)
	Activity: 9.03; H-index: 17; Papers: 58; Citation: 776   highest-cited paper: Kinetic Collision Detection for Simple Polygons (2002) at Int. J. Comput. Geometry Appl.(Cited By 89) Homepage: http://www.win.tue.nl/~speckman/
Expertise: Convex Polygons / Planar Arrangements;

22 Janos Pach (Professor, Computer Science,Electrical Engineering)
	Activity: 8.77; H-index: 30; Papers: 162; Citation: 3075   highest-cited paper: How to draw a planar graph on a grid (1990) at Combinatorica(Cited By 328) Homepage: http://www1.ccny.cuny.edu/prospective/engineering/faculty/JanosPach.cfm
Expertise: Convex Polygons / Planar Arrangements;   Random graph / Independence number;   Finite Sets / New Designs;   Communication Complexity / Lower Bounds;

23 Andrzej Lingas (Professor of Computer Science, Computer Science Lund University)
	Activity: 8.70; H-index: 25; Papers: 167; Citation: 1494   highest-cited paper: The Power of Non-Rectilinear Holes (1982) at ICALP(Cited By 92) Homepage: http://www.cs.lth.se/home/Andrzej_Lingas/
Expertise: Approximation Algorithms / Perfect Graphs;   Convex Polygons / Planar Arrangements;   Communication Complexity / Lower Bounds;

24 Anil Maheshwari (Professor)
	Activity: 8.58; H-index: 19; Papers: 101; Citation: 1090   highest-cited paper: Approximating Weighted Shortest Paths on Polyhedral Surfaces (1997) at Symposium on Computational Geometry(Cited By 106) Homepage: http://www.scs.carleton.ca/people/people.php?Name=Anil+Maheshwari
Expertise: Approximation Algorithms / Perfect Graphs;   Convex Polygons / Planar Arrangements;   Information Systems / Case Study;

25 Joseph S. B. Mitchell (Professor , State University of New York at Stony Brook )
	Activity: 8.46; H-index: 41; Papers: 198; Citation: 6192   highest-cited paper: Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs (1998) at IEEE Trans. Vis. Comput. Graph.(Cited By 614) Homepage: http://www.ams.sunysb.edu/~jsbm
Expertise: Convex Polygons / Planar Arrangements;   Approximation Algorithms / Perfect Graphs;   Interactive Visualization / Computer graphics;   Communication Complexity / Lower Bounds;

26 Ilan Newman (professor , CS dept. of Haifa University)
	Activity: 7.83; H-index: 24; Papers: 80; Citation: 1347   highest-cited paper: Regular Languages are Testable with a Constant Number of Queries (2000) at SIAM J. Comput.(Cited By 102) Homepage: http://cs.haifa.ac.il/~ilan/
Expertise: Communication Complexity / Lower Bounds;   Convex Polygons / Planar Arrangements;   Approximation Algorithms / Perfect Graphs;

27 Artur Czumaj (Associate Professor , Department of Computer Science University of Warwick )
	Activity: 7.70; H-index: 21; Papers: 98; Citation: 2235   highest-cited paper: Tight bounds for worst-case equilibria (2007) at ACM Transactions on Algorithms(Cited By 267) Homepage: http://web.njit.edu/~czumaj/
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Convex Polygons / Planar Arrangements;   Mechanism design / Learning Stochastic Finite Automata;

28 Jie Gao (1415 Computer Science Building Stony Brook University)
	Activity: 7.68; H-index: 22; Papers: 47; Citation: 2139   highest-cited paper: Locating and Bypassing Holes in Sensor Networks (2006) at MONET(Cited By 310) Homepage: http://www.cs.sunysb.edu/~jgao/
Expertise: ATM Networks;   Sensor Networks / Outdoor wireless;   Convex Polygons / Planar Arrangements;

30 Elad Verbin (The School of Computer Science)
	Activity: 7.42; H-index: 8; Papers: 20; Citation: 155   highest-cited paper: Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals (2003) at CPM(Cited By 26) Homepage: http://www.cs.tau.ac.il/~eladv/
Expertise: Data Compression / Arithmetic Coding;   Convex Polygons / Planar Arrangements;   XML Data;   Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;

31 Alexander Wolff (Faculty of Computer Science Karlsruhe University )
	Activity: 7.37; H-index: 11; Papers: 57; Citation: 586   highest-cited paper: Point Set Labeling with Sliding Labels (1998) at Symposium on Computational Geometry(Cited By 91) Homepage: http://i11www.ilkd.uni-karlsruhe.de/~awolff/
Expertise: Convex Polygons / Planar Arrangements;

32 Liam Roditty (School of Computer Science)
	Activity: 7.32; H-index: 12; Papers: 26; Citation: 464   highest-cited paper: On nash equilibria for a network creation game (2006) at SODA(Cited By 74) Homepage: http://www.cs.tau.ac.il/~liamr/
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Convex Polygons / Planar Arrangements;

33 Christian Knauer (Freie Universit?0?1t Berlin Institute of Computer Science )
	Activity: 7.29; H-index: 11; Papers: 69; Citation: 418   highest-cited paper: Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems (2008) at Algorithmica(Cited By 42) Homepage: http://www.inf.fu-berlin.de/inst/ag-ti/members/knauer.en.html
Expertise: Convex Polygons / Planar Arrangements;   Approximation Algorithms / Perfect Graphs;

34 Sariel Har-Peled (Nonvisiting Nonassistant Associate Professor, Computer Science UIUC )
	Activity: 7.18; H-index: 36; Papers: 121; Citation: 3545   highest-cited paper: Approximate clustering via core-sets (2002) at STOC(Cited By 169) Homepage: http://www.uiuc.edu/~sariel/
Expertise: Convex Polygons / Planar Arrangements;   Machine Learning;

35 Yajun Wang (Department of Computer Science and Engineering The Hong Kong University of Science and Technology)
	Activity: 7.10; H-index: 8; Papers: 23; Citation: 137   highest-cited paper: Querying Approximate Shortest Paths in Anisotropic Regions. (2010) at SIAM J. Comput.(Cited By 17) Homepage: http://www.cs.ust.hk/~yalding/
Expertise: Approximation Algorithms / Perfect Graphs;   Convex Polygons / Planar Arrangements;   Pneumatic System / Control Systems Design;   ATM Networks;   Automata Theory / Slender Languages;

36 Fabrizio Frati (Dipartimento di Informatica e Automazione Universita' Roma Tre)
	Activity: 6.90; H-index: 9; Papers: 27; Citation: 142   highest-cited paper: Embedding Graphs Simultaneously with Fixed Edges (2006) at Graph Drawing(Cited By 18) Homepage: http://www.dia.uniroma3.it/~compunet/www/view/person.php?id=frati
Expertise: Convex Polygons / Planar Arrangements;

37 Hyeon-Suk Na (Assistant Professor , School of Computing )
	Activity: 6.89; H-index: 10; Papers: 29; Citation: 209   highest-cited paper: The Expected Number of 3D Visibility Events Is Linear (2003) at SIAM J. Comput.(Cited By 24) Homepage: http://acm.ssu.ac.kr/~hsnaa/
Expertise: Convex Polygons / Planar Arrangements;

38 Jean Cardinal (Algorithms Research Group Computer Science Dept.)
	Activity: 6.78; H-index: 10; Papers: 56; Citation: 316   highest-cited paper: Fast fractal compression of greyscale images (2001) at IEEE Transactions on Image Processing(Cited By 28) Homepage: http://www.ulb.ac.be/di/algo/jcardin/
Expertise: Approximation Algorithms / Perfect Graphs;   Convex Polygons / Planar Arrangements;   Wavelet image coding / Video compression;   Scalable video coding / Rate control;   Wireless Networks / Algorithmic Complexity;

39 Mohammad Ali Abam
	Activity: 6.64; H-index: 4; Papers: 18; Citation: 47   highest-cited paper: Region-Fault Tolerant Geometric Spanners (2009) at Discrete Computational Geometry(Cited By 9)
Expertise: Convex Polygons / Planar Arrangements;

40 Yusu Wang (Assistant Professor, Computer Science and Engineering The Ohio State University 487 Dreese Lab)
	Activity: 6.64; H-index: 14; Papers: 32; Citation: 491   highest-cited paper: Extreme Elevation on a 2-Manifold (2006) at Discrete Computational Geometry(Cited By 66) Homepage: http://www.cse.ohio-state.edu/~yusu/
Expertise: Convex Polygons / Planar Arrangements;   Power optimization / Synchronous Sequential Circuits;

41 Jinhui Xu (Associate Professor , Department of Computer Science and Engineering University)
	Activity: 6.60; H-index: 9; Papers: 77; Citation: 386   highest-cited paper: Maximizing throughput for optical burst switching networks (2007) at IEEE/ACM Trans. Netw.(Cited By 50) Homepage: http://www.cse.buffalo.edu/~jinhui/
Expertise: Approximation Algorithms / Perfect Graphs;   Convex Polygons / Planar Arrangements;   Image Registration / MR Images;   Grid Computing;   ATM Networks;   Search Technology / News Brief;

42 Jiri Matousek (Department of Applied Mathematics )
	Activity: 6.58; H-index: 37; Papers: 154; Citation: 4779   highest-cited paper: A Subexponential Bound for Linear Programming (1996) at Algorithmica(Cited By 244) Homepage: http://kam.mff.cuni.cz/~matousek/
Expertise: Convex Polygons / Planar Arrangements;   Random graph / Independence number;   Communication Complexity / Lower Bounds;

43 Kevin Buchin (Universiteit Utrecht)
	Activity: 6.56; H-index: 5; Papers: 31; Citation: 72   highest-cited paper: Polychromatic Colorings of Plane Graphs. (2009) at Discrete & Computational Geometry(Cited By 8) Homepage: http://people.cs.uu.nl/buchin/
Expertise: Convex Polygons / Planar Arrangements;

44 Telikepalli Kavitha
	Activity: 6.54; H-index: 12; Papers: 42; Citation: 420   highest-cited paper: A Faster Algorithm for Minimum Cycle Basis of Graphs (2004) at ICALP(Cited By 51)
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Convex Polygons / Planar Arrangements;

45 Oswin Aichholzer (associate professor , Institute for Software Technology, Graz University of Technology)
	Activity: 6.54; H-index: 20; Papers: 74; Citation: 1204   highest-cited paper: A Novel Type of Skeleton for Polygons (1995) at J. UCS(Cited By 102) Homepage: http://www.ist.tugraz.at/staff/aichholzer/
Expertise: Convex Polygons / Planar Arrangements;

46 Sergio Cabello ( Faculty of Mathematics and Physics University of Ljubljana )
	Activity: 6.45; H-index: 13; Papers: 40; Citation: 394   highest-cited paper: Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs (2007) at Discrete Computational Geometry(Cited By 38) Homepage: http://www.fmf.uni-lj.si/~cabello/
Expertise: Convex Polygons / Planar Arrangements;

47 Norbert Zeh (Assistant Professor, Faculty of Computer Science Dalhousie University )
	Activity: 6.44; H-index: 16; Papers: 48; Citation: 553   highest-cited paper: An external memory data structure for shortest path queries (2003) at Discrete Applied Mathematics(Cited By 51) Homepage: http://users.cs.dal.ca/~nzeh/
Expertise: Approximation Algorithms / Perfect Graphs;   Convex Polygons / Planar Arrangements;

48 Antoine Vigneron (researcher, Applied Mathematics and Informatics Department of INRA)
	Activity: 6.37; H-index: 12; Papers: 31; Citation: 305   highest-cited paper: The Voronoi Diagram of Curved Objects (2005) at Discrete Computational Geometry(Cited By 68) Homepage: http://w3.jouy.inra.fr/unites/miaj/public/vigneron/
Expertise: Convex Polygons / Planar Arrangements;

49 Thomas Erlebach (Reader in Algorithms , Department of Computer Science University of Leicester)
	Activity: 6.37; H-index: 20; Papers: 82; Citation: 1549   highest-cited paper: Computing the types of the relationships between autonomous systems (2007) at IEEE/ACM Trans. Netw.(Cited By 153) Homepage: http://www.cs.le.ac.uk/~te17/
Expertise: Approximation Algorithms / Perfect Graphs;   Convex Polygons / Planar Arrangements;

50 Assaf Naor (Courant Institute of Mathematical Sciences New York University)
	Activity: 6.22; H-index: 19; Papers: 46; Citation: 1026   highest-cited paper: Measured Descent: A New Embedding Method for Finite Metrics (2004) at FOCS(Cited By 99) Homepage: http://www.cims.nyu.edu/~naor/
Expertise: Convex Polygons / Planar Arrangements;