The following pages link to Frank Sommer (Q1661910):
Displaying 25 items.
- Refined parameterizations for computing colored cuts in edge-colored graphs (Q2082563) (← links)
- Colored cut games (Q2087453) (← links)
- The parameterized complexity of \(s\)-club with triangle and seed constraints (Q2169965) (← links)
- On critical node problems with vulnerable vertices (Q2169985) (← links)
- Destroying bicolored \(P_3\)s by deleting few edges (Q2179362) (← links)
- Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges (Q2672432) (← links)
- Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs (Q3297773) (← links)
- Destroying Bicolored $P_3$s by Deleting Few Edges (Q5038193) (← links)
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
- FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems (Q5147488) (← links)
- (Q5874445) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- Parameterized algorithms for module map problems (Q5915705) (← links)
- Enumerating connected induced subgraphs: improved delay and experimental comparison (Q5918096) (← links)
- Parameterized algorithms for module map problems (Q5918889) (← links)
- Enumerating connected induced subgraphs: improved delay and experimental comparison (Q5918979) (← links)
- The parameterized complexity of \(s\)-club with triangle and seed constraints (Q6056631) (← links)
- (Q6065417) (← links)
- Essentially tight kernels for (weakly) closed graphs (Q6103524) (← links)
- Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)
- Destroying Multicolored Paths and Cycles in Edge-Colored Graphs (Q6131783) (← links)
- (Q6147537) (← links)
- Covering many (or few) edges with \(k\) vertices in sparse graphs (Q6490988) (← links)
- On critical node problems with vulnerable vertices (Q6616219) (← links)
- Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs (Q6646734) (← links)
