|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8 occurrences of 8 keywords
|
|
|
|
|
Results
Found 33 publication records. Showing 33 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul, Alexander Zelikovsky |
Maximum Series-Parallel Subgraph.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina G. Fernandes, Carlos Eduardo Ferreira, Flavio Keidi Miyazawa, Yoshiko Wakabayashi |
Selfish Square Packing. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina G. Fernandes, Maya Stein |
Stability in geodesics for memoryless binary long-lived consensus. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber, Claudson F. Bornstein, Cristina G. Fernandes |
Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN). |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina G. Fernandes, Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa |
Squared Metric Facility Location Problem |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Cristina G. Fernandes, Robin Thomas |
Edge-coloring series-parallel multigraphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Cristina G. Fernandes, Maya Stein |
Geodesic stability for memoryless binary long-lived consensus |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco A. Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi |
Repetition-free longest common subsequence. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi |
Approximating a class of combinatorial problems with rational objective function. |
Math. Program. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hammurabi Mendes, Cristina G. Fernandes |
A Concurrent Implementation of Skip Graphs. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina G. Fernandes, Orlando Lee, Yoshiko Wakabayashi |
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul |
Maximum Series-Parallel Subgraph. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco A. Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi |
Repetition-free longest common subsequence. |
Electronic Notes in Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Cristina G. Fernandes |
On the k-Structure Ratio in Planar and Outerplanar Graphs. |
Discrete Mathematics & Theoretical Computer Science |
2008 |
DBLP BibTeX RDF |
|
| 1 | Cristina G. Fernandes, Carlos Eduardo Ferreira, Christian Tjandraatmadja, Yoshiko Wakabayashi |
A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Lacroix, Cristina G. Fernandes, Marie-France Sagot |
Motif Search in Graphs: Application to Metabolic Networks. |
IEEE/ACM Trans. Comput. Biology Bioinform. |
2006 |
DBLP DOI BibTeX RDF |
Reaction motif, leucine biosynthesis, evolution, graph algorithms, combinatorics, subgraph isomorphism, metabolic network, network motif |
| 1 | José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi |
Approximating Rational Objectives Is as Easy as Approximating Linear Ones. |
SWAT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Lacroix, Cristina G. Fernandes, Marie-France Sagot |
Reaction Motifs in Metabolic Networks. |
WABI |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina G. Fernandes, Edward L. Green, Arnaldo Mandel |
From monomials to words to graphs. |
J. Comb. Theory, Ser. A |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | John M. Boyer, Cristina G. Fernandes, Alexandre Noma, José Coelho de Pina |
Lempel, Even, and Cederbaum Planarity Method. |
WEA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Cristina G. Fernandes, Howard J. Karloff, Alexander Zelikovsky |
A New Approximation Algorithm for Finding Heavy Planar Subgraphs. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Weighted planar graph, Approximation algorithm, Performance ratio |
| 1 | Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed |
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. |
J. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Cristina G. Fernandes |
Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina G. Fernandes, Till Nierhoff |
The UPS Problem. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina G. Fernandes |
A Better Approximation Ratio for the Minimum Size k-Edge-Connected Spanning Subgraph Problem. |
J. Algorithms |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff |
A Better Approximation Algorithm for Finding Planar Subgraphs. |
J. Algorithms |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed |
Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. |
IPCO |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina G. Fernandes |
A Better Approximation Ratio for the Minimum k-Edge-Connected Spanning Subgraph Problem. |
SODA |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff |
A Better Approximation Algorithm for Finding Planar Subgraphs. |
SODA |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Cristina G. Fernandes |
Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus. |
COCOON |
1996 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #33 of 33 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")