Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Journal of Algorithms
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
DAG-width: connectivity measure for directed graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Journal of Combinatorial Theory Series B
Digraph measures: Kelly decompositions, games, and orderings
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
Monotonicity of non-deterministic graph searching
Theoretical Computer Science
Digraph measures: Kelly decompositions, games, and orderings
Theoretical Computer Science
Digraph searching, directed vertex separation and directed pathwidth
Discrete Applied Mathematics
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
Discrete Applied Mathematics
Digraph Strong Searching: Monotonicity and Complexity
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Finite Automata, Digraph Connectivity, and Regular Expression Size
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Monotonicity in digraph search problems
Theoretical Computer Science
Digraph Decompositions and Monotonicity in Digraph Searching
Graph-Theoretic Concepts in Computer Science
Communication: On complexity of Minimum Leaf Out-Branching problem
Discrete Applied Mathematics
New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Recognizing digraphs of Kelly-width 2
Discrete Applied Mathematics
Directed searching digraphs: monotonicity and complexity
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Monotonicity of non-deterministic graph searching
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Characterization and recognition of digraphs of bounded Kelly-width
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Arc searching digraphs without jumping
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Undirected graphs of entanglement 2
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Directed graphs of entanglement two
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Pure Nash equilibria: complete characterization of hard and easy graphical games
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
A cops and robber game in multidimensional grids
Discrete Applied Mathematics
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
Digraph decompositions and monotonicity in digraph searching
Theoretical Computer Science
An extended tree-width notion for directed graphs related to the computation of permanents
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
LIFO-search on digraphs: a searching game for cycle-rank
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Directed nowhere dense classes of 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
D-Width: a more natural measure for directed tree width
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Capacitated confluent flows: complexity and algorithms
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
A polynomial time algorithm for bounded directed pathwidth
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Towards fixed-parameter tractable algorithms for abstract argumentation
Artificial Intelligence
The dag-width of directed graphs
Journal of Combinatorial Theory Series B
On the algorithmic effectiveness of digraph decompositions and complexity measures
Discrete Optimization
Submodular minimization via pathwidth
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth
Discrete Applied Mathematics
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
Entanglement and the complexity of directed graphs
Theoretical Computer Science
Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs
Theoretical Computer Science
Computing directed pathwidth in O(1.89n) time
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
A trichotomy for regular simple path queries on graphs
Proceedings of the 32nd symposium on Principles of database systems
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
Information and Computation
The complexity of optimal monotonic planning: the bad, the good, and the causal graph
Journal of Artificial Intelligence Research
Digraph width measures in parameterized algorithmics
Discrete Applied Mathematics
Digraphs of bounded elimination width
Discrete Applied Mathematics
| Hi-index | 0.01 |