( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings

, , , , , и (Ред.) том 4362 из Lecture Notes in Computer Science, Springer, (2007)
DOI: 10.1007/978-3-540-69507-3

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.

Imalina Leeuwen

Peter Leeuwen

Jan van Neerven

Jan van Weeren

Sara Leeuwen

 

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

Structure of Polynomial-Time Approximation., и . Theory Comput. Syst., 50 (4): 641-674 (2012)Convex Polygon Intersection Graphs., и . GD, том 6502 из Lecture Notes in Computer Science, стр. 377-388. Springer, (2010)Shortcutting directed and undirected networks with a degree constraint., , и . Discret. Appl. Math., (2017)Integer representations of convex polygon intersection graphs., , и . SCG, стр. 300-307. ACM, (2011)On Floridi's Method of Levels of Abstraction.. Minds and Machines, 24 (1): 5-17 (2014)Non-classical Turing machines: extending the notion of computation., и . NCMA, стр. 29-40. Österreichische Computer Gesellschaft, (2017)The Complexity of Interval Routing on Random Graphs., , и . MFCS, том 969 из Lecture Notes in Computer Science, стр. 37-49. Springer, (1995)Maintenance of Transitive Closures and Transitive Reductions of Graphs., и . WG, том 314 из Lecture Notes in Computer Science, стр. 106-120. Springer, (1987)Maintenance of Transitive Closures and Transitive Reductions of Graphs, и . WG '87: Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science, стр. 106--120. London, UK, Springer-Verlag, (1988)Microprogrammed random access stored program machines., и . SIGACT News, 6 (3): 23-32 (1974)