Mathias Weller

According to our database1, Mathias Weller
  • authored at least 41 papers between 2009 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
A polynomial-time algorithm for Outerplanar Diameter Improvement.
J. Comput. Syst. Sci., 2017

Linear-Time Tree Containment in Phylogenetic Networks.
CoRR, 2017

Constructing a Consensus Phylogeny from a Leaf-Removal Distance.
CoRR, 2017

Resolution and reconciliation of non-binary gene trees with transfers, duplications and losses.
Bioinformatics, 2017

Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract).
Proceedings of the String Processing and Information Retrieval, 2017

2016
Parameterized certificate dispersal and its variants.
Theor. Comput. Sci., 2016

Phylogenetic incongruence through the lens of Monadic Second Order logic.
J. Graph Algorithms Appl., 2016

On Residual Approximation in Solution Extension Problems.
Proceedings of the Combinatorial Optimization and Applications, 2016

Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem.
SIAM J. Discrete Math., 2015

Interval scheduling and colorful independent sets.
J. Scheduling, 2015

On the Complexity of Hub Labeling.
CoRR, 2015

On the Complexity of Hub Labeling (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

A Polynomial-Time Algorithm for Outerplanar Diameter Improvement.
Proceedings of the Computer Science - Theory and Applications, 2015

On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
On the parameterized complexity of consensus clustering.
Theor. Comput. Sci., 2014

Constant Thresholds Can Make Target Set Selection Tractable.
Theory Comput. Syst., 2014

Optimal Hub Labeling is NP-complete.
CoRR, 2014

A Polynomial-time Algorithm for Outerplanar Diameter Improvement.
CoRR, 2014

Interval scheduling and colorful independent sets.
CoRR, 2014

Exploiting a hypergraph model for finding Golomb rulers.
Acta Inf., 2014

2013
Aspects of preprocessing applied to combinatorial graph problems.
PhD thesis, 2013

Two-Layer Planarization parameterized by feedback edge set.
Theor. Comput. Sci., 2013

On tractable cases of Target Set Selection.
Social Netw. Analys. Mining, 2013

Efficient Algorithms for Eulerian Extension and Rural Postman.
SIAM J. Discrete Math., 2013

An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Effective and Efficient Data Reduction for the Subset Interconnection Design Problem.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012
A new view on Rural Postman based on Eulerian Extension and Matching.
J. Discrete Algorithms, 2012

On making directed graphs transitive.
J. Comput. Syst. Sci., 2012

Constant Thresholds Can Make Target Set Selection Tractable.
Proceedings of the Design and Analysis of Algorithms, 2012

Exploiting a Hypergraph Model for Finding Golomb Rulers.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Interval Scheduling and Colorful Independent Sets.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011
From Few Components to an Eulerian Graph by Adding Arcs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs.
Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

A New View on Rural Postman Based on Eulerian Extension and Matching.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

On the Parameterized Complexity of Consensus Clustering.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
Efficient Algorithms for Eulerian Extension.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Two-Layer Planarization Parameterized by Feedback Edge Set.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

On Tractable Cases of Target Set Selection.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Extended Islands of Tractability for Parsimony Haplotyping.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009
On Making Directed Graphs Transitive.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009


  Loading...