Graph Automorphisms with Maximal Projection Distances. - H. N. de Ridder; Hans L. Bodlaender (FCT, 1999)

Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes. - Andreas Brandstädt; Van Bang Le; H. N. de Ridder (Inf. Process. Lett., 2004)

On probe classes of graphs. - H. N. de Ridder; Van Bang Le; Daniel Bayer (Electron. Notes Discret. Math., 2006)

Automatic Deduction of Induced Subgraphs of Some Infinite Families of Graphs. - Natalia de Ridder; H. N. de Ridder (Electron. Notes Discret. Math., 2006)

Linear-time certifying recognition for partitioned probe cographs. - Van Bang Le; H. N. de Ridder (Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 2007)

Characterisations and Linear-Time Recognition of Probe Cographs. - Van Bang Le; H. N. de Ridder (WG, 2007)

Probe Split Graphs. - Van Bang Le; H. N. de Ridder (Discret. Math. Theor. Comput. Sci., 2007)

Probe threshold and probe trivially perfect graphs. - Daniel Bayer; Van Bang Le; H. N. de Ridder (Theor. Comput. Sci., 2009)

The Subgraph Isomorphism Problem on a Class of Hyperedge Replacement Languages. - H. N. de Ridder; Natalia de Ridder (ICGT, 2014)