Hisao Tamaki - RankMe

96 papers A* 12A 6B 20Misc 3Journal 39Unranked 15

Year	Rank	Type	Title / Venue / Authors
2025	B	`conf`	A Polynomial Delay Algorithm Generating All Potential Maximal Cliques in Triconnected Planar Graphs. IPEC Alexander Grigoriev, Yasuaki Kobayashi, Hisao Tamaki, Tom C. van der Zanden
2025	J	`jnl`	A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs. CoRR Alexander Grigoriev, Yasuaki Kobayashi, Hisao Tamaki, Tom C. van der Zanden
2023	B	`conf`	A Contraction-Recursive Algorithm for Treewidth. IPEC Hisao Tamaki
2023	J	`jnl`	A contraction-recursive algorithm for treewidth. CoRR Hisao Tamaki
2022	B	`conf`	Heuristic Computation of Exact Treewidth. SEA Hisao Tamaki
2022	J	`jnl`	Heuristic computation of exact treewidth. CoRR Hisao Tamaki
2021	J	`jnl`	A heuristic for listing almost-clique minimal separators of a graph. CoRR Hisao Tamaki
2020	—	`conf`	Experimental Analysis of Treewidth. Treewidth, Kernels, and Algorithms Hisao Tamaki
2019	J	`jnl`	A heuristic use of dynamic programming to upperbound treewidth. CoRR Hisao Tamaki
2019	—	`conf`	Computing Treewidth via Exact and Heuristic Lists of Minimal Separators. SEA² Hisao Tamaki
2019	J	`jnl`	Parameterized Graph Algorithms & Data Reduction: Theory Meets Practice (NII Shonan Meeting 144). NII Shonan Meet. Rep. Bart M. P. Jansen, Christian Schulz, Hisao Tamaki
2019	J	`jnl`	Positive-instance driven dynamic programming for treewidth. J. Comb. Optim. Hisao Tamaki
2017	B	`conf`	An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization. IPEC Yasuaki Kobayashi, Hiromu Ohtsuka, Hisao Tamaki
2017	A	`conf`	Positive-Instance Driven Dynamic Programming for Treewidth. ESA Hisao Tamaki
2017	J	`jnl`	Positive-instance driven dynamic programming for treewidth. CoRR Hisao Tamaki
2016	J	`jnl`	A faster fixed parameter algorithm for two-layer crossing minimization. Inf. Process. Lett. Yasuaki Kobayashi, Hisao Tamaki
2016	J	`jnl`	Computing Directed Pathwidth in O(1.89 Algorithmica Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano
2016	J	`jnl`	Finalizing tentative matches from truncated preference lists. CoRR Hisao Tamaki
2016	B	`conf`	Treedepth Parameterized by Vertex Cover Number. IPEC Yasuaki Kobayashi, Hisao Tamaki
2015	J	`jnl`	A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization. Algorithmica Yasuaki Kobayashi, Hisao Tamaki
2015	J	`jnl`	A faster fixed parameter algorithm for two-layer crossing minimization. CoRR Yasuaki Kobayashi, Hisao Tamaki
2015	A	`conf`	On the Pathwidth of Almost Semicomplete Digraphs. ESA Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki
2015	J	`jnl`	On the pathwidth of almost semicomplete digraphs. CoRR Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki
2014	J	`jnl`	A linear edge kernel for two-layer crossing minimization. Theor. Comput. Sci. Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki
2014	B	`conf`	Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study. SEA Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki
2013	Misc	`conf`	A Linear Edge Kernel for Two-Layer Crossing Minimization. COCOON Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki
2013	J	`jnl`	Route-Enabling Graph Orientation Problems. Algorithmica Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
2012	A	`conf`	A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization. ESA Yasuaki Kobayashi, Hisao Tamaki
2012	B	`conf`	Computing Directed Pathwidth in O(1.89 n ) Time. IPEC Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano
2012	J	`jnl`	Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. Algorithmica Qian-Ping Gu, Hisao Tamaki
2012	—	`conf`	Tracesheets - Spreadsheets of Program Executions as a Common Ground between Learners and Instructors. CSEDU (1) Soichiro Fujii, Hisao Tamaki
2011	B	`conf`	A Polynomial Time Algorithm for Bounded Directed Pathwidth. WG Hisao Tamaki
2011	J	`jnl`	Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n Theor. Comput. Sci. Qian-Ping Gu, Hisao Tamaki
2010	—	`conf`	Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. ISAAC (2) Qian-Ping Gu, Hisao Tamaki
2010	—	`conf`	MAX/C on Sakai - A Web-based C-Programming Course. CSEDU (1) Souichirou Fujii, Kazunori Ohkubo, Hisao Tamaki
2009	B	`conf`	Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in ISAAC Qian-Ping Gu, Hisao Tamaki
2009	B	`conf`	Route-Enabling Graph Orientation Problems. ISAAC Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
2008	A	`conf`	Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs. ALENEX Zhengbing Bian, Qian-Ping Gu, Marjan Marzban, Hisao Tamaki, Yumi Yoshitake
2008	J	`jnl`	Optimal branch-decomposition of planar graphs in ACM Trans. Algorithms Qian-Ping Gu, Hisao Tamaki
2007	—	`conf`	Voronoi Diagram with Respect to Criteria on Vision Information. ISVD Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
2006	—	`conf`	Angular Voronoi Diagram with Applications. ISVD Tetsuo Asano, Hisao Tamaki, Naoki Katoh, Takeshi Tokuyama
2006	J	`jnl`	Matching Algorithms Are Fast in Sparse Random Graphs. Theory Comput. Syst. Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki
2005	J	`jnl`	On the probability of rendezvous in graphs. Random Struct. Algorithms Martin Dietzfelbinger, Hisao Tamaki
2005	A*	`conf`	Optimal Branch-Decomposition of Planar Graphs in ICALP Qian-Ping Gu, Hisao Tamaki
2004	A	`conf`	Matching Algorithms Are Fast in Sparse Random Graphs. STACS Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki
2004	—	`conf`	On Geometric Structure of Global Roundings for Graphs and Range Spaces. SWAT Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
2004	J	`jnl`	The structure and number of global roundings of a graph. Theor. Comput. Sci. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
2003	A	`conf`	A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs. ESA Hisao Tamaki
2003	J	`jnl`	Spanning Trees Crossing Few Barriers. Discret. Comput. Geom. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki
2003	Misc	`conf`	The Structure and Number of Global Roundings of a Graph. COCOON Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
2002	J	`jnl`	Parametric Polymatroid Optimization and Its Geometric Applications. Int. J. Comput. Geom. Appl. Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
2001	J	`jnl`	Efficient randomized routing algorithms on the two-dimensional mesh of buses. Theor. Comput. Sci. Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki
2000	J	`jnl`	Greedily Finding a Dense Subgraph. J. Algorithms Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama
2000	J	`jnl`	Latent Semantic Indexing: A Probabilistic Analysis. J. Comput. Syst. Sci. Christos H. Papadimitriou, Prabhakar Raghavan, Hisao Tamaki, Santosh S. Vempala
2000	J	`jnl`	Multicolor routing in the undirected hypercube. Discret. Appl. Math. Qian-Ping Gu, Hisao Tamaki
1999	A*	`conf`	Parametric Polymatroid Optimization and Its Geometric Applications. SODA Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
1999	—	`conf`	Spanning Trees Crossing Few Barriers. SCG Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki
1998	A*	`conf`	Algorithms for the Maxium Subarray Problem Based on Matrix Multiplication. SODA Hisao Tamaki, Takeshi Tokuyama
1998	B	`conf`	Convertibility among Grid Filling Curves. ISAAC Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
1998	J	`jnl`	Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. Discret. Comput. Geom. Tatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama
1998	Misc	`conf`	Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. COCOON Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki
1998	J	`jnl`	Efficient Self-Embedding of Butterfly Networks with Random Faults. SIAM J. Comput. Hisao Tamaki
1998	J	`jnl`	How to Cut Pseudoparabolas into Segments. Discret. Comput. Geom. Hisao Tamaki, Takeshi Tokuyama
1998	A*	`conf`	Latent Semantic Indexing: A Probabilistic Analysis. PODS Christos H. Papadimitriou, Prabhakar Raghavan, Hisao Tamaki, Santosh S. Vempala
1998	J	`jnl`	Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. J. ACM Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki
1997	B	`conf`	A Characterization of Planar Graphs by Pseudo-Line Arrangements. ISAAC Hisao Tamaki, Takeshi Tokuyama
1997	A*	`conf`	Covering Points in the Plane by STOC Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
1997	—	`conf`	Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. SCG Tatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama
1997	B	`conf`	Multi-Color Routing in the Undirected Hypercube. ISAAC Qian-Ping Gu, Hisao Tamaki
1997	J	`jnl`	Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths. J. Parallel Distributed Comput. Qian-Ping Gu, Hisao Tamaki
1996	J	`jnl`	Construction of the Mesh and the Torus Tolerating a Large Number of Faults. J. Comput. Syst. Sci. Hisao Tamaki
1996	—	`conf`	Greedily Finding a Dense Subgraph. SWAT Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama
1996	A*	`conf`	Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. STOC Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki
1996	—	`conf`	Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths. IPPS Qian-Ping Gu, Hisao Tamaki
1995	—	`conf`	How to Cut Pseudo-Parabolas into Segments. SCG Hisao Tamaki, Takeshi Tokuyama
1995	A*	`conf`	Motion planning for a steering-constrained robot through moderate obstacles. STOC Pankaj K. Agarwal, Prabhakar Raghavan, Hisao Tamaki
1994	B	`conf`	Construction of the Mesh and the Torus Tolerating a Large Number of Faults. SPAA Hisao Tamaki
1994	A*	`conf`	Motion Planning on a Graph (Extended Abstract) FOCS Christos H. Papadimitriou, Prabhakar Raghavan, Madhu Sudan, Hisao Tamaki
1994	A*	`conf`	On the fault tolerance of the butterfly. STOC Anna R. Karlin, Greg Nelson, Hisao Tamaki
1994	J	`jnl`	Routings for Involutions of a Hypercube. Discret. Appl. Math. Alan P. Sprague, Hisao Tamaki
1994	B	`conf`	The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection. ISAAC Kazuo Iwano, Prabhakar Raghavan, Hisao Tamaki
1993	A*	`conf`	Fast Deflection Routing for Packets and Worms (Extended Summary). PODC Amotz Bar-Noy, Prabhakar Raghavan, Baruch Schieber, Hisao Tamaki
1993	—	`—`	Structural robustness of the butterfly and related networks against random faults. Hisao Tamaki
1992	A*	`conf`	Efficient Self-Embedding of Butterfly Networks with Random Faults FOCS Hisao Tamaki
1992	B	`conf`	Robust Bounded-Degree Networks with Small Diameters. SPAA Hisao Tamaki
1989	J	`jnl`	Existential Continuation. New Gener. Comput. Taisuke Sato, Hisao Tamaki
1989	J	`jnl`	First Order Compiler: A Deterministic Logic Program Synthesis Algorithm. J. Symb. Comput. Taisuke Sato, Hisao Tamaki
1987	B	`conf`	Stream-Based Compilation of Ground I/O PROLOG into Committed-Choice Languages. ICLP Hisao Tamaki
1986	B	`conf`	OLD Resolution with Tabulation. ICLP Hisao Tamaki, Taisuke Sato
1985	B	`conf`	A Distributed Unification Scheme for Systolic Logic Programs. ICPP Hisao Tamaki
1984	J	`jnl`	Enumeration of Success Patterns in Logic Programs. Theor. Comput. Sci. Taisuke Sato, Hisao Tamaki
1984	—	`conf`	Semantics of a Logic Programming Language with a Reducibility Predicate. SLP Hisao Tamaki
1984	—	`conf`	Transformational Logic Program Synthesis. FGCS Taisuke Sato, Hisao Tamaki
1984	B	`conf`	Unfold/Fold Transformation of Logic Programs. ICLP Hisao Tamaki, Taisuke Sato
1983	A*	`conf`	Enumeration of Success Patterns in Logic Programs. ICALP Taisuke Sato, Hisao Tamaki
1983	J	`jnl`	Program Transformation Through Meta-shifting. New Gener. Comput. Hisao Tamaki, Taisuke Sato