( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
New Algorithms for Weighted k-Domination and Total k-Domination Problems in Proper Interval Graphs.

, , , , и . CoRR, (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.

Anup Sam Ninan

Fernando Nina

Nina Heekerens

Untersuchungen zur Pododermatitis bei Kaninchen und Meerschweinchen. TierH Hannover, (2009)

Nina Raabe

Single-shot-echoplanare, diffusionsgewichtete MRT zur Differenzierung von Erkrankungen des Pankreas: eine quantitative und qualitative Auswertung. Uni Greifswald, (2009)

Nina Kleinschmidt

Untersuchung zum Vorkommen von Anthelminthikaresistenzen bei erstsömmrigen Rindern in norddeutschen Milchviehbetrieben. TierH Hannover, (2009)
 

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

Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs., , , , и . ISCO, том 10856 из Lecture Notes in Computer Science, стр. 290-302. Springer, (2018)Allocation of indivisible items with individual preference graphs., , , , , , , и . Discret. Appl. Math., (июля 2023)Linear Separation of Connected Dominating Sets in Graphs., и . ISAIM, (2014)Allocation of Indivisible Items with Individual Preference Graphs., , , , , , , и . CoRR, (2022)The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs., , , , , и . SWAT, том 294 из LIPIcs, стр. 7:1-7:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Linear Separation of Total Dominating Sets in Graphs., и . WG, том 8165 из Lecture Notes in Computer Science, стр. 165-176. Springer, (2013)Linear separation of connected dominating sets in graphs., и . Ars Math. Contemp., 16 (2): 487-525 (2019)Equistarable bipartite graphs., , и . Discret. Math., 339 (7): 1960-1969 (2016)Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph., , , , , , и . CoRR, (2023)Strong Cliques in Diamond-Free Graphs., , , , и . WG, том 12301 из Lecture Notes in Computer Science, стр. 261-273. Springer, (2020)