1. Deciding reachability under persistent x86-TSO. In Proceedings of 2021 ACM Program;Abdulla P.A.;Lang.
2. Babai , L. Graph isomorphism in quasipolynomial time . In Proceedings of the 48th Annual ACM SIGACT Symp. Theory of Computing , ( 2016 ), 684--697. Babai, L. Graph isomorphism in quasipolynomial time. In Proceedings of the 48th Annual ACM SIGACT Symp. Theory of Computing, (2016), 684--697.
3. Luks, E.M. Canonical labeling of graphs;Babai L.;STOC,1983
4. Improved bounds for perfect sampling of k-colorings in graphs
5. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees