Carl Einarson

According to our database, Carl Einarson authored at least 4 papers between 2019 and 2023.

Collaborative distances:

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

2023

<i>p</i>-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms.

Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström

J. Comput. Syst. Sci., May, 2023

2020

p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms.

Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström

CoRR, 2020

A General Kernelization Technique for Domination and Independence Problems in Sparse Classes.

Carl Einarson, Felix Reidl

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

2019

Domination Above r-Independence: Does Sparseness Help?

Carl Einarson, Felix Reidl

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019