Bojikian, Narek

1. Tight Bounds for Connectivity Problems Parameterized by Cutwidth
   2022/12/23 by Bojikian, Narek, Chekan, Vera, Hegerfeld, Falko +1 · 2 citations
   #05C85 #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
2. A tight Monte-Carlo algorithm for Steiner Tree parameterized by clique-width
   2023/07/26 by Bojikian, Narek, Kratsch, Stefan · 1 citation
   #05C85 #Data Structures and Algorithms (cs.DS) #F.2 #FOS: Computer and information sciences