Tetsuo Asano

浅野 哲夫

	2012
119		Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente: Faster computation of the Robinson-Foulds distance between phylogenetic networks. Inf. Sci. 197: 77-90 (2012)
118		Tetsuo Asano: In-place Algorithm for Erasing a Connected Component in a Binary Image. Theory Comput. Syst. 50(1): 111-123 (2012)
	2011
117		Tetsuo Asano, Benjamin Doerr: Memory-Constrained Algorithms for Shortest Path Problem. CCCG 2011
116		Tetsuo Asano: Designing Algorithms with Limited Work Space. TAMC 2011: 1
115		Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz: Memory-Constrained Algorithms for Simple Polygons CoRR abs/1112.5904: (2011)
114		Tetsuo Asano, Wolfgang Mulzer, Günter Rote, Yajun Wang: Constant-Work-Space Algorithms for Geometric Problems. JoCG 2(1): 46-68 (2011)
113		Eishi Chiba, Tetsuo Asano, Takeshi Miura, Naoki Katoh, Ikuo Mitsuka: Collision Probability in an In-Line Machines Model. Transactions on Computational Science 13: 1-12 (2011)
	2010
112		Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente: Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. CPM 2010: 190-201
111		Tetsuo Asano: Do We Need a Stack to Erase a Component in a Binary Image? FUN 2010: 16-27
110		Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara: Kaboozle Is NP-complete, Even in a Strip. FUN 2010: 28-36
109		Tetsuo Asano, Wolfgang Mulzer, Yajun Wang: Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon. WALCOM 2010: 9-20
108		Boris Aronov, Tetsuo Asano, Stefan Funke: Optimal Triangulations of Points and Segments with Steiner Points. Int. J. Comput. Geometry Appl. 20(1): 89-104 (2010)
107		Tetsuo Asano, Peter Brass, Shinji Sasahara: Disc Covering Problem with Application to Digital Halftoning. Theory Comput. Syst. 46(2): 157-173 (2010)
106		Tetsuo Asano, Hiroshi Tanaka: In-Place Linear-Time Algorithms for Euclidean Distance Transform. Transactions on Computational Science 8: 103-113 (2010)
	2009
105		Tetsuo Asano, Günter Rote: Constant-Working-Space Algorithms for Geometric Problems. CCCG 2009: 87-90
104		Tetsuo Asano, Sergey Bereg, David G. Kirkpatrick: Finding Nearest Larger Neighbors. Efficient Algorithms 2009: 249-260
103		Tetsuo Asano: Editorial. Algorithmica 54(2): 141 (2009)
102		Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer: A linear-space algorithm for distance preserving graph embedding. Comput. Geom. 42(4): 289-304 (2009)
101		Tetsuo Asano, Valentin E. Brimkov, Reneta P. Barneva: Some theoretical challenges in digital geometry: A perspective. Discrete Applied Mathematics 157(16): 3362-3371 (2009)
100		Tetsuo Asano: Guest Editor's Foreword. Int. J. Comput. Geometry Appl. 19(2): 93 (2009)
99		Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff: Constructing Optimal Highways. Int. J. Found. Comput. Sci. 20(1): 3-23 (2009)
	2008
98		Tetsuo Asano: Constant-Working-Space Algorithms for Image Processing. ETVC 2008: 268-283
97		Tetsuo Asano: Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?. ISAAC 2008: 1
96		Bishal Prasad, Arijit Bishnu, Tetsuo Asano: Linear Boundary and Corner Detection Using Limited Number of Sensor Rows. IWCIA 2008: 250-261
95		Tetsuo Asano, Shinnya Bitou, Mitsuo Motoki, Nobuaki Usui: Space-Efficient Algorithm for Image Rotation. IEICE Transactions 91-A(9): 2341-2348 (2008)
94		Tetsuo Asano: Online uniformity of integer points on a line. Inf. Process. Lett. 109(1): 57-60 (2008)
93		Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno: A Generalization of Magic Squares with Applications to Digital Halftoning. Theory Comput. Syst. 42(2): 143-156 (2008)
	2007
92		Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff: Constructing Optimal Highways. CATS 2007: 7-14
91		Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer: Linear-Space Algorithms for Distance Preserving Embedding. CCCG 2007: 185-188
90		Boris Aronov, Tetsuo Asano, Stefan Funke: Optimal Triangulation with Steiner Points. ISAAC 2007: 681-691
89		Tetsuo Asano, Shinnya Bitou, Mitsuo Motoki, Nobuaki Usui: In-Place Algorithm for Image Rotation. ISAAC 2007: 704-715
88		Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: Voronoi Diagram with Respect to Criteria on Vision Information. ISVD 2007: 25-32
87		Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama: Zone diagrams: existence, uniqueness and algorithmic challenge. SODA 2007: 756-765
86		Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff: Constructing Optimal Highways CoRR abs/cs/0703037: (2007)
85		Xuefeng Liang, Arijit Bishnu, Tetsuo Asano: A Robust Fingerprint Indexing Scheme Using Minutia Neighborhood Structure and Low-Order Delaunay Triangles. IEEE Transactions on Information Forensics and Security 2(4): 721-733 (2007)
84		Xuefeng Liang, Arijit Bishnu, Tetsuo Asano: A Combinatorial Approach to Fingerprint Binarization and Minutiae Extraction Using Euclidean Distance Transform. IJPRAI 21(7): 1141-1158 (2007)
83		Tetsuo Asano: Aspect-ratio Voronoi diagram and its complexity bounds. Inf. Process. Lett. 105(1): 26-31 (2007)
82		Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama: Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge. SIAM J. Comput. 37(4): 1182-1198 (2007)
	2006
81		Tetsuo Asano: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings Springer 2006
80		Tetsuo Asano: Computational Geometric and Combinatorial Approaches to Digital Halftoning. CATS 2006: 3
79		Xuefeng Liang, Tetsuo Asano, Hui Zhang: A Combined Radial Basis Function Model for Fingerprint Distortion. ICIAR (2) 2006: 286-296
78		Xuefeng Liang, Tetsuo Asano: Fingerprint Matching Using Minutia Polygons. ICPR (1) 2006: 1046-1049
77		Tetsuo Asano, Hisao Tamaki, Naoki Katoh, Takeshi Tokuyama: Angular Voronoi Diagram with Applications. ISVD 2006: 18-24
76		Xuefeng Liang, Tetsuo Asano, Arijit Bishnu: Distorted Fingerprint Indexing Using Minutia Detail and Delaunay Triangle. ISVD 2006: 217-223
75		Tetsuo Asano, Hideyuki Sakai, Kokichi Sugihara: Aspect-Ratio Voronoi Diagram with Applications. ISVD 2006: 32-39
74		Tetsuo Asano, David G. Kirkpatrick: Distance Trisector Curves in Regular Convex Distance Me. ISVD 2006: 8-17
73		Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama: The distance trisector curve. STOC 2006: 336-343
72		Xuefeng Liang, Tetsuo Asano: A Linear Time Algorithm for Binary Fingerprint Image Denoising Using Distance Transform. IEICE Transactions 89-D(4): 1534-1542 (2006)
71		Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjamin Doerr: Inserting Points Uniformly at Every Instance. IEICE Transactions 89-D(8): 2348-2356 (2006)
70		Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama: Polyline Fitting of Planar Points under Min-sum Criteria. Int. J. Comput. Geometry Appl. 16(2-3): 97-116 (2006)
	2005
69		Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff: Optimal spanners for axis-aligned rectangles. Comput. Geom. 30(1): 59-77 (2005)
68		Shinji Sasahara, Tetsuo Asano: New dispersed-dot halftoning technique by elimination of unstable pixels for electrophotography. J. Electronic Imaging 14(2): 023006 (2005)
	2004
67		Tetsuo Asano, Peter Braß, Shinji Sasahara: Disc Covering Problem with Application to Digital Halftoning. ICCSA (3) 2004: 11-21
66		Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama: Polyline Fitting of Planar Points Under Min-sum Criteria. ISAAC 2004: 77-88
65		Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno: A Generalization of Magic Squares with Applications to Digital Halftoning. ISAAC 2004: 89-100
64		Xuefeng Liang, Arijit Bishnu, Tetsuo Asano: A Near-Linear Time Algorithm for Binarization of Fingerprint Images Using Distance Transform. IWCIA 2004: 197-208
63		Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: On Geometric Structure of Global Roundings for Graphs and Range Spaces. SWAT 2004: 455-467
62		Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap: Pseudo Approximation Algorithms with Applications to Optimal Motion Planning. Discrete & Computational Geometry 31(1): 139-171 (2004)
61		Tetsuo Asano, Koji Nakano: Foreword. IEICE Transactions 87-D(2): 279-280 (2004)
60		Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: The structure and number of global roundings of a graph. Theor. Comput. Sci. 325(3): 425-437 (2004)
	2003
59		Tetsuo Asano, Reinhard Klette, Christian Ronse: Geometry, Morphology, and Computational Imaging, 11th International Workshop on Theoretical Foundations of Computer Vision Dagstuhl Castle, Germany, April 7-12, 2002, Revised Papers Springer 2003
58		Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap: Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard. CCCG 2003: 10-13
57		Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: The Structure and Number of Global Roundings of a Graph. COCOON 2003: 130-138
56		Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki: Spanning Trees Crossing Few Barriers. Discrete & Computational Geometry 30(4): 591-606 (2003)
55		Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama: Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning. SIAM J. Comput. 32(6): 1423-1435 (2003)
	2002
54		Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama: Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning. SODA 2002: 896-904
53		Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap: Pseudo approximation algorithms, with applications to optimal motion planning. Symposium on Computational Geometry 2002: 170-178
52		Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama: Combinatorial and Geometric Problems Related to Digital Halftoning. Theoretical Foundations of Computer Vision 2002: 58-71
51		Tetsuo Asano, Antonio Hernández-Barrera, Subhas C. Nandy: Translating a convex polyhedron over monotone polyhedra. Comput. Geom. 23(3): 257-269 (2002)
50		Subhas C. Nandy, Tetsuo Asano, Tomohiro Harayama: Shattering a set of objects in 2D. Discrete Applied Mathematics 122(1-3): 183-194 (2002)
	2001
49		Tetsuo Asano, Takeshi Tokuyama: How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2×2-Discrepancy. ISAAC 2001: 636-648
48		Tetsuo Asano, Yasuyuki Kawamura, Reinhard Klette, Koji Obokata: Minimum-Length Polygons in Approximation Sausages. IWVF 2001: 103-112
47		Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama: A unified scheme for detecting fundamental curves in binary edge images. Comput. Geom. 18(2): 73-93 (2001)
46		Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama: Efficient Algorithms for Optimization-Based Image Segmentation. Int. J. Comput. Geometry Appl. 11(2): 145-166 (2001)
45		Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima: A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. J. Comb. Optim. 5(2): 213-231 (2001)
44		Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano: Dynamically maintaining the widest k-dense corridor. Theor. Comput. Sci. 255(1-2): 627-639 (2001)
	2000
43		Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano: Dynamically Maintaining the Widest k -Dense Corridor. CIAC 2000: 187-198
42		Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama: On the Complexities of the Optimal Rounding Problems of Sequences and Matrices. SWAT 2000: 476-489
41		Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama: Optimal Roundings of Sequences and Matrices. Nord. J. Comput. 7(3): 241- (2000)
40		Tetsuo Asano, Yasuyuki Kawamura: Algorithmic considerations on the computational complexities of digital line extraction problem. Systems and Computers in Japan 31(14): 29-37 (2000)
	1999
39		Tetsuo Asano, Yasuyuki Kawamura: Computational comparison of voting-based and arrangement-based schema for digital line detection. CCCG 1999
38		Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima: A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. ISAAC 1999: 317-326
37		Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki: Spanning Trees Crossing Few Barriers. Symposium on Computational Geometry 1999: 41-48
	1998
36		Tetsuo Asano, Hiro Ito, Souichi Kimura, Shigeaki Shimazu: Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image. ISAAC 1998: 149-158
35		Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: Convertibility among Grid Filling Curves. ISAAC 1998: 307-316
34		Tetsuo Asano: Effective Use of Geometric Properties for Clustering. JCDCG 1998: 30-46
	1997
33		Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: Covering Points in the Plane by k-Tours: Towards a Polynomial Time Approximation Scheme for General k. STOC 1997: 275-283
32		Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer: Space-Filling Curves and Their Use in the Design of Geometric Data Structures. Theor. Comput. Sci. 181(1): 3-15 (1997)
	1996
31		Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri: Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings Springer 1996
30		Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama: Polynomial-Time Solutions to Image Segmentation. SODA 1996: 104-113
29		Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap: d1-Optimal Motion for a Rod (Extended Abstract). Symposium on Computational Geometry 1996: 252-263
28		Tetsuo Asano, Naoki Katoh: Variants for the Hough Transform for Line Detection. Comput. Geom. 6: 231-252 (1996)
	1995
27		Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer: Space Filling Curves and Their Use in the Design of Geometric Data Structures. LATIN 1995: 36-48
	1994
26		Tetsuo Asano, Takeshi Tokuyama: Topological Walk Revisited. CCCG 1994: 1-6
25		Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama: A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images. ESA 1994: 215-226
24		Tetsuo Asano: Reporting and Counting Intersections of Lines within a Polygon. ISAAC 1994: 652-659
23		Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano: Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. Int. J. Comput. Geometry Appl. 4(1): 69-85 (1994)
22		Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama: Walking on an arrangement topologically. Int. J. Comput. Geometry Appl. 4(2): 123-151 (1994)
	1993
21		Tetsuo Asano, Naoki Katoh: Number Theory Helps Line Detection in Digital Images. ISAAC 1993: 313-322
20		Tetsuo Asano, Takeshi Tokuyama: Algorithms for Projecting Points To Give the Most Uniform Distribution with Applications to Hashing. Algorithmica 9(6): 572-590 (1993)
	1992
19		Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano: Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. IPCO 1992: 61-71
	1991
18		Tetsuo Asano, Takeshi Tokuyama: Circuit Partitioning Algorithms: Graph Model versus Geometry Model. ISA 1991: 94-103
17		Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama: Walking on an Arrangement Topologically. Symposium on Computational Geometry 1991: 297-306
	1990
16		Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki: Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings Springer 1990
15		Tetsuo Asano, Takeshi Tokuyama: Algorithms for Projecting Points to Give the Most Uniform Distribution with Applications to Hashing. SIGAL International Symposium on Algorithms 1990: 300-309
	1988
14		Tetsuo Asano, Binay K. Bhattacharya, J. Mark Keil, F. Frances Yao: Clustering Algorithms Based on Minimum and Maximum Spanning Trees. Symposium on Computational Geometry 1988: 252-257
	1987
13		Tetsuo Asano, Hiroshi Umeo: Systolic Algorithms for Computing the Visibility Polygon and Triangulation of A Polygonal Region. Parallel Algorithms and Architectures 1987: 77-85
12		Takao Asano, Tetsuo Asano, Hiroshi Imai: Shortest Path Between Two Simple Polygons. Inf. Process. Lett. 24(5): 285-288 (1987)
	1986
11		Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai: Visibility of Disjoint Polygons. Algorithmica 1(1): 49-63 (1986)
10		Tetsuo Asano: Generating and counting valid patterns in routes between two points. Graphs and Combinatorics 2(1): 9-13 (1986)
9		Takao Asano, Tetsuo Asano, Hiroshi Imai: Partitioning a polygonal region into trapezoids. J. ACM 33(2): 290-312 (1986)
8		Takao Asano, Tetsuo Asano, Ron Y. Pinter: Polygon Triangulation: Efficiency and Minimality. J. Algorithms 7(2): 221-231 (1986)
	1985
7		Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai: Visibility-Polygon Search and Euclidean Shortest Paths FOCS 1985: 155-164
6		Wayne Wei-Ming Dai, Tetsuo Asano, Ernest S. Kuh: Routing Region Definition and Ordering Scheme for Building-Block Layout. IEEE Trans. on CAD of Integrated Circuits and Systems 4(3): 189-197 (1985)
	1983
5		Tetsuo Asano, Takao Asano: Minimum Partition of Polygonal Regions into Trapezoids FOCS 1983: 233-241
	1982
4		Tetsuo Asano: Parametric pattern router. DAC 1982: 411-417
	1981
3		Tetsuo Asano, Naokazu Yokoya: Image segmentation schema for low-level computer vision. Pattern Recognition 14(1-6): 267-273 (1981)
	1977
2		Tetsuo Asano, Tadahiro Kitahashi, Kokichi Tanaka, Hiroshi Horino, Nobutaka Amano: A Wire-Routing Scheme Based on Trunk-Division Methods. IEEE Trans. Computers 26(8): 764-772 (1977)
	1976
1		Mitsuo Kurachi, Y. Matsui, Tetsuo Asano: Network Planning for a Common Use Computer Communication Network. ICCC 1976: 379-382

Coauthor Index

1	Hee-Kap Ahn	[86] [92] [99]
2	Helmut Alt	[86] [92] [99]
3	Nobutaka Amano	[2]
4	Boris Aronov	[65] [66] [70] [90] [93] [108]
5	Takao Asano	[5] [7] [8] [9] [11] [12]
6	Sang Won Bae	[86] [92] [99]
7	Reneta P. Barneva	[101]
8	Sergey Bereg (Sergei Bespamyatnikh)	[104]
9	Mark de Berg	[37] [56] [69]
10	Binay K. Bhattacharya	[14]
11	Arijit Bishnu	[64] [76] [84] [85] [96]
12	Shinnya Bitou	[89] [95]
13	Prosenjit Bose	[91] [102]
14	Peter Braß (Peter Brass)	[67] [86] [92] [99] [107]
15	Valentin E. Brimkov	[101]
16	Kevin Buchin	[115]
17	Maike Buchin	[115]
18	Paz Carmi	[91] [102]
19	Danny Z. Chen	[30] [46]
20	Otfried Cheong (Otfried Schwarzkopf)	[37] [56] [69] [86] [92] [99]
21	Eishi Chiba	[113]
22	Wayne Wei-Ming Dai	[6]
23	Erik D. Demaine	[110]
24	Martin L. Demaine	[110]
25	Benjamin Doerr	[71] [117]
26	Hazel Everett	[69]
27	Stefan Funke	[90] [108]
28	Leonidas J. Guibas	[7] [11] [17] [22] [37] [56]
29	Tomohiro Harayama	[43] [44] [50]
30	Herman J. Haverkort	[69]
31	Antonio Hernández-Barrera	[51]
32	John Hershberger	[7] [11]
33	Hiroshi Horino	[2]
34	Toshihide Ibaraki	[16]
35	Yoshihide Igarashi	[31]
36	Hiroshi Imai	[7] [9] [11] [12] [16]
37	Hiro Ito	[36]
38	Jesper Jansson	[112] [119]
39	Naoyoshi Kanamaru	[19] [23]
40	Naoki Katoh	[21] [25] [28] [30] [33] [35] [38] [45] [46] [47] [52] [54] [55] [57] [60] [63] [66] [69] [70] [71] [77] [88] [113]
41	Yasuyuki Kawamura	[39] [40] [48]
42	Kazuhiro Kawashima	[38] [45]
43	J. Mark Keil	[14]
44	Yosuke Kikuchi	[65] [93]
45	Souichi Kimura	[36]
46	David G. Kirkpatrick	[29] [53] [58] [62] [74] [104]
47	Tadahiro Kitahashi	[2]
48	Reinhard Klette	[48] [59]
49	Christian Knauer	[86] [92] [99]
50	Matias Korman	[115]
51	Ernest S. Kuh	[6]
52	Mitsuo Kurachi	[1]
53	Xuefeng Liang	[64] [72] [76] [78] [79] [84] [85]
54	Anil Maheshwari	[91] [102]
55	Jirí Matousek	[73] [82] [87]
56	Tomomi Matsui	[41] [42]
57	Y. Matsui	[1]
58	Kurt Mehlhorn	[66] [70]
59	Ikuo Mitsuka	[113]
60	Takeshi Miura	[113]
61	Satoru Miyano	[31]
62	Mitsuo Motoki	[89] [95]
63	Wolfgang Mulzer (Wolfgang Johann Heinrich Mulzer)	[109] [114] [115]
64	Hyeon-Suk Na	[86] [92] [99]
65	Hiroshi Nagamochi	[31]
66	Koji Nakano	[61]
67	Subhas C. Nandy	[43] [44] [50] [51] [65] [93]
68	Takao Nishizeki	[16] [19] [23]
69	Koji Obokata	[48] [52] [54] [55]
70	Ron Y. Pinter	[8]
71	Bishal Prasad	[96]
72	Desh Ranjan	[27] [32]
73	Christian Ronse	[59]
74	Thomas Roos	[27] [32]
75	Günter Rote	[105] [114] [115]
76	Kunihiko Sadakane	[112] [119]
77	Hideyuki Sakai	[75]
78	Shinji Sasahara	[65] [67] [68] [93] [107]
79	André Schulz	[115]
80	Shigeaki Shimazu	[36]
81	Chan-Su Shin	[86] [92] [99]
82	Chang Shu	[91] [102]
83	Michiel H. M. Smid	[91] [102]
84	Jack Snoeyink	[37] [56]
85	Kokichi Sugihara	[75]
86	Subhash Suri	[31]
87	Hisao Tamaki	[33] [35] [37] [56] [57] [60] [63] [77] [88]
88	Hiroshi Tanaka	[106]
89	Kokichi Tanaka (Kohkichi Tanaka)	[2]
90	Sachio Teramoto	[71]
91	Takeshi Tokuyama	[15] [17] [18] [20] [22] [25] [26] [30] [33] [35] [41] [42] [46] [47] [49] [52] [54] [55] [57] [60] [63] [66] [70] [73] [77] [82] [87] [88]
92	Ryuhei Uehara	[110] [112] [119]
93	Hiroshi Umeo	[13]
94	Takeaki Uno	[65] [93]
95	Nobuaki Usui	[89] [95]
96	Gabriel Valiente	[112] [119]
97	Yajun Wang	[109] [114]
98	Emo Welzl	[27] [32]
99	Peter Widmayer	[27] [32]
100	Alexander Wolff	[69] [86] [92] [99]
101	Stefanie Wuhrer	[91] [102]
102	F. Frances Yao (Frances F. Yao, Foong Frances Yao)	[14]
103	Chee-Keng Yap (Chee Yap)	[29] [53] [58] [62]
104	Naokazu Yokoya	[3]
105	Hui Zhang	[79]

Colors in the list of coauthors

Last update Sat May 26 04:23:17 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page