• Alon N. (2024). Implicit Representation of Sparse Hereditary Families. Discrete & Computational Geometry. 72:2. (476-482). Online publication date: 1-Sep-2024.

    https://doi.org/10.1007/s00454-023-00521-0

  • Shur A and Rubinchik M. Distance Labeling for Families of Cycles. SOFSEM 2024: Theory and Practice of Computer Science. (471-484).

    https://doi.org/10.1007/978-3-031-52113-3_33

  • Glončák V, Munkstrup J and Grue Simonsen J. (2023). Implicit Representation of Relations. Theory of Computing Systems. 67:6. (1156-1196). Online publication date: 1-Dec-2023.

    https://doi.org/10.1007/s00224-023-10141-z

  • Jha P. (2023). Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube. Discrete Applied Mathematics. 337:C. (218-231). Online publication date: 15-Oct-2023.

    https://doi.org/10.1016/j.dam.2023.04.025

  • Alecu B, Alekseev V, Atminas A, Lozin V and Zamaraev V. (2023). Graph parameters, implicit representations and factorial properties. Discrete Mathematics. 346:10. Online publication date: 1-Oct-2023.

    https://doi.org/10.1016/j.disc.2023.113573

  • Chandoo M. (2023). Logical labeling schemes. Discrete Mathematics. 346:10. Online publication date: 1-Oct-2023.

    https://doi.org/10.1016/j.disc.2023.113565

  • Fernau H and Gajjar K. (2023). The Space Complexity of Sum Labelling. Theory of Computing Systems. 67:5. (1026-1049). Online publication date: 1-Oct-2023.

    https://doi.org/10.1007/s00224-023-10130-2

  • Dujmović V, Morin P and Wood D. (2023). Graph product structure for non-minor-closed classes. Journal of Combinatorial Theory Series B. 162:C. (34-67). Online publication date: 1-Sep-2023.

    https://doi.org/10.1016/j.jctb.2023.03.004

  • Izumi T, Emek Y, Wadayama T and Masuzawa T. Deterministic Fault-Tolerant Connectivity Labeling Scheme. Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing. (190-199).

    https://doi.org/10.1145/3583668.3594584

  • Gawrychowski P and Uznański P. (2023). Better Distance Labeling for Unweighted Planar Graphs. Algorithmica. 85:6. (1805-1823). Online publication date: 1-Jun-2023.

    https://doi.org/10.1007/s00453-023-01133-z

  • Alecu B, Atminas A, Lozin V and Malyshev D. (2022). Combinatorics and Algorithms for Quasi-Chain Graphs. Algorithmica. 85:3. (642-664). Online publication date: 1-Mar-2023.

    https://doi.org/10.1007/s00453-022-01019-6

  • Hambardzumyan L, Hatami H and Hatami P. (2022). A counter-example to the probabilistic universal graph conjecture via randomized communication complexity. Discrete Applied Mathematics. 322:C. (117-122). Online publication date: 15-Dec-2022.

    https://doi.org/10.1016/j.dam.2022.07.023

  • Harms N, Wild S and Zamaraev V. Randomized communication and implicit graph representations. Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. (1220-1233).

    https://doi.org/10.1145/3519935.3519978

  • Banerjee A. An Adjacency Labeling Scheme Based on a Decomposition of Trees into Caterpillars. Combinatorial Algorithms. (114-127).

    https://doi.org/10.1007/978-3-031-06678-8_9

  • Alecu B, Alekseev V, Atminas A, Lozin V and Zamaraev V. Graph Parameters, Implicit Representations and Factorial Properties. Combinatorial Algorithms. (60-72).

    https://doi.org/10.1007/978-3-031-06678-8_5

  • Bar-Natan A, Charalampopoulos P, Gawrychowski P, Mozes S and Weimann O. (2022). Fault-tolerant distance labeling for planar graphs. Theoretical Computer Science. 918:C. (48-59). Online publication date: 29-May-2022.

    https://doi.org/10.1016/j.tcs.2022.03.020

  • Dujmović V, Esperet L, Gavoille C, Joret G, Micek P and Morin P. (2021). Adjacency Labelling for Planar Graphs (and Beyond). Journal of the ACM. 68:6. (1-33). Online publication date: 31-Dec-2022.

    https://doi.org/10.1145/3477542

  • Fernau H and Gajjar K. The Space Complexity of Sum Labelling. Fundamentals of Computation Theory. (230-244).

    https://doi.org/10.1007/978-3-030-86593-1_16

  • Gawrychowski P and Uznański P. Better Distance Labeling for Unweighted Planar Graphs. Algorithms and Data Structures. (428-441).

    https://doi.org/10.1007/978-3-030-83508-8_31

  • Dory M and Parter M. Fault-Tolerant Labeling and Compact Routing Schemes. Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. (445-455).

    https://doi.org/10.1145/3465084.3467929

  • Alecu B, Atminas A, Lozin V and Malyshev D. Combinatorics and Algorithms for Quasi-chain Graphs. Combinatorial Algorithms. (49-62).

    https://doi.org/10.1007/978-3-030-79987-8_4

  • Bar-Natan A, Charalampopoulos P, Gawrychowski P, Mozes S and Weimann O. Fault-Tolerant Distance Labeling for Planar Graphs. Structural Information and Communication Complexity. (315-333).

    https://doi.org/10.1007/978-3-030-79527-6_18

  • Bonamy M, Esperet L, Groenland C and Scott A. Optimal labelling schemes for adjacency, comparability, and reachability. Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. (1109-1117).

    https://doi.org/10.1145/3406325.3451102

  • Morin P. (2021). A Fast Algorithm for the Product Structure of Planar Graphs. Algorithmica. 83:5. (1544-1558). Online publication date: 1-May-2021.

    https://doi.org/10.1007/s00453-020-00793-5

  • Gawrychowski P, Janczewski W and Łopuszański J. Shorter labels for routing in trees. Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. (2174-2193).

    /doi/10.5555/3458064.3458194

  • Bonnet É, Geniet C, Kim E, Thomassé S and Watrigant R. Twin-width II. Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. (1977-1996).

    /doi/10.5555/3458064.3458182

  • Chepoi V, Labourel A and Ratel S. (2021). Distance and Routing Labeling Schemes for Cube-Free Median Graphs. Algorithmica. 83:1. (252-296). Online publication date: 1-Jan-2021.

    https://doi.org/10.1007/s00453-020-00756-w

  • Dujmović V, Joret G, Micek P, Morin P, Ueckerdt T and Wood D. (2020). Planar Graphs Have Bounded Queue-Number. Journal of the ACM. 67:4. (1-38). Online publication date: 31-Aug-2020.

    https://doi.org/10.1145/3385731

  • Berglin E and Brodal G. (2020). A Simple Greedy Algorithm for Dynamic Graph Orientation. Algorithmica. 82:2. (245-259). Online publication date: 1-Feb-2020.

    https://doi.org/10.1007/s00453-018-0528-0

  • Fraigniaud P, Patt-Shamir B and Perry M. (2019). Randomized proof-labeling schemes. Distributed Computing. 32:3. (217-234). Online publication date: 1-Jun-2019.

    https://doi.org/10.1007/s00446-018-0340-8

  • Fitch M. (2019). Implicit representation conjecture for semi-algebraic graphs. Discrete Applied Mathematics. 259:C. (53-62). Online publication date: 30-Apr-2019.

    https://doi.org/10.1016/j.dam.2018.11.030

  • Gavenčiak T and Tětek J. Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts. Theory and Applications of Models of Computation. (222-241).

    https://doi.org/10.1007/978-3-030-14812-6_14

  • Besta M, Stanojevic D, Zivic T, Singh J, Hoerold M and Hoefler T. Log(graph). Proceedings of the 27th International Conference on Parallel Architectures and Compilation Techniques. (1-13).

    https://doi.org/10.1145/3243176.3243198

  • Atminas A and Zamaraev V. (2018). On Forbidden Induced Subgraphs for Unit Disk Graphs. Discrete & Computational Geometry. 60:1. (57-97). Online publication date: 1-Jul-2018.

    https://doi.org/10.1007/s00454-018-9968-1

  • Gawrychowski P, Kuhn F, Łopuszański J, Panagiotou K and Su P. Labeling schemes for nearest common ancestors through minor-universal trees. Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. (2604-2619).

    /doi/10.5555/3174304.3175471

  • Abboud A, Gawrychowski P, Mozes S and Weimann O. Near-optimal compression for the planar graph metric. Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. (530-549).

    /doi/10.5555/3174304.3175305

  • Alstrup S, Dahlgaard S and Knudsen M. (2017). Optimal Induced Universal Graphs and Adjacency Labeling for Trees. Journal of the ACM. 64:4. (1-22). Online publication date: 7-Sep-2017.

    https://doi.org/10.1145/3088513

  • Freedman O, Gawrychowski P, Nicholson P and Weimann O. Optimal Distance Labeling Schemes for Trees. Proceedings of the ACM Symposium on Principles of Distributed Computing. (185-194).

    https://doi.org/10.1145/3087801.3087804

  • El-Zein H, Lewenstein M, Munro J, Raman V and Chan T. (2017). On the Succinct Representation of Equivalence Classes. Algorithmica. 78:3. (1020-1040). Online publication date: 1-Jul-2017.

    https://doi.org/10.1007/s00453-016-0192-1

  • Angelidakis H, Makarychev Y and Oparin V. Algorithmic and hardness results for the hub labeling problem. Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. (1442-1461).

    /doi/10.5555/3039686.3039780

  • Alon N and Nenadov R. Optimal induced universal graphs for bounded-degree graphs. Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. (1149-1157).

    /doi/10.5555/3039686.3039760

  • Bollig B and Bury M. (2016). On the OBDD representation of some graph classes. Discrete Applied Mathematics. 214:C. (34-53). Online publication date: 11-Dec-2016.

    https://doi.org/10.1016/j.dam.2016.05.028

  • Komargodski I, Naor M and Yogev E. How to Share a Secret, Infinitely. Proceedings, Part II, of the 14th International Conference on Theory of Cryptography - Volume 9986. (485-514).

    https://doi.org/10.1007/978-3-662-53644-5_19

  • Fraigniaud P and Korman A. (2016). An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets. Journal of the ACM. 63:1. (1-31). Online publication date: 30-Mar-2016.

    https://doi.org/10.1145/2794076

  • Alstrup S, Gavoille C, Halvorsen E and Petersen H. Simpler, faster and shorter labels for distances in graphs. Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms. (338-350).

    /doi/10.5555/2884435.2884460

  • Fischer J and Peters D. (2016). GLOUDS. Journal of Discrete Algorithms. 36:C. (39-49). Online publication date: 1-Jan-2016.

    https://doi.org/10.1016/j.jda.2015.10.004

  • Baruch M, Fraigniaud P and Patt-Shamir B. Randomized Proof-Labeling Schemes. Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing. (315-324).

    https://doi.org/10.1145/2767386.2767421

  • Dahlgaard S, Knudsen M and Rotbart N. A Simple and Optimal Ancestry Labeling Scheme for Trees. Proceedings, Part II, of the 42nd International Colloquium on Automata, Languages, and Programming - Volume 9135. (564-574).

    https://doi.org/10.1007/978-3-662-47666-6_45

  • Alstrup S, Kaplan H, Thorup M and Zwick U. Adjacency Labeling Schemes and Induced-Universal Graphs. Proceedings of the forty-seventh annual ACM symposium on Theory of Computing. (625-634).

    https://doi.org/10.1145/2746539.2746545

  • Atminas A, Collins A, Lozin V and Zamaraev V. (2015). Implicit representations and factorial properties of graphs. Discrete Mathematics. 338:2. (164-179). Online publication date: 6-Feb-2015.

    https://doi.org/10.1016/j.disc.2014.09.008

  • El-Zein H, Munro J and Raman V. Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes. Algorithms and Computation. (543-552).

    https://doi.org/10.1007/978-3-319-13075-0_43

  • He M, Tang G and Zeh N. Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries. Algorithms and Computation. (128-140).

    https://doi.org/10.1007/978-3-319-13075-0_11

  • Rotbart N, Vaz Salles M and Zotos I. An Evaluation of Dynamic Labeling Schemes for Tree Networks. Proceedings of the 13th International Symposium on Experimental Algorithms - Volume 8504. (199-210).

    https://doi.org/10.1007/978-3-319-07959-2_17

  • Sommer C. (2014). Shortest-path queries in static networks. ACM Computing Surveys. 46:4. (1-31). Online publication date: 1-Apr-2014.

    https://doi.org/10.1145/2530531

  • Alstrup S, Halvorsen E and Larsen K. Near-optimal labeling schemes for nearest common ancestors. Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms. (972-982).

    /doi/10.5555/2634074.2634146

  • Kang R and Müller T. (2012). Sphere and Dot Product Representations of Graphs. Discrete & Computational Geometry. 47:3. (548-568). Online publication date: 1-Apr-2012.

    /doi/10.5555/3116257.3116364

  • Kang R and Müller T. Sphere and dot product representations of graphs. Proceedings of the twenty-seventh annual symposium on Computational geometry. (308-314).

    https://doi.org/10.1145/1998196.1998249

  • Frikken K, Yuan H and Atallah M. Secure authenticated comparisons. Proceedings of the 9th international conference on Applied cryptography and network security. (514-531).

    /doi/10.5555/2025968.2026009

  • Bollig B. On symbolic OBDD-based algorithms for the minimum spanning tree problem. Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II. (16-30).

    /doi/10.5555/1940424.1940426

  • Korman A, Peleg D and Rodeh Y. (2010). Constructing Labeling Schemes through Universal Matrices. Algorithmica. 57:4. (641-652). Online publication date: 1-Aug-2010.

    /doi/10.5555/3118226.3118474

  • Blelloch G and Farzan A. Succinct representations of separable graphs. Proceedings of the 21st annual conference on Combinatorial pattern matching. (138-150).

    /doi/10.5555/1875737.1875750

  • Fraigniaud P and Korman A. An optimal ancestry scheme and small universal posets. Proceedings of the forty-second ACM symposium on Theory of computing. (611-620).

    https://doi.org/10.1145/1806689.1806773

  • Korman A, Kutten S and Peleg D. (2010). Proof labeling schemes. Distributed Computing. 22:4. (215-233). Online publication date: 1-May-2010.

    https://doi.org/10.1007/s00446-010-0095-3

  • Korman A. (2010). Labeling schemes for vertex connectivity. ACM Transactions on Algorithms. 6:2. (1-10). Online publication date: 1-Mar-2010.

    https://doi.org/10.1145/1721837.1721855

  • Fraigniaud P and Korman A. Compact ancestry labeling schemes for XML trees. Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms. (458-466).

    /doi/10.5555/1873601.1873639

  • Hsu T and Lu H. An Optimal Labeling for Node Connectivity. Proceedings of the 20th International Symposium on Algorithms and Computation. (303-310).

    https://doi.org/10.1007/978-3-642-10631-6_32

  • Morgan D. (2009). A dynamic distributed approach to representing proper interval graphs. Discrete Mathematics. 309:18. (5697-5702). Online publication date: 1-Sep-2009.

    https://doi.org/10.1016/j.disc.2008.04.039

  • Fraigniaud P and Korman A. On randomized representations of graphs using short labels. Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures. (131-137).

    https://doi.org/10.1145/1583991.1584031

  • Bazzaro F and Gavoille C. (2009). Localized and compact data-structure for comparability graphs. Discrete Mathematics. 309:11. (3465-3484). Online publication date: 1-Jun-2009.

    https://doi.org/10.1016/j.disc.2007.12.091

  • Meer K and Rautenbach D. (2009). On the OBDD size for graphs of bounded tree- and clique-width. Discrete Mathematics. 309:4. (843-851). Online publication date: 1-Mar-2009.

    https://doi.org/10.1016/j.disc.2008.01.022

  • Cohen R, Fraigniaud P, Ilcinkas D, Korman A and Peleg D. (2009). Labeling Schemes for Tree Representation. Algorithmica. 53:1. (1-15). Online publication date: 1-Jan-2009.

    https://doi.org/10.1007/s00453-007-9089-3

  • Esperet L, Labourel A and Ochem P. (2008). On induced-universal graphs for the class of bounded-degree graphs. Information Processing Letters. 108:5. (255-260). Online publication date: 1-Nov-2008.

    https://doi.org/10.1016/j.ipl.2008.04.020

  • Korman A. Improved compact routing schemes for dynamic trees. Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing. (185-194).

    https://doi.org/10.1145/1400751.1400777

  • Korman A and Peleg D. (2008). Compact separator decompositions in dynamic trees and applications to labeling schemes. Distributed Computing. 21:2. (141-161). Online publication date: 1-Jul-2008.

    https://doi.org/10.1007/s00446-008-0061-5

  • Lozin V. (2008). Graph representation functions computable by finite automata. Journal of Automata, Languages and Combinatorics. 13:1. (73-90). Online publication date: 1-Jan-2008.

    /doi/10.5555/1515805.1515809

  • Korman A and Peleg D. (2007). Labeling schemes for weighted dynamic trees. Information and Computation. 205:12. (1721-1740). Online publication date: 1-Dec-2007.

    https://doi.org/10.1016/j.ic.2007.08.004

  • Korman A and Kutten S. (2007). Distributed verification of minimum spanning trees. Distributed Computing. 20:4. (253-266). Online publication date: 1-Nov-2007.

    https://doi.org/10.1007/s00446-007-0025-1

  • Korman A. (2007). General compact labeling schemes for dynamic trees. Distributed Computing. 20:3. (179-193). Online publication date: 1-Oct-2007.

    https://doi.org/10.1007/s00446-007-0035-z

  • Korman A and Peleg D. Compact separator decompositions in dynamic trees and applications to labeling schemes. Proceedings of the 21st international conference on Distributed Computing. (313-327).

    /doi/10.5555/2393794.2393821

  • Korman A and Kutten S. Controller and estimator for dynamic networks. Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing. (175-184).

    https://doi.org/10.1145/1281100.1281127

  • Korman A. Labeling schemes for vertex connectivity. Proceedings of the 34th international conference on Automata, Languages and Programming. (102-109).

    /doi/10.5555/2394539.2394554

  • Korman A and Kutten S. Labeling schemes with queries. Proceedings of the 14th international conference on Structural information and communication complexity. (109-123).

    /doi/10.5555/1760631.1760645

  • Courcelle B and Twigg A. Compact forbidden-set routing. Proceedings of the 24th annual conference on Theoretical aspects of computer science. (37-48).

    /doi/10.5555/1763424.1763430

  • Korman A, Peleg D and Rodeh Y. Constructing labeling schemes through universal matrices. Proceedings of the 17th international conference on Algorithms and Computation. (409-418).

    https://doi.org/10.1007/11940128_42

  • Korman A and Kutten S. Distributed verification of minimum spanning trees. Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing. (26-34).

    https://doi.org/10.1145/1146381.1146389

  • Bonichon N, Gavoille C and Labourel A. Short labels by traversal and jumping. Proceedings of the 13th international conference on Structural Information and Communication Complexity. (143-156).

    https://doi.org/10.1007/11780823_12

  • Goel G and Gustedt J. Bounded arboricity to determine the local structure of sparse graphs. Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science. (159-167).

    https://doi.org/10.1007/11917496_15

  • Bazzaro F and Gavoille C. Localized and compact data-structure for comparability graphs. Proceedings of the 16th international conference on Algorithms and Computation. (1122-1131).

    https://doi.org/10.1007/11602613_111

  • Morgan D. A dynamic implicit adjacency labelling scheme for line graphs. Proceedings of the 9th international conference on Algorithms and Data Structures. (294-305).

    https://doi.org/10.1007/11534273_26

  • Gavoille C and Paul C. (2003). Distance labeling scheme and split decomposition. Discrete Mathematics. 273:1-3. (115-130). Online publication date: 1-Dec-2003.

    https://doi.org/10.1016/S0012-365X(03)00232-2

  • Gavoille C and Peleg D. (2003). Compact and localized distributed data structures. Distributed Computing. 16:2-3. (111-120). Online publication date: 1-Sep-2003.

    https://doi.org/10.1007/s00446-002-0073-5

  • Alstrup S, Bille P and Rauhe T. Labeling schemes for small distances in trees. Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms. (689-698).

    /doi/10.5555/644108.644220

  • Alstrup S, Gavoille C, Kaplan H and Rauhe T. Nearest common ancestors. Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures. (258-264).

    https://doi.org/10.1145/564870.564914

  • Alstrup S and Rauhe T. Improved labeling scheme for ancestor queries. Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms. (947-953).

    /doi/10.5555/545381.545504

  • Chiang Y, Lin C and Lu H. Orderly spanning trees with applications to graph encoding and graph drawing. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. (506-515).

    /doi/10.5555/365411.365518

  • He X, Kao M and Lu H. A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs. Proceedings of the 7th Annual European Symposium on Algorithms. (540-549).

    /doi/10.5555/647909.740150