| Local Routing in Sparse and Lightweight Geometric Graphs | 0 | 0.34 | 2022 |
| Online Two-Dimensional Vector Packing With Advice. | 0 | 0.34 | 2021 |
| Illuminating the x-Axis by α-Floodlights. | 0 | 0.34 | 2021 |
| Shortest Watchman Tours in Simple Polygons under Rotated Monotone Visibility | 0 | 0.34 | 2020 |
| FlowRec: Prototyping Session-Based Recommender Systems in Streaming Mode. | 0 | 0.34 | 2020 |
| Online Clique Clustering. | 0 | 0.34 | 2020 |
| Matchmaking Under Fairness Constraints - A Speed Dating Case Study. | 0 | 0.34 | 2020 |
| A Bandit-Based Ensemble Framework for Exploration/Exploitation of Diverse Recommendation Components: An Experimental Study within E-Commerce | 0 | 0.34 | 2020 |
| A Note on Guarding Staircase Polygons. | 0 | 0.34 | 2019 |
| Ensemble Recommendations via Thompson Sampling: an Experimental Study within e-Commerce. | 0 | 0.34 | 2018 |
| Bandit Algorithms for e-Commerce Recommender Systems: Extended Abstract | 2 | 0.38 | 2017 |
| Discrete Surveillance Tours in Polygonal Domains. | 0 | 0.34 | 2017 |
| Comparative Evaluation Of Top-N Recommenders In E-Commerce: An Industrial Perspective | 4 | 0.45 | 2015 |
| Competitive Strategies for Online Clique Clustering | 0 | 0.34 | 2015 |
| Clearing Connections by Few Agents. | 1 | 0.35 | 2014 |
| Competitive Online Clique Clustering. | 1 | 0.37 | 2013 |
| Using maximum coverage to optimize recommendation systems in e-commerce | 5 | 0.41 | 2013 |
| Approximate Guarding of Monotone and Rectilinear Polygons. | 19 | 0.94 | 2013 |
| The Complexity of Guarding Monotone Polygons. | 3 | 0.43 | 2012 |
| The online freeze-tag problem | 1 | 0.39 | 2006 |
| Competitive exploration of rectilinear polygons | 3 | 0.41 | 2006 |
| Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings | 36 | 2.49 | 2003 |
| Approximation Results For Kinetic Variants Of Tsp | 1 | 0.37 | 2002 |
| Improved exploration of rectilinear polygons | 3 | 0.40 | 2002 |
| Guarding lines and 2-link polygons is apx-hard | 2 | 0.41 | 2001 |
| Approximating a Shortest Watchman Route | 1 | 0.35 | 2001 |
| Computing Vision Points in Polygons | 7 | 0.49 | 1999 |
| Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms | 8 | 1.62 | 1997 |
| Minimum spanning trees in d dimensions | 13 | 0.71 | 1997 |
| Finding the Shortest Watchman Route in a Simple Polygon | 29 | 2.66 | 1993 |
| Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons | 8 | 0.93 | 1993 |
| Restricted Orientation Computational Geometry | 1 | 0.36 | 1992 |
| Shortest m-watchmen routes for histograms: the minmax case | 1 | 0.46 | 1992 |
| Shortest Path Queries In Rectilinear Worlds | 15 | 0.82 | 1992 |
| Optimum Guard Covers And M-Watchmen Routes For Restricted Polygons | 12 | 0.92 | 1991 |
| Shortest path queries in rectilinear worlds of higher dimension (extended abstract) | 7 | 0.79 | 1991 |
| Computing the Rectilinear Link Diameter of a Polygon | 10 | 0.69 | 1991 |
| An optimal algorithm for the rectilinear link center of a rectilinear polygon | 6 | 0.69 | 1991 |
| Finding shortest paths in the presence of orthogonal obstacles using a combined L1 and link metric | 11 | 1.06 | 1990 |
