Journal of the ACM (JACM)
An efficient planarity algorithm
An efficient planarity algorithm
The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon
IEEE Transactions on Computers
A Polynomial Solution to the Undirected Two Paths Problem
Journal of the ACM (JACM)
Algorithms to detect chained-inference faults in information distribution systems
Proceedings of the 2001 ACM symposium on Applied computing
Completely Independent Spanning Trees in Maximal Planar Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Length-bounded disjoint paths in planar graphs
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
The subgraph homeomorphism problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
An approach to the k paths problem
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Efficient Algorithms for k-Disjoint Paths Problems on DAGs
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Disjoint paths in symmetric digraphs
Discrete Applied Mathematics
Improved Algorithms for the 2-Vertex Disjoint Paths Problem
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Disjoint directed and undirected paths and cycles in digraphs
Theoretical Computer Science
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
A very practical algorithm for the two-paths problem in 3-connected planar graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Journal of Computer and System Sciences
Symbolic execution of acyclic workflow graphs
BPM'10 Proceedings of the 8th international conference on Business process management
Subgraphs generating algorithm for obtaining set of node-disjoint paths in terrain-based mesh graphs
MIG'10 Proceedings of the Third international conference on Motion in games
Using dominators for solving constrained path problems
PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
On making directed graphs transitive
Journal of Computer and System Sciences
Finding two disjoint paths in a network with normalized α+-MIN-SUM objective function
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Finding disjoint paths on directed acyclic graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Journal of Combinatorial Theory Series B
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
Fundamenta Informaticae
Linear time algorithms for two disjoint paths problems on directed acyclic graphs
Theoretical Computer Science
Realization strategies of dedicated path protection: A bandwidth cost perspective
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.01 |