( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Independent feedback vertex sets for graphs of bounded diameter.

, , , , и . Inf. Process. Lett., (2018)

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

 

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

Bounding Clique-Width via Perfect Graphs., , и . CoRR, (2014)Parameterizing Cut Sets in a Graph by the Number of Their Components., , , и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 605-615. Springer, (2009)List Coloring in the Absence of a Linear Forest., , , и . WG, том 6986 из Lecture Notes in Computer Science, стр. 119-130. Springer, (2011)Graph Labelings Derived from Models in Distributed Computing., и . WG, том 4271 из Lecture Notes in Computer Science, стр. 301-312. Springer, (2006)Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)., , и . SAT, том 6695 из Lecture Notes in Computer Science, стр. 47-60. Springer, (2011)On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal., , , , и . CoRR, (2019)Using contracted solution graphs for solving reconfiguration problems., и . Acta Inf., 56 (7-8): 619-648 (2019)Finding Cactus Roots in Polynomial Time., , , и . IWOCA, том 9843 из Lecture Notes in Computer Science, стр. 361-372. Springer, (2016)Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes., , и . WG, том 10520 из Lecture Notes in Computer Science, стр. 220-233. Springer, (2017)Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs., , и . Comput. J., 58 (11): 3074-3088 (2015)