Computational investigations of all-terminal network reliability via BDDs H Imai, K Sekine, K Imai IEICE transactions on fundamentals of electronics, communications and …, 1999 | 68 | 1999 |

Minimax geometric fitting of two corresponding sets of points K Imai, S Sumino, H Imai Proceedings of the fifth annual symposium on Computational geometry, 206-275, 1989 | 66 | 1989 |

Algorithms for vertical and orthogonal L1 linear approximation of points P Yamamoto, K Kato, K Imai, H Imai Proceedings of the fourth annual symposium on Computational geometry, 352-361, 1988 | 47 | 1988 |

Orthogonal weighted linear L1 and L∞ approximation and applications ME Houle, H Imai, K Imai, JM Robert, P Yamamoto Discrete Applied Mathematics 43 (3), 217-232, 1993 | 35 | 1993 |

An improved algorithm for the minimum Manhattan network problem R Kato, K Imai, T Asano Algorithms and Computation: 13th International Symposium, ISAAC 2002 …, 2002 | 33 | 2002 |

Maximin location of convex objects in a polygon and related dynamic Voronoi diagrams H Aonuma, H Imai, K Imai, T Tokuyama Proceedings of the sixth annual symposium on Computational geometry, 225-234, 1990 | 33 | 1990 |

Map label placement for points and curves T Kameda, K Imai IEICE transactions on fundamentals of electronics, communications and …, 2003 | 32 | 2003 |

Enumeration of regular triangulations T Masada, H Imai, K Imai Proceedings of the twelfth annual symposium on Computational geometry, 224-233, 1996 | 28 | 1996 |

A branch-and-cut approach for minimum weight triangulation Y Kyoda, K Imai, F Takeuchi, A Tajima Algorithms and Computation: 8th International Symposium, ISAAC'97 Singapore …, 1997 | 27 | 1997 |

Enumerating triangulations in general dimensions H Imai, T Masada, F Takeuchi, K Imai International Journal of Computational Geometry & Applications 12 (06), 455-480, 2002 | 22 | 2002 |

Weighted orthogonal linear *L* _{∞}-approximation and applicationsME Houle, H Imai, K Imai, JM Robert Algorithms and Data Structures: Workshop WADS'89 Ottawa, Canada, August 17 …, 1989 | 21 | 1989 |

Voronoi diagrams for pure 1-qubit quantum states K Kato, M Oto, H Imai, K Imai arXiv preprint quant-ph/0604101, 2006 | 19 | 2006 |

On operators defining a family of nonanalytic*C* ^{∞}-functionsK Kabaya-Imai, M Iri Japan Journal of Applied Mathematics 5, 333-365, 1988 | 16 | 1988 |

Polynomial time algorithms for label size maximization on rotating maps Y Yokosuka, K Imai Journal of Information Processing 25, 572-579, 2017 | 15 | 2017 |

Maximin location of convex objects in a polygon and related dynamic Voronoi diagrams K Imai, H Imai, T Tokuyama Journal of the Operations Research Society of Japan 42 (1), 45-58, 1999 | 12 | 1999 |

Graphical degree sequence problems M Takahashi, K Imai, T Asano IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and …, 1994 | 12 | 1994 |

Voronoi diagrams of moving points H Imai, K Imai Proc. Int. Computer Symp., Taiwan, 600-606, 1990 | 12 | 1990 |

Distance *k*-sectors existK Imai, A Kawamura, J Matoušek, D Reem, T Tokuyama Proceedings of the twenty-sixth annual symposium on Computational geometry …, 2010 | 11 | 2010 |

Voronoi diagrams by divergences with additive weights K Sadakane, H Imai, K Onishi, M Inaba, F Takeuchi, K Imai Proceedings of the fourteenth annual symposium on Computational geometry …, 1998 | 11 | 1998 |

An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem Y Matsumoto, N Kamiyama, K Imai Information Processing Letters 111 (10), 465-468, 2011 | 8 | 2011 |