toggle visibility Search & Display Options

Select All    Deselect All
 | 
Citations
 | 
   print
Kosowski, A., Li, B., Nisse, N., & Suchan, K. (2015). k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. Algorithmica, 72(3), 758–777.
toggle visibility
Li, B., Moataz, F. Z., Nisse, N., & Suchan, K. (2018). Minimum size tree-decompositions. Discret Appl. Math., 245, 109–127.
toggle visibility
Liedloff, M., Montealegre, P., & Todinca, I. (2019). Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques. Algorithmica, 81(3), 986–1005.
toggle visibility
Select All    Deselect All
 | 
Citations
 | 
   print