Markus S. Dregi

According to our database, Markus S. Dregi authored at least 10 papers between 2013 and 2016.

Collaborative distances:

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

2016

A c^k n 5-Approximation Algorithm for Treewidth.

Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk

SIAM J. Comput., 2016

Kernelization and Sparseness: the Case of Dominating Set.

Pål Grønås Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Sánchez Villaamil, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Compressing Bounded Degree Graphs.

Pål Grønås Drange, Markus S. Dregi, R. B. Sandeep

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015

On the Threshold of Intractability.

Pål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan

Proceedings of the Algorithms - ESA 2015, 2015

2014

On the Computational Complexity of Vertex Integrity.

Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof

CoRR, 2014

Kernelization and Sparseness: the case of Dominating Set.

Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Saket Saurabh, Fernando Sánchez Villaamil, Somnath Sikdar

CoRR, 2014

On the Computational Complexity of Vertex Integrity and Component Order Connectivity.

Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Parameterized Complexity of Bandwidth on Trees.

Markus Sortland Dregi, Daniel Lokshtanov

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

A O(c^k n) 5-Approximation Algorithm for Treewidth

Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk

CoRR, 2013

An O(c^k n) 5-Approximation Algorithm for Treewidth.

Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013