Parameterized and Exact Computation
暂无分享,去创建一个
[1] Mateus de Oliveira Oliveira. Hasse Diagram Generators and Petri Nets , 2010, Fundam. Informaticae.
[2] Stephan Kreutzer,et al. Lower Bounds for the Complexity of Monadic Second-Order Logic , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.
[3] Ronald Fagin,et al. The Closure of Monadic NP , 2000, J. Comput. Syst. Sci..
[4] Bruno Courcelle,et al. On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic , 2001, Discret. Appl. Math..
[5] Mihalis Yannakakis,et al. Edge-Deletion Problems , 1981, SIAM J. Comput..
[6] Pim van 't Hof,et al. Obtaining a Bipartite Graph by Contracting Few Edges , 2011, FSTTCS.
[7] Bruno Courcelle,et al. Graph expressions and graph rewritings , 1987, Mathematical systems theory.
[8] Michael R. Fellows,et al. On the parameterized complexity of multiple-interval graph problems , 2009, Theor. Comput. Sci..
[9] Stefan Szeider,et al. Editing graphs to satisfy degree constraints: A parameterized approach , 2012, J. Comput. Syst. Sci..
[10] Lukasz Kaiser,et al. Entanglement and the complexity of directed graphs , 2012, Theor. Comput. Sci..
[11] Antonio Restivo,et al. Two-Dimensional Finite State Recognizability , 1996, Fundam. Informaticae.
[12] Petr A. Golovach,et al. Obtaining planarity by contracting few edges , 2013, Theor. Comput. Sci..
[13] Mateus de Oliveira Oliveira. Canonizable Partial Order Generators , 2010, LATA.
[14] Mateus de Oliveira Oliveira. Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs , 2013, IPEC.
[15] L. Eggan. Transition graphs and the star-height of regular events. , 1963 .
[16] Hisao Tamaki. A Polynomial Time Algorithm for Bounded Directed Pathwidth , 2011, WG.
[17] Andries E. Brouwer,et al. Contractibility and NP-completeness , 1987, J. Graph Theory.
[18] Aleksandrs Slivkins,et al. Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs , 2003, SIAM J. Discret. Math..
[19] Antonios Kalampakas,et al. Recognizability of graph and pattern languages , 2006, Acta Informatica.
[20] Bruno Courcelle,et al. Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , 2012, Encyclopedia of mathematics and its applications.
[21] Michael Lampis,et al. On the algorithmic effectiveness of digraph decompositions and complexity measures , 2008, Discret. Optim..
[22] Petr Hliněný,et al. Are There Any Good Digraph Width Measures? , 2010, IPEC.
[23] Hermann Gruber,et al. Digraph Complexity Measures and Applications in Formal Language Theory , 2011, Discret. Math. Theor. Comput. Sci..
[24] Takao Asano,et al. Edge-Contraction Problems , 1983, J. Comput. Syst. Sci..
[25] Antonio Restivo,et al. Recognizable Picture Languages , 1992, Int. J. Pattern Recognit. Artif. Intell..
[26] Hermann Gruber. On the D-Width of Directed Graphs , 2007 .
[27] Wolfgang Thomas,et al. The monadic quantifier alternation hierarchy over graphs is infinite , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.
[28] Craig A. Tovey,et al. Deterministic Decomposition of Recursive Graph Classes , 1991, SIAM J. Discret. Math..
[29] Michael R. Fellows,et al. Fixed Parameter Tractability and Completeness , 1992, Complexity Theory: Current Research.
[30] John M. Lewis,et al. The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..
[31] Robin Thomas,et al. Directed Tree-Width , 2001, J. Comb. Theory, Ser. B.
[32] Petr Hliněný,et al. Lower bounds on the complexity of MSO1 model-checking , 2014, J. Comput. Syst. Sci..
[33] János Barát. Directed Path-width and Monotonicity in Digraph Searching , 2006, Graphs Comb..
[34] Barry O'Sullivan,et al. Finding small separators in linear time via treewidth reduction , 2011, TALG.
[35] Joost Engelfriet,et al. Context-free graph grammars and concatenation of graphs , 1997, Acta Informatica.
[36] Robert Ganian,et al. On Digraph Width Measures in Parameterized Algorithmics , 2009, IWPEC.
[37] Pim van 't Hof,et al. Contracting Graphs to Paths and Trees , 2011, Algorithmica.
[38] Stephan Kreutzer,et al. On the Parameterized Intractability of Monadic Second-Order Logic , 2009, Log. Methods Comput. Sci..
[39] Stephan Kreutzer,et al. The dag-width of directed graphs , 2012, J. Comb. Theory, Ser. B.
[40] E. Artin. The theory of braids. , 1950, American scientist.
[41] Detlef Seese,et al. Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.
[42] Hannes Moser,et al. Parameterized complexity of finding regular induced subgraphs , 2009, J. Discrete Algorithms.
[43] Bruno Courcelle,et al. Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[44] Mohammad Ali Safari. D-Width: A More Natural Measure for Directed Tree Width , 2005, MFCS.
[45] Stephan Kreutzer,et al. Digraph measures: Kelly decompositions, games, and orderings , 2007, SODA '07.
[46] Leizhen Cai,et al. Parameterized Complexity of Cardinality Constrained Optimization Problems , 2008, Comput. J..
[47] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.
[48] Bruce A. Reed,et al. Introducing Directed Tree Width , 1999, Electron. Notes Discret. Math..
[49] Emil L. Post. A variant of a recursively unsolvable problem , 1946 .
[50] Petr A. Golovach,et al. Increasing the minimum degree of a graph by contractions , 2011, Theor. Comput. Sci..
[51] Markus Holzer,et al. Finite Automata, Digraph Connectivity, and Regular Expression Size , 2008, ICALP.
[52] Konstantin Skodinis,et al. Finite graph automata for linear and boundary graph languages , 2005, Theor. Comput. Sci..
[53] Dietmar Berwanger,et al. Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games , 2005, LPAR.