Journal: Theory Comput. Syst.

Volume 69, Issue 4

33 -- 0Thomas Bosman, Martijn van Ee, Ekin Ergen, Csanád Imreh, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie. Total Completion Time Scheduling Under Scenarios
34 -- 0Jingnan Xie, Harry B. Hunt III, Richard Edwin Stearns. Decision Problems Concerning L Systems
35 -- 0Takashi Horiyama, Kazuhisa Seto, Ryu Suzuki. The Complexity of Pre-assignment Problem for Unique Minimum Vertex Cover on Bipartite Graphs
36 -- 0Sunny Kumar Sharma, Vijay Kumar Bhat, Latif Hanna, Maryam Al-Kandari. Some Symmetrical Planar Structures with their Fault-Tolerant Metric Dimension
37 -- 0Kangyi Tian, Mingyu Xiao 0001, Boting Yang. Improved Parameterized Algorithms for Cluster Vertex Deletion
38 -- 0S. Anil Kumar, N. S. Narayanaswamy. A Geometric Programming Approach to Solve the Restricted Assignment Case of the Santa Claus Problem
39 -- 0Irving van Heuven van Staereling, Bart de Keijzer, Guido Schäfer. The Ground-Set-Cost Budgeted Maximum Coverage Problem
40 -- 0Pallavi Mishra, Rachna Bhatia, Predrag S. Stanimirovic, D. K. Gupta 0001, Rakesh P. Badoni. Unveiling Order in Chaos: A Systematic Approach Based on Graph Theory in Enumerating Sudoku Grids of Rank n

Volume 69, Issue 3

26 -- 0Wesley Calvert, Emma Gruner, Elvira Mayordomo, Daniel Turetsky, Java Darleen Villano. Normality, Relativization, and Randomness
27 -- 0Gunther Bidlingmaier. Greedy Minimum-Energy Scheduling
28 -- 0Tung-Wei Kuo. Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line
29 -- 0Xuehou Tan. An Optimal and Practical Algorithm for the Planar 2-center Problem
30 -- 0Gonzalo Navarro 0001. (Worst-case) Optimal Adaptive Dynamic Bitvectors
31 -- 0Jean-Paul Allouche, John M. Campbell 0001, Shuo Li, Jeffrey O. Shallit, Manon Stipulanti. The Reflection Complexity of Sequences Over Finite Alphabets
32 -- 0Tomohiro I, Dominik Köppl, Hiroshi Sakamoto, Sohei Yamaguchi. Space-Efficient B Trees via Load-Balancing

Volume 69, Issue 2

19 -- 0Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Giuseppe Romana, Marinella Sciortino, Cristian Urbina. Bit Catastrophes for the Burrows-Wheeler Transform
20 -- 0K. Subramani 0001, Piotr Wojciechowski 0002, Alvaro Velasquez. Correction to: Farkas Bounds on Horn Constraint Systems
21 -- 0Marat Kh. Faizrahmanov. Control Structures in Computable Numberings and the Completion Operator
22 -- 0Erik D. Demaine, Kritkorn Karntikoon, Nipun Pitimanaaree. 2-Colorable Perfect Matching is NP-complete in 2-Connected 3-Regular Planar Graphs
23 -- 0Jérôme Lang, Nicolas Maudet, Maria Polukarov, Alice Cohen-Hadria. Strategic Candidacy Equilibria for Common Voting Rules
24 -- 0Dimitris Fotakis 0001, Alkis Kalavasis, Eleni Psaroudaki. Label Ranking Through Nonparametric Regression
25 -- 0Duncan Adamson, Paul Sarnighausen-Cahn, Marius Dumitran, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer. Longest Common Subsequence with Gap Constraints

Volume 69, Issue 1

1 -- 0Nikolay Bazhenov 0001, Manat Mustafa. On learning down-sets in quasi-orders, and ideals in Boolean algebras
2 -- 0Takashi Ishizuka. Note on Constrained Long Choice with Multiple Beginning Elements
3 -- 0Sagar Massand, Sunil Simon. One-Sided Markets with Externalities
4 -- 0Junda Li, Yuan Huang, Yanlin Zheng. Dichotomy for Non-negative Valued Holant Problems on 3-Regular Bipartite Graphs
5 -- 0Barbara M. Anthony, Ricky Birnbaum, Sara Boyd, Christine Chung 0001, Ananya Das 0003, Patrick Davis, Jigar Dhimar, Duc Tran, David S. Yuen. Maximizing Rides Served for Dial-a-Ride on the Uniform Metric
6 -- 0Ryo Hiromasa, Akihiro Mizutani, Yuki Takeuchi, Seiichiro Tani. Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection
7 -- 0Christian Komusiewicz, Nils Morawietz. Can Local Optimality Be Used for Efficient Data Reduction?
8 -- 0Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada 0001. Gathering on Rings for Myopic Asynchronous Robots with Lights
9 -- 0Narad Rampersad, Jeffrey O. Shallit. Rudin-Shapiro Sums Via Automata Theory and Logic
10 -- 0Pallavi Jain 0001, Lawqueen Kanesh, Willian Lochet, Saket Saurabh 0001, Roohani Sharma. Exact and Approximate Digraph Bandwidth
11 -- 0Gaojie Chi, Longkun Guo, Chaoqi Jia. A Local Search Algorithm for the Radius-Constrained k-Median Problem
12 -- 0Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski. Online Matching with Delays and Stochastic Arrival Times
13 -- 0Kazumasa Shinagawa, Daiki Miyahara, Takaaki Mizuki. How to Play Old Maid with Virtual Players
14 -- 0Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker. Online Unbounded Knapsack
15 -- 0Zebin Wang, Chenhui Jin, Jiyan Zhang, Ting Cui. Improved Methods to Solve Nonlinear Invariants with Low Algebraic Degree for Linear Transformation
16 -- 0Eric Balkanski, Tingting Ou, Clifford Stein 0001, Hao-Ting Wei. Scheduling with Speed Predictions
17 -- 0Andrew Bloch-Hansen, Roberto Solis-Oba, Andy Yu. High Multiplicity Strip Packing with Three Rectangle Types
18 -- 0Kazumasa Shinagawa, Daiki Miyahara, Takaaki Mizuki. Correction to: How to Play Old Maid with Virtual Players