Cristina G. Fernandes

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