| 000 | 2024 | Parameterized complexity for iterated type partitions and modular-width by Cordasco, Gargano, Rescigno |
| 001 | 2024 | Twin-width of graphs on surfaces by Kráľ, Pekárková, Štorgel |
| 002 | 2023 | On Algorithmic Applications of Sim-Width and Mim-Width of $(H_1,H_2)$-Free Graphs by Munaro, Yang |
| 003 | 2023 | Flip-width: Cops and Robber on dense graphs by Toruńczyk |
| 004 | 2022 | Expanding the Graph Parameter Hierarchy by Tran |
| 005 | 2021 | Twin-width I: Tractable FO Model Checking by Bonnet, Kim, Thomassé, Watrigant |
| 006 | unknown | Comparing Graph Parameters by Schröder |
| 007 | 2020 | Mim-Width I. Induced path problems by Jaffke, Kwon, Telle |
| 008 | 2019 | The Graph Parameter Hierarchy by Sorge |
| 009 | 2019 | Shrub-depth: Capturing Height of Dense Graphs by Ganian, Hliněný, Nešetřil, Obdržálek, Mendez |
| 010 | 2018 | A systematic comparison of graph parameters by Frömmrich |
| 011 | 2017 | Graph Theory by Diestel |
| 012 | 2015 | Parameterized Algorithms by Cygan, Fomin, Kowalik, Lokshtanov, Marx, Pilipczuk, Pilipczuk, Saurabh |
| 013 | 2015 | Improving Vertex Cover as a Graph Parameter by Ganian |
| 014 | 2015 | Linear rank-width and linear clique-width of trees by Adler, Kanté |
| 015 | 2013 | The Power of Data Reduction: Kernels for Fundamental Graph Problems by Jansen |
| 016 | 2013 | Characterizing graphs of small carving-width by Belmonte, van ’t Hof, Kamiński, Paulusma, Thilikos |
| 017 | 2013 | Parameterized Algorithms for Modular-Width by Gajarský, Lampis, Ordyniak |
| 018 | 2012 | New Width Parameters of Graphs by Vatshelle |
| 019 | 2012 | Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics by Ganian |
| 020 | 2012 | Algorithmic Meta-theorems for Restrictions of Treewidth by Lampis |
| 021 | 2011 | Boolean-width of graphs by Bui-Xuan, Telle, Vatshelle |
| 022 | 2011 | Chordal Bipartite Graphs with High Boxicity by Chandran, Francis, Mathew |
| 023 | 2010 | Comparing 17 graph parameters by Sasák |
| 024 | 2010 | The rank-width of the square grid by Jelínek |
| 025 | 2009 | Clique-Width is NP-Complete by Fellows, Rosamond, Rotics, Szeider |
| 026 | 2008 | Grad and classes with bounded expansion II. Algorithmic aspects by Nešetřil, Ossona de Mendez |
| 027 | 2008 | Spanning Trees with Many Leaves and Average Distance by DeLaViña, Waller |
| 028 | 2007 | Graph Treewidth and Geometric Thickness Parameters by Dujmovic, Wood |
| 029 | 2006 | Approximating clique-width and branch-width by Oum, Seymour |
| 030 | 2005 | On the relationship between NLC-width and linear NLC-width by Gurski, Wanke |
| 031 | 2004 | Track Layouts of Graphs by Dujmović, Pór, Wood |
| 032 | 2000 | Upper bounds to the clique width of graphs by Courcelle, Olariu |
| 033 | 1998 | Clique-decomposition, NLC-decomposition and modular decomposition—relationships and results for random graphs by Johansson |
| 034 | 1998 | A partial $k$-arboretum of graphs with bounded treewidth by Bodlaender |
| 035 | 1994 | k-NLC graphs and polynomial algorithms by Wanke |
| 036 | 1993 | The Pathwidth and Treewidth of Cographs by Bodlaender, Möhring |
| 037 | 1991 | Graph minors. X. Obstructions to tree-decomposition by Robertson, Seymour |
| 038 | 1986 | Graph minors. V. Excluding a planar graph by Robertson, Seymour |
| 039 | 1994 | Genus g Graphs Have Pagenumber O(√g) by Malitz |
| 040 | 1993 | On the chordality of a graph by McKee, Scheinerman |
| 041 | 1986 | Graph minors. II. Algorithmic aspects of tree-width by Robertson, Seymour |
| 042 | 1988 | The average distanceisnot morethan the independence number by Chung |
| 043 | 1985 | On the Cutwidth and the Topological Bandwidth of a Tree by Chung |
