Author:
Ganian Robert,Hliněný Petr,Kneis Joachim,Meister Daniel,Obdržálek Jan,Rossmanith Peter,Sikdar Somnath
Funder
Deutsche Forschungsgemeinschaft
Czech Science Foundation
Austrian Science Fund
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference48 articles.
1. Complexity of the network median problem on planar grids;Ageev;Siberian Adv. Math.,1995
2. Easy problems for tree-decomposable graphs;Arnborg;J. Algorithms,1991
3. Directed path-width and monotonicity in digraph searching;Barát;Graphs Combin.,2006
4. DAG-width and parity games;Berwanger,2006
5. The DAG-width of directed graphs;Berwanger;J. Combin. Theory Ser. B,2012
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献