| Suppression of Coherence Matrix Bias for Phase Linking and Ambiguity Detection in MTInSAR | 0 | 0.34 | 2021 |
| Investigation of Slow-Moving Artificial Slope Failure with Multi-Temporal InSAR by Combining Persistent and Distributed Scatterers: A Case Study in Northern Taiwan | 0 | 0.34 | 2020 |
| Ground Deformation and Its Causes in Abbottabad City, Pakistan from Sentinel-1A Data and MT-InSAR. | 0 | 0.34 | 2020 |
| Nonparametric Estimation of DEM Error in Multitemporal InSAR | 0 | 0.34 | 2019 |
| Monitoring Spatiotemporal Deformation of Tatun Volcano Group by Multi-Temporal Insar. | 0 | 0.34 | 2019 |
| Minimizing Height Effects in MTInSAR for Deformation Detection Over Built Areas | 0 | 0.34 | 2019 |
| Toward Mitigating Stratified Tropospheric Delays in Multitemporal InSAR: A Quadtree Aided Joint Model. | 0 | 0.34 | 2019 |
| Asymptotically Optimal Algorithms for Running Max and Min Filters on Random Inputs. | 0 | 0.34 | 2018 |
| Total {K}-Domination In Special Graphs | 0 | 0.34 | 2018 |
| An Output-Capacitorless Ultra-Low Power Low-Dropout Regulator. | 0 | 0.34 | 2017 |
| Average-case complexity of the min-sum matrix product problem. | 0 | 0.34 | 2016 |
| Ground-Based Interferometric Radar For Dynamic Deformation Monitoring Of The Ting Kau Bridge In Hong Kong | 0 | 0.34 | 2016 |
| Computing Roman domatic number of graphs. | 0 | 0.34 | 2016 |
| Optimal Rendezvous Strategies for Different Environments in Cognitive Radio Networks. | 0 | 0.34 | 2015 |
| Investigation of Slow-Moving Landslides from ALOS/PALSAR Images with TCPInSAR: A Case Study of Oso, USA | 5 | 0.63 | 2015 |
| Internet-Based Anti-Counterfeiting Pattern with Using Big Data in China | 7 | 0.46 | 2015 |
| Optimal Collapsing Protocol for Multiparty Pointer Jumping | 0 | 0.34 | 2014 |
| Optimal Rendezvous Strategies for Different Environments in Cognitive Radio Networks. | 1 | 0.36 | 2014 |
| Extracting the Core Structure of Social Networks Using (α, β)-Communities. | 5 | 0.43 | 2013 |
| On the Complexity of t-Closeness Anonymization and Related Problems. | 2 | 0.36 | 2013 |
| Some sharp bounds on the negative decision number of graphs. | 0 | 0.34 | 2013 |
| Improved approximation for spanning star forest in dense graphs | 2 | 0.39 | 2013 |
| On the complexity of connectivity in cognitive radio networks through spectrum assignment | 1 | 0.36 | 2013 |
| Matroid and knapsack center problems | 6 | 0.57 | 2013 |
| The hardness and approximation of the star p-hub center problem. | 5 | 0.45 | 2013 |
| On the k-edge-incident subgraph problem and its variants | 1 | 0.37 | 2013 |
| Complexity of Connectivity in Cognitive Radio Networks through Spectrum Assignment. | 4 | 0.39 | 2012 |
| Space-Efficient approximation scheme for circular earth mover distance | 3 | 0.39 | 2012 |
| Signed and Minus Domination in Complete Multipartite Graphs | 1 | 0.36 | 2012 |
| The algorithmic complexity of k-domatic partition of graphs | 0 | 0.34 | 2012 |
| On rainbow-k-connectivity of random graphs | 9 | 0.98 | 2012 |
| On the Signed (Total) $k$-Domination Number of a Graph | 2 | 0.42 | 2012 |
| Controlling infection by blocking nodes and links simultaneously | 10 | 0.61 | 2011 |
| Word-reordering for Statistical Machine Translation Using Trigram Language Model. | 0 | 0.34 | 2011 |
| Reversing longest previous factor tables is hard | 5 | 0.43 | 2011 |
| Detecting the structure of social networks using (α, β)-communities | 12 | 0.96 | 2011 |
| On variants of the spanning star forest problem | 0 | 0.34 | 2011 |
| Complexity of total {k}-domination and related problems | 1 | 0.36 | 2011 |
| Limiting negations in bounded treewidth and upward planar circuits | 1 | 0.35 | 2010 |
| An improved approximation algorithm for spanning star forest in dense graphs | 1 | 0.36 | 2010 |
