( en | de | ru )

 

Disambiguation of "Dyck, Dries Van"

Author of the publication

copydeleteadd this publication to your clipboard
Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time.

, , , , and . J. Univers. Comput. Sci., 21 (7): 891-911 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dries Vervecken

Dries Schellekens

Christian Dries

Roman Dries

Thomas Dries

 

Other publications of authors with the same name

To be or not to be Yutsis: Algorithms for the decision problem., , , and . Comput. Phys. Commun., 173 (1-2): 61-70 (2005)On the reduction of Yutsis graphs., and . Discret. Math., 307 (11-12): 1506-1515 (2007)Mining Minimal Motif Pair Sets Maximally Covering Interactions in a Protein-Protein Interaction Network., , , , and . IEEE ACM Trans. Comput. Biol. Bioinform., 10 (1): 73-86 (2013)Anti-monotonic Overlap-Graph Support Measures., , and . ICDM, page 73-82. IEEE Computer Society, (2008)SLIDER: A Generic Metaheuristic for the Discovery of Correlated Motifs in Protein-Protein Interaction Networks., , , , and . IEEE ACM Trans. Comput. Biol. Bioinform., 8 (5): 1344-1357 (2011)Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time., , , , and . J. Univers. Comput. Sci., 21 (7): 891-911 (2015)Graph structural properties of non-Yutsis graphs allowing fast recognition., , , , and . Discret. Appl. Math., 157 (2): 377-386 (2009)All normalized anti-monotonic overlap graph measures are bounded., , and . Data Min. Knowl. Discov., 23 (3): 503-548 (2011)To be or not to be Yutsis., and . Electron. Notes Discret. Math., (2004)SLIDER: Mining Correlated Motifs in Protein-Protein Interaction Networks., , , , and . ICDM, page 716-721. IEEE Computer Society, (2009)