Manfred Cochefert

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2018

Computing square roots of graphs with low maximum degree.

Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart

Discret. Appl. Math., 2018

Exact algorithms for weak Roman domination.

Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff, Anthony Perez

Discret. Appl. Math., 2018

2017

Exact exponential algorithms to find tropical connected sets of minimum size.

Mathieu Chapelle, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff

Theor. Comput. Sci., 2017

2016

Squares of Low Maximum Degree.

Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart

CoRR, 2016

Parameterized Algorithms for Finding Square Roots.

Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma

Algorithmica, 2016

Faster Algorithms to Enumerate Hypergraph Transversals.

Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch

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).

Manfred Cochefert

PhD thesis, 2014

Exact Algorithms to Clique-Colour Graphs.

Manfred Cochefert, Dieter Kratsch

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size.

Mathieu Chapelle, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013

Sparse Square Roots.

Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Exact Algorithms for Weak Roman Domination.

Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Mathieu Liedloff, Anthony Perez

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013