| Date | Author/Title | | Document Type |
|---|
| 2011 | Bazgan, C. and Couetoux, B. and Tuza, Zsolt
Complexity and approximation of the constrained forest problem | | ISI Article |
| 2010 | Bazgan, C. and Tuza, Zsolt and Vanderpooten, D.
Satisfactory graph partition, variants, and generalizations | | ISI Article |
| 2009-12-16 | Bazgan, C. and Couëtoux, B. and Tuza, Zsolt
Covering a graph with a constrained forest (extended abstract) | | Conference or Workshop Item |
| 2007 | Bazgan, C. and Tuza, Zsolt and Vanderpooten, D.
Efficient algorithms for decomposing graphs under degree constraints | | ISI Article |
| 2006 | Bazgan, C. and Tuza, Zsolt and Vanderpooten, D.
Degree-constrained decompositions of graphs: boundered treewidth and planarity | | ISI Article |
| 2006 | Bazgan, C. and Tuza, Zsolt and Vanderpooten, D.
The satisfactory partition problem | | ISI Article |
| 2005 | Bazgan, C. and Tuza, Zsolt and Vanderpooten, D.
Complexity and approximation of satisfactory partition problems | | Article |
| 2003 | Bazgan, C. and Vanderpooten, D. and Tuza, Zsolt
On the existence and determination of satisfactory partitions in a graph | | Article |
| 2002 | Bazgan, C. and Santha, M. and Tuza, Zsolt
Efficient approximation algorithms for the subset-sums equality problem | | Article |
| 1999 | Bazgan, C. and Santha, M. and Tuza, Zsolt
On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs | | Article |
| 1998 | Bazgan, C. and Santha, M. and Tuza, Zsolt
Efficient approximation algorithms for the subset-sums equality problem | | Book Section |
| 1998 | Bazgan, C. and Santha, M. and Tuza, Zsolt
On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs | | Conference or Workshop Item |
