131 citations
- University of ArizonaUS6 papers
- American Physical SocietyUS5 papers
- Fermi National Accelerator LaboratoryUS5 papers
- Indiana University BloomingtonUS5 papers
- University of California, Santa BarbaraUS5 papers
- University of Illinois Urbana-ChampaignUS5 papers
- University of the PacificUS5 papers
- University of UtahUS5 papers
- Washington University in St. LouisUS5 papers
- Brookhaven National LaboratoryUS3 papers
- School of the Art Institute of ChicagoUS3 papers
- University of MilanIT3 papers
Showing 2013Show all
2 papers · 1 filter
cs.DS2013
Algorithms for Cut Problems on Trees
Iyad Kanj, Guohui Lin, Tian Liu +7
We study the {\sc multicut on trees} and the {\sc generalized multiway Cut on trees} problems. For the {\sc multicut on trees} problem, we present a parameterized algorithm that ru…
cs.CC2013★ 6 cited
On the Subexponential Time Complexity of CSP
Iyad Kanj, Stefan Szeider
A CSP with n variables ranging over a domain of d values can be solved by brute-force in d^n steps (omitting a polynomial factor). With a more careful approach, this trivial upper…