The following pages link to Mathias Weller (Q249095):
Displaying 50 items.
- Two-layer planarization parameterized by feedback edge set (Q391093) (← links)
- On making directed graphs transitive (Q414917) (← links)
- Exploiting a hypergraph model for finding Golomb rulers (Q471187) (← links)
- On the fixed parameter tractability of agreement-based phylogenetic distances (Q504072) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases (Q1635706) (← links)
- New insights for power edge set problem (Q1699780) (← links)
- On the linearization of scaffolds sharing repeated contigs (Q1708649) (← links)
- Complexity and lowers bounds for power edge set problem (Q1711663) (← links)
- A new view on rural postman based on Eulerian extension and matching (Q1932348) (← links)
- On the parameterized complexity of consensus clustering (Q2015135) (← links)
- Producing genomic sequences after genome scaffolding with ambiguous paths: complexity, approximation and lower bounds (Q2037107) (← links)
- Quantifying hierarchical conflicts in homology statements (Q2163958) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- Power Edge Set and Zero Forcing Set remain difficult in cubic graphs (Q2301739) (← links)
- New polynomial-time algorithm around the scaffolding problem (Q2315495) (← links)
- New results about the linearization of scaffolds sharing repeated contigs (Q2327106) (← links)
- A polynomial-time algorithm for outerplanar diameter improvement (Q2402366) (← links)
- Fast exact dynamic time warping on run-length encoded time series (Q2684485) (← links)
- Phylogenetic incongruence through the lens of monadic second order logic (Q2790162) (← links)
- Effective and Efficient Data Reduction for the Subset Interconnection Design Problem (Q2872100) (← links)
- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs (Q2891348) (← links)
- On the Complexity of Hub Labeling (Extended Abstract) (Q2946377) (← links)
- Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding (Q2958322) (← links)
- On Residual Approximation in Solution Extension Problems (Q2958338) (← links)
- Efficient Algorithms for Eulerian Extension (Q3057616) (← links)
- On Tractable Cases of Target Set Selection (Q3060749) (← links)
- On the Parameterized Complexity of Consensus Clustering (Q3104664) (← links)
- From Few Components to an Eulerian Graph by Adding Arcs (Q3104786) (← links)
- A New View on Rural Postman Based on Eulerian Extension and Matching (Q3111660) (← links)
- Exploiting a Hypergraph Model for Finding Golomb Rulers (Q3167640) (← links)
- On Making Directed Graphs Transitive (Q3183483) (← links)
- A Polynomial-Time Algorithm for Outerplanar Diameter Improvement (Q3194712) (← links)
- Linearizing Genomes: Exact Methods and Local Search (Q3297780) (← links)
- Scanning Phylogenetic Networks Is NP-hard (Q3297781) (← links)
- Polynomial-Time Data Reduction for the Subset Interconnection Design Problem (Q3453561) (← links)
- On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs (Q3467860) (← links)
- Two-Layer Planarization Parameterized by Feedback Edge Set (Q3569096) (← links)
- Extended Islands of Tractability for Parsimony Haplotyping (Q3575249) (← links)
- Constant Thresholds Can Make Target Set Selection Tractable (Q4916038) (← links)
- Tree Containment With Soft Polytomies (Q5084686) (← links)
- (Q5089244) (← links)
- (Q5111890) (← links)
- (Q5116473) (← links)
- (Q5271449) (← links)
- Efficient Algorithms for Eulerian Extension and Rural Postman (Q5300482) (← links)
- Parameterized certificate dispersal and its variants (Q5964075) (← links)
- Treewidth-Based Algorithms for the Small Parsimony Problem on Networks (Q6133866) (← links)
- What Is Known About Vertex Cover Kernelization? (Q6163635) (← links)
