The following pages link to Dimitrios M. Thilikos (Q284716):
Displaying 50 items.
- An edge variant of the Erdős-Pósa property (Q284717) (← links)
- It is hard to know when greedy is good for finding independent sets (Q286978) (← links)
- Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003) (← links)
- Contraction obstructions for connected graph searching (Q298950) (← links)
- Planar disjoint-paths completion (Q329285) (← links)
- Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
- Increasing the minimum degree of a graph by contractions (Q385061) (← links)
- Outerplanar obstructions for matroid pathwidth (Q393173) (← links)
- On self-duality of branchwidth in graphs of bounded genus (Q411870) (← links)
- Outerplanar obstructions for a feedback vertex set (Q412287) (← links)
- Forbidden graphs for tree-depth (Q412288) (← links)
- On graph contractions and induced minors (Q415282) (← links)
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
- Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms (Q458454) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Acyclic edge coloring through the Lovász local lemma (Q507595) (← links)
- A linear kernel for planar red-blue dominating set (Q516887) (← links)
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← links)
- Contracting planar graphs to contractions of triangulations (Q635743) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Parameterizing cut sets in a graph by the number of their components (Q653326) (← links)
- Connected graph searching (Q690489) (← links)
- A note on exact algorithms for vertex ordering problems on graphs (Q692902) (← links)
- Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth (Q713301) (← links)
- Editing to a planar graph of given degrees (Q730508) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- Containment relations in split graphs (Q765349) (← links)
- Minor-obstructions for apex sub-unicyclic graphs (Q777436) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733) (← links)
- Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209) (← links)
- A note on the subgraphs of the (\(2\times \infty \))-grid (Q960965) (← links)
- Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (Q988694) (← links)
- Derivation of algorithms for cutwidth and related graph layout parameters (Q1015810) (← links)
- Parameterized complexity of finding regular induced subgraphs (Q1026227) (← links)
- (Q1293879) (redirect page) (← links)
- Isomorphism for graphs of bounded distance width (Q1293880) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- On interval routing schemes and treewidth (Q1383155) (← links)
- Fugitive-search games on graphs and related parameters (Q1392025) (← links)
- On the monotonicity of games generated by symmetric submodular functions. (Q1410686) (← links)
- On parallel partial solutions and approximation schemes for local consistency in networks of constraints (Q1579084) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
