6 citations · 6 across the 6 of their papers we have counts for
6 papers
Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem
Manuel Dubinsky, Kun-Mao Chao, César Massri +1
Minimum spanning trees are important tools in the analysis and design of networks. Many practical applications require their computation, ranging from biology and linguistics to ec…
tinygarden -- A java package for testing properties of spanning trees
Manuel Dubinsky, César Massri, Gabriel Taubin
Spanning trees are fundamental objects in graph theory. The spanning tree set size of an arbitrary graph can be very large. This limitation discourages its analysis. However intere…
Three aspects of the MSTCI problem
Manuel Dubinsky, César Massri, Gabriel Taubin
Consider a connected graph and let be a spanning tree of . Every edge induces a cycle in . The intersection of two distinct such cycles is the…
Minimum Spanning Tree Cycle Intersection Problem
Manuel Dubinsky, César Massri, Gabriel Taubin
Consider a connected graph and let be a spanning tree of . Every edge induces a cycle in . The intersection of two distinct such cycles is the…
Solving congruence equations using Bernstein forms
César Massri, Manuel Dubinsky
We present a subdivision method to solve systems of congruence equations. This method is inspired in a subdivision method, based on Bernstein forms, to solve systems of polynomial…
Segmentation of real algebraic plane curves
Cesar Massri, Manuel Dubinsky
In this article we give an implementation of the standard algorithm to segment a real algebraic plane curve defined implicitly. Our implementation is efficient and simpler than pre…