default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 982
Volume 982, January 2024
- Rahul Jain
, Raghunath Tewari:
Space efficient algorithm for solving reachability using tree decomposition and separators. 114251 - Peng Yang, Yuan Huang, Zhiguo Fu:
The computational complexity of Holant problems on 3-regular graphs. 114256 - Yuzuru Tanaka:
Designing aperture 22k hexagonal grids and their indexing as factor rings of Eisenstein integers. 114257 - Xiaojun Zhao, Qingying Deng, Xiaowang Li:
Relating g-good-neighbor connectivity and g-good-neighbor diagnosability of strong digraph network. 114258 - Di Wang, Jinhui Xu:
Gradient complexity and non-stationary views of differentially private empirical risk minimization. 114259 - Nicola Rizzo, Massimo Equi, Tuukka Norri, Veli Mäkinen:
Elastic founder graphs improved and enhanced. 114269 - Michael A. Henning, Arti Pandey, Gopika Sharma, Vikash Tripathi:
Algorithms and hardness results for edge total domination problem in graphs. 114270 - Hoa T. Vu:
Revisiting maximum satisfiability and related problems in data streams. 114271 - Oliver Bachtler, Tim Bergner, Sven O. Krumke:
Almost disjoint paths and separating by forbidden pairs. 114272 - Sumin Huang, Sergey Kitaev:
On ordering of β-description trees. 114273 - Éric Duchêne, Nacim Oijid, Aline Parreau:
Bipartite instances of INFLUENCE. 114274 - Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos:
Filling crosswords is very hard. 114275 - Ling Gai, Weiwei Zhang, Zhao Zhang:
Selfish bin packing with punishment. 114276
- Elisabeth Remy, Paul Ruet:
From multivalued to Boolean functions: Preservation of soft nested canalization. 114277
- Sameep Dahal, Jukka Suomela:
Distributed half-integral matching and beyond. 114278 - Yi-Jun Chang:
The energy complexity of diameter and minimum cut computation in bounded-genus networks. 114279
- Davide Castelnovo, Fabio Gadducci, Marino Miculan:
A simple criterion for M,N-adhesivity. 114280
- Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar:
Popular critical matchings in the many-to-many setting. 114281 - Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Convex grid drawings of planar graphs with constant edge-vertex resolution. 114290 - Firat Kiyak, A. C. Cem Say:
Energy complexity of regular languages. 114291
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-02-26 20:48 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:
