default search action
Shengminjie Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Shengminjie Chen, Donglei Du, Wenguo Yang
, Suixiang Gao:
Maximizing stochastic set function under a matroid constraint from decomposition. J. Comb. Optim. 48(1): 3 (2024) - [j9]Shengminjie Chen, Donglei Du, Ruiqi Yang, Wenguo Yang, Yapu Zhang:
A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity. Theor. Comput. Sci. 981: 114254 (2024) - 2023
- [j8]Shengminjie Chen
Output-Input Ratio Maximization for Online Social Networks: Algorithms and Analyses. IEEE Trans. Comput. Soc. Syst. 10(3): 958-969 (2023) - [j7]Shengminjie Chen
Positive Evaluation Maximization in Social Networks: Model and Algorithm. IEEE Trans. Comput. Soc. Syst. 10(3): 1402-1413 (2023) - [i1]Shengminjie Chen, Donglei Du, Wenguo Yang, Dachuan Xu, Suixiang Gao:
Continuous Non-monotone DR-submodular Maximization with Down-closed Convex Constraint. CoRR abs/2307.09616 (2023) - 2022
- [j6]Liman Du, Shengminjie Chen
Nonsubmodular constrained profit maximization from increment perspective. J. Comb. Optim. 44(4): 2598-2625 (2022) - [j5]Yapu Zhang, Shengminjie Chen, Wenqing Xu, Zhenning Zhang:
Adaptive influence maximization under fixed observation time-step. Theor. Comput. Sci. 928: 104-114 (2022) - [j4]Shengminjie Chen
Information Spread Maximization With Multi-Boosting Stages. IEEE Trans. Netw. Sci. Eng. 9(5): 3467-3477 (2022) - 2021
- [j3]Shengminjie Chen
Novel algorithms for maximum DS decomposition. Theor. Comput. Sci. 857: 87-96 (2021) - [c6]Yapu Zhang, Shengminjie Chen
Fixed Observation Time-Step: Adaptive Influence Maximization. AAIM 2021: 200-211 - 2020
- [j2]Lianbo Ma, Rui Wang
A novel many-objective evolutionary algorithm based on transfer matrix with Kriging model. Inf. Sci. 509: 437-456 (2020) - [j1]Wenguo Yang
Boosting node activity by recommendations in social networks. J. Comb. Optim. 40(3): 825-847 (2020) - [c5]Lianbo Ma, Mingli Shi, Rui Wang
Multi/Many-Objective Optimization Via A New Preference Indicator. CEC 2020: 1-6 - [c4]Shengminjie Chen, Wenguo Yang, Suixiang Gao, Rong Jin:
Novel Algorithms for Maximum DS Decomposition. COCOA 2020: 624-638 - [c3]Liman Du, Shengminjie Chen, Suixiang Gao, Wenguo Yang
Nonsubmodular Constrained Profit Maximization from Increment Perspective. CSoNet 2020: 451-463
2010 – 2019
- 2018
- [c2]Shengminjie Chen
A Novel Many-Objective Bacterial Foraging Optimizer Based on Multi-engine Cooperation Framework. ICSI (1) 2018: 520-529 - [c1]Rui Wang
Multi-indicator Bacterial Foraging Algorithm with Kriging Model for Many-Objective Optimization. ICSI (1) 2018: 530-539
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 2024-08-23 18:26 CEST 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: