Author:
Shur Arseny M.,Rubinchik Mikhail
Publisher
Springer Nature Switzerland
Reference22 articles.
1. Abboud, A., Gawrychowski, P., Mozes, S., Weimann, O.: Near-optimal compression for the planar graph metric. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, pp. 530–549. SIAM (2018)
2. Abiteboul, S., Alstrup, S., Kaplan, H., Milo, T., Rauhe, T.: Compact labeling scheme for ancestor queries. SIAM J. Comput. 35(6), 1295–1309 (2006)
3. Abrahamsen, M., Alstrup, S., Holm, J., Knudsen, M.B.T., Stöckel, M.: Near-optimal induced universal graphs for cycles and paths. Discret. Appl. Math. 282, 1–13 (2020)
4. Alstrup, S., Gørtz, I.L., Halvorsen, E.B., Porat, E.: Distance labeling schemes for trees. In: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. LIPIcs, vol. 55, pp. 132:1–132:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
5. Bazzaro, F., Gavoille, C.: Localized and compact data-structure for comparability graphs. Discret. Math. 309(11), 3465–3484 (2009)