default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBengt J. Nilsson
- > Home > Persons > Bengt J. Nilsson
Publications
- 2024
[j18]Bengt J. Nilsson
, Eli Packer:
Approximation Algorithms for the Two-Watchman Route in a Simple Polygon. Algorithmica 86(9): 2845-2884 (2024)- [c38]Andrej Brodnik, Bengt J. Nilsson, Gordana Vujovic:
Improving Online Bin Covering with Little Advice. IWOCA 2024: 69-81 - [c37]Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt:
Guarding Polyominoes Under k-Hop Visibility. LATIN (1) 2024: 288-302 - 2023
- [c36]Bengt J. Nilsson, Christiane Schmidt:
k-Transmitter Watchman Routes. WALCOM 2023: 202-213 - [i10]Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt:
Minimum k-Hop Dominating Sets in Grid Graphs. CoRR abs/2308.00334 (2023) - [i9]Bengt J. Nilsson, Eli Packer:
Approximation Algorithms for the Two-Watchman Route in a Simple Polygon. CoRR abs/2309.13428 (2023) - [i8]Andrej Brodnik, Bengt J. Nilsson, Gordana Vujovic:
Online Bin Covering with Exact Parameter Advice. CoRR abs/2309.13647 (2023) - 2022
- [j17]Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen:
Local Routing in Sparse and Lightweight Geometric Graphs. Algorithmica 84(5): 1316-1340 (2022) - [c35]Erik Krohn, Bengt J. Nilsson, Christiane Schmidt:
Opposing Half Guards. CCCG 2022: 219-226 - [c34]Matt Gibson-Lopez, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Sean Soderman, Pawel Zylinski:
On Vertex Guarding Staircase Polygons. LATIN 2022: 746-760 - [i7]Bengt J. Nilsson, Christiane Schmidt:
k-Transmitter Watchman Routes. CoRR abs/2202.01757 (2022) - [i6]Bengt J. Nilsson, Gordana Vujovic:
Online Two-Dimensional Vector Packing with Advice. CoRR abs/2204.10322 (2022) - [i5]Erik Krohn, Bengt J. Nilsson, Christiane Schmidt:
Opposing Half Guards. CoRR abs/2207.04474 (2022) - 2021
- [c33]Bengt J. Nilsson, Gordana Vujovic:
Online Two-Dimensional Vector Packing With Advice. CIAC 2021: 381-393 - [c32]Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski:
Illuminating the x-Axis by α-Floodlights. ISAAC 2021: 11:1-11:12 - 2020
- [j16]Marek Chrobak, Christoph Dürr, Aleksander Fabijan, Bengt J. Nilsson:
Online Clique Clustering. Algorithmica 82(4): 938-965 (2020) - [j15]Bengt J. Nilsson, Pawel Zylinski:
How to Keep an Eye on Small Things. Int. J. Comput. Geom. Appl. 30(2): 97-120 (2020) - [j14]Björn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis:
A Bandit-Based Ensemble Framework for Exploration/Exploitation of Diverse Recommendation Components: An Experimental Study within E-Commerce. ACM Trans. Interact. Intell. Syst. 10(1): 4:1-4:32 (2020) - [c31]Dimitris Paraschakis, Bengt J. Nilsson:
Matchmaking Under Fairness Constraints: A Speed Dating Case Study. BIAS 2020: 43-57 - [c30]Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski:
Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility. COCOON 2020: 311-323 - [c29]Dimitris Paraschakis, Bengt J. Nilsson:
FlowRec: Prototyping Session-Based Recommender Systems in Streaming Mode. PAKDD (1) 2020: 65-77 - [i3]Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski:
Shortest Watchman Tours in Simple Polygons under Rotated Monotone Visibility. CoRR abs/2007.08368 (2020) - 2019
- [c28]Bengt J. Nilsson, Pawel Zylinski:
The Lighthouse Problem - Navigating by Lighthouses in Geometric Domains. CCCG 2019: 71-77 - [c27]Matt Gibson, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Pawel Zylinski:
A Note on Guarding Staircase Polygons. CCCG 2019: 105-109 - [c26]Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen:
Local Routing in Sparse and Lightweight Geometric Graphs. ISAAC 2019: 30:1-30:13 - [i2]Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen:
Local Routing in Sparse and Lightweight Geometric Graphs. CoRR abs/1909.10215 (2019) - 2018
- [c25]Björn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis:
Ensemble Recommendations via Thompson Sampling: an Experimental Study within e-Commerce. IUI 2018: 19-29 - 2017
- [c24]Elmar Langetepe, Bengt J. Nilsson, Eli Packer:
Discrete Surveillance Tours in Polygonal Domains. CCCG 2017: 162-167 - [c23]Björn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis:
Bandit Algorithms for e-Commerce Recommender Systems: Extended Abstract. RecSys 2017: 349 - 2015
- [c22]Marek Chrobak, Christoph Dürr, Bengt J. Nilsson:
Competitive Strategies for Online Clique Clustering. CIAC 2015: 101-113 - [c21]Dimitris Paraschakis, Bengt J. Nilsson, John Hollander:
Comparative Evaluation of Top-N Recommenders in e-Commerce: An Industrial Perspective. ICMLA 2015: 1024-1031 - 2014
- [c20]Christos Levcopoulos, Andrzej Lingas, Bengt J. Nilsson, Pawel Zylinski:
Clearing Connections by Few Agents. FUN 2014: 289-300 - [i1]Marek Chrobak, Christoph Dürr, Bengt J. Nilsson:
Approximation Algorithms for Clique Clustering. CoRR abs/1411.4274 (2014) - 2013
- [j13]Erik Krohn, Bengt J. Nilsson:
Approximate Guarding of Monotone and Rectilinear Polygons. Algorithmica 66(3): 564-594 (2013) - [c19]Aleksander Fabijan, Bengt J. Nilsson, Mia Persson:
Competitive Online Clique Clustering. CIAC 2013: 221-233 - [c18]Mikael Hammar, Robin Karlsson, Bengt J. Nilsson:
Using maximum coverage to optimize recommendation systems in e-commerce. RecSys 2013: 265-272 - 2012
- [c17]Erik Krohn, Bengt J. Nilsson:
The Complexity of Guarding Monotone Polygons. CCCG 2012: 167-172 - 2006
- [j12]Mikael Hammar, Bengt J. Nilsson, Mia Persson:
Competitive exploration of rectilinear polygons. Theor. Comput. Sci. 354(3): 367-378 (2006) - [c16]Mikael Hammar, Bengt J. Nilsson, Mia Persson:
The Online Freeze-Tag Problem. LATIN 2006: 569-579 - 2004
- [j11]Björn Brodén, Mikael Hammar, Bengt J. Nilsson:
Online and Offline Algorithms for the Time-Dependent TSP with Time Zones. Algorithmica 39(4): 299-319 (2004) - 2003
- [c14]Mikael Hammar, Bengt J. Nilsson, Mia Persson:
Competitive Exploration of Rectilinear Polygons. FCT 2003: 234-245 - [e1]Andrzej Lingas, Bengt J. Nilsson:
Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings. Lecture Notes in Computer Science 2751, Springer 2003, ISBN 3-540-40543-7 [contents] - 2002
- [j10]Mikael Hammar, Bengt J. Nilsson:
Approximation Results for Kinetic Variants of TSP. Discret. Comput. Geom. 27(4): 635-651 (2002) - [j9]Mikael Hammar, Bengt J. Nilsson, Sven Schuierer:
Improved Exploration of Rectilinear Polygons. Nord. J. Comput. 9(1): 32-53 (2002) - 2001
- [j8]Mikael Hammar, Bengt J. Nilsson, Sven Schuierer:
Parallel searching on m rays. Comput. Geom. 18(3): 125-139 (2001) - [c13]Björn Brodén, Mikael Hammar, Bengt J. Nilsson:
Guarding lines and 2-link polygons is apx-hard. CCCG 2001: 45-48 - 1999
- [j6]Svante Carlsson, Bengt J. Nilsson:
Computing Vision Points in Polygons. Algorithmica 24(1): 50-75 (1999) - [j5]Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson:
Finding the Shortest Watchman Route in a Simple Polygon. Discret. Comput. Geom. 22(3): 377-402 (1999) - [j4]Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson:
Minimum Spanning Trees in d Dimensions. Nord. J. Comput. 6(4): 446-461 (1999) - [c12]Mikael Hammar, Bengt J. Nilsson:
Approximation Results for Kinetic Variants of TSP. ICALP 1999: 392-401 - [c11]Mikael Hammar, Bengt J. Nilsson, Sven Schuierer:
Parallel Searching on m Rays. STACS 1999: 132-142 - 1997
- [c10]Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson:
Minimum Spanning Trees in d Dimensions. ESA 1997: 341-349 - [c9]Mikael Hammar, Bengt J. Nilsson:
Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms. FCT 1997: 210-221 - 1996
- [j3]Bengt J. Nilsson, Sven Schuierer:
An Optimal Algorithm for the Rectilinear Link Center of a Rectilinear Polygon. Comput. Geom. 6: 169-194 (1996) - 1993
- [j2]Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos:
Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons. Int. J. Comput. Geom. Appl. 3(1): 85-105 (1993) - [c8]Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson:
Finding the Shortest Watchman Route in a Simple Polygon. ISAAC 1993: 58-67 - 1992
- [j1]Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars:
Shortest path queries in rectilinear worlds. Int. J. Comput. Geom. Appl. 2(3): 287-309 (1992) - [c7]Bengt J. Nilsson, Thomas Ottmann, Sven Schuierer, Christian Icking:
Restricted Orientation Computational Geometry. Data Structures and Efficient Algorithms 1992: 148-185 - [c6]Bengt J. Nilsson, Sven Schuierer:
Shortest m-Watchmen Routes for Histograms: The MinMax Case. ICCI 1992: 30-33 - 1991
- [c5]Bengt J. Nilsson, Sven Schuierer:
Computing the Rectilinear Link Diameter of a Polygon. Workshop on Computational Geometry 1991: 203-215 - [c4]Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson:
Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract). SCG 1991: 51-60 - [c3]Bengt J. Nilsson, Sven Schuierer:
An Optimal Algorithm for the Rectilinear Link Center of a Rectangular Polygon. WADS 1991: 249-260 - [c2]Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos:
Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons. WADS 1991: 367-378 - 1990
- [c1]Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars:
Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric. SWAT 1990: 213-224
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
