( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Theoretical Examination of Practical Game Playing: Lookahead Search.

, , и . SAGT, том 7615 из Lecture Notes in Computer Science, стр. 251-262. Springer, (2012)

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.

Elsiamma Vettam

Adrian Gabriel

Nicole Adrian

Adrian Lucaciu

Adrian Bölingen

 

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

On the Implications of Lookahead Search in Game Playing, , и . CoRR, (2012)A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem., , и . ACM Trans. Algorithms, 15 (4): 55:1-55:28 (2019)Lighting fibers in a dark network., и . IEEE J. Sel. Areas Commun., 22 (9): 1583-1588 (2004)Approximate Min-max Relations for Odd Cycles in Planar Graphs., , , и . IPCO, том 3509 из Lecture Notes in Computer Science, стр. 35-50. Springer, (2005)The Fair Division of Hereditary Set Systems., и . WINE, том 11316 из Lecture Notes in Computer Science, стр. 297-311. Springer, (2018)Descending the Stable Matching Lattice: How Many Strategic Agents Are Required to Turn Pessimality to Optimality?, , и . SAGT, том 12885 из Lecture Notes in Computer Science, стр. 281-295. Springer, (2021)An Improved Bound for the Tree Conjecture in Network Creation Games., и . SAGT, том 13584 из Lecture Notes in Computer Science, стр. 241-257. Springer, (2022)Two Birds with One Stone: Fairness and Welfare via Transfers., , и . SAGT, том 12885 из Lecture Notes in Computer Science, стр. 376-390. Springer, (2021)On the odd-minor variant of Hadwiger's conjecture., , , , и . J. Comb. Theory, Ser. B, 99 (1): 20-29 (2009)One Dollar Each Eliminates Envy., , , , и . EC, стр. 23-39. ACM, (2020)