#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1999

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Andreas Brandstädt, Van Bang Le, H. N. de Ridder
- Inf. Process. Lett.
- 2004

Modular decomposition of graphs is a powerful tool for designing efficient algorithms for problems on graphs such as Maximum Weight Stable Set (MWS) and Maximum Weight Clique. Using this tool we obtain O(n ·m) time algorithms for MWS on chairand xbull-free graphs which considerably extends an earlier result on bulland chairfree graphs by De Simone and… (More)

- Daniel Bayer, Van Bang Le, H. N. de Ridder
- Theor. Comput. Sci.
- 2009

- Van Bang Le, H. N. de Ridder
- WG
- 2007

Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) where N is independent and G can be extended to a cograph by adding edges between certain non-probes. A partitioned probe cograph is a probe cograph with a given partition in N and P… (More)

- Van Bang Le, H. N. de Ridder
- Discrete Mathematics & Theoretical Computer…
- 2007

An undirected graph G = (V, E) is a probe split graph if its vertex set can be partitioned into two sets, N (nonprobes) and P (probes) where N is independent and there exists E′ ⊆ N ×N such that G′ = (V, E ∪ E′) is a split graph. Recently Chang et al. gave an O(V (V +E)) time recognition algorithm for probe split graphs. In this article we give O(V 2 +V E)… (More)

- H. N. de Ridder, Van Bang Le, Daniel Bayer
- Electronic Notes in Discrete Mathematics
- 2006

- H. N. de Ridder, Hans L. Bodlaender
- FCT
- 1999

This paper introduces diametrical graph automorphisms. A graph automorphism is called diametrical if it has the property that the distance between each vertex and its image is equal to the diameter of the graph. The structure of diametrically automorphic graphs is examined. The complexity of recognizing these graphs is shown to be NP-complete in general,… (More)

Brucellosis is a very widespread and economically important zoonosis which is also infectious for humans (9). The genus Brucella, consisting of gram-negative bacteria, forms together with Ochrobactrum anthropi and Phyllobacterium an rRNA cluster, closely related to the AgrobacteriumRhizobium cluster (1). For the identification of Brucella spp., mainly… (More)

- H. N. de Ridder, Natalia de Ridder
- ICGT
- 2014

A graph class is called A-free if every graph in the class has no graph in the set A as an induced subgraph. Such characterisations by forbidden induced subgraphs are (among other purposes) very useful for determining whether A-free is a subclass of B-free, by determining whether every graph in B has some graph in A as an induced subgraph. This requires… (More)

- Natalia de Ridder, H. N. de Ridder
- Electronic Notes in Discrete Mathematics
- 2006

Graph class C is induced-hereditary if for every graph G in C, every induced subgraph of G belongs to C. Induced-hereditary graph classes allow characterisation by sets of forbidden induced subgraphs. Such characterisations are very useful for automatic deduction of relations between graph classes. However, sometimes those sets of forbidden induced… (More)

Flubendazole (FLUB) is a broad-spectrum benzimidazole anthelmintic, effective against endoparasites such as gastro-intestinal roundworms, gapeworms and tapeworms (2). This drug is widely used in the veterinary medicine of poultry. An administration of flubendazole can result in the presence of residues of the parent compound FLUB and its hydrolysed… (More)