Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Theoretical Computer Science, Volume 799

> Home > Journals > Theoretical Computer Science

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Volume 799, December 2019

- view
  authority control:
- export record
  dblp key:
  - journals/tcs/LozzoR19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/LozzoR19
Giordano Da Lozzo, Ignaz Rutter:
Planarity of streamed graphs. 1-21
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/SabirMV19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/SabirMV19
Eminjan Sabir, Aygul Mamut, Elkin Vumar:
The extra connectivity of the enhanced hypercubes. 22-31
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/RahbaniRS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/RahbaniRS19
Hadi Rahbani, Nader Jafari Rad, Mohammad-Reza Sadeghi:
A note on the complexity of locating-total domination in graphs. 32-39
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/BorosGHMM19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BorosGHMM19
Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic:
Sprague-Grundy function of matroids and related hypergraphs. 40-58
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/ZhangLH19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ZhangLH19
Shunzhe Zhang, Huiqing Liu, Xiaolan Hu:
Hybrid fault diagnosis capability analysis of triangle-free graphs. 59-70
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/IbarraM19a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/IbarraM19a
Oscar H. Ibarra, Ian McQuillan:
On families of full trios containing counter machine languages. 71-93
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/GuHHC19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/GuHHC19
Mei-Mei Gu, Shengjie He, Rong-Xia Hao, Eddie Cheng:
Strongly Menger connectedness of data center network and (n, k)-star graph. 94-103
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/MiaoYH19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/MiaoYH19
Runjie Miao, Jinjiang Yuan, Fei Huang:
Paths and trails in edge-colored weighted graphs. 104-114
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/MurtazaFJ19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/MurtazaFJ19
Muhammad Murtaza, Muhammad Fazil, Imran Javaid:
Locating-dominating sets of functigraphs. 115-123
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/Dose19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Dose19
Titus Dose:
Balance problems for integer circuits. 124-139
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/CurrieHOR19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/CurrieHOR19
James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad:
Some further results on squarefree arithmetic progressions in infinite words. 140-148
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/PferschyNP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/PferschyNP19
Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici:
A Stackelberg knapsack game with weight control. 149-159

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.