1. Shortest Beer Path Queries in Outerplanar Graphs;Joyce Bacic;32nd International Symposium on Algorithms and Computation (ISAAC 2021)
2. Compact representations of separable graphs;K Daniel;Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '03,2003
3. Succinct representations of separable graphs;Guy E Blelloch;Combinatorial Pattern Matching,2010
4. An informationtheoretic upper bound of planar graphs using triangulation;Nicolas Bonichon;STACS 2003,2003
5. Dynamic representations of sparse graphs;St�lting Gerth;Proc. 6th International Workshop on Algorithms and Data Structures (WADS 99),1999