Lidong Wu

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Wen Liu 0009

> Home > Persons > Lidong Wu

Publications

2021
[j33]
- view
  authority control:
- export record
  dblp key:
  - journals/jco/WangLHLWG21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/WangLHLWG21
Xiaozhi Wang, Xianyue Li, Bo Hou, Wen Liu, Lidong Wu, Suogang Gao:
A greedy algorithm for the fault-tolerant outer-connected dominating set problem. J. Comb. Optim. 41(1): 118-127 (2021)
[j30]
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/HuangHLWRG21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/HuangHLWRG21
Yufei Huang, Bo Hou, Wen Liu, Lidong Wu, Stephen Rainwater, Suogang Gao:
On approximation algorithm for the edge metric dimension problem. Theor. Comput. Sci. 853: 2-6 (2021)
[j28]
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/WangGHWL21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/WangGHWL21
Xin Wang, Suogang Gao, Bo Hou, Lidong Wu, Wen Liu:
Approximation algorithms for the submodular edge cover problem with submodular penalties. Theor. Comput. Sci. 871: 126-133 (2021)
2019
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/aaim/HuangHLWRG19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaim/HuangHLWRG19
Yufei Huang, Bo Hou, Wen Liu, Lidong Wu, Stephen Rainwater, Suogang Gao:
On Approximation Algorithm for the Edge Metric Dimension Problem. AAIM 2019: 142-148

a service of

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.