EEMCS EPrints Service
|
||||||||||||||||
2007
Bauer, D. and Broersma, H.J. and Kahl, N. and Morgana, A. and Schmeichel, E. and Surowiec, T.
(2007)
Tutte sets in graphs II: The complexity of finding maximum Tutte sets.
Discrete Applied Mathematics, 155 (10).
pp. 1336-1343.
ISSN 0166-218X
*** ISI Impact 0,822 ***
Bauer, D. and Broersma, H.J. and Morgana, A. and Schmeichel, E.
(2007)
Tutte sets in graphs I: Maximal tutte sets and D-graphs.
Journal of Graph Theory, 55 (4).
pp. 343-358.
ISSN 0364-9024
*** ISI Impact 0,561 ***
1999
Bauer, D. and Broersma, H.J. and Morgana, A. and Schmeichel, E.
(1999)
Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion. Memorandum 1499, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690 |
||||||||||||||||