EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Search
 Organisation

EEMCS EPrints Service


Classification: MSC-68R10
Home Policy Brochure Browse Search User Area Contact Help

2012

Broersma, H.J. and Golovach, P.A. and Patel, V. (2012) Tight complexity bounds for FPT subgraph problems parameterized by clique-width. In: 6th International Symposium on Parameterized and Exact Computation, IPEC 2011, 6-8 Sept 2011, Saarbrücken, Germany. pp. 207-218. Lecture Notes in Computer Science 7112. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-28049-8

2007

Broersma, H.J. and Fomin, F.V. and Královi?, R. and Woeginger, G.J. (2007) Eliminating graphs by means of parallel knock-out schemes. Discrete Applied Mathematics, 155 (2). pp. 92-102. ISSN 0166-218X *** ISI Impact 0,722 ***

2004

Nieberg, T. and Hurink, J.L. (2004)
A PTAS for the minimum dominating set problem in unit disk graphs.
Memorandum 1732, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

2003

Nieberg, T. and Hurink, J.L. and Kern, W. (2003)
A new PTAS for maximum independent sets in unit disk graphs.
Memorandum 1688, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

2002

Bodlaender, H.L. and Broersma, H.J. and Fomin, F.V. and Pyatkin, A.V. and Woeginger, G.J. (2002)
Radio labeling with pre-assigned frequencies.
Memorandum 1636, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Broersma, H.J. and Fomin, F.V. and Nešetřil, J. and Woeginger, G.J. (2002)
More about subcolorings.
Memorandum 1635, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

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

1998

Bauer, D. and Katona, G.Y. and Kratsch, D. and Veldman, H.J. (1998) Chordality and 2-factors in tough graphs. Memorandum 1430, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690