Abstract is missing.
- Cognitive Reasoning and Trust in Human-Robot InteractionsMarta Kwiatkowska. 3-11 [doi]
- On Choice Rules in Dependent Type TheoryMaria Emilia Maietti. 12-23 [doi]
- Natural Language Processing, Moving from Rules to DataAdrian Horia Dediu, Joana M. Matos, Carlos Martín-Vide. 24-38 [doi]
- An All-or-Nothing Flavor to the Church-Turing HypothesisStefan Wolf. 39-56 [doi]
- Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental AnalysisFaisal N. Abu-Khzam, Shaowei Cai, Judith Egan, Peter Shaw, Kai Wang. 59-70 [doi]
- Multi-interval Pairwise Compatibility Graphs - (Extended Abstract)Shareef Ahmed, Md. Saidur Rahman 0001. 71-84 [doi]
- A Note on Effective Categoricity for Linear OrderingsNikolay Bazhenov. 85-96 [doi]
- On the Shortest Common Superstring of NGS ReadsTristan Braquelaire, Marie Gasparoux, Mathieu Raffinot, Raluca Uricaru. 97-111 [doi]
- On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential OneFlorian Bridoux, Pierre Guillon 0001, Kévin Perrot, Sylvain Sené, Guillaume Theyssier. 112-128 [doi]
- On Resource-Bounded Versions of the van Lambalgen TheoremDiptarka Chakraborty, Satyadev Nandakumar, Himanshu Shukla. 129-143 [doi]
- Scheduling Fully Parallel Jobs with Integer Parallel UnitsVincent Chau, Minming Li, Kai Wang. 144-157 [doi]
- Continuous Firefighting on Infinite Square GridsXujin Chen, Xiaodong Hu, Changjun Wang, Ying Zhang. 158-171 [doi]
- Mediated Population Protocols: Leader Election and ApplicationsShantanu Das 0001, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta. 172-186 [doi]
- 0 Under k-Dependent DistributionsNing Ding, Yanli Ren, Dawu Gu. 187-200 [doi]
- Parikh Images of Matrix Ins-Del SystemsHenning Fernau, Lakshmanan Kuppusamy. 201-215 [doi]
- Algorithmic Aspects of the Maximum Colorful Arborescence ProblemGuillaume Fertin, Julien Fradin, Géraldine Jean. 216-230 [doi]
- Incompleteness Theorems, Large Cardinals, and Automata over Finite WordsOlivier Finkel. 231-246 [doi]
- Scheduling Tasks to Minimize Active Time on a Processor with Unlimited CapacityKen C. K. Fong, Minming Li, Yungao Li, Sheung-Hung Poon, Weiwei Wu, Yingchao Zhao. 247-259 [doi]
- The Strength of the SCT CriterionEmanuele Frittaion, Silvia Steila, Keita Yokoyama. 260-273 [doi]
- Covering Polygons with RectanglesRoland Glück. 274-288 [doi]
- The Complexity of Perfect Packings in Dense GraphsJie Han. 289-303 [doi]
- On the Maximum Weight Minimal SeparatorTesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono. 304-318 [doi]
- Pebble Games over Ordered Structural AbstractionsYuguo He. 319-332 [doi]
- Counting Minimal Dominating SetsMamadou Moustapha Kanté, Takeaki Uno. 333-347 [doi]
- On the Computational Complexity of Variants of Combinatorial Voter Control in ElectionsLeon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, Jiehua Chen. 348-361 [doi]
- On the Computational Complexity of Read once Resolution Decidability in 2CNF FormulasHans Kleine Büning, Piotr J. Wojciechowski, K. Subramani. 362-372 [doi]
- Vector Ambiguity and Freeness Problems in SL (2, ℤ)Sang-Ki Ko, Igor Potapov. 373-388 [doi]
- 2) Algorithm for Computing Optimal Continuous Voltage SchedulesMinming Li, Frances F. Yao, Hao Yuan. 389-400 [doi]
- Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean ConvolutionAndrzej Lingas. 401-411 [doi]
- Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational ModelAndrzej Lingas, Mia Persson, Dzmitry Sledneu. 412-424 [doi]
- Bounding the Dimension of Points on a LineNeil Lutz, Donald M. Stull. 425-439 [doi]
- Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and OrderArthur Milchior. 440-454 [doi]
- qPCF: A Language for Quantum Circuit ComputationsLuca Paolini, Margherita Zorzi. 455-469 [doi]
- Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex DeletionsDaniël Paulusma, Christophe Picouleau, Bernard Ries. 470-483 [doi]
- A Density Theorem for Hierarchies of Limit Spaces over Separable Metric SpacesIosif Petrakis. 484-498 [doi]
- On the Conjecture of the Smallest 3-Cop-Win Planar GraphPhotchchara Pisantechakool, Xuehou Tan. 499-514 [doi]
- On Complexity of Total Vertex Cover on Subcubic GraphsSheung-Hung Poon, Wei-Lin Wang. 515-528 [doi]
- Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract)Mozhgan Pourmoradnasseri, Dirk Oliver Theis. 529-542 [doi]
- The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria OptimizationHeiko Röglin, Clemens Rösner. 543-555 [doi]
- From Nonstandard Analysis to Various Flavours of Computability TheorySam Sanders. 556-570 [doi]
- Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed GraphsYangguang Shi, Fa Zhang, Zhiyong Liu. 571-585 [doi]
- A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined BoundsMaciej Skórski. 586-599 [doi]
- On the Complexity of Breaking PseudoentropyMaciej Skórski. 600-613 [doi]
- Efficient Algorithms for Touring a Sequence of Convex Polygons and Related ProblemsXuehou Tan, Bo Jiang. 614-627 [doi]
- Parameterized Complexity of Fair Deletion ProblemsTomás Masarík, Tomás Toufar. 628-642 [doi]
- Degrees of Word Problem for Algebras Without Finitely Presented ExpansionsGuohua Wu, Huishan Wu. 643-653 [doi]
- Kernelization and Parameterized Algorithms for 3-Path Vertex CoverMingyu Xiao, Shaowei Kou. 654-668 [doi]
- Fast Searching on Cartesian Products of GraphsYuan Xue, Boting Yang. 669-683 [doi]
- Sequentialization Using TimestampsAnand Yeolekar, Kumar Madhukar, Dipali Bhutada, R. Venkatesh. 684-696 [doi]