Game Development Reference
In-Depth Information
I. Adler. Marshals, monotone marshals, and hypertree-width. Journal of Graph
Theory , 47(4):275-296, 2004.
I. Adler. Directed tree-width examples. J. Comb. Theory, Ser. B , 97(5):718-725,
I. Adler. Games for width parameters and monotonicity. available from
as , abs/0906.3857, 2009.
I. Adler, G. Gottlob, and M. Grohe. Hypertree-width and related hypergraph
invariants. In Proceedings of the 3rd European Conference on Combinatorics,
Graph Theory and Applications (EUROCOMB'05) , DMTCS Proceedings Series,
pages 5-10, 2005.
B. Alspach. Searching and sweeping graphs: a brief survey. Matematiche (Catania) ,
59:5-37, 2006.
O. Amini, F. Mazoit, N. Nisse, and S. Thomasse. Submodular partition functions.
Discrete Mathematics , 309(20):6000-6008, 2009.
S. Arnborg, D. Corneil, and A. Proskurowski. Complexity of finding embeddings in
a k -tree. SIAM Journal on Algebraic Discrete Methods , 8:277-284, 1987.
J. Barat. Directed path-width and monotonicity in digraph searching. Graphs and
Combinatorics , 22(2):161-172, 2006.
D. Berwanger and E. Gradel. Entanglement - a measure for the complexity of
directed graphs with applications to logic and games. In LPAR , pages 209-223,
D. Berwanger, A. Dawar, P. Hunter, and S. Kreutzer. Dag-width and parity games.
In Symp. on Theoretical Aspects of Computer Science (STACS) , 2006.
D. Bienstock and P. Seymour. Monotonicity in graph searching. Journal of Algo-
rithms , 12(2):239-245, 1991.
D. Bienstock, N. Robertson, P. D. Seymour, and R. Thomas. Quickly excluding a
forest. J. Comb. Theory, Ser. B , 52(2):274-283, 1991.
H. Bodlaender. A linear-time algorithm for finding tree-decompositions of small
tree-width. SIAM Journal on Computing , 25:1305-1317, 1996.
H. Bodlaender. A partial k-aboretum of graphs with bounded tree-width. Theoretical
Computer Science , 209:1-45, 1998.
H. L. Bodlaender. Discovering treewidth. In SOFSEM , pages 1-16, 2005.
H. L. Bodlaender. Treewidth: Algorithmic techniques and results. In Proc. of
Mathematical Foundations of Computer Science (MFCS) , volume 1295 of
Lecture Notes in Computer Science , pages 19-36, 1997.
N. Dendris, L. Kirousis, and D. Thilikos. Fugitive search games on graphs and
related parameters. Theoretical Computer Science , 172(1-2):233-254, 1997.
R. Diestel. Graph Theory . Springer-Verlag, 3rd edition, 2005.
R. Downey and M. Fellows. Parameterized Complexity . Springer, Berlin, 1998.
J. Flum and M. Grohe. Parameterized Complexity Theory . Springer, Berlin, 2006.
F. Fomin and D. Thilikos. On the monotonicity of games generated by symmetric
submodular functions. Discrete Applied Mathematics , 131(2):323-335, 2003.
F. Fomin, D. Kratsch, and H. Muller. On the domination search number. Discrete
Applied Mathematics , 127(3):565-580, 2003.
F. V. Fomin and D. M. Thilikos. An annotated bibliography on guaranteed graph
searching. Theoretical Computer Science , 399(3):236-245, 2008.
M. K. Franklin, Z. Galil, and M. Yung. Eavesdropping games: a graph-theoretic
approach to privacy in distributed systems. J. ACM , 47(2):225-243, 2000.
Search Nedrilad ::

Custom Search