Hiroshi Imai

According to our database1, Hiroshi Imai authored at least 114 papers between 1982 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Parameterized Algorithms to Compute Ising Partition Function.
IEICE Transactions, 2018

FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and Ice-Type Models.
Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

2016
Parametric multiroute flow and its application to multilink-attack network.
Discrete Optimization, 2016

Structural internal deterioration detection with motion vector field image analysis using monocular camera.
Proceedings of the 3D Image Processing, 2016

2015
Improving Width-3 Joint Sparse Form to Attain Asymptotically Optimal Complexity on Average Case.
IEICE Transactions, 2015

Two Lower Bounds for Shortest Double-Base Number System.
IEICE Transactions, 2015

2014
BDD Operations for Quantum Graph States.
Proceedings of the Reversible Computation - 6th International Conference, 2014

Worst case computation time for minimal joint Hamming weight numeral system.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Parametric Multiroute Flow and Its Application to Robust Network with k Edge Failures.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
Proximity and Motion Planning on ℓ1-Rigid Planar Periodic Graphs.
Trans. Computational Science, 2013

Editorial.
Comput. Geom., 2013

2012
Matroid Enumeration for Incidence Geometry.
Discrete & Computational Geometry, 2012

Fastest multi-scalar multiplication based on optimal double-base chains.
Proceedings of the 2012 World Congress on Internet Security, 2012

Calculating Average Joint Hamming Weight for Minimal Weight Conversion of d Integers.
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

Geometrical Treatment of Periodic Graphs with Coordinate System Using Axis-fiber and an Application to a Motion Planning.
Proceedings of the Ninth International Symposium on Voronoi Diagrams in Science and Engineering, 2012

Fast Elliptic Curve Cryptography Using Minimal Weight Conversion of d Integers.
Proceedings of the Tenth Australasian Information Security Conference, 2012

2011
Revisiting Hyperbolic Voronoi Diagrams in Two and Higher Dimensions from Theoretical, Applied and Generalized Viewpoints.
Trans. Computational Science, 2011

Emergency Medical Support System for Extravehicular Activity Training Held at Weightless Environment Test Building (WETS) of the Japan Aerospace Exploration Agency (JAXA) - Future Prospects and A Look Back Over the Past Decade.
J. Medical Systems, 2011

Fast Elliptic Curve Cryptography Using Optimal Double-Base Chains.
IACR Cryptology ePrint Archive, 2011

Proximity and Motion Planning on l_1-Embeddable Tilings.
Proceedings of the Eighth International Symposium on Voronoi Diagrams in Science and Engineering, 2011

2010
Optimal Average Joint Hamming Weight and Minimal Weight Conversion of d Integers.
IACR Cryptology ePrint Archive, 2010

Revisiting Hyperbolic Voronoi Diagrams from Theoretical, Applied and Generalized Viewpoints.
Proceedings of the Seventh International Symposium on Voronoi Diagrams in Science and Engineering, 2010

Voronoi Diagrams on Periodic Graphs.
Proceedings of the Seventh International Symposium on Voronoi Diagrams in Science and Engineering, 2010

2008
Computational Geometry Analysis of Quantum State Space and Its Applications.
Proceedings of the Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence, 2008

Generating facets for the cut polytope of a graph by triangular elimination.
Math. Program., 2008

2007
Error Analysis of a Numerical Calculation about One-qubit Quantum Channel Capacity.
Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering, 2007

2006
On a Geometric Structure of Pure Multi-qubit Quantum States and Its Applicability to a Numerical Computation.
Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006

2005
Qubit channels which require four inputs to achieve capacity: implications for additivity conjectures.
Quantum Information & Computation, 2005

2004
A DNA-Based Computational Model Using a Specific Type of Restriction Enzymes.
Journal of Automata, Languages and Combinatorics, 2004

Finding Neighbor Communities in the Web Using an Inter-Site Graph.
IEICE Transactions, 2004

2003
Standard pairs for lawrence-type matrices and their applications to several lawrence-type integer programs.
Optimization Methods and Software, 2003

Guest Editors' Foreword.
Algorithmica, 2003

Compact Encoding of the Web Graph Exploiting Various Power Laws: Statistical Reason Behind Link Database.
Proceedings of the Advances in Web-Age Information Management, 2003

Finding Neighbor Communities in the Web Using Inter-site Graph.
Proceedings of the Database and Expert Systems Applications, 14th International Conference, 2003

2002
Enumerating Triangulations in General Dimensions.
Int. J. Comput. Geometry Appl., 2002

Applying the Site Information to the Information Retrieval from the Web.
Proceedings of the 3rd International Conference on Web Information Systems Engineering, 2002

Web-Linkage Viewer: Finding Graph Structures in the Web.
Proceedings of the Advances in Web-Age Information Management, 2002

An Analysis of Absorbing Times of Quantum Walks.
Proceedings of the Unconventional Models of Computation, Third International Conference, 2002

General-Purpose Parallel Simulator for Quantum Computing.
Proceedings of the Unconventional Models of Computation, Third International Conference, 2002

Focusing on Sites in the Web.
Proceedings of the Information Systems and Databases (ISDB 2002), 2002

Power of Quantum Entanglement.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Data Compression Method Combining Properties of PPM and CTW.
Proceedings of the Progress in Discovery Science, 2002

A DNA-based Computational Model Using a Specific Type of Restriction Enzyme.
Proceedings of the DNA Computing, 8th International Workshop on DNA Based Computers, 2002

Quantum versus Deterministic Counter Automata.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
On the Newly Established Graduate School of Information Science and Technology of the University of Tokyo.
WISE (2), 2001

Power, Puzzles and Properties of Entanglement.
Proceedings of the Machines, 2001

2000
Classification of Various Neighborhood Operations for the Nurse Scheduling Problem.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Implementing the Context Tree Weighting Method for Text Compression.
Proceedings of the Data Compression Conference, 2000

One-Way Probabilistic Reversible and Quantum One-Counter Automata.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

Finding k-Closest-Pairs Efficiently for High Dimensional Data.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999
Enhanced A* Algorithms for Multiple Alignments: Optimal Alignments for Several Sequences and k-Opt Approximate Alignments for Large Cases.
Theor. Comput. Sci., 1999

Finding Meaningful Regions Containing Given Keywords from Large Text Collections.
Proceedings of the Discovery Science, 1999

Text Retrieval by Using k-word Proximity Search.
Proceedings of the 1999 International Symposium on Database Applications in Non-Traditional Environments (DANTE '99), 1999

1998
OBDDs of a Monotone Function and Its Prime Implicants.
Theory Comput. Syst., 1998

A Cooperative Distributed Text Database Management Method Unifying Search and Compression Based on the Burrows-Wheeler Transformation.
Proceedings of the Advances in Database Technologies, 1998

Geometric Clustering Models in Feature Space.
Proceedings of the Discovery Science, 1998

Voronoi Diagrams by Divergences with Additive Weights.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Computational investigations of the optimality of two- and three-dimensional triangulations under several criteria.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Riemannian computational geometry: Voronoi diagram delaunay-type triangulation in dually flat space.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Geometric clustering models for multimedia databases.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
New flexible approaches for multiple sequence alignment.
Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

Voronoi Diagram in Statistical Parametric Space by Kullback-Leibler Divergence.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Application of an Effective Geometric Clustering Method to the Color Quantization Problem.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Enumerating Triangulations for Products of Two Simplices and for Arbitrary Configurations of Points.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms.
Discrete Applied Mathematics, 1996

OBDDs of a Monotone Function and of Its Prime Implicants.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

A Package for Triangulations.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Enumeration of Regular Triangulations.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Experimental Results of Randomized Clustering Algorithm.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Detour Queries in Geographical Databases for Navigation and Related Algorithm Animations.
CODAS, 1996

Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders.
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995
epsilon-Approximations of k-Label Spaces.
Theor. Comput. Sci., 1995

Computing the Tutte Polynomial of a Graph of Moderate Size.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Search space reduction in high level synthesis by use of an initial circuit.
Proceedings of the 1995 Conference on Asia Pacific Design Automation, Makuhari, Massa, Chiba, Japan, August 29, 1995

1994
A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering (Extended Abstract).
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993
Orthogonal Weighted Linear L1 and L Approximation and Applications.
Discrete Applied Mathematics, 1993

Probing a Set of Hyperplanes by Lines and Related Problems.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

How to Treat Delete Requests in Semi-Online Problems.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Epsilon-Approximations of k-label Spaces.
Proceedings of the Algorithmic Learning Theory, 4th International Workshop, 1993

1992
1-Segment Center Problems.
INFORMS Journal on Computing, 1992

The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

Notes on the PAC Learning of Geometric Concepts with Additional Information.
Proceedings of the Algorithmic Learning Theory, Third Workshop, 1992

1991
Finding k Points with Minimum Diameter and Related Problems.
J. Algorithms, 1991

An Analysis of Randomized Shear Sort on the Mesh Computer.
Proceedings of the ISA '91 Algorithms, 1991

Performance Evaluation of Automatic Name Placement Functions for Geographical Database Systems.
Proceedings of the Database Systems for Advanced Applications '91, 1991

1990
Locating a Robot with Angle Mathematics.
J. Symb. Comput., 1990

Computation Geometry Research in Japan.
Bulletin of the EATCS, 1990

Computing Simple Circuits form a Set of Line Segments.
Discrete & Computational Geometry, 1990

Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow.
Proceedings of the Algorithms, 1990

Maximin Location of Convex Objects in a Polygon and Related Dynamic Voronoi Diagrams.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989
A Linear-Time Algorithm for Linear L_1 Approximation of Points.
Algorithmica, 1989

Weighted Orthogonal Linear L-Approximation and Applications.
Proceedings of the Algorithms and Data Structures, 1989

A Visual System of Placing Characters Appropriately in Multimedia Map Databases.
Proceedings of the Visual Database Systems. Proceedings of the IFIP TC2/WG 2.6 Working Conferenc on Visual Database Systems. Tokyo, 1989

Minimax Geometric Fitting of Two Corresponding Sets of Points.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

Fining k Points with Minimum Spanning Trees and Related Problems.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988
Computing the volume of the union of spheres.
The Visual Computer, 1988

On the convexity of the multiplicative version of Karmarkar's potential function.
Math. Program., 1988

Algorithms for Vertical and Orthogonal L1 Linear Approximation of Points.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987
Dynamic Orthogonal Segment Intersection Search.
J. Algorithms, 1987

Shortest Path Between Two Simple Polygons.
Inf. Process. Lett., 1987

Geometric Relations Among Voronoi Diagrams.
Proceedings of the STACS 87, 1987

1986
Efficient Algorithms for Geometric Graph Search Problems.
SIAM J. Comput., 1986

Partitioning a polygonal region into trapezoids.
J. ACM, 1986

Computational-geometric methods for polygonal approximations of a curve.
Computer Vision, Graphics, and Image Processing, 1986

A Multiplicative Barrier Function Method for Linear Programming.
Algorithmica, 1986

Visibility of Disjoint Polygons.
Algorithmica, 1986

On Computing Simple Circuits on a Set of Line Segments.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985
Voronoi Diagram in the Laguerre Geometry and its Applications.
SIAM J. Comput., 1985

On combinatorial structures of line drawings of polyhedra.
Discrete Applied Mathematics, 1985

Visibility-Polygon Search and Euclidean Shortest Paths
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984
Dynamic Segment Intersection Search with Applications
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983
Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane.
J. Algorithms, 1983

1982
Finding Connected Components of an Intersection Graph of Squares in the Euclidean Plane.
Inf. Process. Lett., 1982


  Loading...