( en | de | ru )

 

Disambiguation of "Nilsson, Bengt J."

Author of the publication

copydeleteadd this publication to your clipboard
Clearing Connections by Few Agents.

, , , and . FUN, volume 8496 of Lecture Notes in Computer Science, page 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. You can also use the button next to the name to display some publications already assigned to the person.

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

 

Other publications of authors with the same name

The Complexity of Guarding Monotone Polygons., and . CCCG, page 167-172. (2012)Approximation Results for Kinetic Variants of TSP., and . Discret. Comput. Geom., 27 (4): 635-651 (2002)Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract)., , and . SCG, page 51-60. ACM, (1991)On Vertex Guarding Staircase Polygons., , , , , and . LATIN, volume 13568 of Lecture Notes in Computer Science, page 746-760. Springer, (2022)Competitive Strategies for Online Clique Clustering., , and . CIAC, volume 9079 of Lecture Notes in Computer Science, page 101-113. Springer, (2015)Minimum Spanning Trees in d Dimensions., , and . ESA, volume 1284 of Lecture Notes in Computer Science, page 341-349. Springer, (1997)Illuminating the x-Axis by α-Floodlights., , , , and . ISAAC, volume 212 of LIPIcs, page 11:1-11:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons., , and . Int. J. Comput. Geom. Appl., 3 (1): 85-105 (1993)Approximate Guarding of Monotone and Rectilinear Polygons.. ICALP, volume 3580 of Lecture Notes in Computer Science, page 1362-1373. Springer, (2005)Guarding Polyominoes Under k-Hop Visibility., , , , and . LATIN (1), volume 14578 of Lecture Notes in Computer Science, page 288-302. Springer, (2024)