Abstract is missing.
- A Roadmap for TAMCT. V. Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper. 1-6 [doi]
- A Tight Lower Bound Instance for k-means++ in Constant DimensionAnup Bhattacharya, Ragesh Jaiswal, Nir Ailon. 7-22 [doi]
- An Improved Upper-Bound for Rivest et al.'s Half-Lie ProblemBala Ravikumar, Duncan Innes. 23-38 [doi]
- Reversibility of Elementary Cellular Automata under Fully Asynchronous UpdateBiswanath Sethi, Nazim Fatès, Sukanta Das. 39-49 [doi]
- Finite State Incompressible Infinite SequencesCristian S. Calude, Ludwig Staiger, Frank Stephan. 50-66 [doi]
- Finding Optimal Strategies of Almost Acyclic Simple Stochastic GamesDavid Auger, Pierre Coucheney, Yann Strozecki. 67-85 [doi]
- The Parameterized Complexity of Domination-Type Problems and Application to Linear CodesDavid Cattanéo, Simon Perdrix. 86-103 [doi]
- On Representations of Abstract Systems with Partial Inputs and OutputsIevgen Ivanov. 104-123 [doi]
- Complexity Information Flow in a Multi-threaded Imperative LanguageJean-Yves Marion, Romain Péchoux. 124-140 [doi]
- A Personalized Privacy Preserving Method for Publishing Social Network DataJia Jiao, Peng Liu, Xianxian Li. 141-157 [doi]
- A Bit-Encoding Phase Selection Strategy for Satisfiability SolversJingchao Chen. 158-167 [doi]
- Generalized Finite Automata over Real and Complex NumbersKlaus Meer, Ameen Naif. 168-187 [doi]
- An Incremental Algorithm for Computing Prime Implicates in Modal LogicManoj K. Raut. 188-202 [doi]
- Approximation Algorithms for the Weight-Reducible Knapsack ProblemMarc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen. 203-215 [doi]
- Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect GraphsMatsuo Konagaya, Yota Otachi, Ryuhei Uehara. 216-228 [doi]
- A Pseudo-Random Bit Generator Based on Three Chaotic Logistic Maps and IEEE 754-2008 Floating-Point ArithmeticMichael François, David Defour, Pascal Berthomé. 229-247 [doi]
- Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set SystemsMin Lu, Tian Liu, Weitian Tong, Guohui Lin, Ke Xu. 248-258 [doi]
- Efficient Algorithms for the Label Cut ProblemsPeng Zhang. 259-270 [doi]
- A Dynamic Approach to Frequent Flyer ProgramRajiv Veeraraghavan, Rakesh Kashyap, Archita Chopde, Swapan Bhattacharya. 271-279 [doi]
- A Categorical Treatment of Malicious Behavioral ObfuscationRomain Péchoux, Thanh Dinh Ta. 280-299 [doi]
- Space Complexity of Optimization Problems in Planar GraphsSamir Datta, Raghav Kulkarni. 300-311 [doi]
- Fine-Tuning Decomposition Theorem for Maximum Weight Bipartite MatchingShibsankar Das, Kalpesh Kapoor. 312-322 [doi]
- Intersection Dimension of Bipartite GraphsSteven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara. 323-340 [doi]
- On the Parameterized Complexity for Token Jumping on GraphsTakehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka. 341-351 [doi]
- Universality of Spiking Neural P Systems with Anti-spikesVenkata Padmavati Metta, Alica Kelemenová. 352-365 [doi]
- Self-stabilizing Minimal Global Offensive Alliance Algorithm with Safe Convergence in an Arbitrary GraphYihua Ding, James Z. Wang, Pradip K. Srimani. 366-377 [doi]
- A Local-Global Approach to Solving Ideal Lattice ProblemsYuan Tian, Rongxin Sun, Xueyong Zhu. 378-400 [doi]
- Modular Form Approach to Solving Lattice ProblemsYuan Tian, Xueyong Zhu, Rongxin Sun. 401-421 [doi]