The following pages link to Danny Hermelin (Q295634):
Displaying 50 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Optimization problems in dotted interval graphs (Q400519) (← links)
- Mod/Resc parsimony inference: theory and application (Q418168) (← links)
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- Parameterized complexity analysis for the closest string with wildcards problem (Q495996) (← links)
- Parameterized complexity of critical node cuts (Q517024) (← links)
- Optimization problems in multiple subtree graphs (Q531599) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- New algorithms for minimizing the weighted number of tardy jobs on a single machine (Q829184) (← links)
- Binary jumbled pattern matching on trees and tree-like structures (Q893318) (← links)
- Approximating the 2-interval pattern problem (Q932323) (← links)
- The minimum substring cover problem (Q958306) (← links)
- W-hierarchies defined by symmetric gates (Q970108) (← links)
- Finding common structured patterns in linear graphs (Q974741) (← links)
- On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints (Q1002106) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Diminishable parameterized problems and strict polynomial kernelization (Q1670737) (← links)
- A biclique approach to reference anchored gene blocks and its applications to pathogenicity islands (Q1708410) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- Constraint satisfaction problems: convexity makes AllDifferent constraints tractable (Q1939255) (← links)
- Unified compression-based acceleration of edit-distance computation (Q1939664) (← links)
- Parameterized two-player Nash equilibrium (Q1949741) (← links)
- Efficient enumeration of maximal induced bicliques (Q1983137) (← links)
- On the parameterized tractability of single machine scheduling with rejection (Q1991260) (← links)
- Computing the \(k\) densest subgraphs of a graph (Q2094387) (← links)
- Scheduling lower bounds via AND subset sum (Q2121467) (← links)
- Faster minimization of tardy processing time on a single machine (Q2134746) (← links)
- A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
- Parameterized multi-scenario single-machine scheduling problems (Q2196612) (← links)
- On the parameterized tractability of the just-in-time flow-shop scheduling problem (Q2294891) (← links)
- On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (Q2316936) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- On the average-case complexity of parameterized clique (Q2344729) (← links)
- Local search for string problems: brute-force is essentially optimal (Q2437744) (← links)
- Tight Kernel Bounds for Problems on Graphs with Small Degeneracy (Q2849328) (← links)
- Tractable Parameterizations for the Minimum Linear Arrangement Problem (Q2849336) (← links)
- Binary Jumbled Pattern Matching on Trees and Tree-Like Structures (Q2849342) (← links)
- A Completeness Theory for Polynomial (Turing) Kernelization (Q2867084) (← links)
- Parameterized Complexity of Induced H-Matching on Claw-Free Graphs (Q2912880) (← links)
- Optimization problems in multiple-interval graphs (Q2930319) (← links)
- (Q2934605) (← links)
- Parameterized complexity dichotomy for Steiner Multicut (Q2954992) (← links)
- Domination When the Stars Are Out (Q3012826) (← links)
- Distance Oracles for Vertex-Labeled Graphs (Q3012943) (← links)
- An Extension of the Nemhauser–Trotter Theorem to Generalized Vertex Cover with Applications (Q3084226) (← links)
- A Purely Democratic Characterization of W[1] (Q3503582) (← links)
- Common Structured Patterns in Linear Graphs: Approximation and Combinatorics (Q3506926) (← links)
- Constrained LCS: Hardness and Approximation (Q3506958) (← links)
