Manfred Cochefert

According to our database1, Manfred Cochefert authored at least 11 papers between 2013 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
Computing square roots of graphs with low maximum degree.
Discret. Appl. Math., 2018

Exact algorithms for weak Roman domination.
Discret. Appl. Math., 2018

2017
Exact exponential algorithms to find tropical connected sets of minimum size.
Theor. Comput. Sci., 2017

2016
Squares of Low Maximum Degree.
CoRR, 2016

Parameterized Algorithms for Finding Square Roots.
Algorithmica, 2016

Faster Algorithms to Enumerate Hypergraph Transversals.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2014
Algorithmes exacts et exponentiels pour les problèmes NP-difficiles sur les graphes et hypergraphes. (Exact Exponential-Time Algorithms for NP-hards Problems on Graphs and Hypergraphs).
PhD thesis, 2014

Exact Algorithms to Clique-Colour Graphs.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013
Sparse Square Roots.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Exact Algorithms for Weak Roman Domination.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013


  Loading...