1. Aspvall, B., Shiloach, Y.: A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality. SIAM Journal on Computing 9, 827–845 (1980)
2. Björklund, H., Svensson, O., Vorobyov, S.: Linear complementarity algorithms for mean payoff games. Technical Report 2005-05, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science (2005)
3. Chandrasekaran, R.: A special case of the complementary pivot problem. Opsearch 7, 263–268 (1970)
4. Chandrasekaran, R.: Integer programming problems for which a simple rounding type algorithm works. Combinatorial Optimization 8, 101–106 (1984)
5. Chandrasekaran, R., Kabadi, S.N., Sridhar, R.: Integer solution for linear complementarity problem. Mathematics of Operations Research 23, 390–402 (1998)