The following pages link to Danny Hermelin (Q295634):
Displaying 38 items.
- On Problems without Polynomial Kernels (Extended Abstract) (Q3521947) (← links)
- Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications (Q3558909) (← links)
- Optimization Problems in Multiple Subtree Graphs (Q3558926) (← links)
- Mod/Resc Parsimony Inference (Q3575248) (← links)
- Minimum Vertex Cover in Rectangle Graphs (Q3586467) (← links)
- Haplotype Inference Constrained by Plausible Haplotype Data (Q3637124) (← links)
- Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs (Q3656858) (← links)
- Tight Kernel Bounds for Problems on Graphs with Small Degeneracy (Q4554933) (← links)
- Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems (Q4598161) (← links)
- Fractals for Kernelization Lower Bounds (Q4609787) (← links)
- Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph (Q4909563) (← links)
- Local Search for String Problems: Brute Force Is Essentially Optimal (Q4928567) (← links)
- Tractable Parameterizations for the Minimum Linear Arrangement Problem (Q4973850) (← links)
- How hard is it to satisfy (almost) all roommates (Q5002706) (← links)
- Hans Bodlaender and the Theory of Kernelization Lower Bounds (Q5042447) (← links)
- (Q5075765) (← links)
- Lossy Kernels for Hitting Subgraphs (Q5111284) (← links)
- Diminishable parameterized problems and strict polynomial kernelization (Q5118456) (← links)
- Parameterized Complexity Analysis for the Closest String with Wildcards Problem (Q5165600) (← links)
- Optimization Problems in Dotted Interval Graphs (Q5200493) (← links)
- SETH-Based Lower Bounds for Subset Sum and Bicriteria Path (Q5236184) (← links)
- Local Alignment of RNA Sequences with Arbitrary Scoring Schemes (Q5307510) (← links)
- Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs (Q5363760) (← links)
- Parameterized Complexity of Critical Node Cuts (Q5363787) (← links)
- (Q5390005) (← links)
- Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs (Q5428821) (← links)
- The Minimum Substring Cover Problem (Q5443381) (← links)
- Algorithms – ESA 2005 (Q5475853) (← links)
- (Q5743381) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897562) (← links)
- The clever shopper problem (Q5915572) (← links)
- The clever shopper problem (Q5919456) (← links)
- Temporal interval cliques and independent sets (Q6039892) (← links)
- Equitable scheduling on a single machine (Q6103750) (← links)
- Approximating sparse quadratic programs (Q6180751) (← links)
- A note on clustering aggregation for binary clusterings (Q6556150) (← links)
- On the parameterized complexity of interval scheduling with eligible machine sets (Q6564614) (← links)
- Minimizing the weighted number of tardy jobs via \((\max,+)\)-convolutions (Q6580559) (← links)
