default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 796
Volume 796, December 2019
- Sumanta Banerjee
, J. Mark Keil, Dinabandhu Pradhan:
Perfect Roman domination in graphs. 1-21 - Felice De Luca, Md. Iqbal Hossain, Stephen G. Kobourov, Anna Lubiw, Debajyoti Mondal:
Recognition and drawing of stick graphs. 22-33 - Annalisa De Bonis:
New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions. 34-50 - Timo Kötzing, Martin S. Krejca:
First-hitting times under drift. 51-69 - Yucheng Wang, Qi Bao, Zhongzhi Zhang:
Combinatorial properties of Farey graphs. 70-89 - Liya Yang, Xiwen Lu:
Two-agent scheduling problems with the general position-dependent processing time. 90-98 - Steve Hanneke, Aryeh Kontorovich:
Optimality of SVM: Novel proofs and tighter bounds. 99-113 - Hafiz Muhammad Afzal Siddiqui, Sakander Hayat, Asad Khan, Muhammad Imran, Ayesha Razzaq, Jia-Bao Liu:
Resolvability and fault-tolerant resolvability structures of convex polytopes. 114-128 - Janosch Döcker, Simone Linz, Charles Semple:
Displaying trees across two phylogenetic networks. 129-146 - Guanqin Lian, Shuming Zhou, Sun-Yuan Hsieh, Jiafei Liu, Gaolin Chen, Yihong Wang:
Performance evaluation on hybrid fault diagnosability of regular networks. 147-153 - Nour El Houda Tellache, Mourad Boudhar, Farouk Yalaoui:
Two-machine open shop problem with agreement graph. 154-168 - Dong Li, Xiaolan Hu, Huiqing Liu:
Structure connectivity and substructure connectivity of twisted hypercubes. 169-179 - Nader Jafari Rad:
On the complexity of multiple bondage in graphs. 180-186 - Robert Janczewski, Pawel Obszarski, Krzysztof Turowski:
2-Coloring number revisited. 187-195 - Thomas Schweser:
DP-degree colorable hypergraphs. 196-206 - Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali:
Tractability of König edge deletion problems. 207-215 - Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle:
Mim-width III. Graph powers and generalized distance domination problems. 216-236 - Matthew Moore:
Finite degree clones are undecidable. 237-271 - Mauro Castelli, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
Comparing incomplete sequences via longest common subsequence. 272-285 - Yuval Filmus:
Another look at degree lower bounds for polynomial calculus. 286-293 - Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono:
On the maximum weight minimal separator. 294-308
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.
last updated on 2025-11-20 00:14 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:
