Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs-Reference-Cited by-同舟云学术

Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs

Published:2010-09 Issue:3 Volume:8 Page:330-338
ISSN:1570-8667
Container-title:Journal of Discrete Algorithms
language:en
Short-container-title:Journal of Discrete Algorithms

Author:

Sau Ignasi,Thilikos Dimitrios M.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference20 articles.

1. Degree-constrained subgraph problems: Hardness and approximation;Amini,2008

2. Supereulerian graphs: a survey;Catlin;Journal of Graph Theory,1992

3. Subexponential parameterized algorithms on graphs of bounded genus and h-minor-free graphs;Demaine;Journal of the ACM,2005

4. Subexponential parameterized algorithms;Dorn,2007

5. F. Dorn, F.V. Fomin, D.M. Thilikos, Catalan structures and dynamic programming in H-minor-free graphs, in: Proc. of the 19th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA), 2008, pp. 631–640

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On computing the Hamiltonian index of graphs;Theoretical Computer Science;2023-01

2. Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering;SIAM Journal on Computing;2022-12-20

3. On Computing the Hamiltonian Index of Graphs;Computer Science – Theory and Applications;2020

4. Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering;2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS);2016-10

5. A new mixed integer linear programming formulation for the maximum degree bounded connected subgraph problem;Publications de l'Institut Math?matique (Belgrade);2016