The following papers are accepted for presentation
- Faisal Abu-Khzam, Shaowei Cai, Judith Egan, Peter Shaw, Kai Wang. Turbo-charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis
- Shareef Ahmed, Md. Saidur Rahman. Multi-interval Pairwise Compatibility Graphs
- Nikolay Bazhenov. A Note on Effective Categoricity for Linear Orderings
- Tristan Braquelaire, Marie Gasparoux, Mathieu Raffinot, Raluca Uricaru. On the shortest common superstring of NGS reads
- Florian Bridoux, Pierre Guillon, Kevin Perrot, Sylvain Sené, Guillaume Theyssier. On the cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One
- Diptarka Chakraborty, Satyadev Nandakumar, Himanshu Shukla. On Resource-bounded versions of the van Lambalgen's theorem
- Vincent Chau, Minming Li, Kai Wang. Scheduling Fully Parallel Jobs with Integer Parallel Units
- Xujin Chen, Xiaodong Hu, Changjun Wang, Ying Zhang. Continuous Firefighting on Infinite Square Grids
- Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta. Mediated Population Protocols: Leader Election and Applications
- Ning Ding, Yanli Ren, Dawu Gu. Learning AC^0 under k-Dependent Distributions
- Henning Fernau, Lakshmanan Kuppusamy. Parikh Images of Matrix Ins-del Systems
- Guillaume Fertin, Julien Fradin, Géraldine Jean. Algorithmic Aspects of the Maximum Colorful Arborescence Problem
- Olivier Finkel. Incompleteness Theorems, Large Cardinals, and Automata over finite Words
- Chi Kit Ken Fong, Minming Li, Yungao Li, Sheung-Hung Poon, Weiwei Wu, Yingchao Zhao. Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity
- Emanuele Frittaion, Silvia Steila, Keita Yokoyama. The strength of the SCT criterion
- Roland Glück. Covering Polygons with Rectangles
- Jie Han. The complexity of perfect packings in dense graphs
- Tesshu Hanaka, Hans L. Bodlaender, Tom van der Zanden, Hirotaka Ono. On the Maximum Weight Minimal Separator
- Yuguo He. Pebble games over ordered structural abstractions
- Mamadou Moustapha Kanté, Takeaki Uno. Counting Minimal Dominating Sets
- Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, Jiehua Chen. On the Computational Complexity of Variants of Combinatorial Voter Control in Elections
- Hans Kleine Büning, Piotr Wojciechowski, K. Subramani. On the computational complexity of read once resolution decidability in 2CNF formulas
- Sang-Ki Ko, Igor Potapov. Vector Ambiguity and Freeness Problems in SL(2,Z)
- Minming Li, Frances Yao, Hao Yuan. An O(n^2) Algorithm for Computing Optimal Continuous Voltage Schedules
- Andrzej Lingas. Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution
- Andrzej Lingas, Mia Persson, Dzmitry Sledneu. Bounds for Semi-disjoint Bilinear Forms in a Unit-cost Computational Model
- Neil Lutz, D. M. Stull. Bounding the Dimension of Points on a Line
- Arthur Milchior. Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order
- Luca Paolini, Margherita Zorzi. qPCF: a language for quantum circuit computations
- Daniël Paulusma, Christophe Picouleau, Bernard Ries. Blocking Independent Sets for H-free graphs via Edge Contractions and Vertex Deletions
- Iosif Petrakis. A density theorem for hierarchies of limit spaces over separable metric spaces
- Photchchara Pisantechakool, Xuehou Tan. On the Conjecture of the Smallest 3-Cop-Win Planar Graph
- Sheung-Hung Poon, Wei-Lin Wang. On Complexity of Total Vertex Cover on Subcubic Graphs
- Mozhgan Pourmoradnasseri, Dirk Oliver Theis. Nondeterministic Communication Complexity of random Boolean functions
- Heiko Röglin, Clemens Rösner. The Smoothed Number of Pareto-optimal Solutions in Non-integer Bicriteria Optimization
- Sam Sanders. From Nonstandard Analysis to various flavours of Computability Theory
- Yangguang Shi, Fa Zhang, Zhiyong Liu. Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs
- Maciej Skorski. A Cryptographic Proof of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds
- Maciej Skorski. On the complexity of breaking pseudoentropy
- Xuehou Tan, Bo Jiang. Efficient algorithms for touring a sequence of convex polygons and related problems
- Tomáš Toufar, Tomáš Masařík. Parameterized complexity of fair deletion problems
- Huishan Wu, Guohua Wu. Degrees of Word Problem for Algebras without Finitely Presented Expansions
- Mingyu Xiao, Shaowei Kou. Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
- Yuan Xue, Boting Yang. Fast Searching on Cartesian Products of Graphs
- Anand Yeolekar, Kumar Madhukar, Dipali Bhutada, Venkatesh R. Sequentialization Using Timestamps