Linear-time register allocation for a fixed number of registers
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Capture of an intruder by mobile agents
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Connections between cutting-pattern sequencing, VLSI Design, and flexible machines
Computers and Operations Research
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
Computing Optimal Linear Layouts of Trees in Linear Time
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
The structure of obstructions to treewidth and pathwidth
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Interval degree and bandwidth of a graph
Discrete Applied Mathematics
On the monotonicity of games generated by symmetric submodular functions
Discrete Applied Mathematics - Submodularity
Computing the vertex separation of unicyclic graphs
Information and Computation
Clique-width minimization is NP-hard
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Finite graph automata for linear and boundary graph languages
Theoretical Computer Science
A 3-approximation for the pathwidth of Halin graphs
Journal of Discrete Algorithms
Node-searching problem on block graphs
Discrete Applied Mathematics
Lower bounds on the pathwidth of some grid-like graphs
Discrete Applied Mathematics
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
Digraph searching, directed vertex separation and directed pathwidth
Discrete Applied Mathematics
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
A Distributed Algorithm for Computing and Updating the Process Number of a Forest
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Computing and Updating the Process Number in Trees
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Searching for a Visible, Lazy Fugitive
Graph-Theoretic Concepts in Computer Science
Derivation of algorithms for cutwidth and related graph layout parameters
Journal of Computer and System Sciences
Edge searching weighted graphs
Discrete Applied Mathematics
Pathwidth is NP-Hard for Weighted Trees
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
minimum dominating set of queens: A trivial programming exercise?
Discrete Applied Mathematics
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Some observations on the computational complexity of graph accessibility problem
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Searching cycle-disjoint graphs
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Better algorithms and bounds for directed maximum leaf problems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
CSP duality and trees of bounded pathwidth
Theoretical Computer Science
Imbalance is fixed parameter tractable
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Network decontamination with local immunization
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Efficient self-stabilizing graph searching in tree networks
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Characterization of graphs and digraphs with small process numbers
Discrete Applied Mathematics
Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Algorithms and complexity results for graph-based pursuit evasion
Autonomous Robots
Using DPLL for efficient OBDD construction
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Graph searching and search time
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Centrality measures based on current flow
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Faster algorithms for finding and counting subgraphs
Journal of Computer and System Sciences
A polynomial time algorithm for bounded directed pathwidth
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Submodular minimization via pathwidth
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Fixed-Parameter tractability, a prehistory,
The Multivariate Algorithmic Revolution and Beyond
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Parameterized algorithms for directed maximum leaf problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Approximate search strategies for weighted trees
Theoretical Computer Science
Computing directed pathwidth in O(1.89n) time
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Discrete Applied Mathematics
Imbalance is fixed parameter tractable
Information Processing Letters
| Hi-index | 0.90 |