- Theoretical Computer Science 281 (2002) 291309 www.elsevier.com/locate/tcs
- Constraints, 5, 251273 (2000) c 2000 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- Theoretical Computer Science 399 (2008) 236245 www.elsevier.com/locate/tcs
- Kernels for the Vertex Cover Problem on the Preferred Attachment Model
- Discrete Mathematics 307 (2007) 20822093 www.elsevier.com/locate/disc
- Discrete Applied Mathematics 79 (1997) 45-61 MATHEMATICS
- AN EFFICIENT IMPLEMENTATION OF1 MATERIAL REQUIREMENTS PLANNING
- Connected Graph Searching in Outerplanar Fedor V. Fomin 1
- Contractions of planar graphs in polynomial time
- Z .Journal of Algorithms 32, 167 194 1999 Article ID jagm.1999.1011, available online at http:rrwww.idealibrary.com on
- DOI: 10.1007/s00453-004-1125-y Algorithmica (2005) 41: 245267
- On Self-duality of Branchwidth in Graphs of Bounded Genus
- QUICKLY EXCLUDING K2,r FROM PLANAR GRAPHS Dimitrios M. Thilikos
- ELSEVIER Theoretical Computer Science 172 (1997) 233-254 Theoretical
- Fast subexponential algorithm for non-local problems on graphs of bounded genus
- Information Information ProcessingLetters61 (1997) 101-106
- Journal of Discrete Algorithms 4 (2006) 499510 www.elsevier.com/locate/jda
- Subexponential Parameterized Algorithms on Bounded-Genus Graphs and H-Minor-Free Graphs
- SIAM J. DISCRETE MATH. c 2006 Society for Industrial and Applied Mathematics Vol. 20, No. 2, pp. 357371
- Approximating Acyclicity Parameters of Sparse Hypergraphs
- Monotonicity and Inert Fugitive Search Yannis C. Stamatiou 1
- Journal of Computer and System Sciences 75 (2009) 231244 Contents lists available at ScienceDirect
- THE ALGORITHMICS COLUMN JOSEP DIAZ
- SIAM J. COMPUT. Vol. 25, No. 3, pp. 626-647, June 1996
- International Journal of Foundations of Computer Science c World Scientific Publishing Company
- Subexponential Parameterized Algorithms for Degree-Constrained Subgraph Problems on Planar Graphs
- BIDIMENSIONAL PARAMETERS AND LOCAL TREEWIDTH ERIK D. DEMAINE, FEDOR V. FOMIN, MOHAMMADTAGHI HAJIAGHAYI, AND
- Discrete Applied Mathematics 131 (2003) 323335 www.elsevier.com/locate/dam
- Problems and conjectures on parameterized H-coloring*
- Journal of Computer and System Sciences 74 (2008) 919937 www.elsevier.com/locate/jcss
- Connected Branch Decomposition and Graph Searching
- Journal of Discrete Algorithms 7 (2009) 181190 Contents lists available at ScienceDirect
- C O M P U T E R S C I E N C E R E V I E W 1 ( 2 0 0 7 ) 1 0 3 1 0 4 available at www.sciencedirect.com
- Discrete Mathematics 310 (2010) 531536 Contents lists available at ScienceDirect
- Fast FPT-algorithms for cleaning grids Josep Diaz Dimitrios M. Thilikos
- Induced packing of odd cycles in a planar graph Petr A. Golovach1
- SIAM J. DISCRETE MATH. c 2009 Society for Industrial and Applied Mathematics Vol. 23, No. 1, pp. 349368
- Parameterized Counting Algorithms for General Graph Covering Problems
- Dominating sets and local treewidth Fedor V. Fomin1
- Constructive linear time algorithms for small carving-width Dimitrios M. Thilikos1
- Algorithmica (2008) 52: 167176 DOI 10.1007/s00453-007-9146-y
- Author's personal copy C O M P U T E R S C I E N C E R E V I E W 2 ( 2 0 0 8 ) 2 9 3 9
- Parameterized Problems in Bioinformatics Liliana Felix Avila Alina Garcia Maria Jose Serna Dimitrios M. Thilikos
- Dynamic Programming for Graphs on Surfaces Juanjo Rue
- Strengthening Erdos-Posa property for minor closed graph classes
- Branchwidth of Graphs B 101 boosting approach, applied to them, minimizes the out-
- Catalan Structures and Dynamic Programming in H-minor-free graphs
- Recontamination helps when searching a graph without Lali Barri`ere1
- New Upper Bounds on the Decomposability
- http://www.elsevier.com/locate/jcss Journal of Computer and System Sciences 69 (2004) 166195
- On Graph Contractions and Induced Minors Pim van 't Hof,1,
- On Self Duality of Pathwidth in Polyhedral
- ELSEVIER Information Processing Letters 61 ( 1997) 227-232 Fast partitioning Z-apex graphs with applications to
- Discrete Applied Mathematics 145 (2005) 297305 www.elsevier.com/locate/dam
- Forbidden Graphs for Tree-depth Zdenek Dvorak Archontia C. Giannopoulou Dimitrios M. Thilikos
- A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
- Bidimensionality and Kernels Fedor V. Fomin
- On exact algorithms for treewidth Hans L. Bodlaender
- Journal of Algorithms 42, 69108 (2002) doi:10.1006/jagm.2001.1195, available online at http://www.idealibrary.com on
- Searching for a visible, lazy fugitive David Richerby
- Contraction obstructions for Treewidth Fedor V. Fomin
- Algorithmica (1999) 24: 105127 Algorithmica
- Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential
- Fixed-Parameter Algorithms for (k,r)-Center in Planar Graphs and Map Graphs
- Outerplanar Obstructions for Feedback Vertex Set Juanjo Rue
- Fast Minor Testing in Planar Graphs Isolde Adler1
- SIAM J. COMPUT. c 2006 Society for Industrial and Applied Mathematics Vol. 36, No. 2, pp. 281309
- Discrete Applied Mathematics 105 (2000) 239271 Algorithms and obstructions for linear-width and related
- Journal of Algorithms 56 (2005) 124 www.elsevier.com/locate/jalgor
- On disconnected cuts and separators Takehiro Ito1
- H-colorings of Large Degree Graphs Josep Diaz
- information and computation 139, 92 109 (1997) On Interval Routing Schemes and Treewidth*
- Journal of Algorithms 56 (2005) 2549 www.elsevier.com/locate/jalgor
- Constructive Linear Time Algorithms For Branchwidth
- Contracting planar graphs to contractions of triangulations Marcin Kaminski
- Parameterizing cut sets in a graph by the number of their components
- A Simple and Fast Approach for Solving Problems on Planar Graphs
- (Meta) Kernelization Hans L. Bodlaender Fedor V. Fomin Daniel Lokshtanov
- arXiv:0910.0079v1[math.CO]1Oct2009 Rank-width and Tree-width of H-minor-free Graphs
- Approximation Algorithms for Domination Search
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
- Discrete Applied Mathematics 152 (2005) 229245 www.elsevier.com/locate/dam
- Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms
- Evaluating cooperation in communities with the k-core structure
- Planar Disjoint-Paths Completion Isolde Adler , Stavros G. Kolliopoulos , and Dimitrios M. Thilikos
- Lift Contractions Petr A. Golovach 1
- A min-max theorem for LIFO-search Archontia C. Giannopoulou 1
- Nash Equilibria in Searching Games C. `Alvarez1
- Confronting Intractability via Parameters$ Happy 60th Birthday Mike!
- Odd cyclic surface separators in planar graphs Petr A. Golovach a
- Square Roots of Minor Closed Graph Classes Nestor V. Nestoridis 1
- Fast sub-exponential Algorithms and Compactness in Planar Graphs
- Outerplanar Obstructions for Matroid Pathwidth
- Increasing the Minimum Degree of a Graph by Contractions
- D-cores: Measuring Collaboration of Directed Graphs Based on Degeneracy
- Containment relations in split graphs Petr A. Golovach
