Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Capture of an intruder by mobile agents
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Discrete Mathematics - Algebraic and topological methods in graph theory
Hypertree Decompositions: A Survey
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On the Monotonicity of Games Generated by Symmetric Submodular Functions
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
Journal of Computer and System Sciences - Special issu on PODS 2001
On the monotonicity of games generated by symmetric submodular functions
Discrete Applied Mathematics - Submodularity
Two Short Proofs Concerning Tree-Decompositions
Combinatorics, Probability and Computing
Query answering exploiting structural properties
ACM SIGMOD Record
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
DAG-width: connectivity measure for directed graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Achievable sets, brambles, and sparse treewidth obstructions
Discrete Applied Mathematics
Planar Branch Decompositions I: The Ratcatcher
INFORMS Journal on Computing
Computing crossing number in linear time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Journal of Combinatorial Theory Series B
Hypertree width and related hypergraph invariants
European Journal of Combinatorics
Lower bounds on the pathwidth of some grid-like graphs
Discrete Applied Mathematics
A nearly linear time algorithm for the half integral disjoint paths packing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On digraph coloring problems and treewidth duality
European Journal of Combinatorics
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
Monotonicity of non-deterministic graph searching
Theoretical Computer Science
Digraph searching, directed vertex separation and directed pathwidth
Discrete Applied Mathematics
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
On tree width, bramble size, and expansion
Journal of Combinatorial Theory Series B
Monotony properties of connected visible graph searching
Information and Computation
Digraph Decompositions and Monotonicity in Digraph Searching
Graph-Theoretic Concepts in Computer Science
Searching for a Visible, Lazy Fugitive
Graph-Theoretic Concepts in Computer Science
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
Theoretical Computer Science
Maximum vertex occupation time and inert fugitive: Recontamination does help
Information Processing Letters
Affine systems of equations and counting infinitary logic
Theoretical Computer Science
Hadwiger's conjecture is decidable
Proceedings of the forty-first annual ACM symposium on Theory of computing
Connected graph searching in chordal graphs
Discrete Applied Mathematics
CFI Construction and Balanced Graphs
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Tree Projections: Game Characterization and Computational Aspects
Graph Theory, Computational Intelligence and Thought
Pursuing a fast robber on a graph
Theoretical Computer Science
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Directed searching digraphs: monotonicity and complexity
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Graph searching in a crime wave
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Monotonicity of non-deterministic graph searching
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Undirected graphs of entanglement 2
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Proceedings of the forty-second ACM symposium on Theory of computing
Tree-width for first order formulae
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
CSP duality and trees of bounded pathwidth
Theoretical Computer Science
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On brambles, grid-like minors, and parameterized intractability of monadic second-order logic
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
An (almost) linear time algorithm for odd cycles transversal
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithmic properties of millstream systems
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Balanced queries: divide and conquer
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Parity games with partial information played on graphs of bounded complexity
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Approximation algorithms for domination search
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Treewidth computations II. Lower bounds
Information and Computation
Characterization of graphs and digraphs with small process numbers
Discrete Applied Mathematics
Finding topological subgraphs is fixed-parameter tractable
Proceedings of the forty-third annual ACM symposium on Theory of computing
Digraph decompositions and monotonicity in digraph searching
Theoretical Computer Science
LIFO-search on digraphs: a searching game for cycle-rank
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Monotony properties of connected visible graph searching
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Bidimensionality and geometric graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Treewidth lower bounds with brambles
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Polynomial treewidth forces a large grid-like-minor
European Journal of Combinatorics
Graph searching and search time
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
European Journal of Combinatorics
Nondeterministic graph searching: from pathwidth to treewidth
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
D-Width: a more natural measure for directed tree width
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Graph Minors. XXII. Irrelevant vertices in linkage problems
Journal of Combinatorial Theory Series B
Hypertree decompositions: structure, algorithms, and applications
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Tree-width of hypergraphs and surface duality
Journal of Combinatorial Theory Series B
Note: A note on planar graphs with large width parameters and small grid-minors
Discrete Applied Mathematics
Variations on Cops and Robbers
Journal of Graph Theory
Patterns with bounded treewidth
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
The dag-width of directed graphs
Journal of Combinatorial Theory Series B
On the algorithmic effectiveness of digraph decompositions and complexity measures
Discrete Optimization
LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth
Discrete Applied Mathematics
First-Order and Monadic Second-Order Model-Checking on Ordered Structures
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
The power of counting logics on restricted classes of finite structures
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Affine systems of equations and counting infinitary logic
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Entanglement and the complexity of directed graphs
Theoretical Computer Science
Locating a robber on a graph via distance queries
Theoretical Computer Science
On the complexity of planning for agent teams and its implications for single agent planning
Artificial Intelligence
Large-treewidth graph decompositions and applications
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Finding small separators in linear time via treewidth reduction
ACM Transactions on Algorithms (TALG)
Lower bounds for treewidth of product graphs
Discrete Applied Mathematics
Theoretical Computer Science
Digraph width measures in parameterized algorithmics
Discrete Applied Mathematics
| Hi-index | 0.01 |