| 2007 |
|---|
| 6 | EE | Van Bang Le,
H. N. de Ridder:
Linear-time certifying recognition for partitioned probe cographs.
Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes 2007 |
| 5 | EE | Van Bang Le,
H. N. de Ridder:
Characterisations and Linear-Time Recognition of Probe Cographs.
WG 2007: 226-237 |
| 2006 |
|---|
| 4 | EE | Natalia de Ridder,
H. N. de Ridder:
Automatic Deduction of Induced Subgraphs of Some Infinite Families of Graphs.
Electronic Notes in Discrete Mathematics 27: 19-20 (2006) |
| 3 | EE | H. N. de Ridder,
Van Bang Le,
D. Bayer:
On probe classes of graphs.
Electronic Notes in Discrete Mathematics 27: 21 (2006) |
| 2004 |
|---|
| 2 | EE | Andreas Brandstädt,
Van Bang Le,
H. N. de Ridder:
Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes.
Inf. Process. Lett. 89(4): 165-173 (2004) |
| 1999 |
|---|
| 1 | EE | H. N. de Ridder,
Hans L. Bodlaender:
Graph Automorphisms with Maximal Projection Distances.
FCT 1999: 204-214 |
