From post

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.

 

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

Designing Connected Tours That Almost Cover a Network., и . PDCAT, стр. 281-286. IEEE, (2013)Energy-efficient data gathering with tour length-constrained mobile elements in wireless sensor networks., , и . LCN, стр. 582-589. IEEE Computer Society, (2010)On the Complexity of SAT., и . FOCS, стр. 459-464. IEEE Computer Society, (1999)An incremental data-stream sketch using sparse random projections., , , и . SDM, стр. 563-568. SIAM, (2007)Connected tours for sensor networks using clustering techniques., , и . WOCC, стр. 432-437. IEEE, (2013)On the complexity of intersecting finite state automata and N L versus N P., , и . Theor. Comput. Sci., 302 (1-3): 257-274 (2003)A Constant-Factor Approximation Algorithm for the Link Building Problem., , и . COCOA (2), том 6509 из Lecture Notes in Computer Science, стр. 87-96. Springer, (2010)Design diagnosis using Boolean satisfiability., , и . ASP-DAC, стр. 218-223. IEEE Computer Society, (2004)Non-uniform Depth of Polynomial Time and Space Simulations., и . FCT, том 2751 из Lecture Notes in Computer Science, стр. 311-320. Springer, (2003)Analysis of a Forwarding Game without Payments., и . PDCAT, стр. 691-696. IEEE, (2012)