Author:
Bessy Stephane,Bougeret Marin,Chaplick Steven,Gonçalves Daniel,Paul Christophe
Funder
Deutsche Forschungsgemeinschaft
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference16 articles.
1. Approximation algorithms for NP-complete problems on planar graphs;Baker;J. ACM,1994
2. Scheduling split intervals;Bar-Yehuda;SIAM J. Comput.,2006
3. QPTAS and subexponential algorithm for maximum clique on disk graphs;Bonnet;CoRR,2017
4. On independent set on B1-EPG graphs;Bougeret,2015
5. Edge intersection graphs of L-shaped paths in grids;Cameron;Discrete Appl. Math.,2016
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献