| 2011 | Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers Costas S. Iliopoulos, William F. Smyth |
| 2010 | Blocks of Hypergraphs - Applied to Hypergraphs and Outerplanarity. Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry |
| 2010 | Chains-into-Bins Processes. Tugkan Batu, Petra Berenbrink, Colin Cooper |
| 2010 | Collision-Free Routing in Sink-Centric Sensor Networks with Coarse-Grain Coordinates. Alfredo Navarra, Maria Cristina Pinotti |
| 2010 | Complexity of Locally Injective Homomorphism to the Theta Graphs. Bernard Lidický, Marek Tesar |
| 2010 | Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures. Cristina Bazgan, Sonia Toubaline, Zsolt Tuza |
| 2010 | Computing Role Assignments of Proper Interval Graphs in Polynomial Time. Pinar Heggernes, Pim van 't Hof, Daniël Paulusma |
| 2010 | Dichotomy for Coloring of Dart Graphs. Martin Kochol, Riste Skrekovski |
| 2010 | Dictionary-Symbolwise Flexible Parsing. Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo |
| 2010 | Efficient Chaining of Seeds in Ordered Trees. Julien Allali, Cédric Chauve, Pascal Ferraro, Anne-Laure Gaillard |
| 2010 | Efficient Connectivity Testing of Hypercubic Networks with Faults. Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek, Tomasz Radzik |
| 2010 | Efficient Reconstruction of RC-Equivalent Strings. Ferdinando Cicalese, Péter L. Erdös, Zsuzsanna Lipták |
| 2010 | Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism. Yusaku Kaneta, Hiroki Arimura |
| 2010 | Graphs of Separability at Most Two: Structural Characterizations and Their Consequences. Ferdinando Cicalese, Martin Milanic |
| 2010 | Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures. Danny Z. Chen, Haitao Wang |
| 2010 | Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three. Francine Blanchet-Sadri, Bob Chen, Aleksandar Chakarov |
| 2010 | On Antimagic Labeling for Generalized Web and Flower Graphs. Joe Ryan, Oudone Phanalasy, Mirka Miller, Leanne Rylands |
| 2010 | On Approximation Complexity of Metric Dimension Problem. Mathias Hauptmann, Richard Schmied, Claus Viehmann |
| 2010 | On Fast Enumeration of Pseudo Bicliques. Zareen Alamgir, Saira Karim, Syed Husnine |
| 2010 | On Improved Exact Algorithms for Konstanty Junosza-Szaniawski, Pawel Rzazewski |
| 2010 | On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs. Oudone Phanalasy, Mirka Miller, Leanne Rylands, Paulette Lieby |
| 2010 | On the Computational Complexity of Degenerate Unit Distance Representations of Graphs. Boris Horvat, Jan Kratochvíl, Tomaz Pisanski |
| 2010 | On the Maximal Sum of Exponents of Runsin a String. Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2010 | Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes. Konrad K. Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach |
| 2010 | Parameterized Complexity of Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola |
| 2010 | Path-Based Supports for Hypergraphs. Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry |
| 2010 | Ranking and Drawing in Subexponential Time. Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh |
| 2010 | Recognition of Probe Ptolemaic Graphs - (Extended Abstract). Maw-Shang Chang, Ling-Ju Hung |
| 2010 | Reductions of Matrices Associated with Nowhere-Zero Flows. Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková |
| 2010 | Regular Language Constrained Sequence Alignment Revisited. Gregory Kucherov, Tamar Pinhas, Michal Ziv-Ukelson |
| 2010 | Shortest Paths between Shortest Paths and Independent Sets. Marcin Kaminski, Paul Medvedev, Martin Milanic |
| 2010 | Single Parameter FPT-Algorithms for Non-trivial Games. Vladimir Estivill-Castro, Mahdi Parsa |
| 2010 | Skip Lift: A Probabilistic Alternative to Red-Black Trees. Prosenjit Bose, Karim Douïeb, Pat Morin |
| 2010 | Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter |
| 2010 | The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
| 2010 | The Complexity Status of Problems Related to Sparsest Cuts. Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin |
| 2010 | The Cover Time of Cartesian Product Graphs. Mohammed Amin Abdullah, Colin Cooper, Tomasz Radzik |
| 2010 | Thread Graphs, Linear Rank-Width and Their Algorithmic Applications. Robert Ganian |
| 2010 | Upper and Lower I/O Bounds for Pebbling Desh Ranjan, John E. Savage, Mohammad Zubair |
| 2010 | Worst Case Efficient Single and Multiple String Matching in the RAM Model. Djamal Belazzougui |