EEMCS

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

EEMCS EPrints Service


Classification: MSC-05C85
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 ***
Verbree, J.M. (2007) Network Lifetime in Wireless Networks. Master's thesis, University of Twente.

2006

Bonsma, P.S. (2006) Spanning trees with many leaves: new extremal results and an improved FPT algorithm. Memorandum 1793, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

2003

Broersma, H.J. (2003)
A general framework for coloring problems: old results, new results, and open problems.
Memorandum 1704, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Broersma, H.J. and Fomin, F.V. and Golovach, P.A. and Woeginger, G.J. (2003)
Backbone colorings for networks: tree and path backbones.
Memorandum 1705, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Broersma, H.J. and Fomin, F.V. and Kratochvil, J. and Woeginger, G.J. (2003)
Planar graph coloring avoiding monochromatic subgraphs: trees and paths make things difficult.
Memorandum 1701, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Broersma, H.J. and Fujisawa, J. and Yoshimoto, K. (2003)
Backbone colorings along perfect matchings.
Memorandum 1706, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Salman, A.N.M. and Broersma, H.J. and Rodger, C.A. (2003)
A continuation of spanning 2-connected subgraphs in truncated rectangular grid graphs.
Memorandum 1700, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Salman, A.N.M. and Broersma, H.J. and Rodger, C.A. (2003)
More on spanning 2-connected subgraphs of alphabet graphs, special classes of grid graphs.
Memorandum 1702, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

2002

Salman, A.N.M. and Baskoro, E.T. and Broersma, H.J. (2002)
Spanning 2-connected subgraphs of alphabet graphs, special classes of grid graphs.
Memorandum 1629, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Salman, A.N.M. and Baskoro, E.T. and Broersma, H.J. (2002)
Spanning 2-connected subgraphs in truncated rectangular grid graphs.
Memorandum 1630, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Salman, A.N.M. and Baskoro, E.T. and Broersma, H.J. (2002)
More on spanning 2-connected subgraphs in truncated rectangular grid graphs.
Memorandum 1637, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

2000

Li, X. and Zhang, Shenggui and Broersma, H.J. (2000) Directed paths with few or many colors in colored directed graphs. Memorandum 1543, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690