| The Hausdorff Core Problem On Simple Polygons | 0 | 0.34 | 2014 |
| A Uniform Paradigm to Succinctly Encode Various Families of Trees. | 20 | 0.74 | 2014 |
| Algorithms in the Ultra-Wide Word Model. | 0 | 0.34 | 2014 |
| Compact navigation and distance oracles for graphs with small treewidth | 4 | 0.41 | 2014 |
| Entropy-Bounded Representation of Point Grids | 5 | 0.40 | 2014 |
| On the hierarchy of distribution-sensitive properties for data structures | 1 | 0.35 | 2013 |
| Succinct encoding of arbitrary graphs | 11 | 0.50 | 2013 |
| A priority queue with the time-finger property | 2 | 0.35 | 2012 |
| Succinct indices for range queries with applications to orthogonal range maxima | 5 | 0.42 | 2012 |
| A unifying property for distribution-sensitive priority queues | 3 | 0.40 | 2011 |
| Compact representation of posets | 3 | 0.39 | 2011 |
| Succinct representation of dynamic trees | 6 | 0.45 | 2011 |
| Priority Queues with Multiple Time Fingers | 0 | 0.34 | 2010 |
| Universal Succinct Representations of Trees? | 14 | 0.62 | 2009 |
| Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance | 1 | 0.40 | 2009 |
| Succinct Representations of Arbitrary Graphs | 21 | 0.75 | 2008 |
| A Uniform Approach Towards Succinct Representation of Trees | 25 | 1.04 | 2008 |
| Evaluation of General Set Expressions | 0 | 0.34 | 2008 |
| Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull | 0 | 0.34 | 2007 |
| On the complexity of finding an unknown cut via vertex queries | 4 | 0.52 | 2007 |
| Succinct representation of finite abelian groups | 2 | 0.39 | 2006 |
| Worst case optimal union-intersection expression evaluation | 7 | 0.50 | 2005 |
| Cache-oblivious comparison-based algorithms on multisets | 2 | 0.42 | 2005 |
| A rule-based approach to farsi language text-to-phoneme conversion | 0 | 0.34 | 2000 |
