( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Parameterized Complexity of Layered Graph Drawing.

, , , , , , , , , и . Algorithmica, 52 (2): 267-292 (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.

Peter Kitching

Matthew Mellon

Matthew David

Olumuyiwa Matthew

Peter Matthew

 

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

On the Parameterized Complexity of Layered Graph Drawing., , , , , , , , , и 2 other автор(ы). ESA, том 2161 из Lecture Notes in Computer Science, стр. 488-499. Springer, (2001)Symmetric Component Caching., и . IJCAI, стр. 118-124. (2007)Set Branching in Constraint Optimization., и . IJCAI, стр. 532-537. (2009)Decomposition and Symmetry in Constraint Optimization Problems.. University of Toronto, Canada, (2011)The Three Dimensional Logic Engine., и . GD, том 3383 из Lecture Notes in Computer Science, стр. 329-339. Springer, (2004)Exploiting Decomposition in Constraint Optimization Problems., и . CP, том 5202 из Lecture Notes in Computer Science, стр. 478-492. Springer, (2008)Using Expectation Maximization to Find Likely Assignments for Solving CSP's., , , и . AAAI, стр. 224-230. AAAI Press, (2007)A Fixed-Parameter Approach to Two-Layer Planarization., , , , , , , , , и 2 other автор(ы). GD, том 2265 из Lecture Notes in Computer Science, стр. 1-15. Springer, (2001)On the Parameterized Complexity of Layered Graph Drawing., , , , , , , , , и . Algorithmica, 52 (2): 267-292 (2008)Exploiting Decomposition on Constraint Problems with High Tree-Width., и . IJCAI, стр. 525-531. (2009)