arXiv 2004-11-17 EN Lower-Stretch Spanning Trees Elkin, Michael · Emek, Yuval · Spielman, Daniel A. · Teng, Shang-Hua
arXiv 2004-09-08 EN Locally connected spanning trees on graphs Lin, Ching-Chi · Chang, Gerard J. · Chen, Gen-Huey
arXiv 2003-06-25 EN Complexity of Cycle Length Modularity Problems in Graphs Hemaspaandra, Edith · Spakowski, Holger · Thakur, Mayur
arXiv 2002-12-16 EN Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems Fekete, Sandor P. · Meijer, Henk · Rohe, Andre · Tietze, Walter
arXiv 2002-11-25 EN Solution Bounds for a Hypothetical Polynomial Time Aproximation Algorithm for the TSP Yaneff, A. G.
arXiv 2002-06-12 EN Simultaneous Embedding of a Planar Graph and Its Dual on the Grid Erten, C. · Kobourov, S. G.
arXiv 2002-06-11 EN On Simultaneous Graph Embedding Duncan, C. A. · Efrat, A. · Erten, C. · Kobourov, S. +1
arXiv 2001-10-27 EN Vertex-Unfoldings of Simplicial Manifolds Demaine, Erik D. · Eppstein, David · Erickson, Jeff · Hart, George W. +1
arXiv 2001-03-31 EN Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure Demetrescu, Camil · Italiano, Giuseppe F.
arXiv 2001-02-10 EN Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time Hsu, Tsan-sheng · Kao, Ming-Yang