Christian Knauer 个人学术档案

引用次数

	总计	2019 年至今
引用	2632	851
h 指数	29	16
i10 指数	60	30

200

100

150

2001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320249 15 18 36 45 53 90 126 118 105 123 117 168 141 143 145 121 157 141 118 158 166 185 83

开放获取的出版物数量

查看全部

28 篇文章

4 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Helmut AltFreie Universität Berlin在 mi.fu-berlin.de 的电子邮件经过验证
Panos GiannopoulosCity, University of London在 city.ac.uk 的电子邮件经过验证
Carola WenkProfessor of Computer Science, Tulane University在 tulane.edu 的电子邮件经过验证
Sergio CabelloUniversity of Ljubljana and Institute of Mathematics, Physics and Mechanics在 fmf.uni-lj.si 的电子邮件经过验证
Peter BrassProfessor of Computer Science, City College of New York在 cs.ccny.cuny.edu 的电子邮件经过验证
Sue WhitesidesProfessor of Computer Science, University of Victoria BC在 uvic.ca 的电子邮件经过验证
Kevin BuchinProfessor of Computer Science, Technical University Dortmund在 tu-dortmund.de 的电子邮件经过验证
Hee-Kap AhnProfessor, Graduate School of Artificial Intelligence, Dept. Computer Science and Engineering在 postech.ac.kr 的电子邮件经过验证
Darko Dimitrov在 zedat.fu-berlin.de 的电子邮件经过验证
Chan-Su Shin (신찬수)Professor of Division of Computer Engineering, Hankuk University of Foreign Stuides在 hufs.ac.kr 的电子邮件经过验证
Joachim GudmundssonUniversity of Sydney在 sydney.edu.au 的电子邮件经过验证
René van OostrumAMD在 59bits.nl 的电子邮件经过验证
Joseph S. B. MitchellDistinguished Professor, Applied Mathematics and Computer Science, Stony Brook University在 stonybrook.edu 的电子邮件经过验证
Esther ArkinProfessor of Applied Mathematics and Statistics, Stony Brook University在 stonybrook.edu 的电子邮件经过验证
Antoine VigneronAssociate Professor of Computer Science, Ulsan National Institute of Science and Technology在 unist.ac.kr 的电子邮件经过验证
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of Würzburg在 uni-wuerzburg.de 的电子邮件经过验证
Sándor P. FeketeTechnische Universität Braunschweig, L3S Research Center在 tu-bs.de 的电子邮件经过验证
Mark de BergProfessor of Computer Science, TU Eindhoven在 win.tue.nl 的电子邮件经过验证
Jeff EricksonProfessor of Computer Science, University of Illinois Urbana-Champaign在 illinois.edu 的电子邮件经过验证
Stefan LangermanDépartement d'Informatique, Université Libre de Bruxelles在 ulb.ac.be 的电子邮件经过验证

关注

Christian Knauer

Institut für Informatik, Universität Bayreuth

在 uni-bayreuth.de 的电子邮件经过验证 - 首页

Algorithms Data structures Complexity Computational Geometry


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Fréchet distance for curves, revisited B Aronov, S Har-Peled, C Knauer, Y Wang, C Wenk Algorithms–ESA 2006: 14th Annual European Symposium, Zurich, Switzerland …, 2006	193	2006
Comparison of distance measures for planar curves H Alt, C Knauer, C Wenk Algorithmica 38, 45-58, 2004	156	2004
Matching polygonal curves with respect to the Fréchet distance H Alt, C Knauer, C Wenk STACS 2001: 18th Annual Symposium on Theoretical Aspects of Computer Science …, 2001	137	2001
Minimum-cost coverage of point sets by disks H Alt, EM Arkin, H Brönnimann, J Erickson, SP Fekete, C Knauer, ... Proceedings of the twenty-second annual symposium on Computational geometry …, 2006	135	2006
Faster fixed-parameter tractable algorithms for matching and packing problems MR Fellows, C Knauer, N Nishimura, P Ragde, F Rosamond, U Stege, ... Algorithms–ESA 2004: 12th Annual European Symposium, Bergen, Norway …, 2004	113*	2004
Computing the Hausdorff distance of geometric patterns and shapes H Alt, P Braß, M Godau, C Knauer, C Wenk Discrete and Computational Geometry: The Goodman-Pollack Festschrift, 65-76, 2003	104	2003
Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D PK Agarwal, R Klein, C Knauer, S Langerman, P Morin, M Sharir, M Soss Discrete & Computational Geometry 39 (1), 17-37, 2008	70*	2008
On counting point-hyperplane incidences P Braß, C Knauer Computational Geometry 25 (1-2), 13-20, 2003	67	2003
Matching point sets with respect to the Earth Mover's Distance S Cabello, P Giannopoulos, C Knauer, G Rote Computational Geometry 39 (2), 118-133, 2008	59	2008
Bounds on the quality of the PCA bounding boxes D Dimitrov, C Knauer, K Kriegel, G Rote Computational Geometry 42 (8), 772-789, 2009	57*	2009
On the number of cycles in planar graphs K Buchin, C Knauer, K Kriegel, A Schulz, R Seidel Computing and Combinatorics: 13th Annual International Conference, COCOON …, 2007	57	2007
Testing the congruence of d-dimensional point sets P Brass, C Knauer Proceedings of the sixteenth annual symposium on Computational geometry, 310-314, 2000	56	2000
Dilation and detours in geometric networks J Gudmundsson, C Knauer Handbook of Approximation Algorithms and Metaheuristics, 53-69, 2018	54	2018
Computing the discrete Fréchet distance with imprecise input HK Ahn, C Knauer, M Scherfenberg, L Schlipf, A Vigneron International Journal of Computational Geometry & Applications 22 (01), 27-44, 2012	50	2012
How difficult is it to walk the dog K Buchin, M Buchin, C Knauer, G Rote, C Wenk Proc. 23rd Euro. Workshop on Comput. Geom, 170-173, 2007	50	2007
Morphometric relationships between tooth and face shapes HB Lindemann, C Knauer, P Pfeiffer Journal of Oral rehabilitation 31 (10), 972-978, 2004	49	2004
Side scan sonar image resolution and automatic object detection, classification and identification F Langner, C Knauer, W Jans, A Ebert OCEANS 2009-EUROPE, 1-8, 2009	48	2009
Largest inscribed rectangles in convex polygons C Knauer, L Schlipf, JM Schmidt, HR Tiwary Journal of discrete algorithms 13, 78-85, 2012	43	2012
Algorithms for graphs of bounded treewidth via orthogonal range searching S Cabello, C Knauer Computational Geometry 42 (9), 815-824, 2009	42	2009
Parameterized complexity of geometric problems P Giannopoulos, C Knauer, S Whitesides The Computer Journal 51 (3), 372-384, 2008	38	2008

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用