The following pages link to (Q3318125):
Displayed 14 items.
- On feedback vertex set: new measure and new structures (Q494933) (← links)
- Some observations on holographic algorithms (Q1616615) (← links)
- A lower bound on the acyclic matching number of subcubic graphs (Q1637156) (← links)
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- On line graphs of subcubic triangle-free graphs (Q2400553) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- Feedback vertex set on Hamiltonian graphs (Q2672436) (← links)
- A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
- On feedback vertex sets and nonseparating independent sets in cubic graphs (Q3804730) (← links)
- A polyhedral approach to the feedback vertex set problem (Q4645941) (← links)
- The lexicographically first maximal subgraph problems:P-completeness andNC algorithms (Q4729355) (← links)
- On cycle transversals and their connected variants in the absence of a small linear forest (Q5918178) (← links)
- Feedback vertex set reconfiguration in planar graphs (Q6057837) (← links)