Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming

Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo. Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. In Venkatesh Raman, Saket Saurabh, editors, Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings. Volume 6478 of Lecture Notes in Computer Science, pages 158-169, Springer, 2010. [doi]

Authors

Gregory Gutin

This author has not been identified. Look up 'Gregory Gutin' in Google

Eun Jung Kim

This author has not been identified. Look up 'Eun Jung Kim' in Google

Arezou Soleimanfallah

This author has not been identified. Look up 'Arezou Soleimanfallah' in Google

Stefan Szeider

This author has not been identified. Look up 'Stefan Szeider' in Google

Anders Yeo

This author has not been identified. Look up 'Anders Yeo' in Google