| 2013 | Finding Theorems in NBG Set Theory by Automated Forward Deduction Based on Strong Relevant Logic. | Hongbiao Gao, Kai Shi, Yuichi Goto, Jingde Cheng |
| 2013 | Sublinear Time Approximate Sum via Uniform Random Sampling. | Bin Fu, Wenfeng Li, Zhiyong Peng |
| 2013 | Improved Lower Bounds for the Online Bin Packing Problem with Cardinality Constraints. | Hiroshi Fujiwara, Koji M. Kobayashi |
| 2013 | Time/Memory/Data Tradeoffs for Variants of the RSA Problem. | Pierre-Alain Fouque, Damien Vergnaud, Jean-Christophe Zapalowicz |
| 2013 | Random Methods for Parameterized Problems. | Qilong Feng, Jianxin Wang, Shaohua Li, Jianer Chen |
| 2013 | Facets for Art Gallery Problems. | Sndor P. Fekete, Stephan Friedrichs, Alexander Krller, Christiane Schmidt |
| 2013 | A New Model for Product Adoption over Social Networks. | Lidan Fan, Zaixin Lu, Weili Wu, Yuanjun Bi, Ailian Wang |
| 2013 | Selection from Read-Only Memory with Limited Workspace. | Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti |
| 2013 | On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets. | Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani |
| 2013 | Bounded Model Checking for Propositional Projection Temporal Logic. | Zhenhua Duan, Cong Tian, Mengfei Yang, Jia He |
| 2013 | A Toolbox for Provably Optimal Multistage Strict Group Testing Strategies. | Peter Damaschke, Azam Sheikh Muhammad |
| 2013 | Maximum Balanced Subgraph Problem Parameterized above Lower Bound. | Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia |
| 2013 | A Linear-Time Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian Product. | Christophe Crespelle, Eric Thierry, Thomas Lambert |
| 2013 | On the Conjunctive Capacity of Graphs. | Miroslav Chlebk, Janka Chlebkov |
| 2013 | Metrical Service Systems with Multiple Servers. | Ashish Chiplunkar, Sundar Vishwanathan |
| 2013 | A Fast Algorithm for Data Collection along a Fixed Track. | Otfried Cheong, Radwa El Shawi, Joachim Gudmundsson |
| 2013 | An Efficient Algorithm for One-Sided Block Ordering Problem with Block-Interchange Distance. | Kun-Tze Chen, Chi-Long Li, Chung-Han Yang, Chin Lung Lu |
| 2013 | How to Schedule the Marketing of Products with Negative Externalities. | Zhigang Cao, Xujin Chen, Changjun Wang |
| 2013 | On the Complexity of Solving or Approximating Convex Recoloring Problems. | Manoel B. Camplo, Cristiana Gomes Huiban, Rudini M. Sampaio, Yoshiko Wakabayashi |
| 2013 | How to Catch | Vladimir Braverman, Ran Gelles, Rafail Ostrovsky |
| 2013 | The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. | Hans-Joachim Bckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock |
| 2013 | Community Expansion Model Based on Charged System Theory. | Yuanjun Bi, Weili Wu, Ailian Wang, Lidan Fan |
| 2013 | New Bounds for the Balloon Popping Problem. | Davide Bil, Vittorio Bil |
| 2013 | On the Advice Complexity of the Online | Maria Paola Bianchi, Hans-Joachim Bckenhauer, Juraj Hromkovic, Sacha Krug, Bjrn Steffen |
| 2013 | The | Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, Jos Neto |