default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShin-ichi Tanigawa
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j47]Bill Jackson
, Shin-ichi Tanigawa:
Maximal matroids in weak order posets. J. Comb. Theory B 165: 20-46 (2024)- [j46]James Cruickshank, Fatemeh Mohammadi, Harshit J. Motwani, Anthony Nixon, Shin-ichi Tanigawa:
Global Rigidity of Line Constrained Frameworks. SIAM J. Discret. Math. 38(1): 743-763 (2024) - [i9]Hiroki Hamaguchi, Shin-ichi Tanigawa:
Sample Complexity of Low-rank Tensor Recovery from Uniformly Random Entries. CoRR abs/2408.03504 (2024) - 2023
- [j45]James Cruickshank, Bill Jackson, Shin-ichi Tanigawa:
Vertex Splitting, Coincident Realisations, and Global Rigidity of Braced Triangulations. Discret. Comput. Geom. 69(1): 192-208 (2023) - [j44]Ryoshun Oba, Shin-ichi Tanigawa:
Characterizing the universal rigidity of generic tensegrities. Math. Program. 197(1): 109-145 (2023) - [c17]Kazusato Oko, Shinsaku Sakaue, Shin-ichi Tanigawa:
Nearly Tight Spectral Sparsification of Directed Hypergraphs. ICALP 2023: 94:1-94:19 - [i8]James Cruickshank, Fatemeh Mohammadi, Anthony Nixon, Shin-ichi Tanigawa:
Identifiability of Points and Rigidity of Hypergraphs under Algebraic Constraints. CoRR abs/2305.18990 (2023) - 2022
- [j43]Tibor Jordán, Shin-ichi Tanigawa:
Globally rigid powers of graphs. J. Comb. Theory B 155: 111-140 (2022) - [j42]Satoru Fujishige, Tamás Király, Kazuhisa Makino, Kenjiro Takazawa, Shin-ichi Tanigawa:
Minimizing submodular functions on diamonds via generalized fractional matroid matchings. J. Comb. Theory B 157: 294-345 (2022) - [j41]Tibor Jordán, Shin-ichi Tanigawa:
Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices. SIAM J. Discret. Math. 36(3): 2367-2392 (2022) - [i7]Kazusato Oko, Shinsaku Sakaue, Shin-ichi Tanigawa:
Nearly Tight Spectral Sparsification of Directed Hypergraphs by a Simple Iterative Sampling Algorithm. CoRR abs/2204.02537 (2022) - 2021
- [j40]Viktória E. Kaszanitzky, Bernd Schulze, Shin-ichi Tanigawa:
Global rigidity of periodic graphs under fixed-lattice representations. J. Comb. Theory B 146: 176-218 (2021) - [j39]Bill Jackson, Anthony Nixon, Shin-ichi Tanigawa:
An Improved Bound for the Rigidity of Linearly Constrained Frameworks. SIAM J. Discret. Math. 35(2): 928-933 (2021) - 2020
- [j38]Quentin Fortier, Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa:
On packing spanning arborescences with matroid constraint. J. Graph Theory 93(2): 230-252 (2020) - [j37]Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa:
Packing of arborescences with matroid constraints via matroid intersection. Math. Program. 181(1): 85-117 (2020) - [j36]Monique Laurent, Shin-ichi Tanigawa:
Perfect elimination orderings for symmetric matrices. Optim. Lett. 14(2): 339-353 (2020)
2010 – 2019
- 2019
- [j35]Tatsuya Matsuoka, Shin-ichi Tanigawa:
On reachability mixed arborescence packing. Discret. Optim. 32: 1-10 (2019) - [j34]Yaser Eftekhari, Bill Jackson, Anthony Nixon, Bernd Schulze, Shin-ichi Tanigawa, Walter Whiteley:
Point-hyperplane frameworks, slider joints, and rigidity preserving transformations. J. Comb. Theory B 135: 44-74 (2019) - [j33]Tibor Jordán, Shin-ichi Tanigawa:
Global rigidity of triangulations with braces. J. Comb. Theory B 136: 249-288 (2019) - 2018
- [j32]Rintaro Ikeshita, Shin-ichi Tanigawa:
Count Matroids of Group-Labeled Graphs. Comb. 38(5): 1101-1127 (2018) - [j31]Satoru Fujishige, Shin-ichi Tanigawa:
Polynomial combinatorial algorithms for skew-bisubmodular function minimization. Math. Program. 171(1-2): 87-114 (2018) - [j30]Anthony Nixon, Bernd Schulze, Shin-ichi Tanigawa, Walter Whiteley:
Rigidity of Frameworks on Expanding Spheres. SIAM J. Discret. Math. 32(4): 2591-2611 (2018) - [c16]Motoki Ikeda, Shin-ichi Tanigawa:
Cut Sparsifiers for Balanced Digraphs. WAOA 2018: 277-294 - [i6]Tatsuya Matsuoka, Shin-ichi Tanigawa:
On Reachability Mixed Arborescence Packing. CoRR abs/1808.07332 (2018) - 2017
- [j29]Monique Laurent, Matteo Seminaroti, Shin-ichi Tanigawa:
A Structural Characterization for Certifying Robinsonian Matrices. Electron. J. Comb. 24(2): 2 (2017) - [j28]Quentin Fortier, Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa:
On packing spanning arborescences with matroid constraint. Electron. Notes Discret. Math. 61: 451-457 (2017) - [j27]Shin-ichi Tanigawa:
Singularity Degree of the Positive Semidefinite Matrix Completion Problem. SIAM J. Optim. 27(2): 986-1009 (2017) - [i5]Monique Laurent, Matteo Seminaroti, Shin-ichi Tanigawa:
A Structural Characterization for Certifying Robinsonian Matrices. CoRR abs/1701.00806 (2017) - 2016
- [j26]Sergey Bereg, Seok-Hee Hong, Naoki Katoh, Sheung-Hung Poon, Shin-ichi Tanigawa:
On the edge crossing properties of Euclidean minimum weight Laman graphs. Comput. Geom. 51: 15-24 (2016) - [j25]Shin-ichi Tanigawa, Yutaro Yamaguchi:
Packing non-zero A-paths via matroid matching. Discret. Appl. Math. 214: 169-178 (2016) - [j24]Tibor Jordán, Viktória E. Kaszanitzky, Shin-ichi Tanigawa:
Gain-Sparsity and Symmetry-Forced Rigidity in the Plane. Discret. Comput. Geom. 55(2): 314-372 (2016) - [j23]Tibor Jordán, Csaba Király, Shin-ichi Tanigawa:
Generic global rigidity of body-hinge frameworks. J. Comb. Theory B 117: 59-76 (2016) - [j22]Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa:
Unique low rank completability of partially filled matrices. J. Comb. Theory B 121: 432-462 (2016) - [c15]Satoru Iwata, Shin-ichi Tanigawa, Yuichi Yoshida:
Improved Approximation Algorithms for k-Submodular Function Maximization. SODA 2016: 404-413 - [r1]Shin-ichi Tanigawa:
Enumeration of Non-crossing Geometric Graphs. Encyclopedia of Algorithms 2016: 638-640 - 2015
- [j21]Shin-ichi Tanigawa, Yuichi Yoshida:
Testing the Supermodular-Cut Condition. Algorithmica 71(4): 1065-1075 (2015) - [j20]Shin-ichi Tanigawa:
Sufficient conditions for the global rigidity of graphs. J. Comb. Theory B 113: 123-140 (2015) - [j19]Ciprian Borcea, Ileana Streinu, Shin-ichi Tanigawa:
Periodic Body-and-Bar Frameworks. SIAM J. Discret. Math. 29(1): 93-112 (2015) - [j18]Bernd Schulze, Shin-ichi Tanigawa:
Infinitesimal Rigidity of Symmetric Bar-Joint Frameworks. SIAM J. Discret. Math. 29(3): 1259-1286 (2015) - [i4]Satoru Iwata, Shin-ichi Tanigawa, Yuichi Yoshida:
Improved Approximation Algorithms for k-Submodular Function Maximization. CoRR abs/1502.07406 (2015) - 2014
- [j17]Satoru Fujishige, Shin-ichi Tanigawa, Yuichi Yoshida:
Generalized skew bisubmodularity: A characterization and a min-max theorem. Discret. Optim. 12: 1-9 (2014) - [j16]Bernd Schulze, Shin-ichi Tanigawa:
Linking rigid bodies symmetrically. Eur. J. Comb. 42: 145-166 (2014) - [j15]Yuya Higashikawa, Naoki Katoh, Stefan Langerman, Shin-ichi Tanigawa:
Online graph exploration algorithms for cycles and trees by multiple searchers. J. Comb. Optim. 28(2): 480-495 (2014) - [j14]Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa:
Combinatorial Conditions for the Unique Completability of Low-Rank Matrices. SIAM J. Discret. Math. 28(4): 1797-1819 (2014) - [j13]Satoru Fujishige, Shin-ichi Tanigawa:
A Min-Max Theorem for Transversal Submodular Functions and Its Implications. SIAM J. Discret. Math. 28(4): 1855-1875 (2014) - 2013
- [j12]Naoki Katoh, Shin-ichi Tanigawa:
Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries. SIAM J. Discret. Math. 27(1): 155-185 (2013) - [c14]Sergey Bereg, Seok-Hee Hong, Naoki Katoh, Sheung-Hung Poon, Shin-ichi Tanigawa:
On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs. ISAAC 2013: 33-43 - 2012
- [j11]Shuji Kijima, Shin-ichi Tanigawa:
Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits. Discret. Math. 312(16): 2466-2472 (2012) - [j10]Naoki Katoh, Shin-ichi Tanigawa:
A rooted-forest partition with uniform vertex demand. J. Comb. Optim. 24(2): 67-98 (2012) - [j9]Shin-ichi Tanigawa:
Generic Rigidity Matroids with Dilworth Truncations. SIAM J. Discret. Math. 26(3): 1412-1439 (2012) - [c13]Ciprian Borcea, Ileana Streinu, Shin-ichi Tanigawa:
Periodic body-and-bar frameworks. SCG 2012: 347-356 - [c12]Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida:
Constant-Time Algorithms for Sparsity Matroids. ICALP (1) 2012: 498-509 - [c11]Hee-Kap Ahn, Sang Won Bae, Shin-ichi Tanigawa:
Rectilinear Covering for Imprecise Input Points - (Extended Abstract). ISAAC 2012: 309-318 - 2011
- [j8]Sang Won Bae, Sunghee Choi, Chunseok Lee, Shin-ichi Tanigawa:
Exact Algorithms for the Bottleneck Steiner Tree Problem. Algorithmica 61(4): 924-948 (2011) - [j7]Naoki Katoh, Shin-ichi Tanigawa:
A Proof of the Molecular Conjecture. Discret. Comput. Geom. 45(4): 647-700 (2011) - [i3]Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida:
Constant-Time Algorithms for Sparsity Matroids. CoRR abs/1103.2581 (2011) - [i2]Naoki Katoh, Shin-ichi Tanigawa:
Rooted-tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries. CoRR abs/1109.0787 (2011) - 2010
- [j6]Ondrej Bílka, Kevin Buchin, Radoslav Fulek, Masashi Kiyomi, Yoshio Okamoto, Shin-ichi Tanigawa, Csaba D. Tóth:
A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets. Electron. J. Comb. 17(1) (2010) - [c10]Naoki Katoh, Shin-ichi Tanigawa:
A Rooted-Forest Partition with Uniform Vertex Demand. WALCOM 2010: 179-190 - [i1]Shin-ichi Tanigawa:
Generic Rigidity Matroids with Dilworth Truncations. CoRR abs/1010.5699 (2010)
2000 – 2009
- 2009
- [j5]Naoki Katoh, Shin-ichi Tanigawa:
Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees. Discret. Appl. Math. 157(17): 3569-3585 (2009) - [j4]Naoki Katoh, Shin-ichi Tanigawa:
Fast Enumeration Algorithms for Non-crossing Geometric Graphs. Discret. Comput. Geom. 42(3): 443-468 (2009) - [c9]Naoki Katoh, Shin-ichi Tanigawa:
A proof of the molecular conjecture. SCG 2009: 296-305 - [c8]Sang Won Bae, Sunghee Choi, Chunseok Lee, Shin-ichi Tanigawa:
Exact Algorithms for the Bottleneck Steiner Tree Problem. ISAAC 2009: 24-33 - [c7]Naoki Katoh, Shin-ichi Tanigawa:
On the Infinitesimal Rigidity of Bar-and-Slider Frameworks. ISAAC 2009: 524-533 - 2008
- [j3]David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa:
Enumerating Constrained Non-crossing Minimally Rigid Frameworks. Discret. Comput. Geom. 40(1): 31-46 (2008) - [c6]Yongding Zhu, Jinhui Xu, Yang Yang, Naoki Katoh, Shin-ichi Tanigawa:
Geometric Spanner of Objects under L1 Distance. COCOON 2008: 395-404 - [c5]Naoki Katoh, Shin-ichi Tanigawa:
Fast enumeration algorithms for non-crossing geometric graphs. SCG 2008: 328-337 - 2007
- [j2]David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa:
Enumerating Non-crossing Minimally Rigid Frameworks. Graphs Comb. 23(Supplement-1): 117-134 (2007) - [c4]Naoki Katoh, Shin-ichi Tanigawa:
Enumerating Constrained Non-crossing Geometric Spanning Trees. COCOON 2007: 243-253 - 2006
- [j1]Shin-ichi Tanigawa, Naoki Katoh:
Finding a Triangular Mesh with a Constant Number of Different Edge Lengths. IEICE Trans. Inf. Syst. 89-D(8): 2364-2371 (2006) - [c3]Shin-ichi Tanigawa, Naoki Katoh:
Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths. AAIM 2006: 161-172 - [c2]David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa:
Enumerating Non-crossing Minimally Rigid Frameworks. COCOON 2006: 205-215 - 2005
- [c1]Shin-ichi Tanigawa, Naoki Katoh:
Finding a triangular mesh with a constant number of different edge lengths. CCCG 2005: 274-277
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-10-07 21:20 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:
