Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
Journal of the ACM (JACM)
Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs
CG '00 Revised Papers from the Second International Conference on Computers and Games
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
On a simple randomized algorithm for finding a 2-factor in sparse graphs
Information Processing Letters
Simple geometrical intersection graphs
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Enumeration of the monomials of a polynomial and related complexity classes
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Boundary properties of graphs for algorithmic graph problems
Theoretical Computer Science
On the complexity of graph self-assembly in accretive systems
DNA'06 Proceedings of the 12th international conference on DNA Computing
Hamiltonian cycles in subcubic graphs: what makes the problem difficult
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Parameterized complexity of eulerian deletion problems
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
On the complexity of the Eulerian closed walk with precedence path constraints problem
Theoretical Computer Science
Note: Arc-disjoint paths and trees in 2-regular digraphs
Discrete Applied Mathematics
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation
Theory of Computing Systems
| Hi-index | 0.89 |