Dries Van Dyck - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 11 from 11

2015

Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial TimeChristophe Costa Florêncio, Jonny Daenen, Jan Ramon, Jan Van den Bussche, Dries Van Dyck. jucs, 21(7):891-911, 2015. [doi]

2013

Mining Minimal Motif Pair Sets Maximally Covering Interactions in a Protein-Protein Interaction NetworkPeter Boyen, Frank Neven, Dries Van Dyck, Felipe L. Valentim, Aalt D. J. van Dijk. tcbb, 10(1):73-86, 2013. [doi]

2011

SLIDER: A Generic Metaheuristic for the Discovery of Correlated Motifs in Protein-Protein Interaction NetworksPeter Boyen, Dries Van Dyck, Frank Neven, Roeland C. H. J. van Ham, Aalt D. J. van Dijk. tcbb, 8(5):1344-1357, 2011. [doi]

All normalized anti-monotonic overlap graph measures are boundedToon Calders, Jan Ramon, Dries Van Dyck. datamine, 23(3):503-548, 2011. [doi]

2009

Graph structural properties of non-Yutsis graphs allowing fast recognitionRobert E. L. Aldred, Dries Van Dyck, Gunnar Brinkmann, Veerle Fack, Brendan D. McKay. DAM, 157(2):377-386, 2009. [doi]

SLIDER: Mining Correlated Motifs in Protein-Protein Interaction NetworksPeter Boyen, Frank Neven, Dries Van Dyck, Aalt-Jan van Dijk, Roeland C. H. J. van Ham. icdm 2009: 716-721 [doi]

2008

Anti-monotonic Overlap-Graph Support MeasuresToon Calders, Jan Ramon, Dries Van Dyck. icdm 2008: 73-82 [doi]

2007

On the reduction of Yutsis graphsDries Van Dyck, Veerle Fack. DM, 307(11-12):1506-1515, 2007. [doi]

2005

To be or not to be Yutsis: Algorithms for the decision problemDries Van Dyck, Gunnar Brinkmann, Veerle Fack, Brendan D. McKay. cphysics, 173(1-2):61-70, 2005. [doi]

2004

To be or not to be YutsisDries Van Dyck, Veerle Fack. endm, 17:275-279, 2004. [doi]

To be or not to be YutsisDries Van Dyck, Veerle Fack. colognetwente 2004: 237-241

Sign in or sign up to see more results.

runs on WebDSL