Narek Bojikian

According to our database, Narek Bojikian authored at least 8 papers between 2020 and 2025.

Collaborative distances:

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

2025

Tight Bounds for Feedback Vertex Set Parameterized by Clique-width.

Narek Bojikian, Stefan Kratsch

CoRR, December, 2025

Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees.

Narek Bojikian, Alexander Firbas, Robert Ganian, Hung P. Hoang, Krisztina Szilágyi

CoRR, March, 2025

Tight Bounds for Connected Odd Cycle Transversal Parameterized by Clique-Width.

Narek Bojikian, Stefan Kratsch

Proceedings of the 20th International Symposium on Parameterized and Exact Computation, 2025

Tight Bounds for Some Classical Problems Parameterized by Cutwidth.

Narek Bojikian, Vera Chekan, Stefan Kratsch

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024

Tight Algorithm for Connected Odd Cycle Transversal Parameterized by Clique-width.

Narek Bojikian, Stefan Kratsch

CoRR, 2024

A Tight Monte-Carlo Algorithm for Steiner Tree Parameterized by Clique-Width.

Narek Bojikian, Stefan Kratsch

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Tight Bounds for Connectivity Problems Parameterized by Cutwidth.

Narek Bojikian, Vera Chekan, Falko Hegerfeld, Stefan Kratsch

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2020

PACE-Challenge-2020-HU-Berlin-Exact-Track.

Narek Bojikian, Alexander van der Grinten, Falko Hegerfeld, Laurence Alec Kluge, Stefan Kratsch

Dataset, June, 2020