The following pages link to Dimitrios M. Thilikos (Q284716):
Displaying 50 items.
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (Q1680511) (← links)
- An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
- Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- The restrictive \(H\)-coloring problem (Q1764813) (← links)
- Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors (Q1774147) (← links)
- Structure and enumeration of \(K_{4}\)-minor-free links and link diagrams (Q1792076) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Asymptotic enumeration of non-crossing partitions on surfaces (Q1939583) (← links)
- A Menger-like property of tree-cut width (Q1998754) (← links)
- Minor obstructions for apex-pseudoforests (Q2043398) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- Subgraph complementation (Q2182091) (← links)
- Edge degeneracy: algorithmic and structural results (Q2196572) (← links)
- Structure and enumeration of \(K_4\)-minor-free links and link-diagrams (Q2198981) (← links)
- Contraction obstructions for treewidth (Q2275894) (← links)
- On disconnected cuts and separators (Q2275942) (← links)
- On the parameterized complexity of graph modification to first-order logic properties (Q2300624) (← links)
- Hitting minors on bounded treewidth graphs. III. Lower bounds (Q2301360) (← links)
- Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms (Q2304558) (← links)
- Complexity issues on bounded restrictive \(H\)-coloring (Q2370448) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- Minors in graphs of large \(\theta_r\)-girth (Q2400974) (← links)
- Packing and covering immersion-expansions of planar sub-cubic graphs (Q2400977) (← links)
- A polynomial-time algorithm for outerplanar diameter improvement (Q2402366) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Square roots of minor closed graph classes (Q2442205) (← links)
- Characterizing graphs of small carving-width (Q2446832) (← links)
- Lift-contractions (Q2509756) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q2672445) (← links)
- The mixed search game against an agile and visible fugitive is monotone (Q2685344) (← links)
- On strict brambles (Q2689118) (← links)
- (Q2721973) (← links)
- Monotonicity and inert fugitive search games (Q2741367) (← links)
- Quickly excluding \(K_{2,r}\) from planar graphs (Q2741369) (← links)
- On graph powers for leaf-labeled trees (Q2777607) (← links)
- An $$O(\log \mathrm{OPT})$$ O ( log OPT ) -Approximation for Covering/Packing Minor Models of $$\theta _{r}$$ θ r (Q2788996) (← links)
- Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs (Q2839212) (← links)
- Outerplanar obstructions for the feedback vertex set (Q2851458) (← links)
- Obstructions for tree-depth (Q2851471) (← links)
- A min-max theorem for LIFO-search (Q2857377) (← links)
- Lift contractions (Q2857379) (← links)
- Outerplanar obstructions for matroid pathwidth (Q2857402) (← links)
- Square roots of minor closed graph classes (Q2857427) (← links)
- Excluding Graphs as Immersions in Surface Embedded Graphs (Q2864308) (← links)
- Optimizing the graph minors weak structure theorem (Q2870501) (← links)
- Increasing the Minimum Degree of a Graph by Contractions (Q2891338) (← links)
