| How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model | 2011/02/02 | English | 16 |
| The Complexity of Optimal Design of Temporally Connected Graphs | 2017/04/03 | English | 16 |
| XML Compression via Directed Acyclic Graphs | 2014/05/25 | English | 16 |
| Improved Lower Bounds on the Price of Stability of Undirected Network Design Games | 2012/05/15 | English | 15 |
| Bounding the Expected Length of Longest Common Subsequences and Forests | 1999/08/01 | | 15 |
| Planar and Grid Graph Reachability Problems | 2009/02/05 | English | 15 |
| Computability and Complexity in Self-assembly | 2010/04/20 | English | 15 |
| Fixed-Parameter Enumerability of Cluster Editing and Related Problems | 2008/07/16 | English | 15 |
| Faster Algorithms for the Constrained k-means Problem | 2017/11/06 | English | 14 |
| A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games | 2017/12/02 | English | 14 |
| The Hardness of Approximating Spanner Problems | 2007/03/13 | English | 14 |
| On the Analysis of Randomized Load Balancing Schemes | 1999/06/01 | | 14 |
| The Behavior of Clique-Width under Graph Operations and Graph Transformations | 2016/05/23 | English | 14 |
| A Kleene Theorem for Weighted Tree Automata | 2004/09/15 | English | 14 |
| Parallel Skyline Queries | 2015/04/16 | English | 14 |
| A New Combinatorial Approach to Sequence Comparison | 2007/10/30 | English | 14 |
| Spectral Sparsification in the Semi-streaming Setting | 2012/04/26 | English | 14 |
| Searching for Black Holes in Subways | 2011/07/28 | English | 14 |
| Trimmed Moebius Inversion and Graphs of Bounded Degree | 2009/01/29 | English | 14 |
| Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy | 2009/03/14 | English | 14 |
| On the Structure of Weakly Acyclic Games | 2013/04/04 | English | 14 |
| Scheduling Without Payments | 2013/04/26 | English | 13 |
| The Price of Anarchy in Network Creation Games Is (Mostly) Constant | 2013/03/17 | English | 13 |
| Containment of Conjunctive Queries on Annotated Relations | 2011/04/30 | English | 13 |
| Elimination Trees and the Construction of Pools and Stacks | 1997/12/01 | English | 13 |
| Algebraic Characterization of Reversible Logic Gates | 2004/12/20 | English | 13 |
| A New Efficient Algorithm for Computing the Longest Common Subsequence | 2008/01/25 | English | 13 |
| Interacting Explicit Evidence Systems | 2007/10/25 | English | 13 |
| A Simple 3-Edge-Connected Component Algorithm | 2005/05/09 | English | 13 |
| Complexity of Equations over Sets of Natural Numbers | 2009/12/23 | English | 13 |