default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNing Ruan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c11]Yun Zhu, Xiayu Chen, Lei Shu, Bowen Tan, Xinying Song, Lijuan Liu, Maria Wang, Jindong Chen, Ning Ruan:
An Efficient Conversational Smart Compose System. ACL (demo) 2023: 456-462- 2020
- [j11]Yihao Wang
, Yuanyuan Ma, Ruixia Jin, Pei Liu, Ning Ruan:
Comprehensive Criteria-Based Generalized Steganalysis Feature Selection Method. IEEE Access 8: 154418-154435 (2020)
2010 – 2019
- 2017
- [j10]Lin Yan, Ning Ruan, Shuo Yan, Wei Gao:
相关集的数据关联描述及实例讨论 (Description of Data Association Occurring in Related Sets and Specific Example). 计算机科学 44(1): 283-288 (2017) - 2015
- [j9]Ning Ruan, David Yang Gao:
Global solutions to fractional programming problem with ratio of nonconvex functions. Appl. Math. Comput. 255: 66-72 (2015) - 2014
- [j8]Ning Ruan, David Yang Gao:
Global optimal solutions to general sensor network localization problem. Perform. Evaluation 75: 1-16 (2014) - 2013
- [c10]Ning Ruan:
An Interesting Cryptography Study Based on Knapsack Problem. UKSim 2013: 330-334 - [i5]Ning Ruan, David Yang Gao:
Global Optimal Solutions to a General Sensor Network Localization Problem. CoRR abs/1302.3673 (2013) - [i4]Ruoming Jin, Ning Ruan, Bo You, Haixun Wang:
Hub-Accelerator: Fast and Exact Shortest Path Computation in Large Social Networks. CoRR abs/1305.0507 (2013) - 2012
- [c9]Ning Ruan, David Yang Gao:
Canonical Duality Theory and Algorithm for Solving Challenging Problems in Network Optimisation. ICONIP (3) 2012: 702-709 - [c8]Ruoming Jin, Ning Ruan, Saikat Dey, Jeffrey Xu Yu:
SCARAB: scaling reachability computation on large graphs. SIGMOD Conference 2012: 169-180 - [c7]Ruoming Jin, Ning Ruan, Yang Xiang, Victor E. Lee:
A highway-centric labeling approach for answering distance queries on large sparse graphs. SIGMOD Conference 2012: 445-456 - [i3]Ning Ruan, Ruoming Jin, Crown Guan Wang, Kun Huang:
Network Backbone Discovery Using Edge Clustering. CoRR abs/1202.1842 (2012) - [i2]Ning Ruan, David Yang Gao:
Global Optimal Solution to Discrete Value Selection Problem with Inequality Constraints. CoRR abs/1205.0856 (2012) - 2011
- [j7]Ruoming Jin, Ning Ruan, Yang Xiang, Haixun Wang:
Path-tree: An efficient reachability indexing scheme for large directed graphs. ACM Trans. Database Syst. 36(1): 7:1-7:44 (2011) - [c6]Ning Ruan, Ruoming Jin, Yan Huang:
Distance Preserving Graph Simplification. ICDM 2011: 1200-1205 - [i1]Ning Ruan, Ruoming Jin, Yan Huang:
Distance Preserving Graph Simplification. CoRR abs/1110.0517 (2011) - 2010
- [j6]Ning Ruan, David Yang Gao, Y. Jiao:
Canonical dual least square method for solving general nonlinear systems of quadratic equations. Comput. Optim. Appl. 47(2): 335-347 (2010) - [j5]David Yang Gao, Ning Ruan:
Solutions to quadratic minimization problems with box and integer constraints. J. Glob. Optim. 47(3): 463-484 (2010) - [c5]Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yang Xiang:
Computing label-constraint reachability in graph databases. SIGMOD Conference 2010: 123-134 - [p1]Victor E. Lee, Ning Ruan, Ruoming Jin, Charu C. Aggarwal:
A Survey of Algorithms for Dense Subgraph Discovery. Managing and Mining Graph Data 2010: 303-336
2000 – 2009
- 2009
- [j4]David Yang Gao, Ning Ruan, Hanif D. Sherali:
Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality. J. Glob. Optim. 45(3): 473-497 (2009) - [c4]Ning Ruan, Ruoming Jin, Victor E. Lee, Kun Huang:
A Sparsification Approach for Temporal Graphical Model Decomposition. ICDM 2009: 447-456 - [c3]Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry:
3-HOP: a high-compression indexing scheme for reachability query. SIGMOD Conference 2009: 813-826 - 2008
- [j3]David Yang Gao, Ning Ruan:
Solutions and optimality criteria for nonconvex quadratic-exponential minimization problem. Math. Methods Oper. Res. 67(3): 479-491 (2008) - [c2]Ruoming Jin, Muad Abu-Ata, Yang Xiang, Ning Ruan:
Effective and efficient itemset pattern summarization: regression-based approaches. KDD 2008: 399-407 - [c1]Ruoming Jin, Yang Xiang, Ning Ruan, Haixun Wang:
Efficiently answering reachability queries on very large directed graphs. SIGMOD Conference 2008: 595-608 - 2006
- [j2]Ning Ruan, Xiaoling Sun:
An exact algorithm for cost minimization in series reliability systems with multiple component choices. Appl. Math. Comput. 181(1): 732-741 (2006) - [j1]Xiaoling Sun, Ning Ruan, Duan Li:
An efficient algorithm for nonlinear integer programming problems arising in series-parallel reliability systems. Optim. Methods Softw. 21(4): 617-633 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
