Maarten Löffler

Citeras av

	Alla	Sedan 2020
Citat	3675	1613
h-index	28	17
i10-index	73	41

340

170

255

200720082009201020112012201320142015201620172018201920202021202220232024202512 27 56 63 98 123 188 226 197 218 273 271 265 316 281 322 332 302 56

Offentlig åtkomst

Visa alla

61 artiklar

1 artikel

tillgänglig

inte tillgänglig

Enligt krav från finansiärer

Medförfattare

Marc van KreveldProfessor of Computer Science, Utrecht UniversityVerifierad e-postadress på uu.nl
Rodrigo I. SilveiraUniversitat Politècnica de CatalunyaVerifierad e-postadress på upc.edu
Kevin BuchinProfessor of Computer Science, Technical University DortmundVerifierad e-postadress på tu-dortmund.de
Frank StaalsUtrecht UniversityVerifierad e-postadress på fstaals.net
David EppsteinDistinguished Professor of Computer Science, University of California, IrvineVerifierad e-postadress på uci.edu
Irina KostitsynaNASA Ames Research CenterVerifierad e-postadress på tue.nl
Darren StrashHamilton CollegeVerifierad e-postadress på hamilton.edu
Maike BuchinRuhr-Universität BochumVerifierad e-postadress på rub.de
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienVerifierad e-postadress på ac.tuwien.ac.at
Lionov WiratmaUtrecht University, Parahyangan Catholic UniversityVerifierad e-postadress på unpar.ac.id
Joachim GudmundssonUniversity of SydneyVerifierad e-postadress på sydney.edu.au
Boris AronovProfessor of Computer Science, Tandon School of Engineering, New York UniversityVerifierad e-postadress på nyu.edu
Carola WenkProfessor of Computer Science, Tulane UniversityVerifierad e-postadress på tulane.edu
Jack SnoeyinkComputer Science, UNC Chapel HillVerifierad e-postadress på cs.unc.edu
Michael T. GoodrichProfessor of Computer Science, University of California, IrvineVerifierad e-postadress på uci.edu
Andre SchulzProfessor of CSVerifierad e-postadress på fernuni-hagen.de
Jeff PhillipsProfessor, School of Computing, University of UtahVerifierad e-postadress på cs.utah.edu
Matias KormanSiemens EDAVerifierad e-postadress på mentor.com
Vera SacristánUniversitat Politècnica de CatalunyaVerifierad e-postadress på upc.edu
Anne DriemelProfessor, Hausdorff Center for Mathematics, University of BonnVerifierad e-postadress på informatik.uni-bonn.de

Följ

Maarten Löffler

Computer Science, Utrecht University

Verifierad e-postadress på cs.uu.nl

Theoretical Computer Science Algorithms Computational Geometry


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
Listing all maximal cliques in large sparse real-world graphs D Eppstein, M Löffler, D Strash Journal of Experimental Algorithmics (JEA) 18, 3.1-3.21, 2013	809*	2013
Detecting commuting patterns by clustering subtrajectories K Buchin, M Buchin, J Gudmundsson, M Löffler, J Luo International Journal of Computational Geometry & Applications 21 (03), 253-282, 2011	235	2011
Largest and smallest convex hulls for imprecise points M Löffler, M van Kreveld Algorithmica 56 (2), 235-269, 2010	174*	2010
Largest bounding box, smallest diameter, and related problems on imprecise points M Löffler, M van Kreveld Computational Geometry 43 (4), 419-433, 2010	121	2010
Median trajectories K Buchin, M Buchin, M Van Kreveld, M Löffler, RI Silveira, C Wenk, ... Algorithmica 66, 595-614, 2013	104	2013
Ecological validity of virtual environments to assess human navigation ability IJM van der Ham, AME Faber, M Venselaar, MJ van Kreveld, M Löffler Frontiers in psychology 6, 637, 2015	95	2015
Shape fitting on point sets with probability distributions M Löffler, JM Phillips European symposium on algorithms, 313-324, 2009	87	2009
Delaunay triangulations of imprecise pointsin linear time after preprocessing M Löffler, J Snoeyink Proceedings of the twenty-fourth annual symposium on Computational geometry …, 2008	87	2008
Almost all Delaunay triangulations have stretch factor greater than π/2 P Bose, L Devroye, M Löffler, J Snoeyink, V Verma Computational Geometry 44 (2), 121-127, 2011	78*	2011
Data imprecision in computational geometry M Löffler Utrecht Univesity, 2009	73	2009
Approximating (k, ℓ)-center clustering for curves K Buchin, A Driemel, J Gudmundsson, M Horton, I Kostitsyna, M Löffler, ... Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019	60	2019
Preprocessing imprecise points for Delaunay triangulation: Simplified and extended K Buchin, M Löffler, P Morin, W Mulzer Algorithmica, 1-20, 2011	60*	2011
Generating realistic terrains with higher-order Delaunay triangulations T De Kok, M Van Kreveld, M Löffler Computational Geometry 36 (1), 52-65, 2007	59	2007
Geometric computations on indecisive points A Jørgensen, M Löffler, J Phillips Algorithms and Data Structures, 536-547, 2011	58*	2011
Segmentation of trajectories on nonmonotone criteria B Aronov, A Driemel, MV Kreveld, M Löffler, F Staals ACM Transactions on Algorithms (TALG) 12 (2), 1-28, 2015	52	2015
Preprocessing imprecise points and splitting triangulations M Van Kreveld, M Löffler, JSB Mitchell SIAM Journal on Computing 39 (7), 2990-3000, 2010	44	2010
On Optimal Polyline Simplification using the Hausdorff and Fr\'echet Distance M van Kreveld, M Löffler, L Wiratma arXiv preprint arXiv:1803.03550, 2018	42	2018
The directed Hausdorff distance between imprecise point sets C Knauer, M Löffler, M Scherfenberg, T Wolle Theoretical Computer Science, 2011	39	2011
Automated puzzle difficulty estimation M Van Kreveld, M Löffler, P Mutser 2015 IEEE Conference on Computational Intelligence and Games (CIG), 415-422, 2015	37	2015
Planar and poly-arc Lombardi drawings CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Löffler Graph Drawing: 19th International Symposium, GD 2011, Eindhoven, The …, 2012	37	2012

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Följ

Citeras av

Medförfattare