Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Cristina G. Fernandes
@inproceedings{DBLP:conf/latin/FernandesMS24,
author = {Cristina G. Fernandes and
Guilherme Oliveira Mota and
Nicol{\'{a}}s Sanhueza{-}Matamala},
editor = {Jos{\'{e}} A. Soto and
Andreas Wiese},
title = {Separating Path Systems in Complete Graphs},
booktitle = {{LATIN} 2024: Theoretical Informatics - 16th Latin American Symposium,
Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {14579},
pages = {98--113},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-55601-2\_7},
doi = {10.1007/978-3-031-55601-2\_7},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/FernandesMS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FernandesL23,
author = {Cristina G. Fernandes and
Carla Negri Lintzmayer},
title = {How heavy independent sets help to find arborescences with many leaves
in DAGs},
journal = {J. Comput. Syst. Sci.},
volume = {135},
pages = {158--174},
year = {2023},
url = {https://doi.org/10.1016/j.jcss.2023.02.006},
doi = {10.1016/J.JCSS.2023.02.006},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/FernandesL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RaveloF23,
author = {Santiago Vald{\'{e}}s Ravelo and
Cristina G. Fernandes},
title = {Complexity and approximability of Minimum Path-Collection Exact Covers},
journal = {Theor. Comput. Sci.},
volume = {942},
pages = {21--32},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2022.11.022},
doi = {10.1016/J.TCS.2022.11.022},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RaveloF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/lagos/2023,
editor = {Cristina G. Fernandes and
Sergio Rajsbaum},
title = {Proceedings of the {XII} Latin-American Algorithms, Graphs and Optimization
Symposium, {LAGOS} 2023, Huatulco, Mexico, September 18-22, 2023},
series = {Procedia Computer Science},
volume = {223},
publisher = {Elsevier},
year = {2023},
url = {https://www.sciencedirect.com/science/journal/18770509/223},
timestamp = {Tue, 16 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lagos/2023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-02754,
author = {F{\'{a}}bio Botler and
Cristina G. Fernandes and
Juan Guti{\'{e}}rrez},
title = {Independent dominating sets in planar triangulations},
journal = {CoRR},
volume = {abs/2308.02754},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.02754},
doi = {10.48550/ARXIV.2308.02754},
eprinttype = {arXiv},
eprint = {2308.02754},
timestamp = {Thu, 24 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-02754.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-07471,
author = {Cristina G. Fernandes and
Carla Negri Lintzmayer and
Phablo F. S. Moura},
title = {Approximations for the Steiner Multicycle Problem},
journal = {CoRR},
volume = {abs/2308.07471},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.07471},
doi = {10.48550/ARXIV.2308.07471},
eprinttype = {arXiv},
eprint = {2308.07471},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-07471.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FernandesL22,
author = {Cristina G. Fernandes and
Carla Negri Lintzmayer},
title = {Leafy spanning arborescences in DAGs},
journal = {Discret. Appl. Math.},
volume = {323},
pages = {217--227},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2021.06.018},
doi = {10.1016/J.DAM.2021.06.018},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FernandesL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FernandesLF22,
author = {Cristina G. Fernandes and
Carla Negri Lintzmayer and
M{\'{a}}rio C{\'{e}}sar San Felice},
title = {Leafy spanning k-forests},
journal = {J. Comb. Optim.},
volume = {44},
number = {2},
pages = {934--946},
year = {2022},
url = {https://doi.org/10.1007/s10878-022-00872-z},
doi = {10.1007/S10878-022-00872-Z},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FernandesLF22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/FernandesLM22,
author = {Cristina G. Fernandes and
Carla Negri Lintzmayer and
Phablo F. S. Moura},
editor = {Armando Casta{\~{n}}eda and
Francisco Rodr{\'{\i}}guez{-}Henr{\'{\i}}quez},
title = {Approximations for the Steiner Multicycle Problem},
booktitle = {{LATIN} 2022: Theoretical Informatics - 15th Latin American Symposium,
Guanajuato, Mexico, November 7-11, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13568},
pages = {188--203},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20624-5\_12},
doi = {10.1007/978-3-031-20624-5\_12},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/FernandesLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/FernandesPAR21,
author = {Cristina G. Fernandes and
Jos{\'{e}} Coelho de Pina and
Jorge Luis Ram{\'{\i}}rez Alfons{\'{\i}}n and
Sinai Robins},
title = {Cubic Graphs, Their Ehrhart Quasi-Polynomials, and a Scissors Congruence
Phenomenon},
journal = {Discret. Comput. Geom.},
volume = {65},
number = {1},
pages = {227--243},
year = {2021},
url = {https://doi.org/10.1007/s00454-020-00192-1},
doi = {10.1007/S00454-020-00192-1},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/FernandesPAR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BotlerFG21,
author = {F{\'{a}}bio Botler and
Cristina G. Fernandes and
Juan Guti{\'{e}}rrez},
title = {On Tuza's conjecture for triangulations and graphs with small treewidth},
journal = {Discret. Math.},
volume = {344},
number = {4},
pages = {112281},
year = {2021},
url = {https://doi.org/10.1016/j.disc.2020.112281},
doi = {10.1016/J.DISC.2020.112281},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BotlerFG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-11025,
author = {Cristina G. Fernandes and
Jos{\'{e}} Coelho de Pina and
Jorge L. Ram{\'{\i}}rez Alfons{\'{\i}}n and
Sinai Robins},
title = {On the period collapse of a family of Ehrhart quasi-polynomials},
journal = {CoRR},
volume = {abs/2104.11025},
year = {2021},
url = {https://arxiv.org/abs/2104.11025},
eprinttype = {arXiv},
eprint = {2104.11025},
timestamp = {Tue, 27 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-11025.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-13464,
author = {Cristina G. Fernandes and
Carla Negri Lintzmayer},
title = {How heavy independent sets help to find arborescences with many leaves
in DAGs},
journal = {CoRR},
volume = {abs/2111.13464},
year = {2021},
url = {https://arxiv.org/abs/2111.13464},
eprinttype = {arXiv},
eprint = {2111.13464},
timestamp = {Wed, 01 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-13464.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CerioliFGGL20,
author = {M{\'{a}}rcia R. Cerioli and
Cristina G. Fernandes and
Renzo G{\'{o}}mez and
Juan Guti{\'{e}}rrez and
Paloma T. Lima},
title = {Transversals of longest paths},
journal = {Discret. Math.},
volume = {343},
number = {3},
pages = {111717},
year = {2020},
url = {https://doi.org/10.1016/j.disc.2019.111717},
doi = {10.1016/J.DISC.2019.111717},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/CerioliFGGL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/FernandesL20,
author = {Cristina G. Fernandes and
Carla Negri Lintzmayer},
editor = {Yoshiharu Kohayakawa and
Fl{\'{a}}vio Keidi Miyazawa},
title = {Leafy Spanning Arborescences in DAGs},
booktitle = {{LATIN} 2020: Theoretical Informatics - 14th Latin American Symposium,
S{\~{a}}o Paulo, Brazil, January 5-8, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12118},
pages = {50--62},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-61792-9\_5},
doi = {10.1007/978-3-030-61792-9\_5},
timestamp = {Thu, 17 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/FernandesL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-07925,
author = {F{\'{a}}bio Botler and
Cristina G. Fernandes and
Juan Guti{\'{e}}rrez},
title = {On Tuza's conjecture for triangulations and graphs with small treewidth},
journal = {CoRR},
volume = {abs/2002.07925},
year = {2020},
url = {https://arxiv.org/abs/2002.07925},
eprinttype = {arXiv},
eprint = {2002.07925},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-07925.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-07660,
author = {Cristina G. Fernandes and
Carla Negri Lintzmayer},
title = {Leafy Spanning Arborescences in DAGs},
journal = {CoRR},
volume = {abs/2007.07660},
year = {2020},
url = {https://arxiv.org/abs/2007.07660},
eprinttype = {arXiv},
eprint = {2007.07660},
timestamp = {Tue, 21 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-07660.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/FernandesHPA19,
author = {Cristina G. Fernandes and
C{\'{e}}sar Hern{\'{a}}ndez{-}V{\'{e}}lez and
Jos{\'{e}} Coelho de Pina and
Jorge Luis Ram{\'{\i}}rez Alfons{\'{\i}}n},
title = {Counting Hamiltonian Cycles in the Matroid Basis Graph},
journal = {Graphs Comb.},
volume = {35},
number = {2},
pages = {539--550},
year = {2019},
url = {https://doi.org/10.1007/s00373-019-02011-8},
doi = {10.1007/S00373-019-02011-8},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/FernandesHPA19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/FernandesFMW19,
author = {Cristina G. Fernandes and
Carlos E. Ferreira and
Fl{\'{a}}vio Keidi Miyazawa and
Yoshiko Wakabayashi},
title = {Prices of Anarchy of Selfish 2D Bin Packing Games},
journal = {Int. J. Found. Comput. Sci.},
volume = {30},
number = {3},
pages = {355--374},
year = {2019},
url = {https://doi.org/10.1142/S0129054119500096},
doi = {10.1142/S0129054119500096},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/FernandesFMW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/BotlerFG19,
author = {F{\'{a}}bio Botler and
Cristina G. Fernandes and
Juan Guti{\'{e}}rrez},
editor = {Gabriel Coutinho and
Yoshiharu Kohayakawa and
Vin{\'{\i}}cius Fernandes dos Santos and
Sebasti{\'{a}}n Urrutia},
title = {On Tuza's Conjecture for Triangulations and Graphs with Small Treewidth},
booktitle = {Proceedings of the tenth Latin and American Algorithms, Graphs and
Optimization Symposium, {LAGOS} 2019, Belo Horizonte, Brazil, June
2-7, 2019},
series = {Electronic Notes in Theoretical Computer Science},
volume = {346},
pages = {171--183},
publisher = {Elsevier},
year = {2019},
url = {https://doi.org/10.1016/j.entcs.2019.08.016},
doi = {10.1016/J.ENTCS.2019.08.016},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/entcs/BotlerFG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/CerioliFLLMS19,
author = {M{\'{a}}rcia R. Cerioli and
Cristina G. Fernandes and
Orlando Lee and
Carla Negri Lintzmayer and
Guilherme Oliveira Mota and
C{\^{a}}ndida Nunes da Silva},
editor = {Gabriel Coutinho and
Yoshiharu Kohayakawa and
Vin{\'{\i}}cius Fernandes dos Santos and
Sebasti{\'{a}}n Urrutia},
title = {On Edge-magic Labelings of Forests},
booktitle = {Proceedings of the tenth Latin and American Algorithms, Graphs and
Optimization Symposium, {LAGOS} 2019, Belo Horizonte, Brazil, June
2-7, 2019},
series = {Electronic Notes in Theoretical Computer Science},
volume = {346},
pages = {299--307},
publisher = {Elsevier},
year = {2019},
url = {https://doi.org/10.1016/j.entcs.2019.08.027},
doi = {10.1016/J.ENTCS.2019.08.027},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/entcs/CerioliFLLMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FernandesPP18,
author = {Cristina G. Fernandes and
Samuel P. de Paula and
Lehilton L. C. Pedrosa},
title = {Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center},
journal = {Algorithmica},
volume = {80},
number = {3},
pages = {1041--1072},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0398-x},
doi = {10.1007/S00453-017-0398-X},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FernandesPP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FernandesS18,
author = {Cristina G. Fernandes and
Rafael Crivellari Saliba Schouery},
title = {Approximation Algorithms for the Max-Buying Problem with Limited Supply},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {2973--2992},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0364-7},
doi = {10.1007/S00453-017-0364-7},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FernandesS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FernandesST18,
author = {Cristina G. Fernandes and
Tina Janne Schmidt and
Anusch Taraz},
title = {On minimum bisection and related cut problems in trees and tree-like
graphs},
journal = {J. Graph Theory},
volume = {89},
number = {2},
pages = {214--245},
year = {2018},
url = {https://doi.org/10.1002/jgt.22248},
doi = {10.1002/JGT.22248},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FernandesST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/tf/18/CalinescuF18,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes},
editor = {Teofilo F. Gonzalez},
title = {Maximum Planar Subgraph},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics, Second Edition,
Volume 2: Contemporary and Emerging Applications},
publisher = {Chapman and Hall/CRC},
year = {2018},
timestamp = {Mon, 28 Oct 2019 16:49:19 +0100},
biburl = {https://dblp.org/rec/books/tf/18/CalinescuF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-07164,
author = {Cristina G. Fernandes and
Jos{\'{e}} Coelho de Pina and
Jorge Luis Ram{\'{\i}}rez Alfons{\'{\i}}n and
Sinai Robins},
title = {Cubic graphs, their Ehrhart quasi-polynomials, and a scissors congruence
phenomenon},
journal = {CoRR},
volume = {abs/1802.07164},
year = {2018},
url = {http://arxiv.org/abs/1802.07164},
eprinttype = {arXiv},
eprint = {1802.07164},
timestamp = {Mon, 25 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-07164.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ChenEFHSYY17,
author = {Guantao Chen and
Julia Ehrenm{\"{u}}ller and
Cristina G. Fernandes and
Carl Georg Heise and
Songling Shan and
Ping Yang and
Amy N. Yates},
title = {Nonempty intersection of longest paths in series-parallel graphs},
journal = {Discret. Math.},
volume = {340},
number = {3},
pages = {287--304},
year = {2017},
url = {https://doi.org/10.1016/j.disc.2016.07.023},
doi = {10.1016/J.DISC.2016.07.023},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/ChenEFHSYY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CerioliFGGL17,
author = {M{\'{a}}rcia R. Cerioli and
Cristina G. Fernandes and
Renzo G{\'{o}}mez and
Juan Guti{\'{e}}rrez and
Paloma T. Lima},
title = {Transversals of Longest Paths},
journal = {Electron. Notes Discret. Math.},
volume = {62},
pages = {135--140},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.10.024},
doi = {10.1016/J.ENDM.2017.10.024},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/CerioliFGGL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/FeliceFL17,
author = {M{\'{a}}rio C{\'{e}}sar San Felice and
Cristina G. Fernandes and
Carla Negri Lintzmayer},
editor = {Roberto Solis{-}Oba and
Rudolf Fleischer},
title = {The Online Multicommodity Connected Facility Location Problem},
booktitle = {Approximation and Online Algorithms - 15th International Workshop,
{WAOA} 2017, Vienna, Austria, September 7-8, 2017, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {10787},
pages = {118--131},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-89441-6\_10},
doi = {10.1007/978-3-319-89441-6\_10},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/FeliceFL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FernandesFMW17,
author = {Cristina G. Fernandes and
Carlos E. Ferreira and
Fl{\'{a}}vio Keidi Miyazawa and
Yoshiko Wakabayashi},
title = {Prices of anarchy of selfish 2D bin packing games},
journal = {CoRR},
volume = {abs/1707.07882},
year = {2017},
url = {http://arxiv.org/abs/1707.07882},
eprinttype = {arXiv},
eprint = {1707.07882},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FernandesFMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-06411,
author = {Cristina G. Fernandes and
Tina Janne Schmidt and
Anusch Taraz},
title = {On Minimum Bisection and Related Cut Problems in Trees and Tree-Like
Graphs},
journal = {CoRR},
volume = {abs/1708.06411},
year = {2017},
url = {http://arxiv.org/abs/1708.06411},
eprinttype = {arXiv},
eprint = {1708.06411},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-06411.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-06431,
author = {Cristina G. Fernandes and
Tina Janne Schmidt and
Anusch Taraz},
title = {Approximating the Minimum k-Section Width in Bounded-Degree Trees
with Linear Diameter},
journal = {CoRR},
volume = {abs/1708.06431},
year = {2017},
url = {http://arxiv.org/abs/1708.06431},
eprinttype = {arXiv},
eprint = {1708.06431},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-06431.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-07086,
author = {M{\'{a}}rcia R. Cerioli and
Cristina G. Fernandes and
Renzo G{\'{o}}mez and
Juan Guti{\'{e}}rrez and
Paloma T. Lima},
title = {Transversals of Longest Paths},
journal = {CoRR},
volume = {abs/1712.07086},
year = {2017},
url = {http://arxiv.org/abs/1712.07086},
eprinttype = {arXiv},
eprint = {1712.07086},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-07086.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FernandesK16,
author = {Cristina G. Fernandes and
Marcos A. Kiwi},
title = {Repetition-free longest common subsequence of random sequences},
journal = {Discret. Appl. Math.},
volume = {210},
pages = {75--87},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.07.005},
doi = {10.1016/J.DAM.2015.07.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FernandesK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/FernandesFFS16,
author = {Cristina G. Fernandes and
Carlos E. Ferreira and
{\'{A}}lvaro Junio Pereira Franco and
Rafael Crivellari Saliba Schouery},
title = {The envy-free pricing problem, unit-demand markets and connections
with the network pricing problem},
journal = {Discret. Optim.},
volume = {22},
pages = {141--161},
year = {2016},
url = {https://doi.org/10.1016/j.disopt.2015.09.003},
doi = {10.1016/J.DISOPT.2015.09.003},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/FernandesFFS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FernandesHLP16,
author = {Cristina G. Fernandes and
C{\'{e}}sar Hern{\'{a}}ndez{-}V{\'{e}}lez and
Orlando Lee and
Jos{\'{e}} Coelho de Pina},
title = {Spanning trees with nonseparating paths},
journal = {Discret. Math.},
volume = {339},
number = {1},
pages = {365--374},
year = {2016},
url = {https://doi.org/10.1016/j.disc.2015.08.020},
doi = {10.1016/J.DISC.2015.08.020},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FernandesHLP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FernandesO16,
author = {Cristina G. Fernandes and
Marcio T. I. Oshiro},
title = {Kinetic clustering of points on the line},
journal = {Theor. Comput. Sci.},
volume = {639},
pages = {60--71},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.05.020},
doi = {10.1016/J.TCS.2016.05.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FernandesO16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/FernandesPP16,
author = {Cristina G. Fernandes and
Samuel P. de Paula and
Lehilton L. C. Pedrosa},
editor = {Evangelos Kranakis and
Gonzalo Navarro and
Edgar Ch{\'{a}}vez},
title = {Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center},
booktitle = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium,
Ensenada, Mexico, April 11-15, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9644},
pages = {441--453},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49529-2\_33},
doi = {10.1007/978-3-662-49529-2\_33},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/latin/FernandesPP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FernandesPP16,
author = {Cristina G. Fernandes and
Samuel P. de Paula and
Lehilton L. C. Pedrosa},
title = {Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center},
journal = {CoRR},
volume = {abs/1608.01721},
year = {2016},
url = {http://arxiv.org/abs/1608.01721},
eprinttype = {arXiv},
eprint = {1608.01721},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FernandesPP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FernandesST15,
author = {Cristina G. Fernandes and
Tina Janne Schmidt and
Anusch Taraz},
title = {On Minimum Bisection and Related Partition Problems in Graphs with
Bounded Tree Width},
journal = {Electron. Notes Discret. Math.},
volume = {49},
pages = {481--488},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.06.067},
doi = {10.1016/J.ENDM.2015.06.067},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FernandesST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FernandesO15,
author = {Cristina G. Fernandes and
Marcio T. I. Oshiro},
title = {Trajectory clustering of points in {R}},
journal = {Electron. Notes Discret. Math.},
volume = {50},
pages = {53--58},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.07.010},
doi = {10.1016/J.ENDM.2015.07.010},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FernandesO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FernandesST15a,
author = {Cristina G. Fernandes and
Tina Janne Schmidt and
Anusch Taraz},
title = {Approximating Minimum k-Section in Trees with Linear Diameter},
journal = {Electron. Notes Discret. Math.},
volume = {50},
pages = {71--76},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.07.013},
doi = {10.1016/J.ENDM.2015.07.013},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FernandesST15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FernandesS15,
author = {Cristina G. Fernandes and
Maya Jakobine Stein},
title = {Geodesic stability for memoryless binary long-lived consensus},
journal = {J. Comput. Syst. Sci.},
volume = {81},
number = {7},
pages = {1210--1220},
year = {2015},
url = {https://doi.org/10.1016/j.jcss.2015.03.002},
doi = {10.1016/J.JCSS.2015.03.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FernandesS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FernandesMMP15,
author = {Cristina G. Fernandes and
Luis A. A. Meira and
Fl{\'{a}}vio Keidi Miyazawa and
Lehilton L. C. Pedrosa},
title = {A systematic approach to bound factor-revealing LPs and its application
to the metric and squared metric facility location problems},
journal = {Math. Program.},
volume = {153},
number = {2},
pages = {655--685},
year = {2015},
url = {https://doi.org/10.1007/s10107-014-0821-x},
doi = {10.1007/S10107-014-0821-X},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/FernandesMMP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FernandesO15,
author = {Cristina G. Fernandes and
Marcio T. I. Oshiro},
title = {Kinetic Clustering of Points on the Line},
journal = {CoRR},
volume = {abs/1512.04303},
year = {2015},
url = {http://arxiv.org/abs/1512.04303},
eprinttype = {arXiv},
eprint = {1512.04303},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FernandesO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/BirginFFMOR14,
author = {Ernesto G. Birgin and
Paulo Feofiloff and
Cristina G. Fernandes and
Everton L. de Melo and
Marcio T. I. Oshiro and
D{\'{e}}bora P. Ronconi},
title = {A {MILP} model for an extended version of the Flexible Job Shop Problem},
journal = {Optim. Lett.},
volume = {8},
number = {4},
pages = {1417--1431},
year = {2014},
url = {https://doi.org/10.1007/s11590-013-0669-7},
doi = {10.1007/S11590-013-0669-7},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/BirginFFMOR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FernandesS14,
author = {Cristina G. Fernandes and
Rafael Crivellari Saliba Schouery},
title = {Second-Price Ad Auctions with Binary Bids and markets with good competition},
journal = {Theor. Comput. Sci.},
volume = {540},
pages = {103--114},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2013.08.022},
doi = {10.1016/J.TCS.2013.08.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FernandesS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/FernandesFFS14,
author = {Cristina G. Fernandes and
Carlos Eduardo Ferreira and
{\'{A}}lvaro Junio Pereira Franco and
Rafael Crivellari Saliba Schouery},
editor = {Pierre Fouilhoux and
Luis Eduardo Neves Gouveia and
Ali Ridha Mahjoub and
Vangelis Th. Paschos},
title = {The Envy-Free Pricing Problem and Unit-Demand Markets},
booktitle = {Combinatorial Optimization - Third International Symposium, {ISCO}
2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8596},
pages = {230--241},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-09174-7\_20},
doi = {10.1007/978-3-319-09174-7\_20},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iscopt/FernandesFFS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/FernandesS14,
author = {Cristina G. Fernandes and
Rafael Crivellari Saliba Schouery},
editor = {Alberto Pardo and
Alfredo Viola},
title = {Approximation Algorithms for the Max-Buying Problem with Limited Supply},
booktitle = {{LATIN} 2014: Theoretical Informatics - 11th Latin American Symposium,
Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8392},
pages = {707--718},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-642-54423-1\_61},
doi = {10.1007/978-3-642-54423-1\_61},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/FernandesS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BirginFFMOR14,
author = {Ernesto G. Birgin and
Paulo Feofiloff and
Cristina G. Fernandes and
Everton L. de Melo and
Marcio T. I. Oshiro and
D{\'{e}}bora P. Ronconi},
title = {A {MILP} model for an extended version of the Flexible Job Shop Problem},
journal = {CoRR},
volume = {abs/1401.3654},
year = {2014},
url = {http://arxiv.org/abs/1401.3654},
eprinttype = {arXiv},
eprint = {1401.3654},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BirginFFMOR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/RezendeFMW13,
author = {Susanna F. de Rezende and
Cristina G. Fernandes and
Daniel M. Martin and
Yoshiko Wakabayashi},
title = {Intersecting longest paths},
journal = {Discret. Math.},
volume = {313},
number = {11},
pages = {1401--1408},
year = {2013},
url = {https://doi.org/10.1016/j.disc.2013.02.016},
doi = {10.1016/J.DISC.2013.02.016},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/RezendeFMW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-4883,
author = {Marcos A. Kiwi and
Cristina G. Fernandes},
title = {Repetition-free longest common subsequence of random sequences},
journal = {CoRR},
volume = {abs/1305.4883},
year = {2013},
url = {http://arxiv.org/abs/1305.4883},
eprinttype = {arXiv},
eprint = {1305.4883},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-4883.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FernandesS13,
author = {Cristina G. Fernandes and
Rafael Crivellari Saliba Schouery},
title = {Approximation Algorithms for the Max-Buying Problem with Limited Supply},
journal = {CoRR},
volume = {abs/1309.7955},
year = {2013},
url = {http://arxiv.org/abs/1309.7955},
eprinttype = {arXiv},
eprint = {1309.7955},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FernandesS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FernandesFFS13,
author = {Cristina G. Fernandes and
Carlos Eduardo Ferreira and
{\'{A}}lvaro Junio Pereira Franco and
Rafael Crivellari Saliba Schouery},
title = {The Unit-Demand Envy-Free Pricing Problem},
journal = {CoRR},
volume = {abs/1310.0038},
year = {2013},
url = {http://arxiv.org/abs/1310.0038},
eprinttype = {arXiv},
eprint = {1310.0038},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FernandesFFS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CalinescuFKZ12,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes and
Hemanshu Kaul and
Alexander Zelikovsky},
title = {Maximum Series-Parallel Subgraph},
journal = {Algorithmica},
volume = {63},
number = {1-2},
pages = {137--157},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9523-4},
doi = {10.1007/S00453-011-9523-4},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CalinescuFKZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FernandesMMP12,
author = {Cristina G. Fernandes and
Luis A. A. Meira and
Fl{\'{a}}vio Keidi Miyazawa and
Lehilton L. C. Pedrosa},
editor = {Anupam Gupta and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Rocco A. Servedio},
title = {A Systematic Approach to Bound Factor Revealing LPs and Its Application
to the Metric and Squared Metric Facility Location Problems},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 15th International Workshop, {APPROX} 2012, and 16th
International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August
15-17, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7408},
pages = {146--157},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32512-0\_13},
doi = {10.1007/978-3-642-32512-0\_13},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/FernandesMMP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/FernandesS12,
author = {Cristina G. Fernandes and
Rafael Crivellari Saliba Schouery},
editor = {Ali Ridha Mahjoub and
Vangelis Markakis and
Ioannis Milis and
Vangelis Th. Paschos},
title = {Second-Price Ad Auctions with Binary Bids and Markets with Good Competition},
booktitle = {Combinatorial Optimization - Second International Symposium, {ISCO}
2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7422},
pages = {439--450},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32147-4\_39},
doi = {10.1007/978-3-642-32147-4\_39},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iscopt/FernandesS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LaberBF11,
author = {Eduardo Sany Laber and
Claudson F. Bornstein and
Cristina G. Fernandes},
title = {Guest Editorial: Special Issue on Latin American Theoretical Informatics
Symposium {(LATIN)}},
journal = {Algorithmica},
volume = {59},
number = {1},
pages = {1--2},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9473-2},
doi = {10.1007/S00453-010-9473-2},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LaberBF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FernandesS11,
author = {Cristina G. Fernandes and
Maya Stein},
title = {Stability in geodesics for memoryless binary long-lived consensus},
journal = {Electron. Notes Discret. Math.},
volume = {37},
pages = {351--356},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.05.060},
doi = {10.1016/J.ENDM.2011.05.060},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/FernandesS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FernandesFMW11,
author = {Cristina G. Fernandes and
Carlos Eduardo Ferreira and
Flavio Keidi Miyazawa and
Yoshiko Wakabayashi},
title = {Selfish Square Packing},
journal = {Electron. Notes Discret. Math.},
volume = {37},
pages = {369--374},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.05.063},
doi = {10.1016/J.ENDM.2011.05.063},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/FernandesFMW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/RezendeFMW11,
author = {Susanna F. de Rezende and
Cristina G. Fernandes and
Daniel M. Martin and
Yoshiko Wakabayashi},
title = {Intersection of Longest Paths in a Graph},
journal = {Electron. Notes Discret. Math.},
volume = {38},
pages = {743--748},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.10.024},
doi = {10.1016/J.ENDM.2011.10.024},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/RezendeFMW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-4100,
author = {Cristina G. Fernandes and
Maya Stein},
title = {Geodesic stability for memoryless binary long-lived consensus},
journal = {CoRR},
volume = {abs/1102.4100},
year = {2011},
url = {http://arxiv.org/abs/1102.4100},
eprinttype = {arXiv},
eprint = {1102.4100},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-4100.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-5370,
author = {Cristina G. Fernandes and
Robin Thomas},
title = {Edge-coloring series-parallel multigraphs},
journal = {CoRR},
volume = {abs/1107.5370},
year = {2011},
url = {http://arxiv.org/abs/1107.5370},
eprinttype = {arXiv},
eprint = {1107.5370},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-5370.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-1672,
author = {Cristina G. Fernandes and
Luis A. A. Meira and
Fl{\'{a}}vio Keidi Miyazawa and
Lehilton L. C. Pedrosa},
title = {Squared Metric Facility Location Problem},
journal = {CoRR},
volume = {abs/1111.1672},
year = {2011},
url = {http://arxiv.org/abs/1111.1672},
eprinttype = {arXiv},
eprint = {1111.1672},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-1672.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AdiBFFMSSTW10,
author = {Said Sadique Adi and
Mar{\'{\i}}lia D. V. Braga and
Cristina G. Fernandes and
Carlos Eduardo Ferreira and
F{\'{a}}bio Viduani Martinez and
Marie{-}France Sagot and
Marco Aurelio Stefanes and
Christian Tjandraatmadja and
Yoshiko Wakabayashi},
title = {Repetition-free longest common subsequence},
journal = {Discret. Appl. Math.},
volume = {158},
number = {12},
pages = {1315--1324},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2009.04.023},
doi = {10.1016/J.DAM.2009.04.023},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AdiBFFMSSTW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/CorreaFW10,
author = {Jos{\'{e}} R. Correa and
Cristina G. Fernandes and
Yoshiko Wakabayashi},
title = {Approximating a class of combinatorial problems with rational objective
function},
journal = {Math. Program.},
volume = {124},
number = {1-2},
pages = {255--269},
year = {2010},
url = {https://doi.org/10.1007/s10107-010-0364-8},
doi = {10.1007/S10107-010-0364-8},
timestamp = {Mon, 29 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/CorreaFW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-1437,
author = {Paulo Feofiloff and
Cristina G. Fernandes and
Carlos Eduardo Ferreira and
Jos{\'{e}} Coelho de Pina},
title = {A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting
Steiner Tree Problem},
journal = {CoRR},
volume = {abs/1004.1437},
year = {2010},
url = {http://arxiv.org/abs/1004.1437},
eprinttype = {arXiv},
eprint = {1004.1437},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-1437.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FernandesLW09,
author = {Cristina G. Fernandes and
Orlando Lee and
Yoshiko Wakabayashi},
title = {Minimum cycle cover and Chinese postman problems on mixed graphs with
bounded tree-width},
journal = {Discret. Appl. Math.},
volume = {157},
number = {2},
pages = {272--279},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2007.10.032},
doi = {10.1016/J.DAM.2007.10.032},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FernandesLW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/MendesF09,
author = {Hammurabi Mendes and
Cristina G. Fernandes},
title = {A Concurrent Implementation of Skip Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {35},
pages = {263--268},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.11.043},
doi = {10.1016/J.ENDM.2009.11.043},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/MendesF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CalinescuFK09,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes and
Hemanshu Kaul},
editor = {Christophe Paul and
Michel Habib},
title = {Maximum Series-Parallel Subgraph},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {54--65},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_5},
doi = {10.1007/978-3-642-11409-0\_5},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/CalinescuFK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/CalinescuF08,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes},
title = {On the k-Structure Ratio in Planar and Outerplanar Graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {10},
number = {3},
year = {2008},
url = {https://doi.org/10.46298/dmtcs.423},
doi = {10.46298/DMTCS.423},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/CalinescuF08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AdiBFFMSSTW08,
author = {Said Sadique Adi and
Mar{\'{\i}}lia D. V. Braga and
Cristina G. Fernandes and
Carlos Eduardo Ferreira and
F{\'{a}}bio Viduani Martinez and
Marie{-}France Sagot and
Marco Aurelio Stefanes and
Christian Tjandraatmadja and
Yoshiko Wakabayashi},
title = {Repetition-free longest common subsequence},
journal = {Electron. Notes Discret. Math.},
volume = {30},
pages = {243--248},
year = {2008},
url = {https://doi.org/10.1016/j.endm.2008.01.042},
doi = {10.1016/J.ENDM.2008.01.042},
timestamp = {Mon, 13 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/AdiBFFMSSTW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/FernandesFTW08,
author = {Cristina G. Fernandes and
Carlos Eduardo Ferreira and
Christian Tjandraatmadja and
Yoshiko Wakabayashi},
editor = {Eduardo Sany Laber and
Claudson F. Bornstein and
Loana Tito Nogueira and
Lu{\'{e}}rbio Faria},
title = {A Polyhedral Investigation of the {LCS} Problem and a Repetition-Free
Variant},
booktitle = {{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium,
B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4957},
pages = {329--338},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-78773-0\_29},
doi = {10.1007/978-3-540-78773-0\_29},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/FernandesFTW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FeofiloffFFP07,
author = {Paulo Feofiloff and
Cristina G. Fernandes and
Carlos Eduardo Ferreira and
Jos{\'{e}} Coelho de Pina},
title = {Primal-dual approximation algorithms for the Prize-Collecting Steiner
Tree Problem},
journal = {Inf. Process. Lett.},
volume = {103},
number = {5},
pages = {195--202},
year = {2007},
url = {https://doi.org/10.1016/j.ipl.2007.03.012},
doi = {10.1016/J.IPL.2007.03.012},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FeofiloffFFP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/CorreaFMW07,
author = {Jos{\'{e}} R. Correa and
Cristina G. Fernandes and
Mart{\'{\i}}n Matamala and
Yoshiko Wakabayashi},
editor = {Christos Kaklamanis and
Martin Skutella},
title = {A 5/3-Approximation for Finding Spanning Trees with Many Leaves in
Cubic Graphs},
booktitle = {Approximation and Online Algorithms, 5th International Workshop, {WAOA}
2007, Eilat, Israel, October 11-12, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4927},
pages = {184--192},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77918-6\_15},
doi = {10.1007/978-3-540-77918-6\_15},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/CorreaFMW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/FernandesC07,
author = {Cristina G. Fernandes and
Gruia C{\u{a}}linescu},
editor = {Teofilo F. Gonzalez},
title = {Maximum Planar Subgraph},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics},
publisher = {Chapman and Hall/CRC},
year = {2007},
url = {https://doi.org/10.1201/9781420010749.ch56},
doi = {10.1201/9781420010749.CH56},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/crc/FernandesC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/LacroixFS06,
author = {Vincent Lacroix and
Cristina G. Fernandes and
Marie{-}France Sagot},
title = {Motif Search in Graphs: Application to Metabolic Networks},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {3},
number = {4},
pages = {360--368},
year = {2006},
url = {https://doi.org/10.1109/TCBB.2006.55},
doi = {10.1109/TCBB.2006.55},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/LacroixFS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CorreaFW06,
author = {Jos{\'{e}} R. Correa and
Cristina G. Fernandes and
Yoshiko Wakabayashi},
editor = {Lars Arge and
Rusins Freivalds},
title = {Approximating Rational Objectives Is as Easy as Approximating Linear
Ones},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {351--362},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_33},
doi = {10.1007/11785293\_33},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/CorreaFW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/LacroixFS05,
author = {Vincent Lacroix and
Cristina G. Fernandes and
Marie{-}France Sagot},
editor = {Rita Casadio and
Gene Myers},
title = {Reaction Motifs in Metabolic Networks},
booktitle = {Algorithms in Bioinformatics, 5th International Workshop, {WABI} 2005,
Mallorca, Spain, October 3-6, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3692},
pages = {178--191},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11557067\_15},
doi = {10.1007/11557067\_15},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wabi/LacroixFS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FernandesGM04,
author = {Cristina G. Fernandes and
Edward L. Green and
Arnaldo Mandel},
title = {From monomials to words to graphs},
journal = {J. Comb. Theory, Ser. {A}},
volume = {105},
number = {2},
pages = {185--206},
year = {2004},
url = {https://doi.org/10.1016/j.jcta.2003.11.001},
doi = {10.1016/J.JCTA.2003.11.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FernandesGM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/BoyerFNP04,
author = {John M. Boyer and
Cristina G. Fernandes and
Alexandre Noma and
Jos{\'{e}} Coelho de Pina},
editor = {Celso C. Ribeiro and
Simone L. Martins},
title = {Lempel, Even, and Cederbaum Planarity Method},
booktitle = {Experimental and Efficient Algorithms, Third International Workshop,
{WEA} 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3059},
pages = {129--144},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24838-5\_10},
doi = {10.1007/978-3-540-24838-5\_10},
timestamp = {Sat, 09 Apr 2022 12:38:17 +0200},
biburl = {https://dblp.org/rec/conf/wea/BoyerFNP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CalinescuFKZ03,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes and
Howard J. Karloff and
Alexander Zelikovsky},
title = {A New Approximation Algorithm for Finding Heavy Planar Subgraphs},
journal = {Algorithmica},
volume = {36},
number = {2},
pages = {179--205},
year = {2003},
url = {https://doi.org/10.1007/s00453-002-1020-3},
doi = {10.1007/S00453-002-1020-3},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CalinescuFKZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/CalinescuFR03,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes and
Bruce A. Reed},
title = {Multicuts in unweighted graphs and digraphs with bounded degree and
bounded tree-width},
journal = {J. Algorithms},
volume = {48},
number = {2},
pages = {333--359},
year = {2003},
url = {https://doi.org/10.1016/S0196-6774(03)00073-7},
doi = {10.1016/S0196-6774(03)00073-7},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/CalinescuFR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/globecom/CalinescuFMOYZ03,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes and
Ion I. Mandoiu and
Alexander Olshevsky and
K. Yang and
Alexander Zelikovsky},
title = {Primal-dual algorithms for QoS multimedia multicast},
booktitle = {Proceedings of the Global Telecommunications Conference, 2003. {GLOBECOM}
'03, San Francisco, CA, USA, 1-5 December 2003},
pages = {3631--3635},
publisher = {{IEEE}},
year = {2003},
url = {https://doi.org/10.1109/GLOCOM.2003.1258911},
doi = {10.1109/GLOCOM.2003.1258911},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/globecom/CalinescuFMOYZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CalinescuF01,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes},
title = {Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width},
journal = {Electron. Notes Discret. Math.},
volume = {7},
pages = {194--197},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(04)00258-6},
doi = {10.1016/S1571-0653(04)00258-6},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/CalinescuF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FernandesN01,
author = {Cristina G. Fernandes and
Till Nierhoff},
editor = {Afonso Ferreira and
Horst Reichel},
title = {The {UPS} Problem},
booktitle = {{STACS} 2001, 18th Annual Symposium on Theoretical Aspects of Computer
Science, Dresden, Germany, February 15-17, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2010},
pages = {238--246},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44693-1\_21},
doi = {10.1007/3-540-44693-1\_21},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/FernandesN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/CalinescuFFK98,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes and
Ulrich Finkler and
Howard J. Karloff},
title = {A Better Approximation Algorithm for Finding Planar Subgraphs},
journal = {J. Algorithms},
volume = {27},
number = {2},
pages = {269--302},
year = {1998},
url = {https://doi.org/10.1006/jagm.1997.0920},
doi = {10.1006/JAGM.1997.0920},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/CalinescuFFK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Fernandes98,
author = {Cristina G. Fernandes},
title = {A Better Approximation Ratio for the Minimum Size \emph{k}-Edge-Connected
Spanning Subgraph Problem},
journal = {J. Algorithms},
volume = {28},
number = {1},
pages = {105--124},
year = {1998},
url = {https://doi.org/10.1006/jagm.1998.0931},
doi = {10.1006/JAGM.1998.0931},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/Fernandes98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/CalinescuFR98,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes and
Bruce A. Reed},
editor = {Robert E. Bixby and
E. Andrew Boyd and
Roger Z. R{\'{\i}}os{-}Mercado},
title = {Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width},
booktitle = {Integer Programming and Combinatorial Optimization, 6th International
{IPCO} Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1412},
pages = {137--152},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-69346-7\_11},
doi = {10.1007/3-540-69346-7\_11},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipco/CalinescuFR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Fernandes97,
author = {Cristina G. Fernandes},
editor = {Michael E. Saks},
title = {A Better Approximation Ratio for the Minimum k-Edge-Connected Spanning
Subgraph Problem},
booktitle = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA}},
pages = {629--638},
publisher = {{ACM/SIAM}},
year = {1997},
url = {http://dl.acm.org/citation.cfm?id=314161.314402},
timestamp = {Thu, 05 Jul 2018 07:29:42 +0200},
biburl = {https://dblp.org/rec/conf/soda/Fernandes97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/CalinescuF96,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes},
editor = {Jin{-}yi Cai and
C. K. Wong},
title = {Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus},
booktitle = {Computing and Combinatorics, Second Annual International Conference,
{COCOON} '96, Hong Kong, June 17-19, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1090},
pages = {152--161},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61332-3\_148},
doi = {10.1007/3-540-61332-3\_148},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/CalinescuF96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CalinescuFFK96,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes and
Ulrich Finkler and
Howard J. Karloff},
editor = {{\'{E}}va Tardos},
title = {A Better Approximation Algorithm for Finding Planar Subgraphs},
booktitle = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 28-30 January 1996, Atlanta, Georgia, {USA}},
pages = {16--25},
publisher = {{ACM/SIAM}},
year = {1996},
url = {http://dl.acm.org/citation.cfm?id=313852.313869},
timestamp = {Thu, 05 Jul 2018 07:29:31 +0200},
biburl = {https://dblp.org/rec/conf/soda/CalinescuFFK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 02:25 CEST 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:
