The following pages link to Kernelization (Q4646517):
Displaying 50 items.
- On the proper orientation number of chordal graphs (Q820574) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- Parameterized complexity of \(d\)-hitting set with quotas (Q831823) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Parameterized complexity of categorical clustering with size constraints (Q832880) (← links)
- Paths to trees and cacti (Q1998842) (← links)
- On the approximate compressibility of connected vertex cover (Q2006945) (← links)
- Parameterized complexity of \textsc{maximum edge colorable subgraph} (Q2019513) (← links)
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346) (← links)
- A parameterized perspective on protecting elections (Q2034407) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems (Q2049975) (← links)
- Sparsification lower bound for linear spanners in directed graphs (Q2055974) (← links)
- Reflections on kernelizing and computing unrooted agreement forests (Q2069261) (← links)
- Incompressibility of \(H\)-free edge modification problems: towards a dichotomy (Q2071824) (← links)
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (Q2075363) (← links)
- Defensive alliances in graphs (Q2079875) (← links)
- Parameterized complexity of maximum edge colorable subgraph (Q2088595) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- (Sub)linear kernels for edge modification problems toward structured graph classes (Q2093576) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
- Eternal vertex cover on bipartite graphs (Q2097214) (← links)
- Lossy kernelization of same-size clustering (Q2097218) (← links)
- Output sensitive fault tolerant maximum matching (Q2097219) (← links)
- Parameterized complexity of set-restricted disjoint paths on chordal graphs (Q2097221) (← links)
- Partial vertex cover on graphs of bounded degeneracy (Q2097233) (← links)
- Linear-time parameterized algorithms with limited local resources (Q2105436) (← links)
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
- Star colouring of bounded degree graphs and regular graphs (Q2124639) (← links)
- Well-partitioned chordal graphs (Q2144581) (← links)
- On structural parameterizations of the offensive alliance problem (Q2150581) (← links)
- Exact and parameterized algorithms for read-once refutations in Horn constraint systems (Q2151419) (← links)
- From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability (Q2154075) (← links)
- Parameterized complexity of directed spanner problems (Q2161008) (← links)
- A polynomial kernel for funnel arc deletion set (Q2161012) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Parameterized complexity of happy coloring problems (Q2192381) (← links)
- On the tractability of optimization problems on \(H\)-graphs (Q2196605) (← links)
- Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) (← links)
- Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space (Q2203595) (← links)
- Revisiting the parameterized complexity of maximum-duo preservation string mapping (Q2210511) (← links)
- New reduction rules for the tree bisection and reconnection distance (Q2210581) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- Tree-like unit refutations in Horn constraint systems (Q2232285) (← links)
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
- Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
- New kernels for several problems on planar graphs (Q2285156) (← links)
- Consensus strings with small maximum distance and small distance sum (Q2309476) (← links)
- Simultaneous feedback edge set: a parameterized perspective (Q2659779) (← links)
