default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndré Nusser
Person information
- affiliation: INRIA / Université Côte d'Azur, France
- affiliation: University of Copenhagen, Denmark
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
- affiliation: University of Stuttgart, FMI, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c23]Mikkel Abrahamsen, Sarita de Berg
, Lucas Meijer, André Nusser, Leonidas Theocharous:
Clustering with Few Disks to Minimize the Sum of Radii. SoCG 2024: 2:1-2:15- [c22]Ivor van der Hoog, André Nusser, Eva Rotenberg, Frank Staals:
Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs. MFCS 2024: 63:1-63:17 - [c21]Mikkel Abrahamsen, Joakim Blikstad, André Nusser, Hanwen Zhang:
Minimum Star Partitions of Simple Polygons in Polynomial Time. STOC 2024: 904-910 - [i17]Ivor van der Hoog, André Nusser, Eva Rotenberg, Frank Staals:
Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs. CoRR abs/2406.20065 (2024) - [i16]Karl Bringmann, Kasper Green Larsen, André Nusser, Eva Rotenberg, Yanheng Wang:
Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation. CoRR abs/2410.00996 (2024) - 2023
- [c20]Mikkel Abrahamsen, William Bille Meyling, André Nusser:
Constructing Concise Convex Covers via Clique Covers (CG Challenge). SoCG 2023: 66:1-66:9 - [i15]Mikkel Abrahamsen, Joakim Blikstad, André Nusser, Hanwen Zhang:
Minimum Star Partitions of Simple Polygons in Polynomial Time. CoRR abs/2311.10631 (2023) - [i14]Mikkel Abrahamsen, Sarita de Berg, Lucas Meijer, André Nusser, Leonidas Theocharous:
Clustering with Few Disks to Minimize the Sum of Radii. CoRR abs/2312.08803 (2023) - 2022
- [j11]David Coudert, André Nusser, Laurent Viennot:
Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation. ACM J. Exp. Algorithmics 27: 1.15:1-1.15:29 (2022) - [j10]Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser:
Dynamic time warping under translation: Approximation guided by space-filling curves. J. Comput. Geom. 14(2): 83-107 (2022) - [c19]David Coudert, André Nusser, Laurent Viennot:
Computing Graph Hyperbolicity Using Dominating Sets. ALENEX 2022: 78-90 - [c18]Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser:
Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves. SoCG 2022: 20:1-20:17 - [c17]Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, André Nusser, Zahra Parsaeian:
Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs. SoCG 2022: 21:1-21:16 - [c16]Kevin Buchin, André Nusser, Sampson Wong:
Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time. SoCG 2022: 22:1-22:16 - [c15]Karl Bringmann, Anne Driemel, André Nusser, Ioannis Psarros:
Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance. SODA 2022: 517-550 - [c14]Marvin Künnemann, André Nusser:
Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union. SODA 2022: 3181-3201 - [i13]Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, André Nusser, Zahra Parsaeian:
Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs. CoRR abs/2203.03663 (2022) - [i12]Kevin Buchin, André Nusser, Sampson Wong:
Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time. CoRR abs/2203.04531 (2022) - [i11]Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser:
Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves. CoRR abs/2203.07898 (2022) - 2021
- [b1]André Nusser:
Fine-grained complexity and algorithm engineering of geometric similarity measures. Saarland University, Saarbrücken, Germany, 2021 - [j9]Emilio Cruciani, Emanuele Natale, André Nusser, Giacomo Scornavacca:
Phase transition of the 2-Choices dynamics on core-periphery networks. Distributed Comput. 34(3): 207-225 (2021) - [j8]Anne Driemel, André Nusser, Jeff M. Phillips, Ioannis Psarros:
The VC Dimension of Metric Balls under Fréchet and Hausdorff Distances. Discret. Comput. Geom. 66(4): 1351-1381 (2021) - [j7]Karl Bringmann, Marvin Künnemann, André Nusser:
Walking the dog fast in practice: Algorithm engineering of the Fréchet distance. J. Comput. Geom. 12(1): 70-108 (2021) - [j6]Karl Bringmann, André Nusser:
Translating Hausdorff is hard: fine-grained lower bounds for Hausdorff distance under translation. J. Comput. Geom. 13(2): 30-50 (2021) - [j5]Karl Bringmann, Marvin Künnemann, André Nusser:
Discrete Fréchet Distance under Translation: Conditional Hardness and an Improved Algorithm. ACM Trans. Algorithms 17(3): 25:1-25:42 (2021) - [c13]Karl Bringmann, André Nusser:
Translating Hausdorff Is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation. SoCG 2021: 18:1-18:17 - [i10]Karl Bringmann, André Nusser:
Translating Hausdorff is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation. CoRR abs/2101.07696 (2021) - [i9]David Coudert, André Nusser, Laurent Viennot:
Enumeration of Far-Apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation. CoRR abs/2104.12523 (2021) - [i8]Karl Bringmann, Anne Driemel, André Nusser, Ioannis Psarros:
Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance. CoRR abs/2107.07792 (2021) - [i7]Marvin Künnemann, André Nusser:
Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union. CoRR abs/2111.02544 (2021) - [i6]David Coudert, André Nusser, Laurent Viennot:
Hyperbolicity Computation through Dominating Sets. CoRR abs/2111.08520 (2021) - 2020
- [c12]Karl Bringmann, Marvin Künnemann, André Nusser:
When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under Translation. ESA 2020: 25:1-25:17 - [c11]Milutin Brankovic, Kevin Buchin, Koen Klaren, André Nusser, Aleksandr Popov, Sampson Wong:
(k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping. SIGSPATIAL/GIS 2020: 99-110 - [i5]Karl Bringmann, Marvin Künnemann, André Nusser:
When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation. CoRR abs/2008.07510 (2020) - [i4]Milutin Brankovic, Kevin Buchin, Koen Klaren, André Nusser, Aleksandr Popov, Sampson Wong:
(k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping. CoRR abs/2012.00464 (2020)
2010 – 2019
- 2019
- [c10]Karl Bringmann, Marvin Künnemann, André Nusser:
Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance. SoCG 2019: 17:1-17:21 - [c9]Kevin Buchin, Anne Driemel, Natasja van de L'Isle, André Nusser:
klcluster: Center-based Clustering of Trajectories. SIGSPATIAL/GIS 2019: 496-499 - [c8]Karl Bringmann, Marvin Künnemann, André Nusser:
Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability. SODA 2019: 2902-2921 - [c7]Stefan Funke, Tobias Rupp, André Nusser, Sabine Storandt:
PATHFINDER: Storage and Indexing of Massive Trajectory Sets. SSTD 2019: 90-99 - [i3]Karl Bringmann, Marvin Künnemann, André Nusser:
Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance. CoRR abs/1901.01504 (2019) - 2018
- [j4]Emilio Cruciani, Emanuele Natale, André Nusser, Giacomo Scornavacca:
Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks. Bull. EATCS 125 (2018) - [c6]Emilio Cruciani, Emanuele Natale, André Nusser, Giacomo Scornavacca:
Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks. AAMAS 2018: 777-785 - [c5]Emilio Cruciani, Emanuele Natale, André Nusser, Giacomo Scornavacca:
On the Emergent Behavior of the 2-Choices Dynamics. ICTCS 2018: 60-64 - [i2]Emilio Cruciani, Emanuele Natale, André Nusser, Giacomo Scornavacca:
Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks. CoRR abs/1804.07223 (2018) - [i1]Karl Bringmann, Marvin Künnemann, André Nusser:
Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability. CoRR abs/1810.10982 (2018) - 2017
- [c4]Stefan Funke, André Nusser, Sabine Storandt:
The Simultaneous Maze Solving Problem. AAAI 2017: 808-814 - [c3]Daniel Bahrdt, Michael Becher, Stefan Funke, Filip Krumpe, André Nusser, Martin Seybold, Sabine Storandt:
Growing Balls in ℝd. ALENEX 2017: 247-258 - 2016
- [j3]Stefan Funke, André Nusser, Sabine Storandt:
On k-Path Covers and their applications. VLDB J. 25(1): 103-123 (2016) - [c2]Stefan Funke, André Nusser, Sabine Storandt:
Placement of Loading Stations for Electric Vehicles: Allowing Small Detours. ICAPS 2016: 131-139 - 2015
- [j2]Stefan Funke, André Nusser, Sabine Storandt:
Placement of Loading Stations for Electric Vehicles: No Detours Necessary! J. Artif. Intell. Res. 53: 633-658 (2015) - 2014
- [j1]Stefan Funke, André Nusser, Sabine Storandt:
On k-Path Covers and their Applications. Proc. VLDB Endow. 7(10): 893-902 (2014) - [c1]Stefan Funke, André Nusser, Sabine Storandt:
Placement of Loading Stations for Electric Vehicles: No Detours Necessary! AAAI 2014: 417-423
Coauthor Index
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-11-15 19:27 CET 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:
