Bengt J. Nilsson
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
28
Venues
18
Active years
1991–2026
Best venue rank
A*
Where they publish
Papers
28 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | MFCS | Segment Watchman Routes. | Anna Brtzner, Omrit Filtser, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt |
| 2024 | IWOCA | Improving Online Bin Covering with Little Advice. | Andrej Brodnik, Bengt J. Nilsson, Gordana Vujovic |
| 2024 | LATIN | Guarding Polyominoes Under k-Hop Visibility. | Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt |
| 2023 | WALCOM | k-Transmitter Watchman Routes. | Bengt J. Nilsson, Christiane Schmidt |
| 2022 | LATIN | On Vertex Guarding Staircase Polygons. | Matt Gibson-Lopez, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Sean Soderman, Pawel Zylinski |
| 2021 | CIAC | Online Two-Dimensional Vector Packing With Advice. | Bengt J. Nilsson, Gordana Vujovic |
| 2021 | ISAAC | Illuminating the x-Axis by α-Floodlights. | Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski |
| 2020 | COCOON | Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility. | Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski |
| 2020 | PAKDD | FlowRec: Prototyping Session-Based Recommender Systems in Streaming Mode. | Dimitris Paraschakis, Bengt J. Nilsson |
| 2019 | ISAAC | Local Routing in Sparse and Lightweight Geometric Graphs. | Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, Andr van Renssen |
| 2018 | IUI | Ensemble Recommendations via Thompson Sampling: an Experimental Study within e-Commerce. | Bjrn Brodn, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis |
| 2017 | RecSys | Bandit Algorithms for e-Commerce Recommender Systems: Extended Abstract. | Bjrn Brodn, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis |
| 2015 | CIAC | Competitive Strategies for Online Clique Clustering. | Marek Chrobak, Christoph Drr, Bengt J. Nilsson |
| 2015 | ICMLA | Comparative Evaluation of Top-N Recommenders in e-Commerce: An Industrial Perspective. | Dimitris Paraschakis, Bengt J. Nilsson, John Hollander |
| 2014 | FUN | Clearing Connections by Few Agents. | Christos Levcopoulos, Andrzej Lingas, Bengt J. Nilsson, Pawel Zylinski |
| 2013 | CIAC | Competitive Online Clique Clustering. | Aleksander Fabijan, Bengt J. Nilsson, Mia Persson |
| 2013 | RecSys | Using maximum coverage to optimize recommendation systems in e-commerce. | Mikael Hammar, Robin Karlsson, Bengt J. Nilsson |
| 2006 | LATIN | The Online Freeze-Tag Problem. | Mikael Hammar, Bengt J. Nilsson, Mia Persson |
| 2005 | ICALP | Approximate Guarding of Monotone and Rectilinear Polygons. | Bengt J. Nilsson |
| 2003 | FCT | Competitive Exploration of Rectilinear Polygons. | Mikael Hammar, Bengt J. Nilsson, Mia Persson |
| 1999 | ICALP | Approximation Results for Kinetic Variants of TSP. | Mikael Hammar, Bengt J. Nilsson |
| 1999 | STACS | Parallel Searching on m Rays. | Mikael Hammar, Bengt J. Nilsson, Sven Schuierer |
| 1997 | ESA | Minimum Spanning Trees in | Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson |
| 1997 | FCT | Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms. | Mikael Hammar, Bengt J. Nilsson |
| 1993 | ISAAC | Finding the Shortest Watchman Route in a Simple Polygon. | Svante Carlsson, Hkan Jonsson, Bengt J. Nilsson |
| 1992 | ICCI | Shortest | Bengt J. Nilsson, Sven Schuierer |
| 1991 | WADS | Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons. | Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos |
| 1991 | WADS | An Optimal Algorithm for the Rectilinear Link Center of a Rectangular Polygon. | Bengt J. Nilsson, Sven Schuierer |