- Samuel N. Araújo, João Marcos Brito, Raquel Folz, Rosiane de Freitas, Rudini M. Sampaio:
Graph convexity impartial games: Complexity and winning strategies. Theor. Comput. Sci. 998: 114534 (2024) - N. R. Aravind, Neeldhara Misra, Harshil Mittal:
Chess is hard even for a single player. Theor. Comput. Sci. 1015: 114726 (2024) - Bogdan Armaselu:
Finding the largest separating rectangle among two point sets. Theor. Comput. Sci. 1017: 114778 (2024) - Michela Ascolese, Andrea Frosini, Elisa Pergola, Simone Rinaldi, Laurent Vuillon:
An algebraic approach to the reconstruction of uniform hypergraphs from their degree sequence. Theor. Comput. Sci. 1020: 114872 (2024) - Rocco Ascone, Giulia Bernardini, Luca Manzoni:
Fixed points and attractors of reactantless and inhibitorless reaction systems. Theor. Comput. Sci. 984: 114322 (2024) - Aistis Atminas, Vadim V. Lozin:
Deciding atomicity of subword-closed languages. Theor. Comput. Sci. 1003: 114595 (2024) - Romain Azaïs, Florian Ingels:
Detection of common subtrees with identical label distribution. Theor. Comput. Sci. 988: 114366 (2024) - Oliver Bachtler, Tim Bergner, Sven O. Krumke:
Almost disjoint paths and separating by forbidden pairs. Theor. Comput. Sci. 982: 114272 (2024) - Tian Bai, Mingyu Xiao:
Exact algorithms for restricted subset feedback vertex set in chordal and split graphs. Theor. Comput. Sci. 984: 114326 (2024) - Lora Bailey, Heather C. Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Elizabeth Bailey Matson, Inne Singgih, Grace Stadnyk, Xinyi Wang, Alexander Wiedemann:
Complexity and enumeration in models of genome rearrangement. Theor. Comput. Sci. 1022: 114880 (2024) - Stefan Balev, Eric Sanlaville, Jason Schoeters:
Temporally connected components. Theor. Comput. Sci. 1013: 114757 (2024) - Jørgen Bang-Jensen, Stéphane Bessy, Lucas Picasarri-Arrieta:
Constrained flows in networks. Theor. Comput. Sci. 1010: 114702 (2024) - Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz:
Graph realization of distance sets. Theor. Comput. Sci. 1019: 114810 (2024) - Ambroise Baril, Antoine Castillon, Nacim Oijid:
On the parameterized complexity of non-hereditary relaxations of clique. Theor. Comput. Sci. 1003: 114625 (2024) - Jean-Luc Baril, José Luis Ramírez, Fabio A. Velandia:
Bijections between directed-column convex polyominoes and restricted compositions. Theor. Comput. Sci. 1003: 114626 (2024) - Robert D. Barish, Tetsuo Shibuya:
String editing under pattern constraints. Theor. Comput. Sci. 1022: 114889 (2024) - Alexey Barsukov, Mamadou Moustapha Kanté:
Generalisations of matrix partitions: Complexity and obstructions. Theor. Comput. Sci. 1007: 114652 (2024) - Julien Baste, Antoine Castillon, Clarisse Dhaenens, Mohammed Haddad, Hamida Seba:
γ-clustering problems: Classical and parametrized complexity. Theor. Comput. Sci. 1018: 114784 (2024) - Julien Baste, Dimitri Watel:
An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth. Theor. Comput. Sci. 990: 114406 (2024) - Prashant Batra, Vikram Sharma:
Complexity of a root clustering algorithm for holomorphic functions. Theor. Comput. Sci. 999: 114504 (2024) - Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Bond percolation in small-world graphs with power-law distribution. Theor. Comput. Sci. 1011: 114717 (2024) - Bishnu Charan Behera, Somindu C. Ramanna:
Unbounded non-zero inner product encryption. Theor. Comput. Sci. 1000: 114548 (2024) - Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Convex grid drawings of planar graphs with constant edge-vertex resolution. Theor. Comput. Sci. 982: 114290 (2024) - Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino:
Envy-free relaxations for goods, chores, and mixed items. Theor. Comput. Sci. 1002: 114596 (2024) - Daniel Berend, Liat Cohen, Omrit Filtser:
A tour of general Hanoi graphs. Theor. Comput. Sci. 983: 114289 (2024) - Daniel Berend, S. Mamana:
A probabilistic algorithm for vertex cover. Theor. Comput. Sci. 983: 114306 (2024) - Sophie Berthelette, Gilles Brassard, Xavier Coiteux-Roy:
On computable numbers, with an application to the Druckproblem. Theor. Comput. Sci. 1002: 114573 (2024) - Bernard Berthomieu, Dmitry A. Zaitsev:
Sleptsov nets are Turing-complete. Theor. Comput. Sci. 986: 114346 (2024) - Subhash Bhagat, Andrzej Pelc:
Deterministic rendezvous in infinite trees. Theor. Comput. Sci. 984: 114313 (2024) - Christian Bianchini, Alberto Policriti, Brian Riccardi, Riccardo Romanello:
Incremental NFA minimization. Theor. Comput. Sci. 1004: 114621 (2024)