TAMC 2015 Accepted Papers

Zhaohui Wei and Shengyu Zhang. Quantum game players can have advantage without discord
Mitsunori Ogihara and Kei Uchizawa. Computational Complexity Studies of Synchronous Boolean Finite Dynamical Systems
Andris Ambainis and Jevgēnijs Vihrovs. Size of Sets with Small Sensitivity: a Generalization of Simon's Lemma
Nikhil Balaji and Samir Datta. Bounded Treewidth and Space-Efficient Linear Algebra
Lam Si Tung Ho, Vu Dinh, Nguyen Viet Cuong, Duy Duc Nguyen and Binh T. Nguyen. Learning From Non-iid Data: Fast Rates for the One-vs-All Multiclass Plug-in Classifier
Raghav Kulkarni, Youming Qiao and Xiaoming Sun. On the power of parity queries in Boolean decision trees
Xujin Chen, Xiaodong Hu and Changjun Wang. Finding Connected Dense $k$-Subgraphs
Henning Fernau, Alejandro Lopez-Ortiz and Jazmín Romero. Kernelization Algorithms for Packing Problems Allowing Overlaps
Robert Ganian, Martin Kronegger, Andreas Pfandler and Alexandru Popa. Parameterized Complexity of Asynchronous Border Minimization
Wanbin Son and Peyman Afshani. Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls
Arash Farzan, Alejandro Lopez-Ortiz, Patrick K. Nicholson and Alejandro Salinger. Algorithms in the Ultra-Wide Word Model
Joey Eremondi, Oscar Ibarra and Ian McQuillan. Deletion Operations on Deterministic Families of Automata
Pavel Dvořák and Dusan Knop. Parametrized complexity of length-bounded cuts and multi-cuts
Maciej Bendkowski, Katarzyna Grygiel and Marek Zaionc. Asymptotic properties of combinatory logic
Anthony Bonato, Marc Lozier, Dieter Mitsche, Xavier Perez-Gimenez and Pawel Pralat. The domination number of on-line social networks and random geometric graphs
Alexandre Talon and Jan Kratochvil. Completion of the mixed-unit interval graphs hierarchy
Jin-Yong Lin and Sheung-Hung Poon. Hardness and Algorithms on Signed Domination
Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier and Nimrod Talmon. The Complexity of Finding Effectors
Mingyu Xiao and Huan Tan. An Improved Exact Algorithm for Maximum Induced Matching
Laurent Bulteau, Vincent Froese and Nimrod Talmon. Multi-Player Diffusion Games on Graph Classes
Ning Ding. Some New Consequences of the Hypothesis that P Has Fixed Polynomial-size Circuits
Takuya Nishida, Yu-Ichi Hayashi, Takaaki Mizuki and Hideaki Sone. Card-Based Protocols for Any Boolean Function
Takehiro Ito, Hirotaka Ono and Yota Otachi. Reconfiguration of Cliques in a Graph
Nadine Losert. Where Join Preservation Fails in the Bounded Turing Degrees of C.E. Sets
Xin He and Dayu He. Star Shaped Orthogonal Drawing
Dayu He and Xin He. A Linear Time Algorithm for Testing Almost Bipartite Graphs
Kaspars Balodis, Jānis Iraids and Rusins Freivalds. Structured Frequency Algorithms
Arijit Bishnu, Sameer Desai, Arijit Ghosh, Mayank Goswami and Subhabrata Paul. Uniformity of point samples in metric spaces using gap ratio
Ankush Das, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi and Dominik Wojtczak. On Pure Nash Equilibria in Stochastic Games
Douglas Cenzer and Christopher Porter. Algorithmically Random Functions and Effective Capacities
Nans Lefebvre. The first-order contiguity of sparse random graphs with prescribed degrees
Sepp Hartung and Nimrod Talmon. The Complexity of Degree Anonymization by Graph Contractions
Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa and Ryuhei Uehara. Common Developments of Three Incongruent Boxes of Area 30
Stefano Facchini and Simon Perdrix. Quantum Circuits for the Unitary Permutation Problem
Reema Patel, Kevin Patel and Dhiren Patel. ExplicitPRISMSymm: Symmetry Reduction Technique for Explicit Models in PRISM