Pages that link to "Item:Q708228"
From MaRDI portal
The following pages link to Improved upper bounds for vertex cover (Q708228):
Displaying 49 items.
- (Q5089163) (← links)
- Quick separation in chordal and split graphs (Q5089243) (← links)
- (Q5092393) (← links)
- Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction (Q5092478) (← links)
- (Q5136298) (← links)
- Parameterized Algorithms for Book Embedding Problems (Q5141644) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
- Rank Vertex Cover as a Natural Problem for Algebraic Compression (Q5232153) (← links)
- 3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size (Q5261045) (← links)
- Parameterized and Exact Computation (Q5311526) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- Parameterized Pre-Coloring Extension and List Coloring Problems (Q5857010) (← links)
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors (Q5918315) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5918733) (← links)
- Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)
- On finding separators in temporal split and permutation graphs (Q5925700) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5925712) (← links)
- A polynomial kernel for 3-leaf power deletion (Q6046945) (← links)
- On the complexity of the storyplan problem (Q6078287) (← links)
- Parameterized complexity of optimizing list vertex-coloring through reconfiguration (Q6091170) (← links)
- Reducing the vertex cover number via edge contractions (Q6098145) (← links)
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes (Q6098156) (← links)
- Solving larger maximum clique problems using parallel quantum annealing (Q6098277) (← links)
- Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)
- Winner determination algorithms for graph games with matching structures (Q6119832) (← links)
- Grouped domination parameterized by vertex cover, twin cover, and beyond (Q6131196) (← links)
- Exact algorithms for restricted subset feedback vertex set in chordal and split graphs (Q6140360) (← links)
- What Is Known About Vertex Cover Kernelization? (Q6163635) (← links)
- On the \(d\)-claw vertex deletion problem (Q6182678) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)
- Parameterized approximation algorithms for weighted vertex cover (Q6547955) (← links)
- Parameterized algorithms for minimum sum vertex cover (Q6547957) (← links)
- On the parameterized complexity of non-hereditary relaxations of clique (Q6549685) (← links)
- On kernels for \(d\)-path vertex cover (Q6564612) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q6564613) (← links)
- Parameterized algorithms for fixed-order book drawing with few crossings per edge (Q6569894) (← links)
- Search-space reduction via essential vertices (Q6606914) (← links)
- Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover (Q6610085) (← links)
- \(b\)-coloring parameterized by clique-width (Q6614620) (← links)
- Fixed-parameter algorithms for computing RAC drawings of graphs (Q6618251) (← links)
- Parameterized complexity of simultaneous planarity (Q6618252) (← links)
- The parametrized complexity of the segment number (Q6618253) (← links)
- Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs (Q6620013) (← links)
- Algorithmic meta-theorems for combinatorial reconfiguration revisited (Q6623591) (← links)
- The parameterized complexity of maximum betweenness centrality (Q6636087) (← links)
- Parameterized complexity of weighted target set selection (Q6636096) (← links)
- Fixed-parameter algorithms for computing bend-restricted RAC drawings of graphs (Q6636993) (← links)
- Parameterizing path partitions (Q6664058) (← links)