default search action
Hisao Tamaki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c56]Hisao Tamaki:
A Contraction-Recursive Algorithm for Treewidth. IPEC 2023: 34:1-34:15 - [i9]Hisao Tamaki:
A contraction-recursive algorithm for treewidth. CoRR abs/2307.01318 (2023) - 2022
- [c55]Hisao Tamaki:
Heuristic Computation of Exact Treewidth. SEA 2022: 17:1-17:16 - [i8]Hisao Tamaki:
Heuristic computation of exact treewidth. CoRR abs/2202.07793 (2022) - 2021
- [i7]Hisao Tamaki:
A heuristic for listing almost-clique minimal separators of a graph. CoRR abs/2108.07551 (2021) - 2020
- [c54]Hisao Tamaki:
Experimental Analysis of Treewidth. Treewidth, Kernels, and Algorithms 2020: 214-221
2010 – 2019
- 2019
- [j29]Hisao Tamaki
:
Positive-instance driven dynamic programming for treewidth. J. Comb. Optim. 37(4): 1283-1311 (2019) - [c53]Hisao Tamaki
Computing Treewidth via Exact and Heuristic Lists of Minimal Separators. SEA² 2019: 219-236 - [i6]Hisao Tamaki:
A heuristic use of dynamic programming to upperbound treewidth. CoRR abs/1909.07647 (2019) - [i5]Bart M. P. Jansen, Christian Schulz, Hisao Tamaki:
Parameterized Graph Algorithms & Data Reduction: Theory Meets Practice (NII Shonan Meeting 144). NII Shonan Meet. Rep. 2019 (2019) - 2017
- [c52]Hisao Tamaki:
Positive-Instance Driven Dynamic Programming for Treewidth. ESA 2017: 68:1-68:13 - [c51]Yasuaki Kobayashi
An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization. IPEC 2017: 25:1-25:12 - [i4]Hisao Tamaki:
Positive-instance driven dynamic programming for treewidth. CoRR abs/1704.05286 (2017) - 2016
- [j28]Kenta Kitsunai, Yasuaki Kobayashi
Computing Directed Pathwidth in O(1.89n) Time. Algorithmica 75(1): 138-157 (2016) - [j27]Yasuaki Kobayashi
A faster fixed parameter algorithm for two-layer crossing minimization. Inf. Process. Lett. 116(9): 547-549 (2016) - [c50]Yasuaki Kobayashi
Treedepth Parameterized by Vertex Cover Number. IPEC 2016: 18:1-18:11 - [i3]Hisao Tamaki:
Finalizing tentative matches from truncated preference lists. CoRR abs/1605.04381 (2016) - 2015
- [j26]Yasuaki Kobayashi
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization. Algorithmica 72(3): 778-790 (2015) - [c49]Kenta Kitsunai, Yasuaki Kobayashi
On the Pathwidth of Almost Semicomplete Digraphs. ESA 2015: 816-827 - [i2]Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki:
On the pathwidth of almost semicomplete digraphs. CoRR abs/1507.01934 (2015) - [i1]Yasuaki Kobayashi, Hisao Tamaki:
A faster fixed parameter algorithm for two-layer crossing minimization. CoRR abs/1512.05876 (2015) - 2014
- [j25]Yasuaki Kobayashi
A linear edge kernel for two-layer crossing minimization. Theor. Comput. Sci. 554: 74-81 (2014) - [c48]Yasuaki Kobayashi
Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study. SEA 2014: 388-399 - 2013
- [j24]Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono
Route-Enabling Graph Orientation Problems. Algorithmica 65(2): 317-338 (2013) - [c47]Yasuaki Kobayashi
A Linear Edge Kernel for Two-Layer Crossing Minimization. COCOON 2013: 458-468 - 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) - [c46]Soichiro Fujii, Hisao Tamaki:
Tracesheets - Spreadsheets of Program Executions as a Common Ground between Learners and Instructors. CSEDU (1) 2012: 158-163 - [c45]Yasuaki Kobayashi
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization. ESA 2012: 683-694 - [c44]Kenta Kitsunai, Yasuaki Kobayashi
Computing Directed Pathwidth in O(1.89 n ) Time. IPEC 2012: 182-193 - 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) - [c43]Hisao Tamaki:
A Polynomial Time Algorithm for Bounded Directed Pathwidth. WG 2011: 331-342 - 2010
- [c42]Souichirou Fujii, Kazunori Ohkubo, Hisao Tamaki:
MAX/C on Sakai - A Web-based C-Programming Course. CSEDU (1) 2010: 196-201 - [c41]Yasuaki Kobayashi
k-cyclic Orientations of Graphs. ISAAC (2) 2010: 73-84 - [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
2000 – 2009
- 2009
- [c39]Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono
Route-Enabling Graph Orientation Problems. ISAAC 2009: 403-412 - [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 - 2007
- [c36]Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
Voronoi Diagram with Respect to Criteria on Vision Information. ISVD 2007: 25-32 - 2006
- [j20]Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki:
Matching Algorithms Are Fast in Sparse Random Graphs. Theory Comput. Syst. 39(1): 3-14 (2006) - [c35]Tetsuo Asano, Hisao Tamaki, Naoki Katoh, Takeshi Tokuyama
Angular Voronoi Diagram with Applications. ISVD 2006: 18-24 - 2005
- [j19]Martin Dietzfelbinger
On the probability of rendezvous in graphs. Random Struct. Algorithms 26(3): 266-288 (2005) - [c34]Qian-Ping Gu, Hisao Tamaki:
Optimal Branch-Decomposition of Planar Graphs in O(n3) Time. ICALP 2005: 373-384 - 2004
- [j18]Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
The structure and number of global roundings of a graph. Theor. Comput. Sci. 325(3): 425-437 (2004) - [c33]Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki:
Matching Algorithms Are Fast in Sparse Random Graphs. STACS 2004: 81-92 - [c32]Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
On Geometric Structure of Global Roundings for Graphs and Range Spaces. SWAT 2004: 455-467 - 2003
- [j17]Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink
Spanning Trees Crossing Few Barriers. Discret. Comput. Geom. 30(4): 591-606 (2003) - [c31]Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
The Structure and Number of Global Roundings of a Graph. COCOON 2003: 130-138 - [c30]Hisao Tamaki:
A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs. ESA 2003: 765-775 - 2002
- [j16]Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
Parametric Polymatroid Optimization and Its Geometric Applications. Int. J. Comput. Geom. Appl. 12(5): 429-444 (2002) - 2001
- [j15]Kazuo Iwama, Eiji Miyano
Efficient randomized routing algorithms on the two-dimensional mesh of buses. Theor. Comput. Sci. 261(2): 227-239 (2001) - 2000
- [j14]Qian-Ping Gu, Hisao Tamaki:
Multicolor routing in the undirected hypercube. Discret. Appl. Math. 100(3): 169-181 (2000) - [j13]Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama
Greedily Finding a Dense Subgraph. J. Algorithms 34(2): 203-221 (2000) - [j12]Christos H. Papadimitriou, Prabhakar Raghavan
Latent Semantic Indexing: A Probabilistic Analysis. J. Comput. Syst. Sci. 61(2): 217-235 (2000)
1990 – 1999
- 1999
- [c29]Tetsuo Asano, Mark de Berg, Otfried Cheong
Spanning Trees Crossing Few Barriers. SCG 1999: 41-48 - [c28]Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
Parametric Polymatroid Optimization and Its Geometric Applications. SODA 1999: 517-526 - 1998
- [j11]Hisao Tamaki, Takeshi Tokuyama
How to Cut Pseudoparabolas into Segments. Discret. Comput. Geom. 19(2): 265-290 (1998) - [j10]Tatsuya Akutsu
Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. Discret. Comput. Geom. 20(3): 307-331 (1998) - [j9]Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki:
Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. J. ACM 45(5): 863-890 (1998) - [j8]Hisao Tamaki:
Efficient Self-Embedding of Butterfly Networks with Random Faults. SIAM J. Comput. 27(3): 614-636 (1998) - [c27]Kazuo Iwama, Eiji Miyano
Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. COCOON 1998: 229-240 - [c26]Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
Convertibility among Grid Filling Curves. ISAAC 1998: 307-316 - [c25]Christos H. Papadimitriou, Prabhakar Raghavan, Hisao Tamaki, Santosh S. Vempala:
Latent Semantic Indexing: A Probabilistic Analysis. PODS 1998: 159-168 - [c24]Hisao Tamaki, Takeshi Tokuyama:
Algorithms for the Maxium Subarray Problem Based on Matrix Multiplication. SODA 1998: 446-452 - 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) - [c23]Tatsuya Akutsu
Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. SCG 1997: 314-323 - [c22]Qian-Ping Gu, Hisao Tamaki:
Multi-Color Routing in the Undirected Hypercube. ISAAC 1997: 72-81 - [c21]Hisao Tamaki, Takeshi Tokuyama
A Characterization of Planar Graphs by Pseudo-Line Arrangements. ISAAC 1997: 133-142 - [c20]Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
Covering Points in the Plane by k-Tours: Towards a Polynomial Time Approximation Scheme for General k. STOC 1997: 275-283 - 1996
- [j6]Hisao Tamaki:
Construction of the Mesh and the Torus Tolerating a Large Number of Faults. J. Comput. Syst. Sci. 53(3): 371-379 (1996) - [c19]Qian-Ping Gu, Hisao Tamaki:
Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths. IPPS 1996: 561-567 - [c18]Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki:
Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. STOC 1996: 151-160 - [c17]Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama
Greedily Finding a Dense Subgraph. SWAT 1996: 136-148 - 1995
- [c16]Hisao Tamaki, Takeshi Tokuyama
How to Cut Pseudo-Parabolas into Segments. SCG 1995: 230-237 - [c15]Pankaj K. Agarwal, Prabhakar Raghavan, Hisao Tamaki:
Motion planning for a steering-constrained robot through moderate obstacles. STOC 1995: 343-352 - 1994
- [j5]Alan P. Sprague, Hisao Tamaki:
Routings for Involutions of a Hypercube. Discret. Appl. Math. 48(2): 175-186 (1994) - [c14]Christos H. Papadimitriou, Prabhakar Raghavan, Madhu Sudan, Hisao Tamaki:
Motion Planning on a Graph (Extended Abstract). FOCS 1994: 511-520 - [c13]Kazuo Iwano, Prabhakar Raghavan, Hisao Tamaki:
The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection. ISAAC 1994: 29-37 - [c12]Hisao Tamaki:
Construction of the Mesh and the Torus Tolerating a Large Number of Faults. SPAA 1994: 268-277 - [c11]Anna R. Karlin, Greg Nelson, Hisao Tamaki:
On the fault tolerance of the butterfly. STOC 1994: 125-133 - 1993
- [b1]Hisao Tamaki:
Structural robustness of the butterfly and related networks against random faults. University of Toronto, Canada, 1993 - [c10]Amotz Bar-Noy, Prabhakar Raghavan, Baruch Schieber, Hisao Tamaki:
Fast Deflection Routing for Packets and Worms (Extended Summary). PODC 1993: 75-86 - 1992
- [c9]Hisao Tamaki:
Efficient Self-Embedding of Butterfly Networks with Random Faults. FOCS 1992: 533-541 - [c8]Hisao Tamaki:
Robust Bounded-Degree Networks with Small Diameters. SPAA 1992: 247-256
1980 – 1989
- 1989
- [j4]Taisuke Sato
First Order Compiler: A Deterministic Logic Program Synthesis Algorithm. J. Symb. Comput. 8(6): 605-627 (1989) - [j3]Taisuke Sato
Existential Continuation. New Gener. Comput. 6(4): 421-438 (1989) - 1987
- [c7]Hisao Tamaki:
Stream-Based Compilation of Ground I/O PROLOG into Committed-Choice Languages. ICLP 1987: 376-393 - 1986
- [c6]Hisao Tamaki, Taisuke Sato
OLD Resolution with Tabulation. ICLP 1986: 84-98 - 1985
- [c5]Hisao Tamaki:
A Distributed Unification Scheme for Systolic Logic Programs. ICPP 1985: 552-559 - 1984
- [j2]Taisuke Sato
Enumeration of Success Patterns in Logic Programs. Theor. Comput. Sci. 34: 227-240 (1984) - [c4]Taisuke Sato, Hisao Tamaki:
Transformational Logic Program Synthesis. FGCS 1984: 195-201 - [c3]Hisao Tamaki, Taisuke Sato:
Unfold/Fold Transformation of Logic Programs. ICLP 1984: 127-138 - [c2]Hisao Tamaki:
Semantics of a Logic Programming Language with a Reducibility Predicate. SLP 1984: 259-264 - 1983
- [j1]Hisao Tamaki, Taisuke Sato
Program Transformation Through Meta-shifting. New Gener. Comput. 1(1): 93-98 (1983) - [c1]Taisuke Sato
Enumeration of Success Patterns in Logic Programs. ICALP 1983: 640-652
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 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
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: