( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Model Counting for CNF Formulas of Bounded Modular Treewidth.

, , и . Algorithmica, 76 (1): 168-194 (2016)

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.

Daniël Rossum

Daniël Wildt

Daniel

Daniel

Daniël Pieter Wierstra

 

Другие публикации лиц с тем же именем

Using Contracted Solution Graphs for Solving Reconfiguration Problems., и . CoRR, (2015)Contracting planar graphs to contractions of triangulations, , и . CoRR, (2010)Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity., , , , и . CoRR, (2017)Graph Isomorphism for (H1, H2)-free Graphs: An Almost Complete Dichotomy., , , и . CoRR, (2018)Induced Packing of Odd Cycles in a Planar Graph., , , и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 514-523. Springer, (2009)Minimal Disconnected Cuts in Planar Graphs., , , и . FCT, том 9210 из Lecture Notes in Computer Science, стр. 243-254. Springer, (2015)Surjective H-Colouring over Reflexive Digraphs., , и . CoRR, (2017)The Computational Complexity of the Role Assignment Problem., и . ICALP, том 2719 из Lecture Notes in Computer Science, стр. 817-828. Springer, (2003)Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms., , и . MFCS, том 3618 из Lecture Notes in Computer Science, стр. 340-351. Springer, (2005)Knocking Out P k -free Graphs., , и . MFCS (2), том 8635 из Lecture Notes in Computer Science, стр. 396-407. Springer, (2014)