Accepted Papers

1. Jianer Chen, Iyad Kanj and Ge Xia. On Parameterized Exponential Time Complexity
2. Zhilin Wu and Stephane Grumbach. Feasibility of Motion Planning on Directed Graphs
3. Takaaki Mizuki, Hitoshi Tsubata and Takao Nishizeki. Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions
4. Maren Martens. A Simple Greedy Algorithm for the k-Disjoint Flow Problem
5. Lusheng Wang and Binhai Zhu. On the Tractability of Maximal Strip Recovery
6. Jin-Yi Cai, Pinyan Lu and Mingji Xia. A Computational Approach to Proving Computational Complexity of Some Counting Problems
7. Peng Zhang, Jin-Yi Cai, Linqing Tang and Wenbo Zhao. Approximation and Hardness Results for Label Cut and Related Problems
8. Pinar Heggernes, Daniel Meister and Charis Papadopoulos. A complete characterisation of the linear clique-width of path powers
9. Xiao Yin and Daming Zhu. Polynomial-time algorithm for sorting by generalized translocations
10. Han Zhu. Testing Equivalence on Fair Ambient
11. Michael Elberfeld, Ilka Schnoor and Till Tantau. Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data
12. Atish Das Sarma, Richard J. Lipton and Danupon Nanongkai. Best-Order Streaming model
13. Ernst-Erich Doberkat. Behavioral and Logical Equivalence of Stochastic Kripke Models in General Measurable Spaces
14. Carsten Witt. Greedy Local Search and Vertex Cover in Sparse Random Graphs
15. Jianxin Wang and Guohong Jiang. A Fixed-parameter Enumeration Algorithm for Weighted FVS Problem
16. Sophie Toulouse and Roberto Wolfler Calvo. On the complexity of the multiple stack TSP
17. Xuehou tan and Bo Jiang. Searching a circular corridor with two flashlights
18. Maw-Shang Chang, Ling-Ju Hung, Ton Kloks and Sheng-Lung Peng. Block-graph Width
19. Douglas Cenzer, Johanna N.Y. Franklin, Jiang Liu and Guohua Wu. Embedding the diamond lattice in the c.e. tt-degrees with superhigh atoms
20. Qilong Feng, Yang Liu, Songjian Lu and Jianxin Wang. Improved Deterministic Algorithms for Weighted Matching and Packing Problems
21. Jiri Fiala, Petr Golovach and Jan Kratochvil. Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
22. Christoph Schubert. Terminal Coalgebras for Measure-Polynomial Functors
23. Bin Fu, Ming-Yang Kao and Lusheng Wang. Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability
24. Anke van Zuylen. Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
25. Ei Ando, Hirotaka Ono, Kunihiko Sadakane and Masafumi Yamashita. Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG
26. Andrea Sorbi, Guohua Wu and Yue Yang. High Minimal Pairs in the Enumeration Degrees
27. Klaus Ambos-Spies and Thorsten Kräling. Quantitative Aspects of Speed-Up and Gap Phenomena
28. Markus Hinkelmann and Andreas Jakoby. Preserving Privacy versus Data Retention
29. Zongyang Zhang and Zhenfu Cao. An observation on non-malleable witness-indistinguishability and non-malleable zero-knowledge
30. Ruei-Yuan Chang, Guanling Lee and Sheng-Lung Peng. Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs
31. Jasper Berendsen, Taolue Chen and David N. Jansen. Undecidability of Cost-bounded Reachability in Priced Probabilistic Timed Automata
32. Fangju Wang and Kyle Swegles. An Online Algorithm for Applying Reinforcement Learning to Handle Ambiguity in Spoken Dialogues
33. Michael Weiss and Gregory Lafitte. An almost totally universal tile set
34. Marc Kaplan and Sophie Laplante. Kolmogorov complexity and combinatorial methods in communication complexity
35. Daniel Lokshtanov, Matthias Mnich and Saket Saurabh. Linear Kernel for Planar Connected Dominating Set
36. Faisal Abu-Khzam. A Quadratic Kernel for 3-Set Packing
37. Sergey Bereg, Minghui Jiang, Boting Yang and Binhai Zhu. On the Red/Blue Spanning Tree Problem
38. John Z. Zhang. The Two-Guard Polygon Walk Problem (Extended Abstract)
39. Evangelos Bampas, Andreas-Nikolas Göbel, Aris Pagourtzis and Aris Tentes. On the connection between interval size functions and path counting
40. Paulo E. D. Pinto, Fabio Protti and Jayme L. Szwarcfiter. Exact and experimental algorithms for a Huffman-based error detecting code