3 Hits in 1.8 sec

Techniques combinatoires pour les algorithmes paramétrés et les noyaux, avec applications aux problèmes de multicoupe. Sciences et Techniques du Languedoc THÈSE

Jean Daligault
2013 unpublished
Treewidth can be approximated within a factor O( log(n)) [58] , and the existence of a constant factor approximation algorithm for treewidth is open.  ...  In Section 4.2, we study constrained separation problems of the type: separate vertex x from vertex y without seperating y from vertex z.  ...  Assume for instance that F does not contain an edge in all SL(w i ) where i divides k + 1. Therefore, we can safely contract each of such slices SL(w i ) onto w i . This makes w i a full vertex.  ... 

Grid Recognition: Classical and Parameterized Computational Perspectives [article]

Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2021 arXiv   pre-print
This also implies that the problem is FPT parameterized by 𝚝𝚍+k where 𝚝𝚍 is the treedepth of G (to be compared with the hardness for pathwidth 2 where k=3).  ...  In addition, observe that each battery gadget has a straight line that seperates the two sides of the battery gadget.  ...  Let p be an (m, n)-placement that is correct and safe.  ... 
arXiv:2106.16180v1 fatcat:myw6oc72jvbmpoxc5dwqysvewa

Dagstuhl Reports, Volume 6, Issue 10, September 2016, Complete Issue [article]

For very unexpected reasons, she could unfortunately not participate in the seminar. Participants  ...  in the union of n arbitrary theories (including for instance propositional logic), as long as each of them comes with an MCSat-friendly inference system.  ...  We discuss each of them seperately in the following sections.  ... 
doi:10.4230/dagrep.6.10 fatcat:wq33g6exi5bzll67no5ztodtoy