| 2011 | p-Suffix Sorting as Arithmetic Coding. | Richard Beal, Donald A. Adjeroh |
| 2011 | Parameterized Longest Previous Factor. | Richard Beal, Donald A. Adjeroh |
| 2011 | Algorithmic Aspects of Dominator Colorings in Graphs. | S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh |
| 2011 | Weighted Improper Colouring. | Jlio Arajo, Jean-Claude Bermond, Frdric Giroire, Frdric Havet, Dorian Mazauric, Remigiusz Modrzejewski |
| 2010 | On Antimagic Labeling for Generalized Web and Flower Graphs. | Joe Ryan, Oudone Phanalasy, Mirka Miller, Leanne Rylands |
| 2010 | Upper and Lower I/O Bounds for Pebbling | Desh Ranjan, John E. Savage, Mohammad Zubair |
| 2010 | On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs. | Oudone Phanalasy, Mirka Miller, Leanne Rylands, Paulette Lieby |
| 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 | Regular Language Constrained Sequence Alignment Revisited. | Gregory Kucherov, Tamar Pinhas, Michal Ziv-Ukelson |
| 2010 | Dichotomy for Coloring of Dart Graphs. | Martin Kochol, Riste Skrekovski |
| 2010 | Reductions of Matrices Associated with Nowhere-Zero Flows. | Martin Kochol, Nad'a Krivonkov, Silvia Smejov, Katarna Srankov |
| 2010 | Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism. | Yusaku Kaneta, Hiroki Arimura |
| 2010 | Shortest Paths between Shortest Paths and Independent Sets. | Marcin Kaminski, Paul Medvedev, Martin Milanic |
| 2010 | On Improved Exact Algorithms for | Konstanty Junosza-Szaniawski, Pawel Rzazewski |
| 2010 | On the Computational Complexity of Degenerate Unit Distance Representations of Graphs. | Boris Horvat, Jan Kratochvl, Tomaz Pisanski |
| 2010 | Computing Role Assignments of Proper Interval Graphs in Polynomial Time. | Pinar Heggernes, Pim van 't Hof, Danil Paulusma |
| 2010 | On Approximation Complexity of Metric Dimension Problem. | Mathias Hauptmann, Richard Schmied, Claus Viehmann |
| 2010 | The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2. | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
| 2010 | Thread Graphs, Linear Rank-Width and Their Algorithmic Applications. | Robert Ganian |
| 2010 | Ranking and Drawing in Subexponential Time. | Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh |
| 2010 | Single Parameter FPT-Algorithms for Non-trivial Games. | Vladimir Estivill-Castro, Mahdi Parsa |
| 2010 | Efficient Connectivity Testing of Hypercubic Networks with Faults. | Toms Dvork, Jir Fink, Petr Gregor, Vclav Koubek, Tomasz Radzik |
| 2010 | Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes. | Konrad K. Dabrowski, Vadim V. Lozin, Haiko Mller, Dieter Rautenbach |
| 2010 | On the Maximal Sum of Exponents of Runsin a String. | Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |