Shin-ichi Tanigawa

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 33

Top Topics

Symmetric Matrices

Submodular Functions

Sampling Algorithm

Top Venues

J. Comb. Theory, Ser. B

SIAM J. Discret. Math.

Publications

Bill Jackson, Shin-ichi Tanigawa
Maximal matroids in weak order posets. J. Comb. Theory, Ser. B 165 (2024)
James Cruickshank, Fatemeh Mohammadi, Harshit J. Motwani, Anthony Nixon, Shin-ichi Tanigawa
Global Rigidity of Line Constrained Frameworks. SIAM J. Discret. Math. 38 (1) (2024)
Ryoshun Oba, Shin-ichi Tanigawa
Characterizing the universal rigidity of generic tensegrities. Math. Program. 197 (1) (2023)
Kazusato Oko, Shinsaku Sakaue, Shin-ichi Tanigawa
Nearly Tight Spectral Sparsification of Directed Hypergraphs. ICALP (2023)
James Cruickshank, Fatemeh Mohammadi, Anthony Nixon, Shin-ichi Tanigawa
Identifiability of Points and Rigidity of Hypergraphs under Algebraic Constraints. CoRR (2023)
James Cruickshank, Bill Jackson, Shin-ichi Tanigawa
Vertex Splitting, Coincident Realisations, and Global Rigidity of Braced Triangulations. Discret. Comput. Geom. 69 (1) (2023)
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, Ser. B 157 (2022)
Kazusato Oko, Shinsaku Sakaue, Shin-ichi Tanigawa
Nearly Tight Spectral Sparsification of Directed Hypergraphs by a Simple Iterative Sampling Algorithm. CoRR (2022)
Tibor Jordán, Shin-ichi Tanigawa
Globally rigid powers of graphs. J. Comb. Theory, Ser. B 155 (2022)
Tibor Jordán, Shin-ichi Tanigawa
Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices. SIAM J. Discret. Math. 36 (3) (2022)
Bill Jackson, Anthony Nixon, Shin-ichi Tanigawa
An Improved Bound for the Rigidity of Linearly Constrained Frameworks. SIAM J. Discret. Math. 35 (2) (2021)
Viktória E. Kaszanitzky, Bernd Schulze, Shin-ichi Tanigawa
Global rigidity of periodic graphs under fixed-lattice representations. J. Comb. Theory, Ser. B 146 (2021)
Monique Laurent, Shin-ichi Tanigawa
Perfect elimination orderings for symmetric matrices. Optim. Lett. 14 (2) (2020)
Quentin Fortier, Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa
On packing spanning arborescences with matroid constraint. J. Graph Theory 93 (2) (2020)
Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa
Packing of arborescences with matroid constraints via matroid intersection. Math. Program. 181 (1) (2020)
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, Ser. B 135 (2019)
Tibor Jordán, Shin-ichi Tanigawa
Global rigidity of triangulations with braces. J. Comb. Theory, Ser. B 136 (2019)
Tatsuya Matsuoka, Shin-ichi Tanigawa
On reachability mixed arborescence packing. Discret. Optim. 32 (2019)
Tatsuya Matsuoka, Shin-ichi Tanigawa
On Reachability Mixed Arborescence Packing. CoRR (2018)
Satoru Fujishige, Shin-ichi Tanigawa
Polynomial combinatorial algorithms for skew-bisubmodular function minimization. Math. Program. 171 (1-2) (2018)
Anthony Nixon, Bernd Schulze, Shin-ichi Tanigawa, Walter Whiteley
Rigidity of Frameworks on Expanding Spheres. SIAM J. Discret. Math. 32 (4) (2018)
Rintaro Ikeshita, Shin-ichi Tanigawa
Count Matroids of Group-Labeled Graphs. Comb. 38 (5) (2018)
Motoki Ikeda, Shin-ichi Tanigawa
Cut Sparsifiers for Balanced Digraphs. WAOA (2018)
Shin-ichi Tanigawa
Singularity Degree of the Positive Semidefinite Matrix Completion Problem. SIAM J. Optim. 27 (2) (2017)
Monique Laurent, Matteo Seminaroti, Shin-ichi Tanigawa
A Structural Characterization for Certifying Robinsonian Matrices. Electron. J. Comb. 24 (2) (2017)
Monique Laurent, Matteo Seminaroti, Shin-ichi Tanigawa
A Structural Characterization for Certifying Robinsonian Matrices. CoRR (2017)
Quentin Fortier, Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa
On packing spanning arborescences with matroid constraint. Electron. Notes Discret. Math. 61 (2017)
Tibor Jordán, Viktória E. Kaszanitzky, Shin-ichi Tanigawa
Gain-Sparsity and Symmetry-Forced Rigidity in the Plane. Discret. Comput. Geom. 55 (2) (2016)
Tibor Jordán, Csaba Király, Shin-ichi Tanigawa
Generic global rigidity of body-hinge frameworks. J. Comb. Theory, Ser. B 117 (2016)
Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa
Unique low rank completability of partially filled matrices. J. Comb. Theory, Ser. B 121 (2016)
Shin-ichi Tanigawa, Yutaro Yamaguchi
Packing non-zero A-paths via matroid matching. Discret. Appl. Math. 214 (2016)
Satoru Iwata, Shin-ichi Tanigawa, Yuichi Yoshida
-Submodular Function Maximization. SODA (2016)
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 (2016)
Shin-ichi Tanigawa, Yuichi Yoshida
Testing the Supermodular-Cut Condition. Algorithmica 71 (4) (2015)
Bernd Schulze, Shin-ichi Tanigawa
Infinitesimal Rigidity of Symmetric Bar-Joint Frameworks. SIAM J. Discret. Math. 29 (3) (2015)
Shin-ichi Tanigawa
Sufficient conditions for the global rigidity of graphs. J. Comb. Theory, Ser. B 113 (2015)
Ciprian Borcea, Ileana Streinu, Shin-ichi Tanigawa
Periodic Body-and-Bar Frameworks. SIAM J. Discret. Math. 29 (1) (2015)
Satoru Iwata, Shin-ichi Tanigawa, Yuichi Yoshida
Improved Approximation Algorithms for k-Submodular Function Maximization. CoRR (2015)
Satoru Fujishige, Shin-ichi Tanigawa, Yuichi Yoshida
Generalized skew bisubmodularity: A characterization and a min-max theorem. Discret. Optim. 12 (2014)
Bernd Schulze, Shin-ichi Tanigawa
Linking rigid bodies symmetrically. Eur. J. Comb. 42 (2014)
Satoru Fujishige, Shin-ichi Tanigawa
A Min-Max Theorem for Transversal Submodular Functions and Its Implications. SIAM J. Discret. Math. 28 (4) (2014)
Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa
Combinatorial Conditions for the Unique Completability of Low-Rank Matrices. SIAM J. Discret. Math. 28 (4) (2014)
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) (2014)
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) (2013)
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)
Hee-Kap Ahn, Sang Won Bae, Shin-ichi Tanigawa
Rectilinear Covering for Imprecise Input Points - (Extended Abstract). ISAAC (2012)
Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida
Constant-Time Algorithms for Sparsity Matroids. ICALP (1) (2012)
Ciprian Borcea, Ileana Streinu, Shin-ichi Tanigawa
Periodic body-and-bar frameworks. SCG (2012)
Naoki Katoh, Shin-ichi Tanigawa
A rooted-forest partition with uniform vertex demand. J. Comb. Optim. 24 (2) (2012)
Shin-ichi Tanigawa
Generic Rigidity Matroids with Dilworth Truncations. SIAM J. Discret. Math. 26 (3) (2012)
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) (2012)
Naoki Katoh, Shin-ichi Tanigawa
Rooted-tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries CoRR (2011)
Naoki Katoh, Shin-ichi Tanigawa
A Proof of the Molecular Conjecture. Discret. Comput. Geom. 45 (4) (2011)
Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida
Constant-Time Algorithms for Sparsity Matroids CoRR (2011)
Sang Won Bae, Sunghee Choi, Chunseok Lee, Shin-ichi Tanigawa
Exact Algorithms for the Bottleneck Steiner Tree Problem. Algorithmica 61 (4) (2011)
Shin-ichi Tanigawa
Generic Rigidity Matroids with Dilworth Truncations CoRR (2010)
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)
Naoki Katoh, Shin-ichi Tanigawa
A Rooted-Forest Partition with Uniform Vertex Demand. WALCOM (2010)
Naoki Katoh, Shin-ichi Tanigawa
Fast Enumeration Algorithms for Non-crossing Geometric Graphs. Discret. Comput. Geom. 42 (3) (2009)
Naoki Katoh, Shin-ichi Tanigawa
A proof of the molecular conjecture. SCG (2009)
Naoki Katoh, Shin-ichi Tanigawa
Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees. Discret. Appl. Math. 157 (17) (2009)
Sang Won Bae, Sunghee Choi, Chunseok Lee, Shin-ichi Tanigawa
Exact Algorithms for the Bottleneck Steiner Tree Problem. ISAAC (2009)
Naoki Katoh, Shin-ichi Tanigawa
On the Infinitesimal Rigidity of Bar-and-Slider Frameworks. ISAAC (2009)
Naoki Katoh, Shin-ichi Tanigawa
Fast enumeration algorithms for non-crossing geometric graphs. SCG (2008)
David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
Enumerating Constrained Non-crossing Minimally Rigid Frameworks. Discret. Comput. Geom. 40 (1) (2008)
Yongding Zhu, Jinhui Xu, Yang Yang, Naoki Katoh, Shin-ichi Tanigawa
Geometric Spanner of Objects under L1 Distance. COCOON (2008)
Naoki Katoh, Shin-ichi Tanigawa
Enumerating Constrained Non-crossing Geometric Spanning Trees. COCOON (2007)
David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
Enumerating Non-crossing Minimally Rigid Frameworks. Graphs Comb. 23 (Supplement-1) (2007)
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)
David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
Enumerating Non-crossing Minimally Rigid Frameworks. COCOON (2006)
Shin-ichi Tanigawa, Naoki Katoh
Finding a Triangular Mesh with a Constant Number of Different Edge Lengths. IEICE Trans. Inf. Syst. (8) (2006)
Shin-ichi Tanigawa, Naoki Katoh
Finding a triangular mesh with a constant number of different edge lengths. CCCG (2005)