Pages that link to "Item:Q3656848"
From MaRDI portal
The following pages link to Kernelization: New Upper and Lower Bound Techniques (Q3656848):
Displaying 19 items.
- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs (Q2891348) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints (Q2947024) (← links)
- An Improved Kernel for Planar Connected Dominating Set (Q3010387) (← links)
- Measuring Indifference: Unit Interval Vertex Deletion (Q3057628) (← links)
- On Making a Distinguished Vertex Minimum Degree by Vertex Deletion (Q3075510) (← links)
- Polynomial Kernels for Proper Interval Completion and Related Problems (Q3088286) (← links)
- Cross-composition: a new technique for kernelization lower bounds (Q3113681) (← links)
- Kernelization Lower Bounds by Cross-Composition (Q4979840) (← links)
- An Efficient Algorithm for Computing Kernel Function Defined with Anti-unification (Q5426043) (← links)
- STACS 2005 (Q5710681) (← links)
- (Q5743381) (← links)
- Confluence in data reduction: bridging graph transformation and kernelization (Q5891215) (← links)
- Faster Existential FO Model Checking on Posets (Q5892117) (← links)
- On kernel inclusions (Q5935464) (← links)
- Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)
- The role of twins in computing planar supports of hypergraphs (Q6616221) (← links)