Polynomial time certifying algorithms for the planar quantified integer programming problem

Z. Liang, K. Subramani, James Worthington. Polynomial time certifying algorithms for the planar quantified integer programming problem. Journal of Logic and Computation, 23(5):1017-1033, 2013. [doi]

@article{LiangSW13,
  title = {Polynomial time certifying algorithms for the planar quantified integer programming problem},
  author = {Z. Liang and K. Subramani and James Worthington},
  year = {2013},
  doi = {10.1093/logcom/exs034},
  url = {http://dx.doi.org/10.1093/logcom/exs034},
  researchr = {https://researchr.org/publication/LiangSW13},
  cites = {0},
  citedby = {0},
  journal = {Journal of Logic and Computation},
  volume = {23},
  number = {5},
  pages = {1017-1033},
}