| An Improved Bound For The Rigidity Of Linearly Constrained Frameworks | 0 | 0.34 | 2021 |
| On packing spanning arborescences with matroid constraint | 0 | 0.34 | 2020 |
| Perfect Elimination Orderings for Symmetric Matrices | 0 | 0.34 | 2020 |
| Packing of arborescences with matroid constraints via matroid intersection | 0 | 0.34 | 2020 |
| Global rigidity of triangulations with braces. | 1 | 0.39 | 2019 |
| Point-hyperplane frameworks, slider joints, and rigidity preserving transformations. | 0 | 0.34 | 2019 |
| On Reachability Mixed Arborescence Packing. | 0 | 0.34 | 2018 |
| Polynomial combinatorial algorithms for skew-bisubmodular function minimization. | 0 | 0.34 | 2018 |
| Count Matroids of Group-Labeled Graphs | 1 | 0.36 | 2018 |
| Singularity Degree of the Positive Semidefinite Matrix Completion Problem. | 0 | 0.34 | 2017 |
| A Structural Characterization for Certifying Robinsonian Matrices. | 1 | 0.35 | 2017 |
| Generic global rigidity of body-hinge frameworks | 3 | 0.43 | 2016 |
| Unique low rank completability of partially filled matrices. | 0 | 0.34 | 2016 |
| Gain-Sparsity and Symmetry-Forced Rigidity in the Plane. | 1 | 0.37 | 2016 |
| Packing non-zero A-paths via matroid matching. | 3 | 0.39 | 2016 |
| Improved Approximation Algorithms for k-Submodular Function Maximization. | 2 | 0.37 | 2016 |
| Sufficient conditions for the global rigidity of graphs | 2 | 0.42 | 2015 |
| Infinitesimal Rigidity of Symmetric Bar-Joint Frameworks | 4 | 0.50 | 2015 |
| Periodic Body-and-Bar Frameworks. | 2 | 0.43 | 2015 |
| Testing the Supermodular-Cut Condition | 3 | 0.41 | 2015 |
| A Min-Max Theorem for Transversal Submodular Functions and Its Implications. | 2 | 0.41 | 2014 |
| Generalized skew bisubmodularity: A characterization and a min-max theorem. | 6 | 0.44 | 2014 |
| Linking rigid bodies symmetrically. | 1 | 0.39 | 2014 |
| Online graph exploration algorithms for cycles and trees by multiple searchers | 12 | 0.66 | 2014 |
| Combinatorial Conditions for the Unique Completability of Low-Rank Matrices. | 3 | 0.41 | 2014 |
| Rooted-tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries | 5 | 0.64 | 2013 |
| On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs. | 0 | 0.34 | 2013 |
| Rectilinear Covering for Imprecise Input Points - (Extended Abstract). | 0 | 0.34 | 2012 |
| A rooted-forest partition with uniform vertex demand | 2 | 0.40 | 2012 |
| Constant-time algorithms for sparsity matroids | 6 | 0.53 | 2012 |
| Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits. | 0 | 0.34 | 2012 |
| Generic Rigidity Matroids with Dilworth Truncations | 3 | 0.47 | 2012 |
| Exact Algorithms for the Bottleneck Steiner Tree Problem | 7 | 0.54 | 2011 |
| A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets | 0 | 0.34 | 2010 |
| A proof of the molecular conjecture | 18 | 1.27 | 2009 |
| On the Infinitesimal Rigidity of Bar-and-Slider Frameworks | 2 | 0.38 | 2009 |
| Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees | 2 | 0.37 | 2009 |
| Fast enumeration algorithms for non-crossing geometric graphs | 9 | 0.56 | 2008 |
| Enumerating Constrained Non-crossing Minimally Rigid Frameworks | 8 | 0.83 | 2008 |
| Geometric Spanner of Objects under L1 Distance | 0 | 0.34 | 2008 |
| Enumerating constrained non-crossing geometric spanning trees | 1 | 0.35 | 2007 |
| Finding a Triangular Mesh with a Constant Number of Different Edge Lengths | 0 | 0.34 | 2006 |
| Polygonal curve approximation using grid points with application to a triangular mesh generation with small number of different edge lengths | 1 | 0.35 | 2006 |
