Pages that link to "Item:Q2441593"

The following pages link to Parameterized complexity of Eulerian deletion problems (Q2441593):

Displaying 21 items.

• Graph editing to a given degree sequence (Q507592) (← links)
• Editing to a planar graph of given degrees (Q730508) (← links)
• Editing to Eulerian graphs (Q896016) (← links)
• Finding even subgraphs even faster (Q1671994) (← links)
• A parameterized algorithmics framework for degree sequence completion problems in directed graphs (Q1739111) (← links)
• Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations (Q2077398) (← links)
• Complexity of some arc-partition problems for digraphs (Q2079880) (← links)
• Directed graph encoding in quantum computing supporting edge-failures (Q2097414) (← links)
• Königsberg sightseeing: Eulerian walks in temporal graphs (Q2115887) (← links)
• Two edge-disjoint paths with length constraints (Q2330117) (← links)
• Plane augmentation of plane graphs to meet parity constraints (Q2656724) (← links)
• Eulerian walks in temporal graphs (Q2689257) (← links)
• Finding Two Edge-Disjoint Paths with Length Constraints (Q3181047) (← links)
• Editing to a Planar Graph of Given Degrees (Q3194713) (← links)
• Deterministic Truncation of Linear Matroids (Q3448849) (← links)
• Graph Editing to a Given Degree Sequence (Q5740185) (← links)
• On the complexity of finding large odd induced subgraphs and odd colorings (Q5918338) (← links)
• Parameterized algorithms for generalizations of directed feedback vertex set (Q5925617) (← links)
• Quantum encoding of dynamic directed graphs (Q6151614) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
• An updated annotated bibliography on arc routing problems (Q6496350) (← links)