Cristina G. Fernandes

According to our database1, Cristina G. Fernandes authored at least 61 papers between 1996 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Leafy Spanning Arborescences in DAGs.
CoRR, 2020

2019
Prices of Anarchy of Selfish 2D Bin Packing Games.
Int. J. Found. Comput. Sci., 2019

Counting Hamiltonian Cycles in the Matroid Basis Graph.
Graphs Comb., 2019

On Edge-magic Labelings of Forests.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On Tuza's Conjecture for Triangulations and Graphs with Small Treewidth.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018
On minimum bisection and related cut problems in trees and tree-like graphs.
J. Graph Theory, 2018

Cubic graphs, their Ehrhart quasi-polynomials, and a scissors congruence phenomenon.
CoRR, 2018

Approximation Algorithms for the Max-Buying Problem with Limited Supply.
Algorithmica, 2018

Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center.
Algorithmica, 2018

Maximum Planar Subgraph.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Transversals of Longest Paths.
Electron. Notes Discret. Math., 2017

Nonempty intersection of longest paths in series-parallel graphs.
Discret. Math., 2017

Approximating the Minimum k-Section Width in Bounded-Degree Trees with Linear Diameter.
CoRR, 2017

The Online Multicommodity Connected Facility Location Problem.
Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

2016
Kinetic clustering of points on the line.
Theor. Comput. Sci., 2016

Spanning trees with nonseparating paths.
Discret. Math., 2016

The envy-free pricing problem, unit-demand markets and connections with the network pricing problem.
Discret. Optim., 2016

Repetition-free longest common subsequence of random sequences.
Discret. Appl. Math., 2016

2015
A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems.
Math. Program., 2015

Geodesic stability for memoryless binary long-lived consensus.
J. Comput. Syst. Sci., 2015

Approximating Minimum k-Section in Trees with Linear Diameter.
Electron. Notes Discret. Math., 2015

On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width.
Electron. Notes Discret. Math., 2015

Trajectory clustering of points in R.
Electron. Notes Discret. Math., 2015

2014
Second-Price Ad Auctions with Binary Bids and markets with good competition.
Theor. Comput. Sci., 2014

A MILP model for an extended version of the Flexible Job Shop Problem.
Optim. Lett., 2014

The Envy-Free Pricing Problem and Unit-Demand Markets.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
Intersecting longest paths.
Discret. Math., 2013

The Unit-Demand Envy-Free Pricing Problem.
CoRR, 2013

2012
Maximum Series-Parallel Subgraph.
Algorithmica, 2012

2011
Intersection of Longest Paths in a Graph.
Electron. Notes Discret. Math., 2011

Stability in geodesics for memoryless binary long-lived consensus.
Electron. Notes Discret. Math., 2011

Selfish Square Packing.
Electron. Notes Discret. Math., 2011

Squared Metric Facility Location Problem
CoRR, 2011

Edge-coloring series-parallel multigraphs
CoRR, 2011

Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN).
Algorithmica, 2011

2010
Approximating a class of combinatorial problems with rational objective function.
Math. Program., 2010

A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem
CoRR, 2010

2009
A Concurrent Implementation of Skip Graphs.
Electron. Notes Discret. Math., 2009

Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width.
Discret. Appl. Math., 2009

Maximum Series-Parallel Subgraph.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

2008
Repetition-free longest common subsequence.
Electron. Notes Discret. Math., 2008

On the k-Structure Ratio in Planar and Outerplanar Graphs.
Discret. Math. Theor. Comput. Sci., 2008

A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
Maximum Planar Subgraph.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem.
Inf. Process. Lett., 2007

A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

2006
Motif Search in Graphs: Application to Metabolic Networks.
IEEE ACM Trans. Comput. Biol. Bioinform., 2006

Approximating Rational Objectives Is as Easy as Approximating Linear Ones.
Proceedings of the Algorithm Theory, 2006

2005
Reaction Motifs in Metabolic Networks.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

2004
From monomials to words to graphs.
J. Comb. Theory, Ser. A, 2004

Lempel, Even, and Cederbaum Planarity Method.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

2003
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width.
J. Algorithms, 2003

A New Approximation Algorithm for Finding Heavy Planar Subgraphs.
Algorithmica, 2003

Primal-dual algorithms for QoS multimedia multicast.
Proceedings of the Global Telecommunications Conference, 2003

2001
Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width.
Electron. Notes Discret. Math., 2001

The UPS Problem.
Proceedings of the STACS 2001, 2001

1998
A Better Approximation Ratio for the Minimum Size <i>k</i>-Edge-Connected Spanning Subgraph Problem.
J. Algorithms, 1998

A Better Approximation Algorithm for Finding Planar Subgraphs.
J. Algorithms, 1998

Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997
A Better Approximation Ratio for the Minimum k-Edge-Connected Spanning Subgraph Problem.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996
Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus.
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996


  Loading...