( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parameterized Graph Cleaning Problems.

, и . WG, том 5344 из Lecture Notes in Computer Science, стр. 287-299. (2008)

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.

Ildikó Hajtó

Ildikó Rietz

Ildikó Gágyor

Ildikó Lajtos

Ildikó Varga

 

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

Complexity of Stability in Trading Networks., , , и . CoRR, (2018)Possible and Necessary Allocations Under Serial Dictatorship with Incomplete Preference Lists., , и . ADT, том 10576 из Lecture Notes in Computer Science, стр. 300-314. Springer, (2017)Parameterized Complexity of the Arc-Preserving Subsequence Problem., и . WG, том 6410 из Lecture Notes in Computer Science, стр. 244-255. (2010)Computational complexity of necessary envy-freeness., , и . Math. Soc. Sci., (2024)The popular assignment problem: when cardinality is more important than popularity., , , , и . SODA, стр. 103-123. SIAM, (2022)Stable Matchings with Covering Constraints: A Complete Computational Trichotomy., и . Algorithmica, 82 (5): 1136-1188 (2020)Campaign Management under Approval-Driven Voting Rules., , и . AAAI, стр. 726-731. AAAI Press, (2011)Stable Assignment with Couples: Parameterized Complexity and Local Search., и . IWPEC, том 5917 из Lecture Notes in Computer Science, стр. 300-311. Springer, (2009)Popular Branchings and Their Dual Certificates., , , , и . IPCO, том 12125 из Lecture Notes in Computer Science, стр. 223-237. Springer, (2020)Parameterized complexity of candidate nomination for elections based on positional scoring rules., , и . Auton. Agents Multi Agent Syst., 38 (2): 28 (декабря 2024)