Bengt J. Nilsson

Citirano

	Sve	Od 2018.
Citati	1029	337
H-indeks	18	11
i10-indeks	25	12

19911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202316 9 9 12 11 17 19 13 13 17 20 16 17 19 27 35 31 28 30 47 38 32 37 38 38 54 41 51 71 65 52 75 23

Javni pristup

Prikaži sve

5 članaka

0 članaka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Dimitris ParaschakisPh.D. in Computer Science, Malmö UniversityPotvrđena adresa e-pošte na mau.se
Marc van KreveldProfessor of Computer Science, Utrecht UniversityPotvrđena adresa e-pošte na uu.nl
Mark de BergProfessor of Computer Science, TU EindhovenPotvrđena adresa e-pošte na win.tue.nl
Paweł ŻylińskiUniwersytet GdańskiPotvrđena adresa e-pošte na ug.edu.pl
Marek ChrobakUniversity of California at RiversidePotvrđena adresa e-pošte na cs.ucr.edu
Christoph DürrCNRS, LIP6, Université Pierre et Marie CuriePotvrđena adresa e-pošte na lip6.fr
Aleksander FabijanExperimentation Platform (ExP) at MicrosoftPotvrđena adresa e-pošte na microsoft.com
eli packerIBM reasearch labPotvrđena adresa e-pošte na il.ibm.com
Leonidas PaliosProfessor, Dept of Computer Science and Engineering, University of IoanninaPotvrđena adresa e-pošte na cs.uoi.gr
David Orden Martín (ORCID: 0000-00...Full Professor of Applied Mathematics, Universidad de AlcaláPotvrđena adresa e-pošte na uah.es
André van RenssenUniversity of SydneyPotvrđena adresa e-pošte na sydney.edu.au
Joachim GudmundssonUniversity of SydneyPotvrđena adresa e-pošte na sydney.edu.au
Matt GibsonAssistant Professor of Computer Science, University of Texas at San AntonioPotvrđena adresa e-pošte na cs.utsa.edu
Elmar LangetepeTheoretical Computer Science -- University of BonnPotvrđena adresa e-pošte na informatik.uni-bonn.de

Prati

Bengt J. Nilsson

Professor of Computer Science, Malmö University

Potvrđena adresa e-pošte na mau.se - Početna stranica

Algorithms Complexity Computational Geometry Recommendation Algorithms e-Learning


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
Finding the shortest watchman route in a simple polygon S Carlsson, H Jonsson, BJ Nilsson Discrete & Computational Geometry 22, 377-402, 1999	139*	1999
Shortest Path Queries in Rectilinear Worlds M De Berg, M Van Kreveld, BJ Nilsson, M Overmars	90*	1992
Guarding art galleries: Methods for mobile guards BJ Nilsson Department of Computer Science, Lund University, Sweden, 1995	87	1995
Approximate guarding of monotone and rectilinear polygons EA Krohn, BJ Nilsson Algorithmica 66, 564-594, 2013	77*	2013
Optimum guard covers and m-watchmen routes for restricted polygons S Carlsson, BJ Nilsson, S Ntafos International Journal of Computational Geometry & Applications 3 (01), 85-105, 1993	67	1993
Guarding lines and 2-link polygons is APX-hard B Brodén, M Hammar, BJ Nilsson 13th Canadian Conference on Computational Geometry, 45-48, 2001	55	2001
Approximation results for kinetic variants of TSP Hammar, Nilsson Discrete & Computational Geometry 27 (4), 635-651, 2002	46	2002
Comparative evaluation of top-N recommenders in e-commerce: industrial perspective D Paraschakis, BJ Nilsson, J Holländer 14th International Conference on Machine Learning and Applications, (IEEE …, 2015	36	2015
A bandit-based ensemble framework for exploration/exploitation of diverse recommendation components: an experimental study within e-commerce B Brodén, M Hammar, BJ Nilsson, D Paraschakis ACM Transactions on Interactive Intelligent Systems (TiiS) 10 (1), 1-32, 2019	35*	2019
Using maximum coverage to optimize recommendation systems in e-commerce M Hammar, R Karlsson, BJ Nilsson Proceedings of the 7th ACM conference on Recommender systems, 265-272, 2013	34	2013
Minimum spanning trees in d dimensions D Krznaric, C Levcopoulos, BJ Nilsson Nordic Journal of Computing 6 (4), 446-461, 1999	33	1999
Concerning the time bounds of existing shortest watchman route algorithms M Hammar, BJ Nilsson Fundamentals of Computation Theory: 11th International Symposium, FCT'97 …, 1997	30	1997
Optimum Watchmen Routes in Spiral Polygons," extended abstract B Nilsson, D Wood Proceedings 2nd Canadian Conference in Computational Geometry, Ottawa, 269-272, 1990	29	1990
Computing vision points in polygons S Carlsson, BJ Nilsson Algorithmica 24, 50-75, 1999	28	1999
Parallel searching on m rays M Hammar, BJ Nilsson, S Schuierer Computational Geometry 18 (3), 125-139, 2001	25	2001
An optimal algorithm for the rectilinear link center of a rectilinear polygon BJ Nilsson, S Schuierer Computational Geometry 6 (3), 169-194, 1996	25*	1996
Computing the rectilinear link diameter of a polygon BJ Nilsson, S Schuierer Computational Geometry-Methods, Algorithms and Applications: International …, 1991	23	1991
Approximating a shortest watchman route BJ Nilsson Fundamenta Informaticae 45 (3), 235-281, 2001	20*	2001
The complexity of guarding monotone polygons E Krohn, BJ Nilsson Canadian Conference on Computational Geometry, Charlottetown, Prince Edward …, 2012	17	2012
Bandit algorithms for e-Commerce recommender systems B Brodén, M Hammar, BJ Nilsson, D Paraschakis Proceedings of the Eleventh ACM Conference on Recommender Systems, 349-349, 2017	16	2017

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori