Bengt J. Nilsson

73 papers A* 3A 5B 11C 6Misc 2Journal 33Unranked 13

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	m-Watchmen's routes in minbar and generalized minbar polygons. Comput. Geom. Rahmat Ghasemi, Alireza Bagheri, Anna Brötzner, Fatemeh Keshavarz-Kohjerdi, Faezeh Farivar, Bengt J. Nilsson, Christiane Schmidt
2025	J	`jnl`	Guarding Polyominoes Under k-Hop Visibility. Algorithmica Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt
2025	J	`jnl`	Improving Online Bin Covering with Little Advice. CoRR Andrej Brodnik, Bengt J. Nilsson, Gordana Vujovic
2025	—	`conf`	Multiple Watchman Routes in Staircase Polygons. CCCG Anna Brötzner, Bengt J. Nilsson, Christiane Schmidt
2025	J	`jnl`	Multiple Watchman Routes in Staircase Polygons. CoRR Anna Brötzner, Bengt J. Nilsson, Christiane Schmidt
2024	J	`jnl`	Approximation Algorithms for the Two-Watchman Route in a Simple Polygon. Algorithmica Bengt J. Nilsson, Eli Packer
2024	—	`conf`	Guarding Polyominoes Under k-Hop Visibility. LATIN (1) Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt
2024	C	`conf`	Improving Online Bin Covering with Little Advice. IWOCA Andrej Brodnik, Bengt J. Nilsson, Gordana Vujovic
2024	J	`jnl`	Online Bin Covering with Exact Parameter Advice. Informatica (Slovenia) Andrej Brodnik, Bengt J. Nilsson, Gordana Vujovic
2023	J	`jnl`	Approximation Algorithms for the Two-Watchman Route in a Simple Polygon. CoRR Bengt J. Nilsson, Eli Packer
2023	J	`jnl`	Minimum k-Hop Dominating Sets in Grid Graphs. CoRR Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt
2023	J	`jnl`	Online Bin Covering with Exact Parameter Advice. CoRR Andrej Brodnik, Bengt J. Nilsson, Gordana Vujovic
2023	B	`conf`	k-Transmitter Watchman Routes. WALCOM Bengt J. Nilsson, Christiane Schmidt
2022	J	`jnl`	APX-Hardness of the Minimum Vision Points Problem. CoRR Mayank Chaturvedi, Bengt J. Nilsson
2022	J	`jnl`	Local Routing in Sparse and Lightweight Geometric Graphs. Algorithmica Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen
2022	B	`conf`	On Vertex Guarding Staircase Polygons. LATIN Matt Gibson-Lopez, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Sean Soderman, Pawel Zylinski
2022	J	`jnl`	Online Two-Dimensional Vector Packing with Advice. CoRR Bengt J. Nilsson, Gordana Vujovic
2022	—	`conf`	Opposing Half Guards. CCCG Erik Krohn, Bengt J. Nilsson, Christiane Schmidt
2022	J	`jnl`	Opposing Half Guards. CoRR Erik Krohn, Bengt J. Nilsson, Christiane Schmidt
2022	J	`jnl`	k-Transmitter Watchman Routes. CoRR Bengt J. Nilsson, Christiane Schmidt
2021	B	`conf`	Illuminating the x-Axis by α-Floodlights. ISAAC Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski
2021	C	`conf`	Online Two-Dimensional Vector Packing With Advice. CIAC Bengt J. Nilsson, Gordana Vujovic
2020	J	`jnl`	A Bandit-Based Ensemble Framework for Exploration/Exploitation of Diverse Recommendation Components: An Experimental Study within E-Commerce. ACM Trans. Interact. Intell. Syst. Björn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis
2020	—	`conf`	FlowRec: Prototyping Session-Based Recommender Systems in Streaming Mode. PAKDD (1) Dimitris Paraschakis, Bengt J. Nilsson
2020	J	`jnl`	How to Keep an Eye on Small Things. Int. J. Comput. Geom. Appl. Bengt J. Nilsson, Pawel Zylinski
2020	—	`conf`	Matchmaking Under Fairness Constraints: A Speed Dating Case Study. BIAS Dimitris Paraschakis, Bengt J. Nilsson
2020	J	`jnl`	Online Clique Clustering. Algorithmica Marek Chrobak, Christoph Dürr, Aleksander Fabijan, Bengt J. Nilsson
2020	Misc	`conf`	Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility. COCOON Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski
2020	J	`jnl`	Shortest Watchman Tours in Simple Polygons under Rotated Monotone Visibility. CoRR Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski
2019	—	`conf`	A Note on Guarding Staircase Polygons. CCCG Matt Gibson, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Pawel Zylinski
2019	B	`conf`	Local Routing in Sparse and Lightweight Geometric Graphs. ISAAC Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen
2019	J	`jnl`	Local Routing in Sparse and Lightweight Geometric Graphs. CoRR Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen
2019	—	`conf`	The Lighthouse Problem - Navigating by Lighthouses in Geometric Domains. CCCG Bengt J. Nilsson, Pawel Zylinski
2018	A	`conf`	Ensemble Recommendations via Thompson Sampling: an Experimental Study within e-Commerce. IUI Björn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis
2017	A	`conf`	Bandit Algorithms for e-Commerce Recommender Systems: Extended Abstract. RecSys Björn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis
2017	—	`conf`	Discrete Surveillance Tours in Polygonal Domains. CCCG Elmar Langetepe, Bengt J. Nilsson, Eli Packer
2015	C	`conf`	Comparative Evaluation of Top-N Recommenders in e-Commerce: An Industrial Perspective. ICMLA Dimitris Paraschakis, Bengt J. Nilsson, John Hollander
2015	C	`conf`	Competitive Strategies for Online Clique Clustering. CIAC Marek Chrobak, Christoph Dürr, Bengt J. Nilsson
2014	J	`jnl`	Approximation Algorithms for Clique Clustering. CoRR Marek Chrobak, Christoph Dürr, Bengt J. Nilsson
2014	Misc	`conf`	Clearing Connections by Few Agents. FUN Christos Levcopoulos, Andrzej Lingas, Bengt J. Nilsson, Pawel Zylinski
2013	J	`jnl`	Approximate Guarding of Monotone and Rectilinear Polygons. Algorithmica Erik Krohn, Bengt J. Nilsson
2013	C	`conf`	Competitive Online Clique Clustering. CIAC Aleksander Fabijan, Bengt J. Nilsson, Mia Persson
2013	A	`conf`	Using maximum coverage to optimize recommendation systems in e-commerce. RecSys Mikael Hammar, Robin Karlsson, Bengt J. Nilsson
2012	—	`conf`	The Complexity of Guarding Monotone Polygons. CCCG Erik Krohn, Bengt J. Nilsson
2006	J	`jnl`	Competitive exploration of rectilinear polygons. Theor. Comput. Sci. Mikael Hammar, Bengt J. Nilsson, Mia Persson
2006	B	`conf`	The Online Freeze-Tag Problem. LATIN Mikael Hammar, Bengt J. Nilsson, Mia Persson
2005	A*	`conf`	Approximate Guarding of Monotone and Rectilinear Polygons. ICALP Bengt J. Nilsson
2004	J	`jnl`	Online and Offline Algorithms for the Time-Dependent TSP with Time Zones. Algorithmica Björn Brodén, Mikael Hammar, Bengt J. Nilsson
2003	B	`conf`	Competitive Exploration of Rectilinear Polygons. FCT Mikael Hammar, Bengt J. Nilsson, Mia Persson
2003	B	`ed.`	Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings FCT Andrzej Lingas, Bengt J. Nilsson
2002	J	`jnl`	Approximation Results for Kinetic Variants of TSP. Discret. Comput. Geom. Mikael Hammar, Bengt J. Nilsson
2002	J	`jnl`	Improved Exploration of Rectilinear Polygons. Nord. J. Comput. Mikael Hammar, Bengt J. Nilsson, Sven Schuierer
2001	J	`jnl`	Approximating a Shortest Watchman Route. Fundam. Informaticae Bengt J. Nilsson
2001	—	`conf`	Guarding lines and 2-link polygons is apx-hard. CCCG Björn Brodén, Mikael Hammar, Bengt J. Nilsson
2001	J	`jnl`	Parallel searching on m rays. Comput. Geom. Mikael Hammar, Bengt J. Nilsson, Sven Schuierer
1999	A*	`conf`	Approximation Results for Kinetic Variants of TSP. ICALP Mikael Hammar, Bengt J. Nilsson
1999	J	`jnl`	Computing Vision Points in Polygons. Algorithmica Svante Carlsson, Bengt J. Nilsson
1999	J	`jnl`	Finding the Shortest Watchman Route in a Simple Polygon. Discret. Comput. Geom. Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson
1999	J	`jnl`	Minimum Spanning Trees in d Dimensions. Nord. J. Comput. Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson
1999	A	`conf`	Parallel Searching on m Rays. STACS Mikael Hammar, Bengt J. Nilsson, Sven Schuierer
1997	B	`conf`	Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms. FCT Mikael Hammar, Bengt J. Nilsson
1997	A	`conf`	Minimum Spanning Trees in ESA Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson
1996	J	`jnl`	An Optimal Algorithm for the Rectilinear Link Center of a Rectilinear Polygon. Comput. Geom. Bengt J. Nilsson, Sven Schuierer
1993	B	`conf`	Finding the Shortest Watchman Route in a Simple Polygon. ISAAC Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson
1993	J	`jnl`	Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons. Int. J. Comput. Geom. Appl. Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos
1992	—	`conf`	Restricted Orientation Computational Geometry. Data Structures and Efficient Algorithms Bengt J. Nilsson, Thomas Ottmann, Sven Schuierer, Christian Icking
1992	C	`conf`	Shortest ICCI Bengt J. Nilsson, Sven Schuierer
1992	J	`jnl`	Shortest path queries in rectilinear worlds. Int. J. Comput. Geom. Appl. Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars
1991	B	`conf`	An Optimal Algorithm for the Rectilinear Link Center of a Rectangular Polygon. WADS Bengt J. Nilsson, Sven Schuierer
1991	A*	`conf`	Computing the Rectilinear Link Diameter of a Polygon. Workshop on Computational Geometry Bengt J. Nilsson, Sven Schuierer
1991	B	`conf`	Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons. WADS Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos
1991	—	`conf`	Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract). SCG Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson
1990	—	`conf`	Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric. SWAT Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars