Publications :: Search

Show author

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

Author information
First name:	Suguru
Last name:	Tamaki
DBLP:	01/3717
Rating:	(not rated yet)
Bookmark:

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

Show item 1 to 8 of 8  

Select a publication
Show	Title	Venue	Rating	Date
	Kazuo Iwama, Suguru Tamaki. The Complexity of the Hajos Calculus for Planar Graphs.	Electronic Colloquium on Computational Complexity (ECCC) 2008, Volume 15	(0)	2008
	Youichi Hanatani, Takashi Horiyama, Kazuo Iwama, Suguru Tamaki. New Graph Calculi for Planar Non-3-Colorable Graphs.	IEICE Transactions 2008, Volume 91	(0)	2008
	Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto. On the Boolean Connectivity Problem for Horn Relations.	Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings 2007	(0)	2007
	Kazuo Iwama, Suguru Tamaki. Exploiting partial knowledge of satisfying assignments.	Discrete Applied Mathematics 2007, Volume 155	(0)	2007
	Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto. A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem.	Electronic Colloquium on Computational Complexity (ECCC) 2007, Volume 14	(0)	2007
	Kazuo Iwama, Suguru Tamaki. Improved upper bounds for 3-SAT.	Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004 2004	(0)	2004
	Kazuo Iwama, Suguru Tamaki. Improved Upper Bounds for 3-SAT	Electronic Colloquium on Computational Complexity (ECCC) 2003, Volume 10	(0)	2003
	Kazuo Iwama, Suguru Tamaki. Exploiting Partial Knowledge of Satisfying Assignments.	Algorithm Engineering, 5th International Workshop, WAE 2001 Aarhus, Denmark, August 28-31, 2001, Proceedings 2001	(0)	2001

Your query returned 8 matches in the database.