Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Fernandes, Cristina Gomes - Departamento de Ciência da Computação, Universidade de São Paulo
arXiv:1004.1437v1[cs.DS]8Apr2010 A Note on Johnson, Minkoff and Phillips' Algorithm
PrimalDual Algorithms for QoS Multimedia Multicast G. Calinescu C.G. Fernandes y I.I. Mandoiu z A. Olshevsky x K. Yang { A. Zelikovsky {
Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus
Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width
log n) implementation of an approximation for the Prize-Collecting Steiner Tree Problem
A Better Approximation Algorithm for Finding Planar Subgraphs Gruia Calinescu \Lambda Cristina G. Fernandes y Ulrich Finkler z Howard Karloff \Lambda
A Better Approximation Algorithm for Finding Planar Subgraphs Gruia Calinescu \Lambda Cristina G. Fernandes y Ulrich Finkler z Howard Karloff \Lambda
COMPUTAO QUNTICA: COMPLEXIDADE E ALGORITMOS
Multicuts in Unweighted Graphs and Digraphs with Bounded Degree and Bounded TreeWidth *
Multilength Single Pair Shortest Disjoint Paths Cristina G. Fernandes 1 y Hein van der Holst 2 z Jos e Coelho de Pina 1
Multicuts in Unweighted Graphs with Bounded Degree and Bounded TreeWidth
Lempel, Even, and Cederbaum Planarity Method
A Better Approximation Ratio for the Minimum Size k-Edge-Connected Spanning Subgraph Problem
Edge-Coloring Series-Parallel Multigraphs Cristina G. Fernandes
A New Approximation Algorithm for Finding Heavy Planar Subgraphs Gruia Calinescu \Lambda Cristina G. Fernandes y Howard Karloff z Alexander Zelikovsky x
The UPS Problem Cristina G. Fernandes 1;? and Till Nierho 2;??
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
A Better Approximation Ratio for the Minimum kedgeconnected Spanning Subgraph Problem
Lempel, Even, and Cederbaum Planarity Method
arXiv:1004.1437v1 A Note on Johnson, Minko and Phillips' Algorithm
