| Publication | Date of Publication | Type |
|---|
| The Hausdorff core problem on simple polygons | 2017-03-09 | Paper |
Succinct representation of finite abelian groups
Proceedings of the 2006 international symposium on Symbolic and algebraic computation | 2017-02-03 | Paper |
Algorithms in the ultra-wide word model
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Compact navigation and distance oracles for graphs with small treewidth
Algorithmica | 2014-11-19 | Paper |
A uniform paradigm to succinctly encode various families of trees
Algorithmica | 2014-03-25 | Paper |
Succinct encoding of arbitrary graphs
Theoretical Computer Science | 2014-01-13 | Paper |
Entropy-bounded representation of point grids
Computational Geometry | 2014-01-08 | Paper |
Succinct indices for range queries with applications to orthogonal range maxima
Automata, Languages, and Programming | 2013-08-12 | Paper |
On the hierarchy of distribution-sensitive properties for data structures
Acta Informatica | 2013-08-05 | Paper |
A priority queue with the time-finger property
Journal of Discrete Algorithms | 2013-01-18 | Paper |
A unifying property for distribution-sensitive priority queues
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Compact representation of posets
Algorithms and Computation | 2011-12-16 | Paper |
Compact navigation and distance oracles for graphs with small treewidth
Automata, Languages and Programming | 2011-07-06 | Paper |
Succinct representation of dynamic trees
Theoretical Computer Science | 2011-06-07 | Paper |
Entropy-bounded representation of point grids
Algorithms and Computation | 2010-12-09 | Paper |
Succinct representations of separable graphs
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Universal Succinct Representations of Trees?
Automata, Languages and Programming | 2009-07-14 | Paper |
Dynamic Succinct Ordered Trees
Automata, Languages and Programming | 2009-07-14 | Paper |
On the Complexity of Finding an Unknown Cut Via Vertex Queries
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Evaluation of General Set Expressions
Algorithms and Computation | 2009-01-29 | Paper |
Succinct Representations of Arbitrary Graphs
Algorithms - ESA 2008 | 2008-11-25 | Paper |
A Uniform Approach Towards Succinct Representation of Trees
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
