( en | de | ru )

 

Disambiguation of "Fernandes, Cristina G."

Author of the publication

copydeleteadd this publication to your clipboard
A New Approximation Algorithm for Finding Heavy Planar Subgraphs.

, , , and . Algorithmica, 36 (2): 179-205 (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alfredo Fernandes

Mario Fernandes

Marcel Fernandes

Tomas Fernandes

Paulo Fernandes

 

Other publications of authors with the same name

Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width., , and . J. Algorithms, 48 (2): 333-359 (2003)A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems., , , and . Math. Program., 153 (2): 655-685 (2015)Approximating Minimum k-Section in Trees with Linear Diameter., , and . Electron. Notes Discret. Math., (2015)Second-Price Ad Auctions with Binary Bids and markets with good competition., and . Theor. Comput. Sci., (2014)Stability in geodesics for memoryless binary long-lived consensus., and . Electron. Notes Discret. Math., (2011)Approximations for the Steiner Multicycle Problem., , and . CoRR, (2023)Second-Price Ad Auctions with Binary Bids and Markets with Good Competition., and . ISCO, volume 7422 of Lecture Notes in Computer Science, page 439-450. Springer, (2012)The Envy-Free Pricing Problem and Unit-Demand Markets., , , and . ISCO, volume 8596 of Lecture Notes in Computer Science, page 230-241. Springer, (2014)Maximum Series-Parallel Subgraph., , , and . Algorithmica, 63 (1-2): 137-157 (2012)Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem., , , and . Inf. Process. Lett., 103 (5): 195-202 (2007)