| 2011 |
|---|
| 64 | A Polynomial Time Algorithm for Bounded Directed Pathwidth. Hisao Tamaki. WG 2011, 331-342. Web SearchBibTeXDownload |
| 2010 |
|---|
| 63 | MAX/C on Sakai - A Web-based C-Programming Course. Souichirou Fujii, Kazunori Ohkubo, Hisao Tamaki. CSEDU (1) 2010, 196-201. Web SearchBibTeX |
| 62 | Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. Qian-Ping Gu, Hisao Tamaki. ISAAC (2) 2010, 85-96. Web SearchBibTeXDownload |
| 61 | k-cyclic Orientations of Graphs. Yasuaki Kobayashi, Yuichiro Miyamoto, Hisao Tamaki. ISAAC (2) 2010, 73-84. Web SearchBibTeXDownload |
| 2009 |
|---|
| 60 | Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n1 + epsilon) Time. Qian-Ping Gu, Hisao Tamaki. ISAAC 2009, 984-993. Web SearchBibTeXDownload |
| 59 | Route-Enabling Graph Orientation Problems. Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara. ISAAC 2009, 403-412. Web SearchBibTeXDownload |
| 2008 |
|---|
| 58 | Optimal branch-decomposition of planar graphs in O(n3) Time. Qian-Ping Gu, Hisao Tamaki. ACM Transactions on Algorithms (4) (2008). Web SearchBibTeXDownload |
| 57 | Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs. Zhengbing Bian, Qian-Ping Gu, Marjan Marzban, Hisao Tamaki, Yumi Yoshitake. ALENEX 2008, 152-165. Web SearchBibTeXDownload |
| 2007 |
|---|
| 56 | Voronoi Diagram with Respect to Criteria on Vision Information. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama. ISVD 2007, 25-32. Web SearchBibTeXDownload |
| 2006 |
|---|
| 55 | Angular Voronoi Diagram with Applications. Tetsuo Asano, Hisao Tamaki, Naoki Katoh, Takeshi Tokuyama. ISVD 2006, 18-24. Web SearchBibTeXDownload |
| 54 | Matching Algorithms Are Fast in Sparse Random Graphs. Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki. Theory Comput. Syst. (39): 3-14 (2006). Web SearchBibTeXDownload |
| 2005 |
|---|
| 53 | Optimal Branch-Decomposition of Planar Graphs in O(n3) Time. Qian-Ping Gu, Hisao Tamaki. ICALP 2005, 373-384. Web SearchBibTeXDownload |
| 52 | On the probability of rendezvous in graphs. Martin Dietzfelbinger, Hisao Tamaki. Random Struct. Algorithms (26): 266-288 (2005). Web SearchBibTeXDownload |
| 2004 |
|---|
| 51 | Matching Algorithms Are Fast in Sparse Random Graphs. Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki. STACS 2004, 81-92. Web SearchBibTeXDownload |
| 50 | On Geometric Structure of Global Roundings for Graphs and Range Spaces. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama. SWAT 2004, 455-467. Web SearchBibTeXDownload |
| 49 | The structure and number of global roundings of a graph. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama. Theor. Comput. Sci. (325): 425-437 (2004). Web SearchBibTeXDownload |
| 2003 |
|---|
| 48 | The Structure and Number of Global Roundings of a Graph. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama. COCOON 2003, 130-138. Web SearchBibTeXDownload |
| 47 | Spanning Trees Crossing Few Barriers. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki. Discrete & Computational Geometry (30): 591-606 (2003). Web SearchBibTeXDownload |
| 46 | A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs. Hisao Tamaki. ESA 2003, 765-775. Web SearchBibTeXDownload |
| 2002 |
|---|
| 45 | Parametric Polymatroid Optimization and Its Geometric Applications. Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama. Int. J. Comput. Geometry Appl. (12): 429 (2002). Web SearchBibTeXDownload |
| 2001 |
|---|
| 44 | Efficient randomized routing algorithms on the two-dimensional mesh of buses. Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki. Theor. Comput. Sci. (261): 227-239 (2001). Web SearchBibTeXDownload |
| 2000 |
|---|
| 43 | Multicolor routing in the undirected hypercube. Qian-Ping Gu, Hisao Tamaki. Discrete Applied Mathematics (100): 169-181 (2000). Web SearchBibTeXDownload |
| 42 | Greedily Finding a Dense Subgraph. Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama. J. Algorithms (34): 203-221 (2000). Web SearchBibTeXDownload |
| 41 | Latent Semantic Indexing: A Probabilistic Analysis. Christos H. Papadimitriou, Prabhakar Raghavan, Hisao Tamaki, Santosh Vempala. J. Comput. Syst. Sci. (61): 217-235 (2000). Cited by 463Web SearchBibTeXDownload |
| 1999 |
|---|
| 40 | Parametric Polymatroid Optimization and Its Geometric Applications. Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama. SODA 1999, 517-526. Web SearchBibTeXDownload |
| 39 | Spanning Trees Crossing Few Barriers. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki. Symposium on Computational Geometry 1999, 41-48. Web SearchBibTeXDownload |
| 1998 |
|---|
| 38 | Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki. COCOON 1998, 229-240. Web SearchBibTeXDownload |
| 37 | How to Cut Pseudoparabolas into Segments. Hisao Tamaki, Takeshi Tokuyama. Discrete & Computational Geometry (19): 265-290 (1998). Web SearchBibTeXDownload |
| 36 | Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. Tatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama. Discrete & Computational Geometry (20): 307-331 (1998). Web SearchBibTeXDownload |
| 35 | Convertibility among Grid Filling Curves. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama. ISAAC 1998, 307-316. Web SearchBibTeXDownload |
| 34 | Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki. J. ACM (45): 863-890 (1998). Web SearchBibTeXDownload |
| 33 | Latent Semantic Indexing: A Probabilistic Analysis. Christos H. Papadimitriou, Prabhakar Raghavan, Hisao Tamaki, Santosh Vempala. PODS 1998, 159-168. Cited by 463Web SearchBibTeX |
| 32 | Efficient Self-Embedding of Butterfly Networks with Random Faults. Hisao Tamaki. SIAM J. Comput. (27): 614-636 (1998). Web SearchBibTeXDownload |
| 31 | Algorithms for the Maxium Subarray Problem Based on Matrix Multiplication. Hisao Tamaki, Takeshi Tokuyama. SODA 1998, 446-452. Web SearchBibTeXDownload |
| 1997 |
|---|
| 30 | A Characterization of Planar Graphs by Pseudo-Line Arrangements. Hisao Tamaki, Takeshi Tokuyama. ISAAC 1997, 133-142. Web SearchBibTeXDownload |
| 29 | Multi-Color Routing in the Undirected Hypercube. Qian-Ping Gu, Hisao Tamaki. ISAAC 1997, 72-81. Web SearchBibTeXDownload |
| 28 | Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths. Qian-Ping Gu, Hisao Tamaki. J. Parallel Distrib. Comput. (44): 147-152 (1997). Web SearchBibTeXDownload |
| 27 | Covering Points in the Plane by k-Tours: Towards a Polynomial Time Approximation Scheme for General k. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama. STOC 1997, 275-283. Web SearchBibTeXDownload |
| 26 | Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. Tatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama. Symposium on Computational Geometry 1997, 314-323. Web SearchBibTeXDownload |
| 1996 |
|---|
| 25 | Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths. Qian-Ping Gu, Hisao Tamaki. IPPS 1996, 561-567. Web SearchBibTeXDownload |
| 24 | Construction of the Mesh and the Torus Tolerating a Large Number of Faults. Hisao Tamaki. J. Comput. Syst. Sci. (53): 371-379 (1996). Web SearchBibTeXDownload |
| 23 | Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki. STOC 1996, 151-160. Web SearchBibTeXDownload |
| 22 | Greedily Finding a Dense Subgraph. Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama. SWAT 1996, 136-148. Web SearchBibTeXDownload |
| 1995 |
|---|
| 21 | Motion planning for a steering-constrained robot through moderate obstacles. Pankaj K. Agarwal, Prabhakar Raghavan, Hisao Tamaki. STOC 1995, 343-352. Cited by 57Web SearchBibTeXDownload |
| 20 | How to Cut Pseudo-Parabolas into Segments. Hisao Tamaki, Takeshi Tokuyama. Symposium on Computational Geometry 1995, 230-237. Web SearchBibTeXDownload |
| 1994 |
|---|
| 19 | Routings for Involutions of a Hypercube. Alan P. Sprague, Hisao Tamaki. Discrete Applied Mathematics (48): 175-186 (1994). Web SearchBibTeXDownload |
| 18 | Motion Planning on a Graph (Extended Abstract). Christos H. Papadimitriou, Prabhakar Raghavan, Madhu Sudan, Hisao Tamaki. FOCS 1994, 511-520. Web SearchBibTeXDownload |
| 17 | The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection. Kazuo Iwano, Prabhakar Raghavan, Hisao Tamaki. ISAAC 1994, 29-37. Cited by 17Web SearchBibTeXDownload |
| 16 | Construction of the Mesh and the Torus Tolerating a Large Number of Faults. Hisao Tamaki. SPAA 1994, 268-277. Web SearchBibTeXDownload |
| 15 | On the fault tolerance of the butterfly. Anna R. Karlin, Greg Nelson, Hisao Tamaki. STOC 1994, 125-133. Web SearchBibTeXDownload |
| 1993 |
|---|
| 14 | Fast Deflection Routing for Packets and Worms (Extended Summary). Amotz Bar-Noy, Prabhakar Raghavan, Baruch Schieber, Hisao Tamaki. PODC 1993, 75-86. Cited by 64Web SearchBibTeX |
| 1992 |
|---|
| 13 | Efficient Self-Embedding of Butterfly Networks with Random Faults. Hisao Tamaki. FOCS 1992, 533-541. Web SearchBibTeXDownload |
| 12 | Robust Bounded-Degree Networks with Small Diameters. Hisao Tamaki. SPAA 1992, 247-256. Web SearchBibTeXDownload |
| 1989 |
|---|
| 11 | First Order Compiler: A Deterministic Logic Program Synthesis Algorithm. Taisuke Sato, Hisao Tamaki. J. Symb. Comput. (8): 605-627 (1989). Web SearchBibTeXDownload |
| 10 | Existential Continuation. Taisuke Sato, Hisao Tamaki. New Generation Comput. (6): 421-438 (1989). Web SearchBibTeXDownload |
| 1987 |
|---|
| 9 | Stream-Based Compilation of Ground I/O PROLOG into Committed-Choice Languages. Hisao Tamaki. ICLP 1987, 376-393. Web SearchBibTeX |
| 1986 |
|---|
| 8 | OLD Resolution with Tabulation. Hisao Tamaki, Taisuke Sato. ICLP 1986, 84-98. Web SearchBibTeXDownload |
| 1985 |
|---|
| 7 | A Distributed Unification Scheme for Systolic Logic Programs. Hisao Tamaki. ICPP 1985, 552-559. Web SearchBibTeX |
| 1984 |
|---|
| 6 | Transformational Logic Program Synthesis. Taisuke Sato, Hisao Tamaki. FGCS 1984, 195-201. Web SearchBibTeX |
| 5 | Unfold/Fold Transformation of Logic Programs. Hisao Tamaki, Taisuke Sato. ICLP 1984, 127-138. Web SearchBibTeX |
| 4 | Semantics of a Logic Programming Language with a Reducibility Predicate. Hisao Tamaki. SLP 1984, 259-264. Web SearchBibTeX |
| 3 | Enumeration of Success Patterns in Logic Programs. Taisuke Sato, Hisao Tamaki. Theor. Comput. Sci. (34): 227-240 (1984). Web SearchBibTeXDownload |
| 1983 |
|---|
| 2 | Enumeration of Success Patterns in Logic Programs. Taisuke Sato, Hisao Tamaki. ICALP 1983, 640-652. Web SearchBibTeXDownload |
| 1 | Program Transformation Through Meta-shifting. Hisao Tamaki, Taisuke Sato. New Generation Comput. (1): 93-98 (1983). Web SearchBibTeXDownload |
