H. N. de Ridder

According to our database, H. N. de Ridder authored at least 9 papers between 1999 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2014

The Subgraph Isomorphism Problem on a Class of Hyperedge Replacement Languages.

H. N. de Ridder, Natalia de Ridder

Proceedings of the Graph Transformation - 7th International Conference, 2014

2009

Probe threshold and probe trivially perfect graphs.

Daniel Bayer, Van Bang Le, H. N. de Ridder

Theor. Comput. Sci., 2009

2007

Probe Split Graphs.

Van Bang Le, H. N. de Ridder

Discret. Math. Theor. Comput. Sci., 2007

Characterisations and Linear-Time Recognition of Probe Cographs.

Van Bang Le, H. N. de Ridder

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

Linear-time certifying recognition for partitioned probe cographs.

Van Bang Le, H. N. de Ridder

Proceedings of the Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05., 2007

2006

Automatic Deduction of Induced Subgraphs of Some Infinite Families of Graphs.

Natalia de Ridder, H. N. de Ridder

Electron. Notes Discret. Math., 2006

On probe classes of graphs.

H. N. de Ridder, Van Bang Le, Daniel Bayer

Electron. Notes Discret. Math., 2006

2004

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

1999

Graph Automorphisms with Maximal Projection Distances.

H. N. de Ridder, Hans L. Bodlaender

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999