A proof of the molecular conjecture N Katoh, S Tanigawa Discrete & Computational Geometry 45 (4), 647-700, 2011 | 127 | 2011 |
Improved Approximation Algorithms for k-Submodular Function Maximization S Iwata, S Tanigawa, Y Yoshida Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 70 | 2016 |
Online graph exploration algorithms for cycles and trees by multiple searchers Y Higashikawa, N Katoh, S Langerman, S Tanigawa Journal of Combinatorial Optimization 28, 480-495, 2014 | 57 | 2014 |
Rooted-tree decompositions with matroid constraints and the infinitesimal rigidity of frameworks with boundaries N Katoh, S Tanigawa SIAM Journal on Discrete Mathematics 27 (1), 155-185, 2013 | 51 | 2013 |
Sufficient conditions for the global rigidity of graphs S Tanigawa Journal of Combinatorial Theory, Series B 113, 123-140, 2015 | 49 | 2015 |
Infinitesimal rigidity of symmetric bar-joint frameworks B Schulze, S Tanigawa SIAM Journal on Discrete Mathematics 29 (3), 1259-1286, 2015 | 49 | 2015 |
Gain-sparsity and symmetry-forced rigidity in the plane T Jordán, VE Kaszanitzky, S Tanigawa Discrete & computational geometry 55, 314-372, 2016 | 45* | 2016 |
Generic global rigidity of body-hinge frameworks T Jordán, C Király, S Tanigawa Journal of Combinatorial Theory, Series B 117, 59-76, 2016 | 43 | 2016 |
Matroids of gain graphs in applied discrete geometry S Tanigawa Transactions of the American Mathematical Society 367 (12), 8597-8641, 2015 | 36 | 2015 |
Point-hyperplane frameworks, slider joints, and rigidity preserving transformations Y Eftekhari, B Jackson, A Nixon, B Schulze, S Tanigawa, W Whiteley Journal of Combinatorial Theory, Series B 135, 44-74, 2019 | 33 | 2019 |
Global rigidity of triangulations with braces T Jordán, S Tanigawa Journal of Combinatorial Theory, Series B 136, 249-288, 2019 | 26 | 2019 |
Periodic body-and-bar frameworks CS Borcea, I Streinu, S Tanigawa Proceedings of the twenty-eighth annual symposium on Computational geometry …, 2012 | 22 | 2012 |
Exact algorithms for the bottleneck Steiner tree problem SW Bae, S Choi, C Lee, S Tanigawa Algorithmica 61, 924-948, 2011 | 22 | 2011 |
Fast enumeration algorithms for non-crossing geometric graphs N Katoh, SI Tanigawa Discrete & Computational Geometry 42, 443-468, 2009 | 22 | 2009 |
Bisubmodular function maximization and extensions S Iwata, S Tanigawa, Y Yoshida The University of Tokyo, 2013 | 20 | 2013 |
Packing non-zero A-paths via matroid matching S Tanigawa, Y Yamaguchi Discrete Applied Mathematics 214, 169-178, 2016 | 19* | 2016 |
Packing of arborescences with matroid constraints via matroid intersection C Király, Z Szigeti, S Tanigawa Mathematical Programming 181, 85-117, 2020 | 18* | 2020 |
Enumeration of optimal pin-jointed bistable compliant mechanisms with non-crossing members M Ohsaki, N Katoh, T Kinoshita, S Tanigawa, D Avis, I Streinu Structural and Multidisciplinary Optimization 37, 645-651, 2009 | 18 | 2009 |
Linking rigid bodies symmetrically B Schulze, S Tanigawa European Journal of Combinatorics 42, 145-166, 2014 | 17 | 2014 |
Enumerating constrained non-crossing minimally rigid frameworks D Avis, N Katoh, M Ohsaki, I Streinu, S Tanigawa Discrete & Computational Geometry 40, 31-46, 2008 | 16 | 2008 |