Остановите войну!
for scientists:
default search action
Hisao Tamaki
- > Home > Persons > Hisao Tamaki
Publications
- 2012
- [j23]Qian-Ping Gu, Hisao Tamaki:
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. Algorithmica 64(3): 416-453 (2012) - 2011
- [j22]Qian-Ping Gu, Hisao Tamaki:
Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n1+ϵ) time. Theor. Comput. Sci. 412(32): 4100-4109 (2011) - 2010
- [c40]Qian-Ping Gu, Hisao Tamaki:
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. ISAAC (2) 2010: 85-96 - 2009
- [c38]Qian-Ping Gu, Hisao Tamaki:
Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n1 + ε) Time. ISAAC 2009: 984-993 - 2008
- [j21]Qian-Ping Gu, Hisao Tamaki:
Optimal branch-decomposition of planar graphs in O(n3) Time. ACM Trans. Algorithms 4(3): 30:1-30:13 (2008) - [c37]Zhengbing Bian, Qian-Ping Gu, Marjan Marzban, Hisao Tamaki, Yumi Yoshitake:
Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs. ALENEX 2008: 152-165 - 2005
- [c34]Qian-Ping Gu, Hisao Tamaki:
Optimal Branch-Decomposition of Planar Graphs in O(n3) Time. ICALP 2005: 373-384 - 2000
- [j14]Qian-Ping Gu, Hisao Tamaki:
Multicolor routing in the undirected hypercube. Discret. Appl. Math. 100(3): 169-181 (2000) - 1997
- [j7]Qian-Ping Gu, Hisao Tamaki:
Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths. J. Parallel Distributed Comput. 44(2): 147-152 (1997) - [c22]Qian-Ping Gu, Hisao Tamaki:
Multi-Color Routing in the Undirected Hypercube. ISAAC 1997: 72-81 - 1996
- [c19]Qian-Ping Gu, Hisao Tamaki:
Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths. IPPS 1996: 561-567
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 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint