Author:
Avis David,Tiwary Hans Raj
Subject
Discrete Mathematics and Combinatorics
Reference11 articles.
1. A linear-time algorithm for testing the truth of certain quantified boolean formulas;Aspvall;Inf. Process. Lett.,1979
2. David Avis, David Bremner, Hans Raj Tiwary, Osamu Watanabe, Polynomial size linear programs for non-bipartite matching problems and other problems in P, Discrete Appl. Math., to appear, CoRR http://arxiv.org/abs/1408.0807.
3. A generalization of extension complexity that captures P;Avis;Inf. Process. Lett.,2015
4. Stable marriage and Roommates problems with restricted edges: Complexity and approximability;Cseh;Discrete Optim.,2016
5. A new fixed point approach for stable networks and stable marriages;Feder;J. Comput. System Sci.,1992
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献