Dries Van Dyck

According to our database, Dries Van Dyck authored at least 10 papers between 2004 and 2015.

Collaborative distances:

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

2015

Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time.

Christophe Costa Florêncio, Jonny Daenen, Jan Ramon, Jan Van den Bussche, Dries Van Dyck

J. Univers. Comput. Sci., 2015

2013

Mining Minimal Motif Pair Sets Maximally Covering Interactions in a Protein-Protein Interaction Network.

Peter Boyen, Frank Neven, Dries Van Dyck, Felipe L. Valentim, Aalt D. J. van Dijk

IEEE ACM Trans. Comput. Biol. Bioinform., 2013

2011

SLIDER: A Generic Metaheuristic for the Discovery of Correlated Motifs in Protein-Protein Interaction Networks.

Peter Boyen, Dries Van Dyck, Frank Neven, Roeland C. H. J. van Ham, Aalt D. J. van Dijk

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

All normalized anti-monotonic overlap graph measures are bounded.

Toon Calders, Jan Ramon, Dries Van Dyck

Data Min. Knowl. Discov., 2011

2009

Graph structural properties of non-Yutsis graphs allowing fast recognition.

Robert E. L. Aldred, Dries Van Dyck, Gunnar Brinkmann, Veerle Fack, Brendan D. McKay

Discret. Appl. Math., 2009

SLIDER: Mining Correlated Motifs in Protein-Protein Interaction Networks.

Peter Boyen, Frank Neven, Dries Van Dyck, Aalt D. J. van Dijk, Roeland C. H. J. van Ham

Proceedings of the ICDM 2009, 2009

2008

Anti-monotonic Overlap-Graph Support Measures.

Toon Calders, Jan Ramon, Dries Van Dyck

Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

2007

On the reduction of Yutsis graphs.

Dries Van Dyck, Veerle Fack

Discret. Math., 2007

2005

To be or not to be Yutsis: Algorithms for the decision problem.

Dries Van Dyck, Gunnar Brinkmann, Veerle Fack, Brendan D. McKay

Comput. Phys. Commun., 2005

2004

To be or not to be Yutsis.

Dries Van Dyck, Veerle Fack

Electron. Notes Discret. Math., 2004