Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
By Erik D. Demaine, Fedor V. Fomin, M. Hajiaghayi, Dimitrios M. Thilikos. JACM, 2005
337 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/2759714e1f0fac51ca4377efa7d6b254f69154cc
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Nati Srebro
- Venkat Chandrasekaran
- Behnam Neyshabur
- Ohad Shamir
- Yoshua Bengio
- Nitish Srivastava
- Martin Jaggi
- Blake E. Woodworth
In Computer Networks and Communications
- Nati Srebro
- Venkat Chandrasekaran
- Jakub Konecný
- Martin Takác
- Martin Jaggi
- Sebastian U. Stich
- Chenxin Ma
- Jialei Wang
Citations in the corpus
- Complexity of Inference in Graphical Models (2008, background): “Based on the results in ( Demaine et al., 2005 ) Theorem 5.2 holds more generally for the inference problem in graphical models dened on bounded-genus graphs, of which planar graphs are a special case.”