Shin-ichi Tanigawa

J. Comb. Theory B, March, 2024

Sample Complexity of Low-rank Tensor Recovery from Uniformly Random Entries.

[BibT_eX]

[DOI]

Hiroki Hamaguchi

CoRR, 2024

2023

Characterizing the universal rigidity of generic tensegrities.

[BibT_eX]

[DOI]

Ryoshun Oba

Math. Program., January, 2023

Vertex Splitting, Coincident Realisations, and Global Rigidity of Braced Triangulations.

[BibT_eX]

[DOI]

James Cruickshank

Discret. Comput. Geom., 2023

Identifiability of Points and Rigidity of Hypergraphs under Algebraic Constraints.

[BibT_eX]

[DOI]

CoRR, 2023

Nearly Tight Spectral Sparsification of Directed Hypergraphs.

[BibT_eX]

[DOI]

Kazusato Oko

Shinsaku Sakaue

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2022

Globally rigid powers of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

Minimizing submodular functions on diamonds via generalized fractional matroid matchings.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

Nearly Tight Spectral Sparsification of Directed Hypergraphs by a Simple Iterative Sampling Algorithm.

[BibT_eX]

[DOI]

Kazusato Oko

Shinsaku Sakaue

CoRR, 2022

2021

An Improved Bound for the Rigidity of Linearly Constrained Frameworks.

[BibT_eX]

[DOI]

Anthony Nixon

SIAM J. Discret. Math., 2021

Global rigidity of periodic graphs under fixed-lattice representations.

[BibT_eX]

[DOI]

Viktória E. Kaszanitzky

Bernd Schulze

J. Comb. Theory B, 2021

2020

Perfect elimination orderings for symmetric matrices.

[BibT_eX]

[DOI]

Monique Laurent

Optim. Lett., 2020

Packing of arborescences with matroid constraints via matroid intersection.

[BibT_eX]

[DOI]

Csaba Király

Zoltán Szigeti

Math. Program., 2020

On packing spanning arborescences with matroid constraint.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

2019

Global rigidity of triangulations with braces.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Point-hyperplane frameworks, slider joints, and rigidity preserving transformations.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

On reachability mixed arborescence packing.

[BibT_eX]

[DOI]

Tatsuya Matsuoka

Discret. Optim., 2019

2018

Rigidity of Frameworks on Expanding Spheres.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Polynomial combinatorial algorithms for skew-bisubmodular function minimization.

[BibT_eX]

[DOI]

Satoru Fujishige

Math. Program., 2018

Count Matroids of Group-Labeled Graphs.

[BibT_eX]

[DOI]

Rintaro Ikeshita

Comb., 2018

Cut Sparsifiers for Balanced Digraphs.

[BibT_eX]

[DOI]

Motoki Ikeda

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

2017

Singularity Degree of the Positive Semidefinite Matrix Completion Problem.

[BibT_eX]

[DOI]

SIAM J. Optim., 2017

A Structural Characterization for Certifying Robinsonian Matrices.

[BibT_eX]

[DOI]

Monique Laurent

Matteo Seminaroti

Electron. J. Comb., 2017

2016

Enumeration of Non-crossing Geometric Graphs.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Generic global rigidity of body-hinge frameworks.

[BibT_eX]

[DOI]

Csaba Király

J. Comb. Theory B, 2016

Unique low rank completability of partially filled matrices.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Gain-Sparsity and Symmetry-Forced Rigidity in the Plane.

[BibT_eX]

[DOI]

Viktória E. Kaszanitzky

Discret. Comput. Geom., 2016

Packing non-zero A-paths via matroid matching.

[BibT_eX]

[DOI]

Yutaro Yamaguchi

Discret. Appl. Math., 2016

On the edge crossing properties of Euclidean minimum weight Laman graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Improved Approximation Algorithms for <i>k</i>-Submodular Function Maximization.

[BibT_eX]

[DOI]

Satoru Iwata

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Infinitesimal Rigidity of Symmetric Bar-Joint Frameworks.

[BibT_eX]

[DOI]

Bernd Schulze

SIAM J. Discret. Math., 2015

Periodic Body-and-Bar Frameworks.

[BibT_eX]

[DOI]

Ciprian Borcea

Ileana Streinu

SIAM J. Discret. Math., 2015

Sufficient conditions for the global rigidity of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

Improved Approximation Algorithms for k-Submodular Function Maximization.

[BibT_eX]

[DOI]

Satoru Iwata

CoRR, 2015

Testing the Supermodular-Cut Condition.

[BibT_eX]

[DOI]

Algorithmica, 2015

2014

Combinatorial Conditions for the Unique Completability of Low-Rank Matrices.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

A Min-Max Theorem for Transversal Submodular Functions and Its Implications.

[BibT_eX]

[DOI]

Satoru Fujishige

SIAM J. Discret. Math., 2014

Online graph exploration algorithms for cycles and trees by multiple searchers.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

Linking rigid bodies symmetrically.

[BibT_eX]

[DOI]

Bernd Schulze

Eur. J. Comb., 2014

Generalized skew bisubmodularity: A characterization and a min-max theorem.

[BibT_eX]

[DOI]

Satoru Fujishige

Discret. Optim., 2014

2013

Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

2012

Generic Rigidity Matroids with Dilworth Truncations.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

A rooted-forest partition with uniform vertex demand.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits.

[BibT_eX]

[DOI]

Shuji Kijima

Discret. Math., 2012

Rectilinear Covering for Imprecise Input Points - (Extended Abstract).

[BibT_eX]

[DOI]

Hee-Kap Ahn

Sang Won Bae

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Constant-Time Algorithms for Sparsity Matroids.

[BibT_eX]

[DOI]

Hiro Ito

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

A Proof of the Molecular Conjecture.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2011

Exact Algorithms for the Bottleneck Steiner Tree Problem.

[BibT_eX]

[DOI]

Algorithmica, 2011

2010

A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

2009

Fast Enumeration Algorithms for Non-crossing Geometric Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

On the Infinitesimal Rigidity of Bar-and-Slider Frameworks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Enumerating Constrained Non-crossing Minimally Rigid Frameworks.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2008

Geometric Spanner of Objects under L1 Distance.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007

Enumerating Non-crossing Minimally Rigid Frameworks.

[BibT_eX]

[DOI]

Graphs Comb., 2007

Enumerating Constrained Non-crossing Geometric Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006

Finding a Triangular Mesh with a Constant Number of Different Edge Lengths.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2006

Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths.

[BibT_eX]

[DOI]