| Locating Evacuation Centers Optimally in Path and Cycle Networks. | 0 | 0.34 | 2021 |
| Almost Linear Time Algorithms For Minsum K-Sink Problems On Dynamic Flow Path Networks | 0 | 0.34 | 2021 |
| Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights | 0 | 0.34 | 2021 |
| Improving Upper and Lower Bounds for the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs | 0 | 0.34 | 2021 |
| Minsum k-sink problem on path networks | 0 | 0.34 | 2020 |
| Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks. | 0 | 0.34 | 2020 |
| Minmax-Regret Evacuation Planning for Cycle Networks. | 0 | 0.34 | 2019 |
| Preface for the Special Issue on the Project “Foundation of Innovative Algorithms for Big Data” | 0 | 0.34 | 2019 |
| The Mixed Evacuation Problem. | 1 | 0.37 | 2018 |
| Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks. | 0 | 0.34 | 2018 |
| An O(n2 log2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks. | 0 | 0.34 | 2018 |
| A population-based algorithm for solving linear assignment problems with two objectives. | 0 | 0.34 | 2017 |
| Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks. | 0 | 0.34 | 2017 |
| Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs | 0 | 0.34 | 2016 |
| Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities. | 1 | 0.36 | 2016 |
| Improved Algorithms for Computing k-Sink on Dynamic Path Networks. | 0 | 0.34 | 2016 |
| Polynomial-time approximability of the k-Sink Location problem. | 0 | 0.34 | 2015 |
| Geometric k-Center Problems with Centers Constrained to Two Lines | 0 | 0.34 | 2015 |
| Minimax Regret 1-Median Problem in Dynamic Path Networks | 1 | 0.40 | 2015 |
| The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths. | 0 | 0.34 | 2014 |
| An inductive construction of minimally rigid body-hinge simple graphs. | 0 | 0.34 | 2014 |
| Rooted-tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries | 5 | 0.64 | 2013 |
| An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs. | 0 | 0.34 | 2013 |
| Independent arborescences in directed graphs. | 0 | 0.34 | 2013 |
| A Linear-Time Algorithm for Testing Outer-1-Planarity. | 12 | 0.56 | 2013 |
| A rooted-forest partition with uniform vertex demand | 2 | 0.40 | 2012 |
| Online exploration of all vertices in a simple polygon | 1 | 0.36 | 2012 |
| Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract). | 6 | 0.46 | 2012 |
| An Emergency Evacuation Planning Model Using the Universally Quickest Flow. | 2 | 0.37 | 2012 |
| Collision probability in an in-line machines model | 1 | 0.40 | 2011 |
| A Geometric Spanner Of Segments | 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 |
| An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths | 12 | 0.89 | 2009 |
| Fast enumeration algorithms for non-crossing geometric graphs | 9 | 0.56 | 2008 |
| Enumerating Constrained Non-crossing Minimally Rigid Frameworks | 8 | 0.83 | 2008 |
| The Minimum Weight In-Tree Cover Problem | 1 | 0.37 | 2008 |
| Risk discovery of car-related crimes from urban spatial attributes using emerging patterns | 1 | 0.35 | 2007 |
| Applying graph mining to discover substructures of room layouts which affect the rent of apartments | 1 | 0.37 | 2007 |
| Enumerating constrained non-crossing geometric spanning trees | 1 | 0.35 | 2007 |
| Voronoi Diagram with Respect to Criteria on Vision Information | 3 | 0.41 | 2007 |
| Is this brand ephemeral? A multivariate tree-based decision analysis of new product sustainability | 13 | 1.92 | 2007 |
| Inserting Points Uniformly at Every Instance | 9 | 1.35 | 2006 |
| Finding a Triangular Mesh with a Constant Number of Different Edge Lengths | 0 | 0.34 | 2006 |
| Angular Voronoi Diagram with Applications | 9 | 1.00 | 2006 |
| An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity | 17 | 1.08 | 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 |
| Optimal spanners for axis-aligned rectangles | 5 | 0.51 | 2005 |
| Triangulating a convex polygon with small number of non-standard bars | 1 | 0.37 | 2005 |
| The structure and number of global roundings of a graph | 5 | 0.64 | 2004 |
