( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Clearing Connections by Few Agents.

, , , и . FUN, том 8496 из Lecture Notes in Computer Science, стр. 289-300. Springer, (2014)

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.

Bengt E J Peterson

Bengt Seeberg

Andreas Nilsson

BSCCO superconductors processed by the glass ceramic route: critical aspects of process, crystallization and incorporation of oxygen, composition dependence on phase formation. TU Dresden, (2009)

Tomas Bengtsson

Wolfgang Bengtsson

 

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

Approximate Guarding of Monotone and Rectilinear Polygons.. ICALP, том 3580 из Lecture Notes in Computer Science, стр. 1362-1373. Springer, (2005)Finding the Shortest Watchman Route in a Simple Polygon., , и . ISAAC, том 762 из Lecture Notes in Computer Science, стр. 58-67. Springer, (1993)Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons., , и . Int. J. Comput. Geom. Appl., 3 (1): 85-105 (1993)Online Two-Dimensional Vector Packing With Advice., и . CIAC, том 12701 из Lecture Notes in Computer Science, стр. 381-393. Springer, (2021)Guarding Polyominoes Under k-Hop Visibility., , , , и . LATIN (1), том 14578 из Lecture Notes in Computer Science, стр. 288-302. Springer, (2024)Illuminating the x-Axis by α-Floodlights., , , , и . ISAAC, том 212 из LIPIcs, стр. 11:1-11:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility., , , , и . COCOON, том 12273 из Lecture Notes in Computer Science, стр. 311-323. Springer, (2020)On Vertex Guarding Staircase Polygons., , , , , и . LATIN, том 13568 из Lecture Notes in Computer Science, стр. 746-760. Springer, (2022)Minimum Spanning Trees in d Dimensions., , и . ESA, том 1284 из Lecture Notes in Computer Science, стр. 341-349. Springer, (1997)Competitive Strategies for Online Clique Clustering., , и . CIAC, том 9079 из Lecture Notes in Computer Science, стр. 101-113. Springer, (2015)