default search action

combined dblp search
author search
venue search
publication search

ask others

Yongtang Shi

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 Neng Fan

> Home > Persons > Yongtang Shi

Publications

2022
[j92]
- view
  authority control:
- export record
  dblp key:
  - journals/oms/CaiFSY22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/oms/CaiFSY22
Qingqiong Cai, Neng Fan, Yongtang Shi, Shunyu Yao:
Integer linear programming formulations for double roman domination problem. Optim. Methods Softw. 37(1): 1-22 (2022)
2021
[j84]
- view
  authority control:
- export record
  dblp key:
  - journals/jco/GuSF21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/GuSF21
Ran Gu, Yongtang Shi, Neng Fan:
Mixed connectivity properties of random graphs and some special graphs. J. Comb. Optim. 42(3): 427-441 (2021)
2019
[i6]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-1902-07863
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1902-07863
Qingqiong Cai, Neng Fan, Yongtang Shi, Shunyu Yao:
Integer Linear Programming Formulations for Double Roman Domination Problem. CoRR abs/1902.07863 (2019)
2017
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoa/GuSF17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoa/GuSF17
Ran Gu, Yongtang Shi, Neng Fan:
Mixed Connectivity of Random Graphs. COCOA (1) 2017: 133-140

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.