Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Aayush Ojha, Raghunath Tewari. Circuit Complexity of Bounded Planar Cutwidth Graph Matching. Electronic Colloquium on Computational Complexity (ECCC), 25:4, 2018. [doi]