Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Hisao
Last name:	Tamaki
DBLP:	29/4584
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 10 of 59  

Select a publication
Show	Title	Venue	Rating	Date
	Qian-Ping Gu, Hisao Tamaki. Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in	Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings 2009	(0)	2009
	Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara. Route-Enabling Graph Orientation Problems.	Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings 2009	(0)	2009
	Zhengbing Bian, Qian-Ping Gu, Marjan Marzban, Hisao Tamaki, Yumi Yoshitake. Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs.	Proceedings of the Workshop on Algorithm Engineering and Experiments, ALENEX 2008, San Francisco, California, USA, January 19, 2008 2008	(0)	2008
	Qian-Ping Gu, Hisao Tamaki. Optimal branch-decomposition of planar graphs in	ACM Transactions on Algorithms 2008, Volume 4	(0)	2008
	Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama. Voronoi Diagram with Respect to Criteria on Vision Information.	Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2007, Pontypridd, Wales, UK, July 9-12, 2007 2007	(0)	2007
	Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki. Matching Algorithms Are Fast in Sparse Random Graphs.	Theory Comput. Syst. 2006, Volume 39	(0)	2006
	Qian-Ping Gu, Hisao Tamaki. Optimal Branch-Decomposition of Planar Graphs in	Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings 2005	(0)	2005
	Martin Dietzfelbinger, Hisao Tamaki. On the probability of rendezvous in graphs.	Random Struct. Algorithms 2005, Volume 26	(0)	2005
	Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki. Matching Algorithms Are Fast in Sparse Random Graphs.	STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings 2004	(0)	2004
	Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama. On Geometric Structure of Global Roundings for Graphs and Range Spaces.	Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings 2004	(0)	2004

Your query returned 59 matches in the database.