1. Das, B., Datta, S., Nimbhorkar, P.: Log-space algorithms for paths and matchings in $$k$$-trees. Theory Comput. Syst. 53(4), 669–689 (2013).
https://doi.org/10.1007/s00224-013-9469-9
2. Datta, S., Kulkarni, R., Roy, S.: Deterministically isolating a perfect matching in bipartite planar graphs. Theory Comput. Syst. 47(3), 737–757 (2010).
https://doi.org/10.1007/s00224-009-9204-8
3. Franklin, D.M.: Strategy inference in stochastic games using belief networks comprised of probabilistic graphical models. In: Proceedings of Florida Artificial Intelligence Research Society (2015)
4. Franklin, D.M.: Strategy inference in multi-agent multi-team scenarios. In: Proceedings of the International Conference on Tools with Artificial Intelligence (2016a)
5. Franklin, D.M.: Strategy inference via real-time homeomorphic and isomorphic tree matching of probabilistic graphical models. In: Proceedings of Florida Artificial Intelligence Research Society (2016b)