Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus. - Gruia Calinescu; Cristina G. Fernandes (COCOON, 1996)

A Better Approximation Ratio for the Minimum k-Edge-Connected Spanning Subgraph Problem. - Cristina G. Fernandes (SODA, 1997)

Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. - Gruia Calinescu; Cristina G. Fernandes; Bruce A. Reed (IPCO, 1998)

A Better Approximation Algorithm for Finding Planar Subgraphs. - Gruia Calinescu; Cristina G. Fernandes; Ulrich Finkler; Howard J. Karloff (J. Algorithms, 1998)

A Better Approximation Ratio for the Minimum Size k-Edge-Connected Spanning Subgraph Problem. - Cristina G. Fernandes (J. Algorithms, 1998)

The UPS Problem. - Cristina G. Fernandes; Till Nierhoff (STACS, 2001)

Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width. - Gruia Calinescu; Cristina G. Fernandes (Electron. Notes Discret. Math., 2001)

Primal-dual algorithms for QoS multimedia multicast. - Gruia Calinescu; Cristina G. Fernandes; Ion I. Mandoiu; Alexander Olshevsky; K. Yang; Alexander Zelikovsky (GLOBECOM, 2003)

A New Approximation Algorithm for Finding Heavy Planar Subgraphs. - Gruia Calinescu; Cristina G. Fernandes; Howard J. Karloff; Alexander Zelikovsky (Algorithmica, 2003)

Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. - Gruia Calinescu; Cristina G. Fernandes; Bruce A. Reed (J. Algorithms, 2003)

Lempel, Even, and Cederbaum Planarity Method. - John M. Boyer; Cristina G. Fernandes; Alexandre Noma; José Coelho de Pina (WEA, 2004)

From monomials to words to graphs. - Cristina G. Fernandes; Edward L. Green; Arnaldo Mandel (J. Comb. Theory A, 2004)

Reaction Motifs in Metabolic Networks. - Vincent Lacroix; Cristina G. Fernandes; Marie-France Sagot (WABI, 2005)

Approximating Rational Objectives Is as Easy as Approximating Linear Ones. - José R. Correa; Cristina G. Fernandes; Yoshiko Wakabayashi (SWAT, 2006)

Motif Search in Graphs: Application to Metabolic Networks. - Vincent Lacroix; Cristina G. Fernandes; Marie-France Sagot (IEEE ACM Trans. Comput. Biol. Bioinform., 2006)

A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs. - José R. Correa; Cristina G. Fernandes; Martín Matamala; Yoshiko Wakabayashi (WAOA, 2007)

Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem. - Paulo Feofiloff; Cristina G. Fernandes; Carlos Eduardo Ferreira; José Coelho de Pina (Inf. Process. Lett., 2007)

Maximum Planar Subgraph. - Cristina G. Fernandes; Gruia Calinescu (Handbook of Approximation Algorithms and Metaheuristics, 2007)

A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant. - Cristina G. Fernandes; Carlos Eduardo Ferreira; Christian Tjandraatmadja; Yoshiko Wakabayashi (LATIN, 2008)

On the k-Structure Ratio in Planar and Outerplanar Graphs. - Gruia Calinescu; Cristina G. Fernandes (Discret. Math. Theor. Comput. Sci., 2008)

Maximum Series-Parallel Subgraph. - Gruia Calinescu; Cristina G. Fernandes; Hemanshu Kaul (WG, 2009)

Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. - Cristina G. Fernandes; Orlando Lee; Yoshiko Wakabayashi (Discret. Appl. Math., 2009)

A Concurrent Implementation of Skip Graphs. - Hammurabi Mendes; Cristina G. Fernandes (Electron. Notes Discret. Math., 2009)

A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem - Paulo Feofiloff; Cristina G. Fernandes; Carlos Eduardo Ferreira; José Coelho de Pina (CoRR, 2010)

Repetition-free longest common subsequence. - Said Sadique Adi; Marília D. V. Braga; Cristina G. Fernandes; Carlos Eduardo Ferreira; Fábio Viduani Martinez; Marie-France Sagot; Marco Aurelio Stefanes; Christian Tjandraatmadja; Yoshiko Wakabayashi (Discret. Appl. Math., 2010)

Approximating a class of combinatorial problems with rational objective function. - José R. Correa; Cristina G. Fernandes; Yoshiko Wakabayashi (Math. Program., 2010)

Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN). - Eduardo Sany Laber; Claudson F. Bornstein; Cristina G. Fernandes (Algorithmica, 2011)

Edge-coloring series-parallel multigraphs - Cristina G. Fernandes; Robin Thomas 001 (CoRR, 2011)

Squared Metric Facility Location Problem - Cristina G. Fernandes; Luis A. A. Meira; Flávio Keidi Miyazawa; Lehilton L. C. Pedrosa (CoRR, 2011)

Selfish Square Packing. - Cristina G. Fernandes; Carlos Eduardo Ferreira; Flavio Keidi Miyazawa; Yoshiko Wakabayashi (Electron. Notes Discret. Math., 2011)

Stability in geodesics for memoryless binary long-lived consensus. - Cristina G. Fernandes; Maya Stein (Electron. Notes Discret. Math., 2011)

Intersection of Longest Paths in a Graph. - Susanna F. de Rezende; Cristina G. Fernandes; Daniel M. Martin; Yoshiko Wakabayashi (Electron. Notes Discret. Math., 2011)

Maximum Series-Parallel Subgraph. - Gruia Calinescu; Cristina G. Fernandes; Hemanshu Kaul; Alexander Zelikovsky (Algorithmica, 2012)

The Unit-Demand Envy-Free Pricing Problem. - Cristina G. Fernandes; Carlos Eduardo Ferreira; Álvaro Junio Pereira Franco; Rafael Crivellari Saliba Schouery (CoRR, 2013)

Intersecting longest paths. - Susanna F. de Rezende; Cristina G. Fernandes; Daniel M. Martin; Yoshiko Wakabayashi (Discret. Math., 2013)

The Envy-Free Pricing Problem and Unit-Demand Markets. - Cristina G. Fernandes; Carlos Eduardo Ferreira; Álvaro Junio Pereira Franco; Rafael Crivellari Saliba Schouery (ISCO, 2014)

A MILP model for an extended version of the Flexible Job Shop Problem. - Ernesto G. Birgin; Paulo Feofiloff; Cristina G. Fernandes; Everton L. de Melo; Marcio T. I. Oshiro; Débora P. Ronconi (Optim. Lett., 2014)

Second-Price Ad Auctions with Binary Bids and markets with good competition. - Cristina G. Fernandes; Rafael Crivellari Saliba Schouery (Theor. Comput. Sci., 2014)

Trajectory clustering of points in R. - Cristina G. Fernandes; Marcio T. I. Oshiro (Electron. Notes Discret. Math., 2015)

On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width. - Cristina G. Fernandes; Tina Janne Schmidt; Anusch Taraz (Electron. Notes Discret. Math., 2015)

Approximating Minimum k-Section in Trees with Linear Diameter. - Cristina G. Fernandes; Tina Janne Schmidt; Anusch Taraz (Electron. Notes Discret. Math., 2015)

Geodesic stability for memoryless binary long-lived consensus. - Cristina G. Fernandes; Maya Jakobine Stein (J. Comput. Syst. Sci., 2015)

A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems. - Cristina G. Fernandes; Luis A. A. Meira; Flávio Keidi Miyazawa; Lehilton L. C. Pedrosa (Math. Program., 2015)

Repetition-free longest common subsequence of random sequences. - Cristina G. Fernandes; Marcos A. Kiwi (Discret. Appl. Math., 2016)

The envy-free pricing problem, unit-demand markets and connections with the network pricing problem. - Cristina G. Fernandes; Carlos E. Ferreira; Álvaro Junio Pereira Franco; Rafael Crivellari Saliba Schouery (Discret. Optim., 2016)

Spanning trees with nonseparating paths. - Cristina G. Fernandes; César Hernández-Vélez; Orlando Lee; José Coelho de Pina (Discret. Math., 2016)

Kinetic clustering of points on the line. - Cristina G. Fernandes; Marcio T. I. Oshiro (Theor. Comput. Sci., 2016)

The Online Multicommodity Connected Facility Location Problem. - Mário César San Felice; Cristina G. Fernandes; Carla Negri Lintzmayer (WAOA, 2017)

Approximating the Minimum k-Section Width in Bounded-Degree Trees with Linear Diameter. - Cristina G. Fernandes; Tina Janne Schmidt; Anusch Taraz (CoRR, 2017)

Nonempty intersection of longest paths in series-parallel graphs. - Guantao Chen; Julia Ehrenmüller; Cristina G. Fernandes; Carl Georg Heise; Songling Shan; Ping Yang; Amy N. Yates (Discret. Math., 2017)

Transversals of Longest Paths. - Márcia R. Cerioli; Cristina G. Fernandes; Renzo Gómez; Juan Gutiérrez 001; Paloma T. Lima (Electron. Notes Discret. Math., 2017)

Maximum Planar Subgraph. - Gruia Calinescu; Cristina G. Fernandes (Handbook of Approximation Algorithms and Metaheuristics (2), 2018)

Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. - Cristina G. Fernandes; Samuel P. de Paula; Lehilton L. C. Pedrosa (Algorithmica, 2018)

Approximation Algorithms for the Max-Buying Problem with Limited Supply. - Cristina G. Fernandes; Rafael Crivellari Saliba Schouery (Algorithmica, 2018)

On minimum bisection and related cut problems in trees and tree-like graphs. - Cristina G. Fernandes; Tina Janne Schmidt; Anusch Taraz (J. Graph Theory, 2018)

On Tuza's Conjecture for Triangulations and Graphs with Small Treewidth. - Fábio Botler; Cristina G. Fernandes; Juan Gutiérrez 001 (LAGOS, 2019)

On Edge-magic Labelings of Forests. - Márcia R. Cerioli; Cristina G. Fernandes; Orlando Lee; Carla Negri Lintzmayer; Guilherme Oliveira Mota; Cândida Nunes da Silva (LAGOS, 2019)

Counting Hamiltonian Cycles in the Matroid Basis Graph. - Cristina G. Fernandes; César Hernández-Vélez; José Coelho de Pina; Jorge Luis Ramírez Alfonsín (Graphs Comb., 2019)

Prices of Anarchy of Selfish 2D Bin Packing Games. - Cristina G. Fernandes; Carlos E. Ferreira; Flávio Keidi Miyazawa; Yoshiko Wakabayashi (Int. J. Found. Comput. Sci., 2019)

On the period collapse of a family of Ehrhart quasi-polynomials. - Cristina G. Fernandes; José Coelho de Pina; Jorge L. Ramírez Alfonsín; Sinai Robins (CoRR, 2021)

Cubic Graphs, Their Ehrhart Quasi-Polynomials, and a Scissors Congruence Phenomenon. - Cristina G. Fernandes; José Coelho de Pina; Jorge Luis Ramírez Alfonsín; Sinai Robins (Discret. Comput. Geom., 2021)

Period collapse in Ehrhart quasi-polynomials of ( {1,3 } )-graphs. - Cristina G. Fernandes; José Coelho de Pina; Jorge Luis Ramírez Alfonsín; Sinai Robins (Comb. Theory, 2022)

Leafy spanning arborescences in DAGs. - Cristina G. Fernandes; Carla Negri Lintzmayer (Discret. Appl. Math., 2022)

Leafy spanning k-forests. - Cristina G. Fernandes; Carla Negri Lintzmayer; Mário César San Felice (J. Comb. Optim., 2022)

Complexity and approximability of Minimum Path-Collection Exact Covers. - Santiago Valdés Ravelo; Cristina G. Fernandes (Theor. Comput. Sci., 2023)

How heavy independent sets help to find arborescences with many leaves in DAGs. - Cristina G. Fernandes; Carla Negri Lintzmayer (J. Comput. Syst. Sci., 2023)

Independent Dominating Sets in Planar Triangulations. - Fábio Botler; Cristina G. Fernandes; Juan Gutiérrez 001 (Electron. J. Comb., 2024)

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs. - Fábio Botler; Y. S. Couto; Cristina G. Fernandes; E. F. de Figueiredo; Renzo Gómez; V. F. dos Santos; C. M. Sato (CoRR, 2024)

Approximations for the Steiner Multicycle problem. - Cristina G. Fernandes; Carla Negri Lintzmayer; Phablo F. S. Moura (Theor. Comput. Sci., 2024)

Packing large balanced trees into bipartite graphs. - Cristina G. Fernandes; Tássio Naia; Giovanne Santos; Maya Stein (Discret. Math., 2025)

Separating Path Systems in Complete Graphs. - Cristina G. Fernandes; Guilherme Oliveira Mota; Nicolás Sanhueza-Matamala (Random Struct. Algorithms, 2025)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree. - Fábio Botler; Cristina G. Fernandes; Carla Negri Lintzmayer; Rui A. Lopes; Suchismita Mishra 001; Bruno L. Netto; Maycon Sambinelli (CoRR, 2025)