default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 804
Volume 804, January 2020
- Yanwei Zhou, Bo Yang, Tao Wang, Yi Mu:
Novel updatable identity-based hash proof system and its applications. 1-28 - Marc Goerigk
, Adam Kasperski, Pawel Zielinski:
Two-stage combinatorial optimization problems under risk. 29-45 - Bijo S. Anand, S. V. Ullas Chandran, Manoj Changat, Mitre Costa Dourado, Ferdoos Hossein Nezhad, Prasanth G. Narasimha-Shenoi:
On the Carathéodory and exchange numbers of geodetic convexity in graphs. 46-57 - Marco Aurelio Stefanes, Diego P. Rubert, José Soares:
Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs. 58-71 - Meng Ji, Xueliang Li, Xiaoyu Zhu:
(Strong) conflict-free connectivity: Algorithm and complexity. 72-80 - Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy:
Range assignment of base-stations maximizing coverage area without interference. 81-97 - Michael A. Henning, Dinabandhu Pradhan:
Algorithmic aspects of upper paired-domination in graphs. 98-114 - Zhicong Lin:
Patterns of relation triples in inversion and ascent sequences. 115-125 - Maximilian Fürst, Dieter Rautenbach:
On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs. 126-138 - Zhao Wang, Yaping Mao, Sun-Yuan Hsieh, Jichang Wu:
On the g-good-neighbor connectivity of graphs. 139-148 - Paul C. Bell, Daniel Reidenbach, Jeffrey O. Shallit:
Unique decipherability in formal languages. 149-160 - Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Beyond level planarity: Cyclic, torus, and simultaneous level planarity. 161-170 - Mélodie Andrieu, Anna E. Frid:
Morphic words and equidistributed sequences. 171-185 - Marina Moscarini:
Computing a metric basis of a 2-connected bipartite distance-hereditary graph. 186-206 - Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan:
On the parameterized complexity of [1, j]-domination problems. 207-218 - Minh Ha Le, Vinh Duc Tran, Van Anh Trinh, Viet Cuong Trinh:
Compacting ciphertext in multi-channel broadcast encryption and attribute-based encryption. 219-235
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-06-11 21:05 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:
