Journal: Theory Comput. Syst.

Volume 63, Issue 6

1131 -- 1184Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer. Minimal Distance of Propositional Models
1185 -- 1206Yasushi Kawase, Xin Han, Kazuhisa Makino. Unit Cost Buyback Problem
1207 -- 1227Warut Suksompong. On Black-Box Transformations in Downward-Closed Environments
1228 -- 1249Vittorio Bilò, Cosimo Vinci. On Stackelberg Strategies in Affine Congestion Games
1250 -- 1277Beate Bollig, Matthias Buttkus. On the Relative Succinctness of Sentential Decision Diagrams
1278 -- 1297Juling Zhang, Guowu Yang, William N. N. Hung, Tian Liu, Xiaoyu Song, Marek A. Perkowski. A Group Algebraic Approach to NPN Classification of Boolean Functions
1298 -- 1313Mike Behrisch, Edith Vargas-García, Dmitriy Zhuk. The Number of Clones Determined by Disjunctions of Unary Relations
1314 -- 1335Elliot Anshelevich, Onkar Bhardwaj, Koushik Kar. Strategic Network Formation Through an Intermediary
1336 -- 1357Dibyayan Chakraborty, Sandip Das 0001, Joydeep Mukherjee, Uma Kant Sahoo. Bounds on the Bend Number of Split and Cocomparability Graphs
1358 -- 1387Frank Gurski, Carolin Rehs. Comparing Linear Width Parameters for Directed Graphs
1388 -- 1412Klaus Ambos-Spies, Timur Bakibayev. Weak Completeness Notions for Exponential Time
1413 -- 1447Spyros Angelopoulos 0001. Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems