| 2010 | A dexptime-Complete Dolev-Yao Theory with Distributive Encryption. Anguraj Baskar, Ramaswamy Ramanujam, S. P. Suresh |
| 2010 | Algorithmic Lower Bounds for Problems on Decomposable Graphs. Daniel Lokshtanov |
| 2010 | All Symmetric Predicates in Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis |
| 2010 | Asynchronous Omega-Regular Games with Partial Information. Bernd Puchala |
| 2010 | Balanced Queries: Divide and Conquer. Dmitri Akatov, Georg Gottlob |
| 2010 | Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds. Kenya Ueno |
| 2010 | Connected Searching of Weighted Trees. Dariusz Dereniowski |
| 2010 | Counting Classes and the Fine Structure between NC Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer |
| 2010 | Counting Dependent and Independent Strings. Marius Zimand |
| 2010 | Counting Minimum ( Ivona Bezáková, Adam J. Friedlander |
| 2010 | Describing Average- and Longtime-Behavior by Weighted MSO Logics. Manfred Droste, Ingmar Meinecke |
| 2010 | Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains. Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc |
| 2010 | Distance Constraint Satisfaction Problems. Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker |
| 2010 | Do We Really Understand the Crossing Numbers? Bojan Mohar |
| 2010 | Does Treewidth Help in Modal Satisfiability? - (Extended Abstract). M. Praveen |
| 2010 | Enumeration of the Monomials of a Polynomial and Related Complexity Classes. Yann Strozecki |
| 2010 | Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model. Gero Greiner, Riko Jacob |
| 2010 | Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks. Beate Bollig |
| 2010 | Faster Algorithms on Branch and Clique Decompositions. Hans L. Bodlaender, Erik Jan van Leeuwen, Johan M. M. van Rooij, Martin Vatshelle |
| 2010 | Faster Approximation Schemes and Parameterized Algorithms on Siamak Tazari |
| 2010 | Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. Davide Bilò, Luciano Gualà, Guido Proietti |
| 2010 | Finding and Counting Vertex-Colored Subtrees. Sylvain Guillemot, Florian Sikora |
| 2010 | Frame Definability for Classes of Trees in the Gaëlle Fontaine, Thomas Place |
| 2010 | Harnessing ML Giulio Manzonetto, Paolo Tranquilli |
| 2010 | Impossibility of Independence Amplification in Kolmogorov Complexity Theory. Marius Zimand |
| 2010 | Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems. Davide Bilò, Luciano Gualà, Guido Proietti |
| 2010 | Improved Simulation of Nondeterministic Turing Machines. Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh |
| 2010 | Information Complexity of Online Problems. Juraj Hromkovic, Rastislav Královic, Richard Královic |
| 2010 | Iterated Regret Minimization in Game Graphs. Emmanuel Filiot, Tristan Le Gall, Jean-François Raskin |
| 2010 | Least and Greatest Solutions of Equations over Sets of Integers. Artur Jez, Alexander Okhotin |
| 2010 | Limiting Negations in Bounded Treewidth and Upward Planar Circuits. Jing He, Hongyu Liang, Jayalal Sarma |
| 2010 | Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings Petr Hlinený, Antonín Kucera |
| 2010 | Mesh Deformation of Dynamic Smooth Manifolds with Surface Correspondences. Ho-Lun Cheng, Ke Yan |
| 2010 | Meta-Envy-Free Cake-Cutting Protocols. Yoshifumi Manabe, Tatsuaki Okamoto |
| 2010 | New Developments in Quantum Algorithms. Andris Ambainis |
| 2010 | On Factor Universality in Symbolic Spaces. Laurent Boyer, Guillaume Theyssier |
| 2010 | On Problem Kernels for Possible Winner Determination under the Nadja Betzler |
| 2010 | On the Topological Complexity of MSO+U and Related Automata Models. Szczepan Hummel, Michal Skrzypczak, Szymon Torunczyk |
| 2010 | Online Clustering with Variable Sized Clusters. János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin |
| 2010 | Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. Stefan Kratsch, Dániel Marx, Magnus Wahlström |
| 2010 | Parity Games with Partial Information Played on Graphs of Bounded Complexity. Bernd Puchala, Roman Rabinovich |
| 2010 | Persistent Homology under Non-uniform Error. Paul Bendich, Herbert Edelsbrunner, Michael Kerber, Amit K. Patel |
| 2010 | Proof Systems and Transformation Games. Yoram Bachrach, Michael Zuckerman, Michael J. Wooldridge, Jeffrey S. Rosenschein |
| 2010 | Properties of Visibly Pushdown Transducers. Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot |
| 2010 | Qualitative Analysis of Partially-Observable Markov Decision Processes. Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger |
| 2010 | Randomness for Free. Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Thomas A. Henzinger |
| 2010 | Resource Combinatory Algebras. Alberto Carraro, Thomas Ehrhard, Antonino Salibra |
| 2010 | Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets. Philippe Schnoebelen |
| 2010 | Robust Computations with Dynamical Systems. Olivier Bournez, Daniel Silva Graça, Emmanuel Hainry |
| 2010 | Scheduling Real-Time Mixed-Criticality Jobs. Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie |
| 2010 | Second-Order Algebraic Theories - (Extended Abstract). Marcelo P. Fiore, Ola Mahmoud |
| 2010 | Semi-linear Parikh Images of Regular Expressions via Reduction. Bahareh Badban, Mohammad Torabi Dashti |
| 2010 | Slowly Synchronizing Automata and Digraphs. Dimitry S. Ananichev, Vladimir V. Gusev, Mikhail V. Volkov |
| 2010 | Solving minones-2-sat as Fast as vertex cover. Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar |
| 2010 | The Average Complexity of Moore's State Minimization Algorithm Is O(n log log n). Julien David |
| 2010 | The Complexity of Finding Reset Words in Finite Automata. Jörg Olschewski, Michael Ummels |
| 2010 | The Multivariate Resultant Is NP-hard in Any Characteristic. Bruno Grenet, Pascal Koiran, Natacha Portier |
| 2010 | The Prize-Collecting Edge Dominating Set Problem in Trees. Naoyuki Kamiyama |
| 2010 | Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity. Nader H. Bshouty, Hanna Mazzawi |
| 2010 | Two Variables and Two Successors. Amaldev Manuel |
| 2010 | Unambiguous Finite Automata over a Unary Alphabet. Alexander Okhotin |
| 2010 | Weights of Exact Threshold Functions. László Babai, Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, Xiaoming Sun |