Dániel Marx, Barry O Sullivan, Igor Razgon. Treewidth Reduction for Constrained Separation and Bipartization Problems. In Jean-Yves Marion, Thomas Schwentick, editors, 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France. Volume 5 of LIPIcs, pages 561-572, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2010. [doi]
@inproceedings{MarxOR10, title = {Treewidth Reduction for Constrained Separation and Bipartization Problems}, author = {Dániel Marx and Barry O Sullivan and Igor Razgon}, year = {2010}, doi = {10.4230/LIPIcs.STACS.2010.2485}, url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2485}, researchr = {https://researchr.org/publication/MarxOR10}, cites = {0}, citedby = {0}, pages = {561-572}, booktitle = {27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France}, editor = {Jean-Yves Marion and Thomas Schwentick}, volume = {5}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, isbn = {978-3-939897-16-3}, }