Chan-Su Shin (신찬수) 个人学术档案

引用次数

	总计	2019 年至今
引用	825	207
h 指数	18	8
i10 指数	33	4

19971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320245 6 4 18 14 21 12 20 33 35 23 51 37 41 37 29 41 48 28 33 33 31 31 36 37 36 43 19

开放获取的出版物数量

查看全部

8 篇文章

0 篇文章

可查看的文章

无法查看的文章

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

合著作者

Hee-Kap AhnProfessor, Graduate School of Artificial Intelligence, Dept. Computer Science and Engineering在 postech.ac.kr 的电子邮件经过验证
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of Würzburg在 uni-wuerzburg.de 的电子邮件经过验证
Antoine VigneronAssociate Professor of Computer Science, Ulsan National Institute of Science and Technology在 unist.ac.kr 的电子邮件经过验证
Peter BrassProfessor of Computer Science, City College of New York在 cs.ccny.cuny.edu 的电子邮件经过验证
Kyung-Yong Chwaprofessor of computer science, KAIST在 kaist.ac.kr 的电子邮件经过验证
Sang Won BaeKyonggi University在 kgu.ac.kr 的电子邮件经过验证
Christian KnauerInstitut für Informatik, Universität Bayreuth在 uni-bayreuth.de 的电子邮件经过验证
William S. EvansUniversity of British Columbia在 cs.ubc.ca 的电子邮件经过验证
Yoshio OkamotoUniversity of Electro-Communications在 uec.ac.jp 的电子邮件经过验证
Benedict Sheung-Hung PoonAssociate Professor, University of Nottingham Ningbo China在 nottingham.edu.cn 的电子邮件经过验证
Joachim GudmundssonUniversity of Sydney在 sydney.edu.au 的电子邮件经过验证
Herman Haverkort在 haverkort.net 的电子邮件经过验证
Jan Kratochvilprofessor, Charles university in Prague, Univerzita Karlova在 kam.mff.cuni.cz 的电子邮件经过验证
Helmut AltFreie Universität Berlin在 mi.fu-berlin.de 的电子邮件经过验证
Chong-Dae ParkKakao Corp.在 kakaocorp.com 的电子邮件经过验证
René van OostrumAMD在 59bits.nl 的电子邮件经过验证
Paweł RzążewskiWarsaw University of Technology, Faculty of Mathematics and Information Science在 mini.pw.edu.pl 的电子邮件经过验证
Hwan Gue ChoPusan National University在 pusan.ac.kr 的电子邮件经过验证
Ivo ViganBloomberg LP在 bloomberg.net 的电子邮件经过验证
Philipp KindermannUniversität Trier在 uni-trier.de 的电子邮件经过验证

关注

Chan-Su Shin (신찬수)

Professor of Division of Computer Engineering, Hankuk University of Foreign Stuides

在 hufs.ac.kr 的电子邮件经过验证

Computational Geometry Graph Drawing Algorithms and Data Structures


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Area-efficient algorithms for straight-line tree drawings CS Shin, SK Kim, KY Chwa Computational Geometry 15 (4), 175-202, 2000	47	2000
Labeling points with weights SH Poon, CS Shin, T Strijk, T Uno, A Wolff Algorithmica 38, 341-362, 2004	45	2004
Untangling a planar graph X Goaoc, J Kratochvíl, Y Okamoto, CS Shin, A Spillner, A Wolff Discrete & Computational Geometry 42 (4), 542-569, 2009	39	2009
Maximizing the overlap of two planar convex sets under rigid motions HK Ahn, O Cheong, CD Park, CS Shin, A Vigneron Proceedings of the twenty-first annual symposium on Computational geometry …, 2005	37	2005
Efficient algorithms for two-center problems for a convex polygon SK Kim, CS Shin Computing and Combinatorics: 6th Annual International Conference, COCOON …, 2000	33	2000
Farthest-point queries with geometric and combinatorial constraints O Daescu, N Mi, CS Shin, A Wolff Computational Geometry 33 (3), 174-185, 2006	30	2006
Guarding art galleries by guarding witnesses KY Chwa, BC Jo, C Knauer, E Moet, R Van Oostrum, CS Shin International Journal of Computational Geometry & Applications 16 (02n03 …, 2006	29	2006
Constructing optimal highways HK Ahn, H Alt, T Asano, SW Bae, P Brass, O Cheong, C Knauer, HS Na, ... International Journal of Foundations of Computer Science 20 (01), 3-23, 2009	27	2009
Computing the optimal bridge between two polygons SK Kim, CS Shin Theory of Computing Systems 34 (4), 337-352, 2001	27	2001
Maximum overlap and minimum convex hull of two convex polyhedra under translations HK Ahn, P Brass, CS Shin Computational Geometry 40 (2), 171-177, 2008	26	2008
Two-center problems for a convex polygon CS Shin, JH Kim, SK Kim, KY Chwa Algorithms—ESA’98: 6th Annual European Symposium Venice, Italy, August 24 …, 1998	24	1998
Representing graphs and hypergraphs by touching polygons in 3D W Evans, P Rzążewski, N Saeedi, CS Shin, A Wolff Graph Drawing and Network Visualization: 27th International Symposium, GD …, 2019	23	2019
Computing farthest neighbors on a convex polytope O Cheong, CS Shin, A Vigneron Theoretical Computer Science 296 (1), 47-58, 2003	22	2003
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets HK Ahn, P Brass, O Cheong, HS Na, CS Shin, A Vigneron Computational Geometry 33 (3), 152-164, 2006	21	2006
Labeling a rectilinear map with sliding labels SK Kim, CS Shin, TC Yang International Journal of Computational Geometry & Applications 11 (02), 167-179, 2001	20	2001
Adaptive zooming in point set labeling SH Poon, CS Shin Fundamentals of Computation Theory: 15th International Symposium, FCT 2005 …, 2005	19	2005
The aligned k-center problem P Brass, C Knauer, HS Na, CS Shin, A Vigneron International Journal of Computational Geometry & Applications 21 (02), 157-178, 2011	18	2011
Computing weighted rectilinear median and center set in the presence of obstacles J Choi, CS Shin, SK Kim International symposium on algorithms and computation, 30-40, 1998	18	1998
Constructing the city Voronoi diagram faster R Görke, CS Shin, A Wolff International Journal of Computational Geometry & Applications 18 (04), 275-294, 2008	17	2008
Facility location and the geometric minimum-diameter spanning tree J Gudmundsson, H Haverkort, SM Park, CS Shin, A Wolff Computational Geometry 27 (1), 87-106, 2004	17	2004

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

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用