The following pages link to (Q2957518):
Displaying 14 items.
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework (Q1654155) (← links)
- Faster graph bipartization (Q2301359) (← links)
- Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (Q2408559) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs (Q5071089) (← links)
- (Q5088957) (← links)
- An Updated Experimental Evaluation of Graph Bipartization Methods (Q5102059) (← links)
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- Hitting Selected (Odd) Cycles (Q5348214) (← links)
- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs (Q6158361) (← links)
