default search action
Cristina G. Fernandes
Cristina Gomes Fernandes
Person information
- affiliation: Universidade de São Paulo
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j48]Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez:
Independent Dominating Sets in Planar Triangulations. Electron. J. Comb. 31(2) (2024) - [j47]Cristina G. Fernandes, Carla Negri Lintzmayer
, Phablo F. S. Moura:
Approximations for the Steiner Multicycle problem. Theor. Comput. Sci. 1020: 114836 (2024) - [c23]Cristina G. Fernandes
Separating Path Systems in Complete Graphs. LATIN (2) 2024: 98-113 - 2023
- [j46]Cristina G. Fernandes
How heavy independent sets help to find arborescences with many leaves in DAGs. J. Comput. Syst. Sci. 135: 158-174 (2023) - [j45]Santiago Valdés Ravelo
Complexity and approximability of Minimum Path-Collection Exact Covers. Theor. Comput. Sci. 942: 21-32 (2023) - [e1]Cristina G. Fernandes, Sergio Rajsbaum:
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, LAGOS 2023, Huatulco, Mexico, September 18-22, 2023. Procedia Computer Science 223, Elsevier 2023 [contents] - [i21]Fábio Botler
Independent dominating sets in planar triangulations. CoRR abs/2308.02754 (2023) - [i20]Cristina G. Fernandes, Carla Negri Lintzmayer
Approximations for the Steiner Multicycle Problem. CoRR abs/2308.07471 (2023) - 2022
- [j44]Cristina G. Fernandes, José Coelho de Pina, Jorge Luis Ramírez Alfonsín, Sinai Robins:
Period collapse in Ehrhart quasi-polynomials of \(\{1,3\}\)-graphs. Comb. Theory 2(3) (2022) - [j43]Cristina G. Fernandes, Carla Negri Lintzmayer
Leafy spanning arborescences in DAGs. Discret. Appl. Math. 323: 217-227 (2022) - [j42]Cristina G. Fernandes, Carla Negri Lintzmayer
Leafy spanning k-forests. J. Comb. Optim. 44(2): 934-946 (2022) - [c22]Cristina G. Fernandes
Approximations for the Steiner Multicycle Problem. LATIN 2022: 188-203 - 2021
- [j41]Cristina G. Fernandes
Cubic Graphs, Their Ehrhart Quasi-Polynomials, and a Scissors Congruence Phenomenon. Discret. Comput. Geom. 65(1): 227-243 (2021) - [j40]Fábio Botler
On Tuza's conjecture for triangulations and graphs with small treewidth. Discret. Math. 344(4): 112281 (2021) - [i19]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 abs/2104.11025 (2021) - [i18]Cristina G. Fernandes, Carla Negri Lintzmayer:
How heavy independent sets help to find arborescences with many leaves in DAGs. CoRR abs/2111.13464 (2021) - 2020
- [j39]Márcia R. Cerioli, Cristina G. Fernandes
Transversals of longest paths. Discret. Math. 343(3): 111717 (2020) - [c21]Cristina G. Fernandes
Leafy Spanning Arborescences in DAGs. LATIN 2020: 50-62 - [i17]Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez:
On Tuza's conjecture for triangulations and graphs with small treewidth. CoRR abs/2002.07925 (2020) - [i16]Cristina G. Fernandes, Carla Negri Lintzmayer:
Leafy Spanning Arborescences in DAGs. CoRR abs/2007.07660 (2020)
2010 – 2019
- 2019
- [j38]Cristina G. Fernandes
Counting Hamiltonian Cycles in the Matroid Basis Graph. Graphs Comb. 35(2): 539-550 (2019) - [j37]Cristina G. Fernandes
Prices of Anarchy of Selfish 2D Bin Packing Games. Int. J. Found. Comput. Sci. 30(3): 355-374 (2019) - [c20]Fábio Botler
On Tuza's Conjecture for Triangulations and Graphs with Small Treewidth. LAGOS 2019: 171-183 - [c19]Márcia R. Cerioli, Cristina G. Fernandes
On Edge-magic Labelings of Forests. LAGOS 2019: 299-307 - 2018
- [j36]Cristina G. Fernandes
Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. Algorithmica 80(3): 1041-1072 (2018) - [j35]Cristina G. Fernandes
Approximation Algorithms for the Max-Buying Problem with Limited Supply. Algorithmica 80(11): 2973-2992 (2018) - [j34]Cristina G. Fernandes
On minimum bisection and related cut problems in trees and tree-like graphs. J. Graph Theory 89(2): 214-245 (2018) - [p1]Gruia Calinescu, Cristina G. Fernandes:
Maximum Planar Subgraph. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - [i15]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 abs/1802.07164 (2018) - 2017
- [j33]Guantao Chen, Julia Ehrenmüller, Cristina G. Fernandes
Nonempty intersection of longest paths in series-parallel graphs. Discret. Math. 340(3): 287-304 (2017) - [j32]Márcia R. Cerioli, Cristina G. Fernandes
Transversals of Longest Paths. Electron. Notes Discret. Math. 62: 135-140 (2017) - [c18]Mário César San Felice
The Online Multicommodity Connected Facility Location Problem. WAOA 2017: 118-131 - [i14]Cristina G. Fernandes, Carlos E. Ferreira, Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
Prices of anarchy of selfish 2D bin packing games. CoRR abs/1707.07882 (2017) - [i13]Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz:
On Minimum Bisection and Related Cut Problems in Trees and Tree-Like Graphs. CoRR abs/1708.06411 (2017) - [i12]Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz:
Approximating the Minimum k-Section Width in Bounded-Degree Trees with Linear Diameter. CoRR abs/1708.06431 (2017) - [i11]Márcia R. Cerioli, Cristina G. Fernandes, Renzo Gómez, Juan Gutiérrez, Paloma T. Lima:
Transversals of Longest Paths. CoRR abs/1712.07086 (2017) - 2016
- [j31]Cristina G. Fernandes
Repetition-free longest common subsequence of random sequences. Discret. Appl. Math. 210: 75-87 (2016) - [j30]Cristina G. Fernandes
The envy-free pricing problem, unit-demand markets and connections with the network pricing problem. Discret. Optim. 22: 141-161 (2016) - [j29]Cristina G. Fernandes
Spanning trees with nonseparating paths. Discret. Math. 339(1): 365-374 (2016) - [j28]Cristina G. Fernandes
Kinetic clustering of points on the line. Theor. Comput. Sci. 639: 60-71 (2016) - [c17]Cristina G. Fernandes
Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. LATIN 2016: 441-453 - [i10]Cristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa:
Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. CoRR abs/1608.01721 (2016) - 2015
- [j27]Cristina G. Fernandes
On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width. Electron. Notes Discret. Math. 49: 481-488 (2015) - [j26]Cristina G. Fernandes
Trajectory clustering of points in R. Electron. Notes Discret. Math. 50: 53-58 (2015) - [j25]Cristina G. Fernandes
Approximating Minimum k-Section in Trees with Linear Diameter. Electron. Notes Discret. Math. 50: 71-76 (2015) - [j24]Cristina G. Fernandes
Geodesic stability for memoryless binary long-lived consensus. J. Comput. Syst. Sci. 81(7): 1210-1220 (2015) - [j23]Cristina G. Fernandes
A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems. Math. Program. 153(2): 655-685 (2015) - [i9]Cristina G. Fernandes, Marcio T. I. Oshiro:
Kinetic Clustering of Points on the Line. CoRR abs/1512.04303 (2015) - 2014
- [j22]Ernesto G. Birgin
A MILP model for an extended version of the Flexible Job Shop Problem. Optim. Lett. 8(4): 1417-1431 (2014) - [j21]Cristina G. Fernandes
Second-Price Ad Auctions with Binary Bids and markets with good competition. Theor. Comput. Sci. 540: 103-114 (2014) - [c16]Cristina G. Fernandes
The Envy-Free Pricing Problem and Unit-Demand Markets. ISCO 2014: 230-241 - [c15]Cristina G. Fernandes
Approximation Algorithms for the Max-Buying Problem with Limited Supply. LATIN 2014: 707-718 - [i8]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 abs/1401.3654 (2014) - 2013
- [j20]Susanna F. de Rezende
Intersecting longest paths. Discret. Math. 313(11): 1401-1408 (2013) - [i7]Marcos A. Kiwi, Cristina G. Fernandes:
Repetition-free longest common subsequence of random sequences. CoRR abs/1305.4883 (2013) - [i6]Cristina G. Fernandes, Rafael Crivellari Saliba Schouery:
Approximation Algorithms for the Max-Buying Problem with Limited Supply. CoRR abs/1309.7955 (2013) - [i5]Cristina G. Fernandes, Carlos Eduardo Ferreira, Álvaro Junio Pereira Franco, Rafael Crivellari Saliba Schouery:
The Unit-Demand Envy-Free Pricing Problem. CoRR abs/1310.0038 (2013) - 2012
- [j19]Gruia Calinescu
Maximum Series-Parallel Subgraph. Algorithmica 63(1-2): 137-157 (2012) - [c14]Cristina G. Fernandes
A Systematic Approach to Bound Factor Revealing LPs and Its Application to the Metric and Squared Metric Facility Location Problems. APPROX-RANDOM 2012: 146-157 - [c13]Cristina G. Fernandes
Second-Price Ad Auctions with Binary Bids and Markets with Good Competition. ISCO 2012: 439-450 - 2011
- [j18]Eduardo Sany Laber, Claudson F. Bornstein, Cristina G. Fernandes
Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN). Algorithmica 59(1): 1-2 (2011) - [j17]Cristina G. Fernandes, Maya Stein
Stability in geodesics for memoryless binary long-lived consensus. Electron. Notes Discret. Math. 37: 351-356 (2011) - [j16]Cristina G. Fernandes, Carlos Eduardo Ferreira, Flavio Keidi Miyazawa
Selfish Square Packing. Electron. Notes Discret. Math. 37: 369-374 (2011) - [j15]Susanna F. de Rezende
Intersection of Longest Paths in a Graph. Electron. Notes Discret. Math. 38: 743-748 (2011) - [i4]Cristina G. Fernandes, Maya Stein:
Geodesic stability for memoryless binary long-lived consensus. CoRR abs/1102.4100 (2011) - [i3]Cristina G. Fernandes, Robin Thomas:
Edge-coloring series-parallel multigraphs. CoRR abs/1107.5370 (2011) - [i2]Cristina G. Fernandes, Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa:
Squared Metric Facility Location Problem. CoRR abs/1111.1672 (2011) - 2010
- [j14]Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes
Repetition-free longest common subsequence. Discret. Appl. Math. 158(12): 1315-1324 (2010) - [j13]José R. Correa, Cristina G. Fernandes
Approximating a class of combinatorial problems with rational objective function. Math. Program. 124(1-2): 255-269 (2010) - [i1]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 abs/1004.1437 (2010)
2000 – 2009
- 2009
- [j12]Cristina G. Fernandes
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. Discret. Appl. Math. 157(2): 272-279 (2009) - [j11]Hammurabi Mendes, Cristina G. Fernandes:
A Concurrent Implementation of Skip Graphs. Electron. Notes Discret. Math. 35: 263-268 (2009) - [c12]Gruia Calinescu
Maximum Series-Parallel Subgraph. WG 2009: 54-65 - 2008
- [j10]Gruia Calinescu, Cristina G. Fernandes
On the k-Structure Ratio in Planar and Outerplanar Graphs. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - [j9]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: 243-248 (2008) - [c11]Cristina G. Fernandes
A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant. LATIN 2008: 329-338 - 2007
- [j8]Paulo Feofiloff
Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem. Inf. Process. Lett. 103(5): 195-202 (2007) - [c10]José R. Correa, Cristina G. Fernandes
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs. WAOA 2007: 184-192 - [r1]Cristina G. Fernandes, Gruia Calinescu:
Maximum Planar Subgraph. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j7]Vincent Lacroix, Cristina G. Fernandes
Motif Search in Graphs: Application to Metabolic Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 3(4): 360-368 (2006) - [c9]José R. Correa, Cristina G. Fernandes
Approximating Rational Objectives Is as Easy as Approximating Linear Ones. SWAT 2006: 351-362 - 2005
- [c8]Vincent Lacroix, Cristina G. Fernandes
Reaction Motifs in Metabolic Networks. WABI 2005: 178-191 - 2004
- [j6]Cristina G. Fernandes
From monomials to words to graphs. J. Comb. Theory A 105(2): 185-206 (2004) - [c7]John M. Boyer, Cristina G. Fernandes
Lempel, Even, and Cederbaum Planarity Method. WEA 2004: 129-144 - 2003
- [j5]Gruia Calinescu
A New Approximation Algorithm for Finding Heavy Planar Subgraphs. Algorithmica 36(2): 179-205 (2003) - [j4]Gruia Calinescu
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. J. Algorithms 48(2): 333-359 (2003) - [c6]Gruia Calinescu, Cristina G. Fernandes
Primal-dual algorithms for QoS multimedia multicast. GLOBECOM 2003: 3631-3635 - 2001
- [j3]Gruia Calinescu
Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width. Electron. Notes Discret. Math. 7: 194-197 (2001) - [c5]Cristina G. Fernandes
The UPS Problem. STACS 2001: 238-246
1990 – 1999
- 1998
- [j2]Gruia Calinescu
A Better Approximation Algorithm for Finding Planar Subgraphs. J. Algorithms 27(2): 269-302 (1998) - [j1]Cristina G. Fernandes
A Better Approximation Ratio for the Minimum Size k-Edge-Connected Spanning Subgraph Problem. J. Algorithms 28(1): 105-124 (1998) - [c4]Gruia Calinescu
Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. IPCO 1998: 137-152 - 1997
- [c3]Cristina G. Fernandes:
A Better Approximation Ratio for the Minimum k-Edge-Connected Spanning Subgraph Problem. SODA 1997: 629-638 - 1996
- [c2]Gruia Calinescu
Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus. COCOON 1996: 152-161 - [c1]Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff:
A Better Approximation Algorithm for Finding Planar Subgraphs. SODA 1996: 16-25
Coauthor Index
Carlos Eduardo Ferreira
aka: Carlos E. Ferreira
aka: Carlos E. Ferreira
Rafael C. S. Schouery
aka: Rafael Crivellari Saliba Schouery
aka: Rafael Crivellari Saliba Schouery
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-26 20:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: