Cristina G. Fernandes

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 44

Top Topics

Approximation Algorithms

Bounded Tree Width

Facility Location Problem

Top Venues

Electron. Notes Discret. Math.

Publications

Cristina G. Fernandes, Guilherme Oliveira Mota, Nicolás Sanhueza-Matamala
Separating Path Systems in Complete Graphs. LATIN (2) (2024)
Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez
Independent Dominating Sets in Planar Triangulations. Electron. J. Comb. 31 (2) (2024)
Cristina G. Fernandes, Carla Negri Lintzmayer, Phablo F. S. Moura
Approximations for the Steiner Multicycle Problem. CoRR (2023)
Santiago Valdés Ravelo, Cristina G. Fernandes
Complexity and approximability of Minimum Path-Collection Exact Covers. Theor. Comput. Sci. 942 (2023)
Cristina G. Fernandes, Carla Negri Lintzmayer
How heavy independent sets help to find arborescences with many leaves in DAGs. J. Comput. Syst. Sci. 135 (2023)
Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez
Independent dominating sets in planar triangulations. CoRR (2023)
Cristina G. Fernandes, Carla Negri Lintzmayer, Phablo F. S. Moura
Approximations for the Steiner Multicycle Problem. LATIN (2022)
Cristina G. Fernandes, Carla Negri Lintzmayer, Mário César San Felice
Leafy spanning k-forests. J. Comb. Optim. 44 (2) (2022)
Cristina G. Fernandes, Carla Negri Lintzmayer
Leafy spanning arborescences in DAGs. Discret. Appl. Math. 323 (2022)
Cristina G. Fernandes, Carla Negri Lintzmayer
How heavy independent sets help to find arborescences with many leaves in DAGs. CoRR (2021)
Cristina G. Fernandes, José Coelho de Pina, Jorge L. Ramírez Alfonsín, Sinai Robins
On the period collapse of a family of Ehrhart quasi-polynomials. CoRR (2021)
Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez
On Tuza's conjecture for triangulations and graphs with small treewidth. Discret. Math. 344 (4) (2021)
Cristina G. Fernandes, José Coelho de Pina, Jorge Luis Ramírez Alfonsín, Sinai Robins
Cubic Graphs, Their Ehrhart Quasi-Polynomials, and a Scissors Congruence Phenomenon. Discret. Comput. Geom. 65 (1) (2021)
Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez
On Tuza's conjecture for triangulations and graphs with small treewidth. CoRR (2020)
Cristina G. Fernandes, Carla Negri Lintzmayer
Leafy Spanning Arborescences in DAGs. CoRR (2020)
Márcia R. Cerioli, Cristina G. Fernandes, Renzo Gómez, Juan Gutiérrez, Paloma T. Lima
Transversals of longest paths. Discret. Math. 343 (3) (2020)
Cristina G. Fernandes, Carla Negri Lintzmayer
Leafy Spanning Arborescences in DAGs. LATIN (2020)
Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez
On Tuza's Conjecture for Triangulations and Graphs with Small Treewidth. LAGOS (2019)
Cristina G. Fernandes, César Hernández-Vélez, José Coelho de Pina, Jorge Luis Ramírez Alfonsín
Counting Hamiltonian Cycles in the Matroid Basis Graph. Graphs Comb. 35 (2) (2019)
Cristina G. Fernandes, Carlos E. Ferreira, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
Prices of Anarchy of Selfish 2D Bin Packing Games. Int. J. Found. Comput. Sci. 30 (3) (2019)
Márcia R. Cerioli, Cristina G. Fernandes, Orlando Lee, Carla Negri Lintzmayer, Guilherme Oliveira Mota, Cândida Nunes da Silva
On Edge-magic Labelings of Forests. LAGOS (2019)
Cristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa
Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. Algorithmica 80 (3) (2018)
Cristina G. Fernandes, José Coelho de Pina, Jorge Luis Ramírez Alfonsín, Sinai Robins
Cubic graphs, their Ehrhart quasi-polynomials, and a scissors congruence phenomenon. CoRR (2018)
Cristina G. Fernandes, Rafael Crivellari Saliba Schouery
Approximation Algorithms for the Max-Buying Problem with Limited Supply. Algorithmica 80 (11) (2018)
Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz
On minimum bisection and related cut problems in trees and tree-like graphs. J. Graph Theory 89 (2) (2018)
Guantao Chen, Julia Ehrenmüller, Cristina G. Fernandes, Carl Georg Heise, Songling Shan, Ping Yang, Amy N. Yates
Nonempty intersection of longest paths in series-parallel graphs. Discret. Math. 340 (3) (2017)
Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz
On Minimum Bisection and Related Cut Problems in Trees and Tree-Like Graphs. CoRR (2017)
Mário César San Felice, Cristina G. Fernandes, Carla Negri Lintzmayer
The Online Multicommodity Connected Facility Location Problem. WAOA (2017)
Márcia R. Cerioli, Cristina G. Fernandes, Renzo Gómez, Juan Gutiérrez, Paloma T. Lima
Transversals of Longest Paths. Electron. Notes Discret. Math. 62 (2017)
Márcia R. Cerioli, Cristina G. Fernandes, Renzo Gómez, Juan Gutiérrez, Paloma T. Lima
Transversals of Longest Paths. CoRR (2017)
Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz
Approximating the Minimum k-Section Width in Bounded-Degree Trees with Linear Diameter. CoRR (2017)
Cristina G. Fernandes, Carlos E. Ferreira, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
Prices of anarchy of selfish 2D bin packing games. CoRR (2017)
Cristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa
Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. LATIN (2016)
Cristina G. Fernandes, Marcio T. I. Oshiro
Kinetic clustering of points on the line. Theor. Comput. Sci. 639 (2016)
Cristina G. Fernandes, Carlos E. Ferreira, Álvaro Junio Pereira Franco, Rafael Crivellari Saliba Schouery
The envy-free pricing problem, unit-demand markets and connections with the network pricing problem. Discret. Optim. 22 (2016)
Cristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa
Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. CoRR (2016)
Cristina G. Fernandes, Marcos A. Kiwi
Repetition-free longest common subsequence of random sequences. Discret. Appl. Math. 210 (2016)
Cristina G. Fernandes, César Hernández-Vélez, Orlando Lee, José Coelho de Pina
Spanning trees with nonseparating paths. Discret. Math. 339 (1) (2016)
Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz
On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width. Electron. Notes Discret. Math. 49 (2015)
Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz
Approximating Minimum k-Section in Trees with Linear Diameter. Electron. Notes Discret. Math. 50 (2015)
Cristina G. Fernandes, Maya Jakobine Stein
Geodesic stability for memoryless binary long-lived consensus. J. Comput. Syst. Sci. 81 (7) (2015)
Cristina G. Fernandes, Marcio T. I. Oshiro
Trajectory clustering of points in R. Electron. Notes Discret. Math. 50 (2015)
Cristina G. Fernandes, Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa
A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems. Math. Program. 153 (2) (2015)
Cristina G. Fernandes, Marcio T. I. Oshiro
Kinetic Clustering of Points on the Line. CoRR (2015)
Cristina G. Fernandes, Rafael Crivellari Saliba Schouery
Second-Price Ad Auctions with Binary Bids and markets with good competition. Theor. Comput. Sci. 540 (2014)
Cristina G. Fernandes, Rafael Crivellari Saliba Schouery
Approximation Algorithms for the Max-Buying Problem with Limited Supply. LATIN (2014)
Ernesto G. Birgin, Paulo Feofiloff, Cristina G. Fernandes, Everton L. de Melo, Marcio T. I. Oshiro, Débora P. Ronconi
A MILP model for an extended version of the Flexible Job Shop Problem. CoRR (2014)
Ernesto G. Birgin, Paulo Feofiloff, Cristina G. Fernandes, Everton L. de Melo, Marcio T. I. Oshiro, Débora P. Ronconi
A MILP model for an extended version of the Flexible Job Shop Problem. Optim. Lett. 8 (4) (2014)
Cristina G. Fernandes, Carlos Eduardo Ferreira, Álvaro Junio Pereira Franco, Rafael Crivellari Saliba Schouery
The Envy-Free Pricing Problem and Unit-Demand Markets. ISCO (2014)
Cristina G. Fernandes, Carlos Eduardo Ferreira, Álvaro Junio Pereira Franco, Rafael Crivellari Saliba Schouery
The Unit-Demand Envy-Free Pricing Problem. CoRR (2013)
Susanna F. de Rezende, Cristina G. Fernandes, Daniel M. Martin, Yoshiko Wakabayashi
Intersecting longest paths. Discret. Math. 313 (11) (2013)
Marcos A. Kiwi, Cristina G. Fernandes
Repetition-free longest common subsequence of random sequences CoRR (2013)
Cristina G. Fernandes, Rafael Crivellari Saliba Schouery
Approximation Algorithms for the Max-Buying Problem with Limited Supply. CoRR (2013)
Cristina G. Fernandes, Rafael Crivellari Saliba Schouery
Second-Price Ad Auctions with Binary Bids and Markets with Good Competition. ISCO (2012)
Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul, Alexander Zelikovsky
Maximum Series-Parallel Subgraph. Algorithmica 63 (1-2) (2012)
Cristina G. Fernandes, Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa
A Systematic Approach to Bound Factor Revealing LPs and Its Application to the Metric and Squared Metric Facility Location Problems. APPROX-RANDOM (2012)
Cristina G. Fernandes, Maya Stein
Stability in geodesics for memoryless binary long-lived consensus. Electron. Notes Discret. Math. 37 (2011)
Cristina G. Fernandes, Carlos Eduardo Ferreira, Flavio Keidi Miyazawa, Yoshiko Wakabayashi
Selfish Square Packing. Electron. Notes Discret. Math. 37 (2011)
Eduardo Sany Laber, Claudson F. Bornstein, Cristina G. Fernandes
Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN). Algorithmica 59 (1) (2011)
Cristina G. Fernandes, Maya Stein
Geodesic stability for memoryless binary long-lived consensus CoRR (2011)
Cristina G. Fernandes, Robin Thomas
Edge-coloring series-parallel multigraphs CoRR (2011)
Cristina G. Fernandes, Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa
Squared Metric Facility Location Problem CoRR (2011)
Susanna F. de Rezende, Cristina G. Fernandes, Daniel M. Martin, Yoshiko Wakabayashi
Intersection of Longest Paths in a Graph. Electron. Notes Discret. Math. 38 (2011)
Paulo Feofiloff, Cristina G. Fernandes, Carlos Eduardo Ferreira, José Coelho de Pina
A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem CoRR (2010)
José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi
Approximating a class of combinatorial problems with rational objective function. Math. Program. 124 (1-2) (2010)
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
Repetition-free longest common subsequence. Discret. Appl. Math. 158 (12) (2010)
Hammurabi Mendes, Cristina G. Fernandes
A Concurrent Implementation of Skip Graphs. Electron. Notes Discret. Math. 35 (2009)
Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul
Maximum Series-Parallel Subgraph. WG (2009)
Cristina G. Fernandes, Orlando Lee, Yoshiko Wakabayashi
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. Discret. Appl. Math. 157 (2) (2009)
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
Repetition-free longest common subsequence. Electron. Notes Discret. Math. 30 (2008)
Gruia Calinescu, Cristina G. Fernandes
On the k-Structure Ratio in Planar and Outerplanar Graphs. Discret. Math. Theor. Comput. Sci. 10 (3) (2008)
Cristina G. Fernandes, Carlos Eduardo Ferreira, Christian Tjandraatmadja, Yoshiko Wakabayashi
A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant. LATIN (2008)
José R. Correa, Cristina G. Fernandes, Martín Matamala, Yoshiko Wakabayashi
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs. WAOA (2007)
Paulo Feofiloff, Cristina G. Fernandes, Carlos Eduardo Ferreira, José Coelho de Pina
Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem. Inf. Process. Lett. 103 (5) (2007)
José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi
Approximating Rational Objectives Is as Easy as Approximating Linear Ones. SWAT (2006)
Vincent Lacroix, Cristina G. Fernandes, Marie-France Sagot
Motif Search in Graphs: Application to Metabolic Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 3 (4) (2006)
Vincent Lacroix, Cristina G. Fernandes, Marie-France Sagot
Reaction Motifs in Metabolic Networks. WABI (2005)
Cristina G. Fernandes, Edward L. Green, Arnaldo Mandel
From monomials to words to graphs. J. Comb. Theory, Ser. A 105 (2) (2004)
John M. Boyer, Cristina G. Fernandes, Alexandre Noma, José Coelho de Pina
Lempel, Even, and Cederbaum Planarity Method. WEA (2004)
Gruia Calinescu, Cristina G. Fernandes, Howard J. Karloff, Alexander Zelikovsky
A New Approximation Algorithm for Finding Heavy Planar Subgraphs. Algorithmica 36 (2) (2003)
Gruia Calinescu, Cristina G. Fernandes, Ion I. Mandoiu, Alexander Olshevsky, K. Yang, Alexander Zelikovsky
Primal-dual algorithms for QoS multimedia multicast. GLOBECOM (2003)
Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. J. Algorithms 48 (2) (2003)
Cristina G. Fernandes, Till Nierhoff
The UPS Problem. STACS (2001)
Gruia Calinescu, Cristina G. Fernandes
Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width. Electron. Notes Discret. Math. 7 (2001)
Cristina G. Fernandes
-Edge-Connected Spanning Subgraph Problem. J. Algorithms 28 (1) (1998)
Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff
A Better Approximation Algorithm for Finding Planar Subgraphs. J. Algorithms 27 (2) (1998)
Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed
Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. IPCO (1998)
Cristina G. Fernandes
A Better Approximation Ratio for the Minimum k-Edge-Connected Spanning Subgraph Problem. SODA (1997)
Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff
A Better Approximation Algorithm for Finding Planar Subgraphs. SODA (1996)
Gruia Calinescu, Cristina G. Fernandes
Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus. COCOON (1996)