%0 Journal Article %1 journals/dam/GribanovM17 %A Gribanov, Dmitry V. %A Malyshev, Dmitriy S. %D 2017 %J Discret. Appl. Math. %K dblp %P 13-20 %T The computational complexity of three graph problems for instances with bounded minors of constraint matrices. %U http://dblp.uni-trier.de/db/journals/dam/dam227.html#GribanovM17 %V 227

@article{journals/dam/GribanovM17, added-at = {2020-02-20T00:00:00.000+0100}, author = {Gribanov, Dmitry V. and Malyshev, Dmitriy S.}, biburl = {https://www.bibsonomy.org/bibtex/29bd1153b4c4608a11a88595cde25c381/dblp}, ee = {https://doi.org/10.1016/j.dam.2017.04.025}, interhash = {869fec2d36e8be86e2916dc65d352844}, intrahash = {9bd1153b4c4608a11a88595cde25c381}, journal = {Discret. Appl. Math.}, keywords = {dblp}, pages = {13-20}, timestamp = {2020-02-21T12:35:23.000+0100}, title = {The computational complexity of three graph problems for instances with bounded minors of constraint matrices.}, url = {http://dblp.uni-trier.de/db/journals/dam/dam227.html#GribanovM17}, volume = 227, year = 2017 }