A shortest path approach to wireframe to solid model conversion
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Algebraic and combinatorial graph theory for optimal structural analysis
Civil and structural engineering computing: 2001
Building Three-Dimensional Ribonucleic Acid Structures
Computing in Science and Engineering
Algorithms for shortest paths and d-cycle problems
Journal of Discrete Algorithms
On finding cycle bases and fundamental cycle bases with a shortest maximal cycle
Information Processing Letters
Generating cycle spaces for graphs on surfaces with small genera
European Journal of Combinatorics
Greedy optimal homotopy and homology generators
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A greedy approach to compute a minimum cycle basis of a directed graph
Information Processing Letters
Implementing minimum cycle basis algorithms
Journal of Experimental Algorithmics (JEA)
Discrete Applied Mathematics
Minimum cycle bases of direct products of complete graphs
Information Processing Letters
The zoo of tree spanner problems
Discrete Applied Mathematics
Minimal cycle bases for analysis of frames with semi-rigid joints
Computers and Structures
On a Special Co-cycle Basis of Graphs
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
An improved heuristic for computing short integral cycle bases
Journal of Experimental Algorithmics (JEA)
Efficient approximation algorithms for shortest cycles in undirected graphs
Information Processing Letters
Minimum Cycle Bases and Their Applications
Algorithmics of Large and Complex Networks
On the Complexity of Matroid Isomorphism Problems
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Minimum cycle bases: Faster and simpler
ACM Transactions on Algorithms (TALG)
Minimum Cycle Bases of Weighted Outerplanar Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Finding good cycle constraints for large scale multi-robot SLAM
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
A greedy approach to compute a minimum cycle basis of a directed graph
Information Processing Letters
Minimum cut bases in undirected networks
Discrete Applied Mathematics
New approximation algorithms for minimum cycle bases of graphs
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Efficient approximation algorithms for shortest cycles in undirected graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Novel topological framework for adaptive routing
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Minimum cycle bases of weighted outerplanar graphs
Information Processing Letters
On the approximability of the minimum strictly fundamental cycle basis problem
Discrete Applied Mathematics
An Õ(m2n) randomized algorithm to compute a minimum cycle basis of a directed graph
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Properties of Gomory-Hu co-cycle bases
Theoretical Computer Science
A faster deterministic algorithm for minimum cycle bases in directed graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A polynomial time algorithm for minimum cycle basis in directed graphs
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Implementing minimum cycle basis algorithms
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Efficient deterministic algorithms for finding a minimum cycle basis in undirected graphs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
A flexible assembly retrieval approach for model reuse
Computer-Aided Design
QUBE: a quick algorithm for updating betweenness centrality
Proceedings of the 21st international conference on World Wide Web
Testing connectivity of faulty networks in sublinear time
Journal of Discrete Algorithms
Survey: Cycle bases in graphs characterization, algorithms, complexity, and applications
Computer Science Review
Computer Science Review
Integral cycle bases for cyclic timetabling
Discrete Optimization
Minimum cycle bases in graphs algorithms and applications
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Scale-free coordinates for multi-robot systems with bearing-only sensors
International Journal of Robotics Research
A comparison of methods for sketch-based 3D shape retrieval
Computer Vision and Image Understanding
| Hi-index | 0.00 |