Publisher
Springer Nature Singapore
Reference25 articles.
1. Ağaoğlu Çağırıcı, D., Hliněný, P.: Isomorphism testing for $$T$$-graphs in FPT. In: Mutzel, P., Rahman, M.S., Slamin (eds.) WALCOM 2022. LNCS, vol. 13174, pp. 239–250. Springer, Cham (2022). https://doi.org/10.1007/978-3-030-96731-4_20
2. Arvind, V., Nedela, R., Ponomarenko, I., Zeman, P.: Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable. In: Bekos, M.A., Kaufmann, M. (eds.) WG 2022. LNCS, vol. 13453, pp. 29–42. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-15914-5_3
3. Ağaoğlu, D., Hliněný, P.: Isomorphism problem for $$S_d$$-graphs. In: MFCS, pp. 4:1–4:14 (2020)
4. Ağaoğlu Çağırıcı, D., et al.: Recognizing $$H$$-graphs - beyond circular-arc graphs. In: MFCS, pp. 8:1–8:14 (2023)
5. Ağaoğlu Çağırıcı, D., Hliněný, P.: Efficient isomorphism for $$S_d$$-graphs and $$T$$-graphs. Algorithmica 85, 352–383 (2023). https://doi.org/10.1007/s00453-022-01033-8