• Format (Classified by research topics)
    1. Title of papers
      Journal name (Conf.: conference name)
      co-authors
      other information
    2. Example：
      Efficient Algorithms for the Hitchcock Transportation Problem
      SIAM J. Computing 24-3 (1995) 563-578. (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
    ACM-SIAM 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 SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
    VLDB
    International Conference on Very Large Data Base
  • Computational geometry
    1. Geometric matching and placement
      1. Title: Maximin Location of Convex Objects in a Polygon and Related Dynamic Voronoi Diagrams
        Proc. 6-th ACM SCG, pp.225-234, 1990.
        H. Aonuma, H. Imai, and K. Imai
        to appear in J. OR Society of Japan
      2. A Dynamic Algorithms for Placing Rectangles without Overlapping
        Journal of Information Processing 14-1(1991).
        Ta. Asano and S. Tsukiyama
      3. Distribution of Distances and Triangles in Point Sets and Its Application to Largest Common Point Set Problems
        Discrete and Computational Geometry 20-3 (1998) 307-331. (Conf: ACM SCG '97)
        T. Akutsu H. Tamaki
    2. Combinatorics of Arrangement
      1. Bounding the number of $k$-faces in arrangements of hyperplanes
        Discrete Applied Math., 31 (1991) pp.151-165. (Conf.: CCCG'89)
        K. Fukuda, S. Saito and A. Tamura
      2. The Sum of Smaller Endpoint Degree over Edges of Graphs and its Applications to Geometric Problems
        Proc. 3rd CCCG, pp.145-148, 1991.
        T. Akutsu, A. Aoki, H. Imai and K. Imai
        No journal version
      3. A Theorem on the Average Number of Subfaces in Arrangements and Oriented Matroids,
        Geometriae Dedicata 47 (1993) 129-147.
        K. Fukuda and A. Tamura
      4. Complexity of Projected Images of Convex Subdivisions
        Computational Geometry, Theory and Applications 4 (1994) 293-308. (Conf.: CCCG'93)
        T. Hirata, J. Matsousek, and X-H. Tan
      5. How to Cut Pseudo-Parabolas into Segments
        Discrete and Computational Geometry 19, 265-290 (Conf: ACM SCG '95).
        H. Tamaki
        Yamashita Award IPSJ
      6. A Characterization of Planar Graphs by Pseudo-Line Arrangements
        ISAAC 97, LNCS 1350 pp.133-142.
        H. Tamaki
        ISAAC97 Best Paper Award
      7. Parametric Polymatroid Optimization and Its Geometric Applications
        11th ACM-SIAM SODA (1999)
        N. Katoh and H. Tamaki
      8. Lovasz's Lemma for the Three Dimensional K-Level of Concave Surfaces and its Applications
        40th IEEE FOCS
        N. Katoh
    3. Topological walk and its applications
      1. Algorithms for Projecting Points to Give the Most Uniform Distribution with Applications to Hashing
        Algorithmica, 9-6 (1993) pp.572-590. (Conf.: ISAAC'90)
        Te. Asano
      2. Curcuit Partitioning Algorithms Based on Geometry Model
        Algorithmic Aspects of VLSI Layout, pp. 199-212 (1993), Elsevier. (Conf.: ISAAC'91)
        Te. Asano
      3. Partial Construction of an Arrangement of Lines and Its Application to Optimal Partitioning of Bichromatic Point Set
        IEICE Transactions E77-A (1994) 595-600
        Te. Asano
      4. Walking on an Arrangement Topologically
        Int'l Journal of Computational Geometry and Applications, 4-2 (1994) 123-151. (Conf.: ACM SCG '91)
        Te. Asano and L. Guibas
      5. Topological Walk Revisited
        Trans. IEICE E81-A-5, (1998) pp.751-756. (Conf: CCCG '94).
        Te. Asano
    4. Application to CAD and Image Processing
      1. Orthogonal Queries in Segments and Triangles
        Algorithmica 18, pp. 229-245 (1997). (Conf.: ISAAC '94)
      2. A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images
        Proc. 2nd ESA, Springer LNCS 855 (1994) 215-226
        Te. Asano and N. Katoh
        Journal version submitted
      3. Polynomial Time Solutions to Image Segmentation
        Proc. 7th SODA (1996) 104-113.
        Te. Asano, D. Chen, and N. Katoh
        Journal version submitted
      4. Algorithms for the Maximum Subarray Problem Based on Matrix Multiplication
        Proc. 9th SODA (1998) 446-452
        Hisao Tamaki
      5. Convertiblity among Grid Filling Curves
        Proc. ISAAC '98
        T. Asano, N. Katoh, and H. Tamaki
  • Combinatorial Optimization
    1. Graph and OR
      1. Splitting a Configuration in a Simplex
        Algorithmica, 9-6 (1993) pp.649-668. (Conf.: ISAAC '90)
        K. Numata
      2. Efficient Algorithms for the Hitchcock Transportation Problem
        SIAM J. Computing 24-3 (1995) 563-578. (Conf.: SODA '92)
        J. Nakano
        TRL Best paper award 1996
        IPSJ Research Award
      3. Geometric Algorithms for the Minimum Cost Assignment Problem
        Random Structures and Algorithms 6-5 (1995) 393-406. (Conf.: ACM SCG '91)
        J. Nakano
      4. On Minimum and Maximum Spanning Trees of Linearly Moving Points
        Discrete and Compuational Geometry, 13 (1995) 161-176. (Conf.: FOCS '92)
        N. Katoh and K. Iwano
        Yamashita Award, IPSJ
      5. Finding Subsets Maximizing Minimum Structures,
        Proc. 6th SODA, (1995) 150-159
        M. Halldorsson, N. Katoh and K. Imano
        to appear in SIAM Discrete Math
      6. Greedy Finding a Dense Subgraph
        Proc. SWAT, LNCS 1097 (1996) 136-145
        Y. Asahiro, K. Iwama, H. Tamaki
        Journal version submitted
      7. Covering Points in the Plane by k-Tours: Towards a Polynomial Time Apploximation Scheme for General k
        Proc. STOC (1997) 275-283
        T. Asano, N. Katoh, H. Tamaki
    2. Data Optization
      1. Consecutive Interval Query and Dynamic Programming on Intervals,
        Discrete Applied Mathematics 85-1 (1998) pp.1-24.
        Conf: 4th ISAAC, LNCS 762 (1993) 466-475
        A. Aggarwal
      2. Finding a Minimum Weight k-Link Path in Graphs with the Concave Monge Property and Applications
        Discrete and Comuptational Geometry, 12 (1994) 263-280. (Conf.: ACM SCG '93)
        A. Aggrwal and B. Schieber
        TRL best paper award 1995
      3. An Improved Algoirthm for the Traveler's Problem
        Journal of Algoirthms 19-2 (1995) 318-330. (Conf.: ISAAC '93)
        A. Aggarwal
  • Other CS papers
    1. Pseudo-random generators
      1. A Note on Polynomial Arithmetic Analogue of Halton Sequences
        ACM Trans. on Modeling and Computer Simulation 4-3 (1994) 279-284.
        S. Tezuka
    2. Data Mining
      1. Data Mining Using Two-Dimensional Optimized Association Rules: Scheme, Algoirthms, and Visualization
        SIGMOD '96
        T. Fukuda, Y. Morimoto, S. Morishita
        Journal version submitted
      2. Mining Optimized Association Rules for Numeric Attributes
        Journal of Computer Systems Science 58 (1999) 1-12
        Conf: PODS '96
        T. Fukuda, Y. Morimoto, S. Morishita
      3. Constructing Efficient Decision Trees Using Optimized Association Rules
        Constraint Vol 2 (1997), pp.163-189.
        Conf: VLDB '96
        T. Fukuda, Y. Morimoto, S. Morishita
        TRL Best paper award 1998
      4. Interval Finding and Its Application to Data Mining
        Trans. IEICE E80-A (1997) 620-626. (Conf: ISAAC'96)
        T. Fukuda, Y. Morimoto, S. Morishita
      5. Computing Optimized Rectilinear Regions for Association Rules
        K. Yoda, T. Fukuda, Y. Morimoto, S. Morishita
        Proc. KDD'97
      6. Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
        Y. Morimoto, T. Fukuda, K. Yoda, H. Matsuzawa
        VLDB98
      7. Algorithm Theory in Data Mining,
        Proc. 21st Australasian Computer Science Conference (ACSC'98) (1998) pp. 1--15 (invited plenary talk)
      8. Approximation of Optimal Two-Dimensional Assoication Rules for Categorical Attributes Using Semidefinite Programming
        Proc. Discovery Science'99 (to appear)
    3. E-Commerce
      1. A Key Updata Method for Secure Multiparty Communication,
        H. Maruyama and N. Uramoto
        GLOBCOM 98
      2. Optimal Online Algorithms for an Electronic Commerce Money Distribution System
        H. Kawazoe and T. Shibuya
        11th ACM-SIAM SODA (1999)
  • Group Theory（when I was a student）
    1. Finite Reflection Groups
      1. On the decomposition rules of the tensor products of the representations of the classical Weyl groups,
        Journal of Algebra 88 (1984) 380-394.
      2. A theorem on the representations of the Weyl groups of type $D_n$ and $B_{n-1}$
        Journal of algebra 90 (1984) 430-434
    2. Linear Algebraic Groups
      1. On a relation between the representations of a general linear group and a symplectic group
        Algebraic and Topological Theories (1985) 344-368, Kinokuniya Shoten
      2. 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 33-2 (1986) 273-282
      3. Highest weight vectors associated with some branchings
        Proceedings of Symposia in Pure Mathematics Vol 47-2, (The Arcata Conference on Representations of Finite Groups), pp.541-545, 1987
      4. Determinantal method and the Littlewood-Richardson rule
        Journal of Algebra 117 (1988) 1-18
      5. A generating function of strict Gelfand patterns and character formulas of general linear groups
        Journal of the Math. Soc. of Japan 40 (1989) 671-685