 Format (Classified by research topics)

Title of papers
Journal name (Conf.: conference name)
coauthors
other information
 Example：
Efficient Algorithms for the Hitchcock Transportation Problem
SIAM J. Computing 243 (1995) 563578. (Conf.: SODA '92)
J. Nakano
TRL Best paper award 1996
Research award, IPSJ1993
 Acronyms of international conferences
 ACM SCG
 ACM Symposium on Computational Geometry
 CCCG
 Canadian Conference on Computational Geometry
 SODA
 ACMSIAM Symposium on Discrete Algorithms
 FOCS
 IEEE Symposium on Foundation of Computer Science
 ISAAC
 International Symposium on Algorithms and Computation
 ESA
 European Symposium on Algorithms
 SIGMOD
 ACM SIGMOD International Conference
on Management of Data
 PODS
 ACM SIGACTSIGMODSIGART Symposium on
Principles of Database Systems
 VLDB
 International Conference on Very Large Data Base
 Computational geometry
 Geometric matching and placement

Title: Maximin Location of Convex Objects in a Polygon and Related
Dynamic Voronoi Diagrams
Proc. 6th ACM SCG, pp.225234, 1990.
H. Aonuma, H. Imai, and K. Imai
to appear in J. OR Society of Japan

A Dynamic Algorithms for Placing Rectangles without
Overlapping
Journal of Information Processing 141(1991).
Ta. Asano and S. Tsukiyama
 Distribution of Distances and Triangles
in Point Sets and Its Application to Largest Common Point Set Problems
Discrete and Computational Geometry 203 (1998) 307331.
(Conf: ACM SCG '97)
T. Akutsu H. Tamaki
 Combinatorics of Arrangement
 Bounding the number of $k$faces in arrangements
of hyperplanes
Discrete Applied Math., 31 (1991) pp.151165.
(Conf.: CCCG'89)
K. Fukuda, S. Saito and A. Tamura
 The Sum of Smaller Endpoint Degree over Edges of Graphs and its
Applications to Geometric Problems
Proc. 3rd CCCG, pp.145148, 1991.
T. Akutsu, A. Aoki, H. Imai and K. Imai
No journal version
 A Theorem on the Average Number of Subfaces in Arrangements
and Oriented Matroids,
Geometriae Dedicata 47 (1993) 129147.
K. Fukuda and A. Tamura

Complexity of Projected Images of Convex Subdivisions
Computational Geometry, Theory and Applications 4
(1994) 293308. (Conf.: CCCG'93)
T. Hirata, J. Matsousek, and XH. Tan
 How to Cut PseudoParabolas into Segments
Discrete and Computational Geometry 19, 265290 (Conf: ACM SCG '95).
H. Tamaki
Yamashita Award IPSJ
 A Characterization of Planar Graphs by PseudoLine Arrangements
ISAAC 97, LNCS 1350 pp.133142.
H. Tamaki
ISAAC97 Best Paper Award
 Parametric Polymatroid Optimization and Its Geometric Applications
11th ACMSIAM SODA (1999)
N. Katoh and H. Tamaki
 Lovasz's Lemma for the Three Dimensional KLevel of Concave Surfaces and its Applications
40th IEEE FOCS
N. Katoh
 Topological walk and its applications
 Algorithms for Projecting Points to Give the Most Uniform
Distribution with Applications to Hashing
Algorithmica, 96 (1993) pp.572590. (Conf.: ISAAC'90)
Te. Asano
 Curcuit Partitioning Algorithms Based on Geometry Model
Algorithmic Aspects of VLSI Layout, pp. 199212 (1993),
Elsevier. (Conf.: ISAAC'91)
Te. Asano
 Partial Construction of an Arrangement of Lines and
Its Application to Optimal Partitioning of Bichromatic
Point Set
IEICE Transactions E77A (1994) 595600
Te. Asano
 Walking on an Arrangement Topologically
Int'l Journal of Computational Geometry and Applications, 42 (1994)
123151. (Conf.: ACM SCG '91)
Te. Asano and L. Guibas
 Topological Walk Revisited
Trans. IEICE E81A5, (1998) pp.751756. (Conf: CCCG '94).
Te. Asano
 Application to CAD and Image Processing
 Orthogonal Queries in Segments and Triangles
Algorithmica 18, pp. 229245 (1997).
(Conf.: ISAAC '94)
 A Unified Scheme for Detecting Fundamental Curves in
Binary Edge Images
Proc. 2nd ESA, Springer LNCS 855 (1994) 215226
Te. Asano and N. Katoh
Journal version submitted
 Polynomial Time Solutions to Image Segmentation
Proc. 7th SODA (1996) 104113.
Te. Asano, D. Chen, and N. Katoh
Journal version submitted
 Algorithms for the Maximum Subarray Problem Based on
Matrix Multiplication
Proc. 9th SODA (1998) 446452
Hisao Tamaki
 Convertiblity among Grid Filling Curves
Proc. ISAAC '98
T. Asano, N. Katoh, and H. Tamaki
 Combinatorial Optimization
 Graph and OR
 Splitting a Configuration in a Simplex
Algorithmica, 96 (1993) pp.649668. (Conf.: ISAAC '90)
K. Numata
 Efficient Algorithms for the Hitchcock Transportation Problem
SIAM J. Computing 243 (1995) 563578. (Conf.: SODA '92)
J. Nakano
TRL Best paper award 1996
IPSJ Research Award
 Geometric Algorithms for the Minimum Cost Assignment Problem
Random Structures and Algorithms 65 (1995) 393406.
(Conf.: ACM SCG '91)
J. Nakano
 On Minimum and Maximum Spanning Trees of Linearly Moving Points
Discrete and Compuational Geometry, 13 (1995) 161176.
(Conf.: FOCS '92)
N. Katoh and K. Iwano
Yamashita Award, IPSJ
 Finding Subsets Maximizing Minimum Structures,
Proc. 6th SODA, (1995) 150159
M. Halldorsson, N. Katoh and K. Imano
to appear in SIAM Discrete Math
 Greedy Finding a Dense Subgraph
Proc. SWAT, LNCS 1097 (1996) 136145
Y. Asahiro, K. Iwama, H. Tamaki
Journal version submitted
 Covering Points in the Plane by kTours:
Towards a Polynomial Time Apploximation Scheme for General k
Proc. STOC (1997) 275283
T. Asano, N. Katoh, H. Tamaki
 Data Optization
 Consecutive Interval Query and Dynamic Programming on
Intervals,
Discrete Applied Mathematics 851 (1998) pp.124.
Conf: 4th ISAAC, LNCS 762 (1993) 466475
A. Aggarwal
 Finding a Minimum Weight kLink Path in Graphs with the
Concave Monge Property and Applications
Discrete and Comuptational Geometry, 12 (1994) 263280.
(Conf.: ACM SCG '93)
A. Aggrwal and B. Schieber
TRL best paper award 1995
 An Improved Algoirthm for the Traveler's Problem
Journal of Algoirthms 192 (1995) 318330. (Conf.: ISAAC '93)
A. Aggarwal
 Other CS papers
 Pseudorandom generators
 A Note on Polynomial Arithmetic Analogue of
Halton Sequences
ACM Trans. on Modeling and Computer Simulation 43
(1994) 279284.
S. Tezuka
 Data Mining
 Data Mining Using TwoDimensional Optimized Association Rules:
Scheme, Algoirthms, and Visualization
SIGMOD '96
T. Fukuda, Y. Morimoto, S. Morishita
Journal version submitted
 Mining Optimized Association Rules for Numeric Attributes
Journal of Computer Systems Science 58 (1999) 112
Conf: PODS '96
T. Fukuda, Y. Morimoto, S. Morishita
 Constructing Efficient Decision Trees Using Optimized Association Rules
Constraint Vol 2 (1997), pp.163189.
Conf: VLDB '96
T. Fukuda, Y. Morimoto, S. Morishita
TRL Best paper award 1998
 Interval Finding and Its Application to Data Mining
Trans. IEICE E80A (1997) 620626. (Conf: ISAAC'96)
T. Fukuda, Y. Morimoto, S. Morishita
 Computing Optimized Rectilinear Regions for Association Rules
K. Yoda, T. Fukuda, Y. Morimoto, S. Morishita
Proc. KDD'97
 Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
Y. Morimoto, T. Fukuda, K. Yoda, H. Matsuzawa
VLDB98

Algorithm Theory in Data Mining,
Proc. 21st Australasian Computer Science Conference (ACSC'98)
(1998) pp. 115 (invited plenary talk)

Approximation of Optimal TwoDimensional Assoication Rules for Categorical Attributes Using Semidefinite Programming
Proc. Discovery Science'99 (to appear)
 ECommerce
 A Key Updata Method for Secure Multiparty Communication,
H. Maruyama and N. Uramoto
GLOBCOM 98
 Optimal Online Algorithms for an Electronic Commerce
Money Distribution System
H. Kawazoe and T. Shibuya
11th ACMSIAM SODA (1999)
 Group Theory（when I was a student）
 Finite Reflection Groups

On the decomposition rules of the tensor products of the
representations of the classical Weyl groups,
Journal of Algebra 88 (1984) 380394.
 A theorem on the representations of the Weyl groups of
type $D_n$ and $B_{n1}$
Journal of algebra 90 (1984) 430434
 Linear Algebraic Groups
 On a relation between the representations of a general
linear group and a symplectic group
Algebraic and Topological Theories (1985) 344368, Kinokuniya
Shoten
 Multiplicity free representations with respect to the
restriction between $SL(2n,C)$ and $Sp(n,C)$
Journal of Faculty of Sci. Univ. Tokyo Sec.IA 332 (1986)
273282
 Highest weight vectors associated with some branchings
Proceedings of Symposia in Pure Mathematics Vol 472,
(The Arcata Conference on Representations of Finite Groups),
pp.541545, 1987
 Determinantal method and the LittlewoodRichardson rule
Journal of Algebra 117 (1988) 118
 A generating function of strict Gelfand patterns and
character formulas of general linear groups
Journal of the Math. Soc. of Japan 40 (1989) 671685