default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 1056
Volume 1056, 2025
- Robert M. Alaniz, Bin Fu, Timothy Gomez, Elise Grizzell, Andrew Rodriguez, Marco Rodriguez, Robert T. Schweller, Tim Wylie:
Reachability in restricted chemical reaction networks. 115514 - Qianhong Liu, Fan Wang:
Edge-bipancyclicity of hypercubes with faulty edges. 115503 - Aixia Liu, Shuchang Chai, Lina Li, Chenhui Liang, Jun Yuan
:
The local diagnosability of directed interconnection networks. 115504 - Yimeng Xu, Jiaqi Zheng, Guihai Chen, Xia Zhu, Zhen Yao:
Online multi-dimensional generalized assignment problem with predictions. 115505 - Sungmin Kim, Yo-Sub Han:
Approximate Cartesian tree pattern matching. 115506 - Yuxin Zhang, Shengli Liu, Yunxiao Zhou, Haibin Zhang:
Full-grained proxy re-encryption for all circuits. 115507 - Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
Temporal graph realization from fastest paths. 115508 - Daniel Gibney, Paul Macnichol, Sharma V. Thankachan:
Non-overlapping indexing in BWT-runs bounded space. 115512 - Xiaoping Zhu, Jianming Zhu, Priyanshi Garg, Guoqing Wang:
Target influence maximization problem under avoiding unexpected users interruption in online social network. 115513 - Raphaël Henry:
On the minimal components of substitution subshifts. 115517 - Jingyang Zhao, Mingyu Xiao, Chao Xu:
The traveling tournament problem: Improved algorithms based on cycle packing. 115519 - Matthew Connor, Othon Michail, George Skretas:
All for one and one for all: An O(1)-musketeers generic transformation for rotating robots. 115521 - Laurent Feuilloley, Jan Janousek, Jan Matyás Kristan, Josef Erik Sedlácek:
Decreasing verification radius in local certification. 115520 - Anthony Bonato, Caleb Jones, Trent G. Marbach, Teddy Mishura, Zhiyuan Zhang:
Hypergraph burning, matchings, and zero forcing. 115529 - Jasine Babu, K. Murali Krishnan, Veena Prabhakaran, Nandini J. Warrier:
Computing eternal vertex cover number of maximal outerplanar graphs in linear time. 115530 - Vuong Bui:
Growth of bilinear maps III: decidability. 115515 - Nicola Galesi, Fariba Ranjbar:
The complexity of boolean failure identification. 115536 - Jeremy Chizewer, Stephen Melczer, J. Ian Munro, Ava Pun:
Succinct encodings of binary trees with application to AVL trees. 115537 - Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Max-SAT with cardinality constraint parameterized by the number of clauses. 115540 - Davide Bilò, Luca Di Donato, Luciano Gualà, Stefano Leucci:
Uniform-budget solo chess with only rooks or only knights is hard. 115544 - Christian Ortlieb:
Toward Grünbaum's conjecture bounding vertices of degree 4. 115551
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-12-09 23:40 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:
