Pages that link to "Item:Q3638049"
From MaRDI portal
The following pages link to Incompressibility through Colors and IDs (Q3638049):
Displaying 29 items.
- Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs (Q2828227) (← links)
- A Multivariate Approach for Checking Resiliency in Access Control (Q2830068) (← links)
- Kernel Bounds for Path and Cycle Problems (Q2891344) (← links)
- On the Hardness of Losing Width (Q2891345) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs (Q3057621) (← links)
- On the Kernelization Complexity of Colorful Motifs (Q3058688) (← links)
- Enumerate and Measure: Improving Parameter Budget Management (Q3058690) (← links)
- On Making a Distinguished Vertex Minimum Degree by Vertex Deletion (Q3075510) (← links)
- Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287) (← links)
- From Few Components to an Eulerian Graph by Adding Arcs (Q3104786) (← links)
- New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)
- A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity (Q3452840) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Fractals for Kernelization Lower Bounds (Q4609787) (← links)
- Lossy Kernels for Hitting Subgraphs (Q5111284) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs (Q5111869) (← links)
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)
- (Q5743378) (← links)
- (Q5743380) (← links)
- (Q5743381) (← links)
- (Q5743382) (← links)
- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT (Q5890956) (← links)
- Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems (Q5890961) (← links)
- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT (Q5892359) (← links)
- P versus NPC: minimum Steiner trees in convex split graphs (Q6102270) (← links)
- On the kernel and related problems in interval digraphs (Q6103517) (← links)
- On convexity in split graphs: complexity of Steiner tree and domination (Q6123388) (← links)