default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasaki Yamamoto 0001
Person information
- affiliation: Seikei University, Tokyo, Japan
Other persons with the same name
- Masaki Yamamoto 0002 — Faculty of Human and Cultural Studies, Tezukayama Gakuin University, Japan
- Masaki Yamamoto 0003 — Kobe Steel Ltd., Japan
- Masaki Yamamoto 0004 — Nagoya University, Japan
- Masaki Yamamoto 0005
![[0000-0001-6907-4786]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-6907-4786")
— Panasonic Corporation, Kyoto, Japan - Masaki Yamamoto 0006 — Kochi University of Technology
- Masaki Yamamoto 0007 — Nara Institute of Science and Technology, Japan
- Masaki Yamamoto 0008 — Toyota Motor Corporation, Mishuku, Japan
- Masaki Yamamoto 0009 — Kobe University, Department of Mechanical Engineering, Japan
- Masaki Yamamoto 0010 — Nagoya Institute of Technology, Department of Electrical and Mechanical Engineering, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j13]Naoki Matsumoto, Masaki Yamamoto, Masahito Yamazaki:
The minimum number of vertices of graphs containing two monochromatic triangles for any edge $2$-coloring. Australas. J Comb. 81: 208-232 (2021)
2010 – 2019
- 2017
- [j12]Masaki Yamamoto:
Approximately counting paths and cycles in a graph. Discret. Appl. Math. 217: 381-387 (2017) - 2014
- [i6]Ryuhei Mori, Takeshi Koshiba, Osamu Watanabe, Masaki Yamamoto:
Linear Programming Relaxations for Goldreich's Generators over Non-Binary Alphabets. CoRR abs/1406.0373 (2014) - 2013
- [j11]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
Derandomizing the HSSW Algorithm for 3-SAT. Algorithmica 67(2): 112-124 (2013) - [j10]Masaki Yamamoto:
A Combinatorial Analysis for the Critical Clause Tree. Theory Comput. Syst. 52(2): 271-284 (2013) - 2012
- [j9]Yuichi Yoshida, Masaki Yamamoto, Hiro Ito:
Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems. SIAM J. Comput. 41(4): 1074-1093 (2012) - 2011
- [j8]Tomonori Ando, Yoshiyuki Kabashima, Hisanao Takahashi, Osamu Watanabe, Masaki Yamamoto:
Spectral Analysis of Random Sparse Matrices. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(6): 1247-1256 (2011) - [j7]Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura, Masaki Yamamoto:
Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions. J. Comput. Biol. 18(10): 1275-1290 (2011) - [j6]Masaki Yamamoto, Shuji Kijima, Yasuko Matsui:
A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise. J. Comb. Optim. 22(3): 392-408 (2011) - [j5]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
An exact algorithm for the Boolean connectivity problem for k-CNF. Theor. Comput. Sci. 412(35): 4613-4618 (2011) - [c8]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
Derandomizing HSSW Algorithm for 3-SAT. COCOON 2011: 1-12 - [i5]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
Derandomizing HSSW Algorithm for 3-SAT. CoRR abs/1102.3766 (2011) - [i4]Masaki Yamamoto:
A tighter lower bound on the circuit size of the hardest Boolean functions. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j4]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
On the Boolean connectivity problem for Horn relations. Discret. Appl. Math. 158(18): 2024-2030 (2010) - [j3]Osamu Watanabe, Masaki Yamamoto:
Average-case analysis for the MAX-2SAT problem. Theor. Comput. Sci. 411(16-18): 1685-1697 (2010) - [c7]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
An Exact Algorithm for the Boolean Connectivity Problem for k-CNF. SAT 2010: 172-180 - [i3]Masaki Yamamoto:
A combinatorial analysis for the critical clause tree. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c6]Masaki Yamamoto, Shuji Kijima, Yasuko Matsui:
A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise. COCOON 2009: 328-337 - [c5]Yuichi Yoshida, Masaki Yamamoto, Hiro Ito:
An improved constant-time approximation algorithm for maximum matchings. STOC 2009: 225-234 - 2007
- [j2]Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto:
An improved exact algorithm for the domatic number problem. Inf. Process. Lett. 101(3): 101-106 (2007) - [c4]Masaki Yamamoto:
A Spectral Method for MAX2SAT in the Planted Solution Model. ISAAC 2007: 112-123 - [c3]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
On the Boolean Connectivity Problem for Horn Relations. SAT 2007: 187-200 - [i2]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j1]Masaki Yamamoto:
Generating Instances for MAX2SAT with Optimal Solutions. Theory Comput. Syst. 39(5): 723-742 (2006) - [c2]Osamu Watanabe, Masaki Yamamoto:
Average-Case Analysis for the MAX-2SAT Problem. SAT 2006: 277-282 - [i1]Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto:
An Improved Exact Algorithm for the Domatic Number Problem. CoRR abs/cs/0603060 (2006) - 2005
- [c1]Masaki Yamamoto:
An Improved O(1.234m)-Time Deterministic Algorithm for SAT. ISAAC 2005: 644-653
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
