Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Luérbio Faria
@article{DBLP:journals/dam/FariaNPS23,
author = {Lu{\'{e}}rbio Faria and
Mauro Nigro and
Myriam Preissmann and
Diana Sasaki},
title = {Results about the total chromatic number and the conformability of
some families of circulant graphs},
journal = {Discret. Appl. Math.},
volume = {340},
pages = {123--133},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.07.003},
doi = {10.1016/J.DAM.2023.07.003},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/FariaNPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AlvesCFGKS23,
author = {Sancrey Rodrigues Alves and
Fernanda Couto and
Lu{\'{e}}rbio Faria and
Sylvain Gravier and
Sulamita Klein and
U{\'{e}}verton S. Souza},
title = {Partitions and well-coveredness: The graph sandwich problem},
journal = {Discret. Math.},
volume = {346},
number = {3},
pages = {113253},
year = {2023},
url = {https://doi.org/10.1016/j.disc.2022.113253},
doi = {10.1016/J.DISC.2022.113253},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AlvesCFGKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/FariaNS23,
author = {Lu{\'{e}}rbio Faria and
Mauro Nigro and
Diana Sasaki},
title = {On the conformability of regular line graphs},
journal = {{RAIRO} Oper. Res.},
volume = {57},
number = {5},
pages = {2527--2536},
year = {2023},
url = {https://doi.org/10.1051/ro/2023140},
doi = {10.1051/RO/2023140},
timestamp = {Thu, 09 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rairo/FariaNS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FariaS22,
author = {Lu{\'{e}}rbio Faria and
U{\'{e}}verton S. Souza},
title = {On the probe problem for (\emph{r}, \emph{{\(\mathscr{l}\)}})-well-coveredness:
Algorithms and complexity},
journal = {Theor. Comput. Sci.},
volume = {932},
pages = {56--68},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.08.006},
doi = {10.1016/J.TCS.2022.08.006},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/FariaS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MarcianoALSFF21,
author = {Carlos E. Marciano and
Gladstone M. Arantes Jr. and
Abilio Lucena and
Luidi Gelabert Simonetti and
Lu{\'{e}}rbio Faria and
Felipe M. G. Fran{\c{c}}a},
title = {Optimizing concurrency under Scheduling by Edge Reversal},
journal = {Networks},
volume = {77},
number = {4},
pages = {520--537},
year = {2021},
url = {https://doi.org/10.1002/net.22014},
doi = {10.1002/NET.22014},
timestamp = {Fri, 04 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MarcianoALSFF21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/FariaS21,
author = {Lu{\'{e}}rbio Faria and
U{\'{e}}verton S. Souza},
editor = {Chi{-}Yeh Chen and
Wing{-}Kai Hon and
Ling{-}Ju Hung and
Chia{-}Wei Lee},
title = {On the Probe Problem for (r, {\(\mathscr{l}\)} )-Well-Coveredness},
booktitle = {Computing and Combinatorics - 27th International Conference, {COCOON}
2021, Tainan, Taiwan, October 24-26, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13025},
pages = {375--386},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-89543-3\_32},
doi = {10.1007/978-3-030-89543-3\_32},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/FariaS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/CoelhoCFFGK21,
author = {Erika Morais Martins Coelho and
Hebert Coelho and
Lu{\'{e}}rbio Faria and
Mateus de Paula Ferreira and
Sylvain Gravier and
Sulamita Klein},
editor = {Paola Flocchini and
Lucia Moura},
title = {On the Oriented Coloring of the Disjoint Union of Graphs},
booktitle = {Combinatorial Algorithms - 32nd International Workshop, {IWOCA} 2021,
Ottawa, ON, Canada, July 5-7, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12757},
pages = {194--207},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-79987-8\_14},
doi = {10.1007/978-3-030-79987-8\_14},
timestamp = {Mon, 12 Jul 2021 09:19:27 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/CoelhoCFFGK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lagos/FariaGM21,
author = {Lu{\'{e}}rbio Faria and
Andr{\'{e}} Luiz Pires Guedes and
Lilian Markenzon},
editor = {Carlos E. Ferreira and
Orlando Lee and
Fl{\'{a}}vio Keidi Miyazawa},
title = {On feedback vertex set in reducible flow hypergraphs},
booktitle = {Proceedings of the {XI} Latin and American Algorithms, Graphs and
Optimization Symposium, {LAGOS} 2021, Online Event / S{\~{a}}o Paulo,
Brazil, May 2021},
series = {Procedia Computer Science},
volume = {195},
pages = {212--220},
publisher = {Elsevier},
year = {2021},
url = {https://doi.org/10.1016/j.procs.2021.11.027},
doi = {10.1016/J.PROCS.2021.11.027},
timestamp = {Tue, 18 Jan 2022 09:21:02 +0100},
biburl = {https://dblp.org/rec/conf/lagos/FariaGM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CoutoFGKS20,
author = {Fernanda Couto and
Lu{\'{e}}rbio Faria and
Sylvain Gravier and
Sulamita Klein and
Vin{\'{\i}}cius Fernandes dos Santos},
title = {Characterizations, probe and sandwich problems on (k, {\(\mathscr{l}\)})-cographs},
journal = {Discret. Appl. Math.},
volume = {281},
pages = {118--133},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2020.04.002},
doi = {10.1016/J.DAM.2020.04.002},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/CoutoFGKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FariaKSSS20,
author = {Lu{\'{e}}rbio Faria and
Sulamita Klein and
Ignasi Sau and
U{\'{e}}verton S. Souza and
Rubens Sucupira},
title = {Maximum cuts in edge-colored graphs},
journal = {Discret. Appl. Math.},
volume = {281},
pages = {229--234},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2019.02.038},
doi = {10.1016/J.DAM.2019.02.038},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FariaKSSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/AlvesCFGKS20,
author = {Sancrey Rodrigues Alves and
Fernanda Couto and
Lu{\'{e}}rbio Faria and
Sylvain Gravier and
Sulamita Klein and
U{\'{e}}verton S. Souza},
editor = {Yoshiharu Kohayakawa and
Fl{\'{a}}vio Keidi Miyazawa},
title = {Graph Sandwich Problem for the Property of Being Well-Covered and
Partitionable into k Independent Sets and {\(\mathscr{l}\)} Cliques},
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 = {587--599},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-61792-9\_46},
doi = {10.1007/978-3-030-61792-9\_46},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/AlvesCFGKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CoutoFGK18,
author = {Fernanda Couto and
Lu{\'{e}}rbio Faria and
Sylvain Gravier and
Sulamita Klein},
title = {On the forbidden induced subgraph probe and sandwich problems},
journal = {Discret. Appl. Math.},
volume = {234},
pages = {56--66},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2016.04.005},
doi = {10.1016/J.DAM.2016.04.005},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CoutoFGK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DantasFFT18,
author = {Simone Dantas and
Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Rafael B. Teixeira},
title = {The partitioned probe problem: NP-complete versus polynomial dichotomy},
journal = {Discret. Appl. Math.},
volume = {234},
pages = {67--75},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.02.006},
doi = {10.1016/J.DAM.2017.02.006},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DantasFFT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CoutoFGK18,
author = {Fernanda Couto and
Lu{\'{e}}rbio Faria and
Sylvain Gravier and
Sulamita Klein},
title = {Chordal-(2, 1) graph sandwich problem with boundary conditions},
journal = {Electron. Notes Discret. Math.},
volume = {69},
pages = {277--284},
year = {2018},
url = {https://doi.org/10.1016/j.endm.2018.07.036},
doi = {10.1016/J.ENDM.2018.07.036},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/CoutoFGK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlvesDFKSS18,
author = {Sancrey Rodrigues Alves and
Konrad K. Dabrowski and
Lu{\'{e}}rbio Faria and
Sulamita Klein and
Ignasi Sau and
U{\'{e}}verton S. Souza},
title = {On the (parameterized) complexity of recognizing well-covered (\emph{r},
\emph{{\(\mathscr{l}\)}})-graph},
journal = {Theor. Comput. Sci.},
volume = {746},
pages = {36--48},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2018.06.024},
doi = {10.1016/J.TCS.2018.06.024},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlvesDFKSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-00858,
author = {Lu{\'{e}}rbio Faria and
Sulamita Klein and
Ignasi Sau and
U{\'{e}}verton S. Souza and
Rubens Sucupira},
title = {Maximum cuts in edge-colored graphs},
journal = {CoRR},
volume = {abs/1805.00858},
year = {2018},
url = {http://arxiv.org/abs/1805.00858},
eprinttype = {arXiv},
eprint = {1805.00858},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-00858.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/FariaKSS17,
author = {Lu{\'{e}}rbio Faria and
Sulamita Klein and
Ignasi Sau and
Rubens Sucupira},
title = {Improved kernels for Signed Max Cut parameterized above lower bound
on (r, l)-graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {19},
number = {1},
year = {2017},
url = {https://doi.org/10.23638/DMTCS-19-1-14},
doi = {10.23638/DMTCS-19-1-14},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/FariaKSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/SucupiraFKSS17,
author = {Rubens Sucupira and
Lu{\'{e}}rbio Faria and
Sulamita Klein and
Ignasi Sau and
U{\'{e}}verton S. Souza},
title = {Maximum Cuts in Edge-colored Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {62},
pages = {87--92},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.10.016},
doi = {10.1016/J.ENDM.2017.10.016},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/SucupiraFKSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BasteFKS17,
author = {Julien Baste and
Lu{\'{e}}rbio Faria and
Sulamita Klein and
Ignasi Sau},
title = {Parameterized Complexity Dichotomy for (r, {\(\mathscr{l}\)})-Vertex
Deletion},
journal = {Theory Comput. Syst.},
volume = {61},
number = {3},
pages = {777--794},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9716-y},
doi = {10.1007/S00224-016-9716-Y},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BasteFKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlvesDFKSS17,
author = {Sancrey Rodrigues Alves and
Konrad Kazimierz Dabrowski and
Lu{\'{e}}rbio Faria and
Sulamita Klein and
Ignasi Sau and
U{\'{e}}verton S. Souza},
title = {On the (parameterized) complexity of recognizing well-covered (r,
l)-graphs},
journal = {CoRR},
volume = {abs/1705.09177},
year = {2017},
url = {http://arxiv.org/abs/1705.09177},
eprinttype = {arXiv},
eprint = {1705.09177},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/AlvesDFKSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CoelhoFGK16,
author = {Hebert Coelho and
Lu{\'{e}}rbio Faria and
Sylvain Gravier and
Sulamita Klein},
title = {Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented
graphs},
journal = {Discret. Appl. Math.},
volume = {198},
pages = {109--117},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.06.023},
doi = {10.1016/J.DAM.2015.06.023},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CoelhoFGK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CorreaDFPS16,
author = {Jos{\'{e}} Correa and
Guillermo Dur{\'{a}}n and
Lu{\'{e}}rbio Faria and
Miguel A. Piza{\~{n}}a and
Gelasio Salazar},
title = {Preface: LAGOS'13: Seventh Latin-American Algorithms, Graphs, and
Optimization Symposium, Playa del Carmen, M{\'{e}}xico - 2013},
journal = {Discret. Appl. Math.},
volume = {210},
pages = {1--3},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2016.05.007},
doi = {10.1016/J.DAM.2016.05.007},
timestamp = {Wed, 03 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/CorreaDFPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GusmaoBHFF16,
author = {Andr{\'{e}}ia C. S. Gusm{\~{a}}o and
Let{\'{\i}}cia Rodrigues Bueno and
Rodrigo de A. Hausen and
Celina M. H. de Figueiredo and
Lu{\'{e}}rbio Faria},
title = {A note on the middle levels problem},
journal = {Discret. Appl. Math.},
volume = {210},
pages = {290--296},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.08.001},
doi = {10.1016/J.DAM.2015.08.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GusmaoBHFF16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/FariaHKLWW16,
author = {Lu{\'{e}}rbio Faria and
Wing{-}Kai Hon and
Ton Kloks and
Hsiang{-}Hsuan Liu and
Tao{-}Ming Wang and
Yue{-}Li Wang},
title = {On complexities of minus domination},
journal = {Discret. Optim.},
volume = {22},
pages = {6--19},
year = {2016},
url = {https://doi.org/10.1016/j.disopt.2016.04.002},
doi = {10.1016/J.DISOPT.2016.04.002},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/FariaHKLWW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DantasFFT16,
author = {Simone Dantas and
Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Rafael B. Teixeira},
title = {The (k, {\(\mathscr{l}\)}) unpartitioned probe problem NP-complete
versus polynomial dichotomy},
journal = {Inf. Process. Lett.},
volume = {116},
number = {4},
pages = {294--298},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.11.004},
doi = {10.1016/J.IPL.2015.11.004},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DantasFFT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FariaFRV16,
author = {Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
R. Bruce Richter and
Imrich Vrt'o},
title = {The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing
Numbers of the \emph{n}-Cube},
journal = {J. Graph Theory},
volume = {83},
number = {1},
pages = {19--33},
year = {2016},
url = {https://doi.org/10.1002/jgt.21910},
doi = {10.1002/JGT.21910},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FariaFRV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/AlvesDFKSS16,
author = {Sancrey Rodrigues Alves and
Konrad Kazimierz Dabrowski and
Lu{\'{e}}rbio Faria and
Sulamita Klein and
Ignasi Sau and
U{\'{e}}verton dos Santos Souza},
editor = {T.{-}H. Hubert Chan and
Minming Li and
Lusheng Wang},
title = {On the (Parameterized) Complexity of Recognizing Well-Covered (r,
l)-graphs},
booktitle = {Combinatorial Optimization and Applications - 10th International Conference,
{COCOA} 2016, Hong Kong, China, December 16-18, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10043},
pages = {423--437},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-48749-6\_31},
doi = {10.1007/978-3-319-48749-6\_31},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/AlvesDFKSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CoutoFGKS15,
author = {Fernanda Couto and
Lu{\'{e}}rbio Faria and
Sylvain Gravier and
Sulamita Klein and
Vin{\'{\i}}cius Fernandes dos Santos},
title = {Structural characterization and decomposition for cographs-(2, 1)
and (1, 2): a natural generalization of threshold graphs},
journal = {Electron. Notes Discret. Math.},
volume = {50},
pages = {133--138},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.07.023},
doi = {10.1016/J.ENDM.2015.07.023},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/CoutoFGKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FariaGMM15,
author = {Lu{\'{e}}rbio Faria and
Laurent Gourv{\`{e}}s and
Carlos A. J. Martinhon and
J{\'{e}}r{\^{o}}me Monnot},
title = {The edge-recoloring cost of monochromatic and properly edge-colored
paths and cycles},
journal = {Theor. Comput. Sci.},
volume = {602},
pages = {89--102},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.08.016},
doi = {10.1016/J.TCS.2015.08.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FariaGMM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CoutoFGKS15,
author = {Fernanda Couto and
Lu{\'{e}}rbio Faria and
Sylvain Gravier and
Sulamita Klein and
Vin{\'{\i}}cius Fernandes dos Santos},
editor = {Ernst W. Mayr},
title = {On the Complexity of Probe and Sandwich Problems for Generalized Threshold
Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International
Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {9224},
pages = {312--324},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-53174-7\_22},
doi = {10.1007/978-3-662-53174-7\_22},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/CoutoFGKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/CoutoFGK15,
author = {Fernanda Couto and
Lu{\'{e}}rbio Faria and
Sylvain Gravier and
Sulamita Klein},
editor = {Ekrem Duman and
Ali Fuat Alkaya},
title = {On the forbidden induced subgraph probe problem},
booktitle = {13th Cologne Twente Workshop on Graphs and Combinatorial Optimization,
Istanbul, Turkey, May 26-28, 2015},
pages = {231--234},
year = {2015},
timestamp = {Thu, 02 Feb 2017 18:00:28 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/CoutoFGK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BasteFKS15,
author = {Julien Baste and
Lu{\'{e}}rbio Faria and
Sulamita Klein and
Ignasi Sau},
title = {Parameterized complexity dichotomy for (r, {\(\mathscr{l}\)})-Vertex
Deletion},
journal = {CoRR},
volume = {abs/1504.05515},
year = {2015},
url = {http://arxiv.org/abs/1504.05515},
eprinttype = {arXiv},
eprint = {1504.05515},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BasteFKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FariaKSS15,
author = {Lu{\'{e}}rbio Faria and
Sulamita Klein and
Ignasi Sau and
Rubens Sucupira},
title = {Improved kernels for Signed Max Cut parameterized above lower bound
on (r, l)-graphs},
journal = {CoRR},
volume = {abs/1512.05223},
year = {2015},
url = {http://arxiv.org/abs/1512.05223},
eprinttype = {arXiv},
eprint = {1512.05223},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/FariaKSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DouradoFPRS14,
author = {Mitre Costa Dourado and
Lu{\'{e}}rbio Faria and
Miguel A. Piza{\~{n}}a and
Dieter Rautenbach and
Jayme Luiz Szwarcfiter},
title = {On defensive alliances and strong global offensive alliances},
journal = {Discret. Appl. Math.},
volume = {163},
pages = {136--141},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2013.06.029},
doi = {10.1016/J.DAM.2013.06.029},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DouradoFPRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jbcs/CoutoFK14,
author = {Fernanda Couto and
Lu{\'{e}}rbio Faria and
Sulamita Klein},
title = {Chordal-(k, {\(\mathscr{l}\)}) and strongly chordal-(k, {\(\mathscr{l}\)})graph
sandwich problems},
journal = {J. Braz. Comput. Soc.},
volume = {20},
number = {1},
pages = {19:1--19:10},
year = {2014},
url = {https://doi.org/10.1186/s13173-014-0016-6},
doi = {10.1186/S13173-014-0016-6},
timestamp = {Wed, 20 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jbcs/CoutoFK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BonomoDDFGS13,
author = {Flavia Bonomo and
Mitre Costa Dourado and
Guillermo Dur{\'{a}}n and
Lu{\'{e}}rbio Faria and
Luciano N. Grippo and
Mart{\'{\i}}n Dar{\'{\i}}o Safe},
title = {Forbidden subgraphs and the K{\"{o}}nig-Egerv{\'{a}}ry property},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2380--2388},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.020},
doi = {10.1016/J.DAM.2013.04.020},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BonomoDDFGS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/DantasFFT13,
author = {Simone Dantas and
Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Rafael B. Teixeira},
title = {The generalized split probe problem},
journal = {Electron. Notes Discret. Math.},
volume = {44},
pages = {39--45},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.10.007},
doi = {10.1016/J.ENDM.2013.10.007},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/DantasFFT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CoelhoFGK13,
author = {Hebert Coelho and
Lu{\'{e}}rbio Faria and
Sylvain Gravier and
Sulamita Klein},
title = {Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented
graphs},
journal = {Electron. Notes Discret. Math.},
volume = {44},
pages = {195--200},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.10.030},
doi = {10.1016/J.ENDM.2013.10.030},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/CoelhoFGK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlconFFG13,
author = {Liliana Alc{\'{o}}n and
Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Marisa Gutierrez},
title = {Split clique graph complexity},
journal = {Theor. Comput. Sci.},
volume = {506},
pages = {29--42},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.07.020},
doi = {10.1016/J.TCS.2013.07.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlconFFG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/CoutoFKPN13,
author = {Fernanda Couto and
Lu{\'{e}}rbio Faria and
Sulamita Klein and
F{\'{a}}bio Protti and
Loana Tito Nogueira},
editor = {Michael R. Fellows and
Xuehou Tan and
Binhai Zhu},
title = {On (\emph{k}, {\(\mathscr{l}\)})-Graph Sandwich Problems},
booktitle = {Frontiers in Algorithmics \emph{and} Algorithmic Aspects in Information
and Management, Third Joint International Conference, {FAW-AAIM} 2013,
Dalian, China, June 26-28, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7924},
pages = {187--197},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38756-2\_20},
doi = {10.1007/978-3-642-38756-2\_20},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaim/CoutoFKPN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/MartinhonF13,
author = {Carlos A. J. Martinhon and
Lu{\'{e}}rbio Faria},
editor = {Michael R. Fellows and
Xuehou Tan and
Binhai Zhu},
title = {The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs
and Digraphs},
booktitle = {Frontiers in Algorithmics \emph{and} Algorithmic Aspects in Information
and Management, Third Joint International Conference, {FAW-AAIM} 2013,
Dalian, China, June 26-28, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7924},
pages = {231--240},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38756-2\_24},
doi = {10.1007/978-3-642-38756-2\_24},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaim/MartinhonF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/FariaHKLWW13,
author = {Lu{\'{e}}rbio Faria and
Wing{-}Kai Hon and
Ton Kloks and
Hsiang{-}Hsuan Liu and
Tao{-}Ming Wang and
Yue{-}Li Wang},
editor = {Peter Widmayer and
Yinfeng Xu and
Binhai Zhu},
title = {On Complexities of Minus Domination},
booktitle = {Combinatorial Optimization and Applications - 7th International Conference,
{COCOA} 2013, Chengdu, China, December 12-14, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8287},
pages = {178--189},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03780-6\_16},
doi = {10.1007/978-3-319-03780-6\_16},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/FariaHKLWW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FariaFRV13,
author = {Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
R. Bruce Richter and
Imrich Vrto},
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
R{\"{u}}diger Reischuk},
title = {The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing
Numbers of the n-Cube},
booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International
Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013,
Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {8165},
pages = {249--260},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45043-3\_22},
doi = {10.1007/978-3-642-45043-3\_22},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/FariaFRV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/CoelhoFGK13,
author = {Hebert Coelho and
Lu{\'{e}}rbio Faria and
Sylvain Gravier and
Sulamita Klein},
editor = {Kamiel Cornelissen and
Ruben Hoeksma and
Johann L. Hurink and
Bodo Manthey},
title = {An oriented 8-coloring for acyclic oriented graphs with maximum degree
3},
booktitle = {12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
Enschede, Netherlands, May 21-23, 2013},
series = {{CTIT} Workshop Proceedings},
volume = {{WP} 13-01},
pages = {55--58},
year = {2013},
timestamp = {Mon, 06 Apr 2020 17:04:26 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/CoelhoFGK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/CoutoFKNP13,
author = {Fernanda Couto and
Lu{\'{e}}rbio Faria and
Sulamita Klein and
Loana Tito Nogueira and
F{\'{a}}bio Protti},
editor = {Kamiel Cornelissen and
Ruben Hoeksma and
Johann L. Hurink and
Bodo Manthey},
title = {On specifying boundary conditions for the graph sandwich problem},
booktitle = {12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
Enschede, Netherlands, May 21-23, 2013},
series = {{CTIT} Workshop Proceedings},
volume = {{WP} 13-01},
pages = {63--66},
year = {2013},
timestamp = {Thu, 02 Feb 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/CoutoFKNP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FariaHKLWW13,
author = {Lu{\'{e}}rbio Faria and
Wing{-}Kai Hon and
Ton Kloks and
Hsiang{-}Hsuan Liu and
Tao{-}Ming Wang and
Yue{-}Li Wang},
title = {On Complexities of Minus Domination},
journal = {CoRR},
volume = {abs/1307.6663},
year = {2013},
url = {http://arxiv.org/abs/1307.6663},
eprinttype = {arXiv},
eprint = {1307.6663},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FariaHKLWW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FariaKS12,
author = {Lu{\'{e}}rbio Faria and
Sulamita Klein and
Matej Stehl{\'{\i}}k},
title = {Odd Cycle Transversals and Independent Sets in Fullerene Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {26},
number = {3},
pages = {1458--1469},
year = {2012},
url = {https://doi.org/10.1137/120870463},
doi = {10.1137/120870463},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FariaKS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/CoelhoFGK12,
author = {Hebert Coelho and
Lu{\'{e}}rbio Faria and
Sylvain Gravier and
Sulamita Klein},
editor = {Andreas Brieden and
Zafer{-}Korcan G{\"{o}}rg{\"{u}}l{\"{u}} and
Tino Krug and
Erik Kropat and
Silja Meyer{-}Nieberg and
Goran Mihelcic and
Stefan Wolfgang Pickl},
title = {On the Oriented Chromatic Number of Union of Graphs},
booktitle = {11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
Munich, Germany, May 29-31, 2012. Extended Abstracts},
pages = {88--91},
year = {2012},
timestamp = {Thu, 02 Feb 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/CoelhoFGK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GuedesMF11,
author = {Andr{\'{e}} Luiz Pires Guedes and
Lilian Markenzon and
Lu{\'{e}}rbio Faria},
title = {Flow hypergraph reducibility},
journal = {Discret. Appl. Math.},
volume = {159},
number = {16},
pages = {1775--1785},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2011.02.006},
doi = {10.1016/J.DAM.2011.02.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GuedesMF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BuenoFFMH11,
author = {Let{\'{\i}}cia Rodrigues Bueno and
Celina M. H. de Figueiredo and
Lu{\'{e}}rbio Faria and
Candido F. X. Mendon{\c{c}}a and
Rodrigo de A. Hausen},
title = {Hamiltonian Cycles in Kneser Graphs for n=2k+2},
journal = {Electron. Notes Discret. Math.},
volume = {37},
pages = {291--296},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.05.050},
doi = {10.1016/J.ENDM.2011.05.050},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BuenoFFMH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/DouradoDFGS11,
author = {Mitre Costa Dourado and
Guillermo Dur{\'{a}}n and
Lu{\'{e}}rbio Faria and
Luciano N. Grippo and
Mart{\'{\i}}n Dar{\'{\i}}o Safe},
title = {Forbidden subgraphs and the K{\H{o}}nig property},
journal = {Electron. Notes Discret. Math.},
volume = {37},
pages = {333--338},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.05.057},
doi = {10.1016/J.ENDM.2011.05.057},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/DouradoDFGS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/CerioliFFP11,
author = {M{\'{a}}rcia R. Cerioli and
Lu{\'{e}}rbio Faria and
Talita O. Ferreira and
F{\'{a}}bio Protti},
title = {A note on maximum independent sets and minimum clique partitions in
unit disk graphs and penny graphs: complexity and approximation},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {45},
number = {3},
pages = {331--346},
year = {2011},
url = {https://doi.org/10.1051/ita/2011106},
doi = {10.1051/ITA/2011106},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/CerioliFFP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/AlconFFG11,
author = {Liliana Alc{\'{o}}n and
Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Marisa Gutierrez},
editor = {Petr Kolman and
Jan Kratochv{\'{\i}}l},
title = {Split Clique Graph Complexity},
booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International
Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June
21-24, 2011. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6986},
pages = {11--22},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25870-1\_3},
doi = {10.1007/978-3-642-25870-1\_3},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/AlconFFG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AlconFFG10,
author = {Liliana Alc{\'{o}}n and
Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Marisa Gutierrez},
title = {On maximizing clique, clique-Helly and hereditary clique-Helly induced
subgraphs},
journal = {Discret. Appl. Math.},
volume = {158},
number = {12},
pages = {1279--1285},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2009.01.011},
doi = {10.1016/J.DAM.2009.01.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AlconFFG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CookDEFFK10,
author = {Kathryn Cook and
Simone Dantas and
Elaine M. Eschen and
Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Sulamita Klein},
title = {2K\({}_{\mbox{2}}\) vertex-set partition into nonempty parts},
journal = {Discret. Math.},
volume = {310},
number = {6-7},
pages = {1259--1264},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2009.11.030},
doi = {10.1016/J.DISC.2009.11.030},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CookDEFFK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HausenFFK10,
author = {Rodrigo de A. Hausen and
Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Luis Antonio Brasil Kowada},
title = {Unitary Toric Classes, the Reality and Desire Diagram, and Sorting
by Transpositions},
journal = {{SIAM} J. Discret. Math.},
volume = {24},
number = {3},
pages = {792--807},
year = {2010},
url = {https://doi.org/10.1137/08074413X},
doi = {10.1137/08074413X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HausenFFK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/DantasFFKNP10,
author = {Simone Dantas and
Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Sulamita Klein and
Loana Tito Nogueira and
F{\'{a}}bio Protti},
editor = {Taso Viglas and
Alex Potanin},
title = {Advances on the List Stubborn Problem},
booktitle = {Theory of Computing 2010, {CATS} 2010, Brisbane, Australia, January
2010},
series = {{CRPIT}},
volume = {109},
pages = {65--70},
publisher = {Australian Computer Society},
year = {2010},
url = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV109Dantas.html},
timestamp = {Mon, 08 Feb 2021 13:26:48 +0100},
biburl = {https://dblp.org/rec/conf/cats/DantasFFKNP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/NetoCXSFF09,
author = {Candido Ferreira Xavier de Mendon{\c{c}}a Neto and
Ademir Aparecido Constantino and
Erico F. Xavier and
Jorge Stolfi and
Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo},
title = {Skewness, splitting number and vertex deletion of some toroidal meshes},
journal = {Ars Comb.},
volume = {92},
year = {2009},
timestamp = {Mon, 22 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/NetoCXSFF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlconFFG09,
author = {Liliana Alc{\'{o}}n and
Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Marisa Gutierrez},
title = {The complexity of clique graph recognition},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2072--2083},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.018},
doi = {10.1016/J.TCS.2009.01.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlconFFG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/GuedesMF09,
author = {Andr{\'{e}} Luiz Pires Guedes and
Lilian Markenzon and
Lu{\'{e}}rbio Faria},
editor = {Sonia Cafieri and
Antonio Mucherino and
Giacomo Nannicini and
Fabien Tarissan and
Leo Liberti},
title = {Recognition of Reducible Flow Hypergraphs},
booktitle = {Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial
Optimization, {CTW} 2009, Paris, France, June 2-4 2009},
pages = {229--232},
year = {2009},
url = {http://www.lix.polytechnique.fr/ctw09/ctw09-proceedings.pdf\#page=241},
timestamp = {Thu, 12 Mar 2020 11:34:41 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/GuedesMF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CerioliFFMPR08,
author = {M{\'{a}}rcia R. Cerioli and
Lu{\'{e}}rbio Faria and
Talita O. Ferreira and
Carlos A. J. Martinhon and
F{\'{a}}bio Protti and
Bruce A. Reed},
title = {Partition into cliques for cubic graphs: Planar case, complexity and
approximation},
journal = {Discret. Appl. Math.},
volume = {156},
number = {12},
pages = {2270--2278},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2007.10.015},
doi = {10.1016/J.DAM.2007.10.015},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CerioliFFMPR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AlconFFG08,
author = {Liliana Alc{\'{o}}n and
Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Marisa Gutierrez},
title = {On maximizing clique, clique-Helly and hereditary clique-Helly induced
subgraphs},
journal = {Electron. Notes Discret. Math.},
volume = {30},
pages = {147--152},
year = {2008},
url = {https://doi.org/10.1016/j.endm.2008.01.026},
doi = {10.1016/J.ENDM.2008.01.026},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/AlconFFG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/GuedesMF08,
author = {Andr{\'{e}} Luiz Pires Guedes and
Lilian Markenzon and
Lu{\'{e}}rbio Faria},
title = {Flow Hypergraph Reducibility},
journal = {Electron. Notes Discret. Math.},
volume = {30},
pages = {255--260},
year = {2008},
url = {https://doi.org/10.1016/j.endm.2008.01.044},
doi = {10.1016/J.ENDM.2008.01.044},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/GuedesMF08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/DantasEFFK08,
author = {Simone Dantas and
Elaine M. Eschen and
Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Sulamita Klein},
title = {2K\({}_{\mbox{2}}\) vertex-set partition into nonempty parts},
journal = {Electron. Notes Discret. Math.},
volume = {30},
pages = {291--296},
year = {2008},
url = {https://doi.org/10.1016/j.endm.2008.01.050},
doi = {10.1016/J.ENDM.2008.01.050},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/DantasEFFK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FariaFSV08,
author = {Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Ondrej S{\'{y}}kora and
Imrich Vrto},
title = {An improved upper bound on the crossing number of the hypercube},
journal = {J. Graph Theory},
volume = {59},
number = {2},
pages = {145--161},
year = {2008},
url = {https://doi.org/10.1002/jgt.20330},
doi = {10.1002/JGT.20330},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FariaFSV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AbouelaoualimDFMMS08,
author = {Abdelfattah Abouelaoualim and
Kinkar Chandra Das and
Lu{\'{e}}rbio Faria and
Yannis Manoussakis and
Carlos A. J. Martinhon and
Rachid Saad},
title = {Paths and trails in edge-colored graphs},
journal = {Theor. Comput. Sci.},
volume = {409},
number = {3},
pages = {497--510},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2008.09.021},
doi = {10.1016/J.TCS.2008.09.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AbouelaoualimDFMMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/AbouelaoualimDFMMS08,
author = {Abdelfattah Abouelaoualim and
Kinkar Chandra Das and
Lu{\'{e}}rbio Faria and
Yannis Manoussakis and
Carlos A. J. Martinhon and
Rachid Saad},
editor = {Eduardo Sany Laber and
Claudson F. Bornstein and
Loana Tito Nogueira and
Lu{\'{e}}rbio Faria},
title = {Paths and Trails in Edge-Colored Graphs},
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 = {723--735},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-78773-0\_62},
doi = {10.1007/978-3-540-78773-0\_62},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/AbouelaoualimDFMMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wob/HausenFFK08,
author = {Rodrigo de A. Hausen and
Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Luis Antonio Brasil Kowada},
editor = {Ana L. C. Bazzan and
Mark Craven and
Nat{\'{a}}lia Florencio Martins},
title = {On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions},
booktitle = {Advances in Bioinformatics and Computational Biology, Third Brazilian
Symposium on Bioinformatics, {BSB} 2008, Santo Andr{\'{e}}, Brazil,
August 28-30, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5167},
pages = {79--91},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85557-6\_8},
doi = {10.1007/978-3-540-85557-6\_8},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wob/HausenFFK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/latin/2008,
editor = {Eduardo Sany Laber and
Claudson F. Bornstein and
Loana Tito Nogueira and
Lu{\'{e}}rbio Faria},
title = {{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},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-78773-0},
doi = {10.1007/978-3-540-78773-0},
isbn = {978-3-540-78772-3},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/2008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FigueiredoFKS07,
author = {Celina M. H. de Figueiredo and
Lu{\'{e}}rbio Faria and
Sulamita Klein and
R. Sritharan},
title = {On the complexity of the sandwich problems for strongly chordal graphs
and chordal bipartite graphs},
journal = {Theor. Comput. Sci.},
volume = {381},
number = {1-3},
pages = {57--67},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.04.007},
doi = {10.1016/J.TCS.2007.04.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FigueiredoFKS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FariaFGNS06,
author = {Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Sylvain Gravier and
Candido Ferreira Xavier de Mendon{\c{c}}a Neto and
Jorge Stolfi},
title = {On maximum planar induced subgraphs},
journal = {Discret. Appl. Math.},
volume = {154},
number = {13},
pages = {1774--1782},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2006.03.021},
doi = {10.1016/J.DAM.2006.03.021},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FariaFGNS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/AlconFFG06,
author = {Liliana Alc{\'{o}}n and
Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Marisa Gutierrez},
editor = {Fedor V. Fomin},
title = {Clique Graph Recognition Is NP-Complete},
booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop,
{WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4271},
pages = {269--277},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11917496\_24},
doi = {10.1007/11917496\_24},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/AlconFFG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/MendoncaXSFF05,
author = {Candido Ferreira Xavier de Mendon{\c{c}}a Neto and
Erico F. Xavier and
Jorge Stolfi and
Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo},
title = {The non planar vertex deletion of Cn x Cm},
journal = {Ars Comb.},
volume = {76},
year = {2005},
timestamp = {Thu, 02 Feb 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/MendoncaXSFF05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CamposDFG05,
author = {C. N. Campos and
Simone Dantas and
Lu{\'{e}}rbio Faria and
Sylvain Gravier},
title = {2K\({}_{\mbox{2}}\)-Partition Problem},
journal = {Electron. Notes Discret. Math.},
volume = {22},
pages = {217--221},
year = {2005},
url = {https://doi.org/10.1016/j.endm.2005.06.031},
doi = {10.1016/J.ENDM.2005.06.031},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/CamposDFG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FariaFN04,
author = {Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Candido Ferreira Xavier de Mendon{\c{c}}a Neto},
title = {On the complexity of the approximation of nonplanarity parameters
for cubic graphs},
journal = {Discret. Appl. Math.},
volume = {141},
number = {1-3},
pages = {119--134},
year = {2004},
url = {https://doi.org/10.1016/S0166-218X(03)00370-6},
doi = {10.1016/S0166-218X(03)00370-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FariaFN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DantasFF04,
author = {Simone Dantas and
Celina M. H. de Figueiredo and
Lu{\'{e}}rbio Faria},
title = {On decision and optimization (\emph{k, l})-graph sandwich problems},
journal = {Discret. Appl. Math.},
volume = {143},
number = {1-3},
pages = {155--165},
year = {2004},
url = {https://doi.org/10.1016/j.dam.2004.02.008},
doi = {10.1016/J.DAM.2004.02.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DantasFF04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CerioliFFP04,
author = {M{\'{a}}rcia R. Cerioli and
Lu{\'{e}}rbio Faria and
Talita O. Ferreira and
F{\'{a}}bio Protti},
title = {On minimum clique partition and maximum independent set on unit disk
graphs and penny graphs: complexity and approximation},
journal = {Electron. Notes Discret. Math.},
volume = {18},
pages = {73--79},
year = {2004},
url = {https://doi.org/10.1016/j.endm.2004.06.012},
doi = {10.1016/J.ENDM.2004.06.012},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/CerioliFFP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FariaFGMS04,
author = {Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Sylvain Gravier and
Candido F. X. Mendon{\c{c}}a and
Jorge Stolfi},
title = {Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness
and a \emph{I}-approximation for finding maximum planar induced subgraphs},
journal = {Electron. Notes Discret. Math.},
volume = {18},
pages = {121--126},
year = {2004},
url = {https://doi.org/10.1016/j.endm.2004.06.019},
doi = {10.1016/J.ENDM.2004.06.019},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FariaFGMS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FariaFSV03,
author = {Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Ondrej S{\'{y}}kora and
Imrich Vrto},
editor = {Hans L. Bodlaender},
title = {An Improved Upper Bound on the Crossing Number of the Hypercube},
booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop,
{WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2880},
pages = {230--236},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39890-5\_20},
doi = {10.1007/978-3-540-39890-5\_20},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FariaFSV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/NetoSXSFF02,
author = {Candido Ferreira Xavier de Mendon{\c{c}}a Neto and
Karl Schaffer and
Erico F. Xavier and
Jorge Stolfi and
Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo},
title = {The splitting number and skewness of C\({}_{\mbox{n}}\) x C\({}_{\mbox{m}}\)},
journal = {Ars Comb.},
volume = {63},
year = {2002},
timestamp = {Thu, 02 Feb 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/NetoSXSFF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DantasFF02,
author = {Simone Dantas and
Celina M. H. de Figueiredo and
Lu{\'{e}}rbio Faria},
editor = {Ludek Kucera},
title = {On the Complexity of (k, l)-Graph Sandwich Problems},
booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop,
{WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {2573},
pages = {92--101},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36379-3\_9},
doi = {10.1007/3-540-36379-3\_9},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/DantasFF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FariaFN01,
author = {Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Candido Ferreira Xavier de Mendon{\c{c}}a Neto},
title = {{SPLITTING} {NUMBER} is NP-complete},
journal = {Discret. Appl. Math.},
volume = {108},
number = {1-2},
pages = {65--83},
year = {2001},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FariaFN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FariaFN01,
author = {Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Candido Ferreira Xavier de Mendon{\c{c}}a Neto},
title = {On the complexity of the approximation of nonplanarity parameters
for cubic graphs},
journal = {Electron. Notes Discret. Math.},
volume = {7},
pages = {18--21},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(04)00214-8},
doi = {10.1016/S1571-0653(04)00214-8},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FariaFN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FigueiredoFN99,
author = {Celina M. H. de Figueiredo and
Lu{\'{e}}rbio Faria and
Candido Ferreira Xavier de Mendon{\c{c}}a Neto},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {887--888},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.315069},
timestamp = {Thu, 05 Jul 2018 07:29:57 +0200},
biburl = {https://dblp.org/rec/conf/soda/FigueiredoFN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/FariaFN98,
author = {Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Candido Ferreira Xavier de Mendon{\c{c}}a Neto},
editor = {Claudio L. Lucchesi and
Arnaldo V. Moura},
title = {The Splitting Number of the 4-Cube},
booktitle = {{LATIN} '98: Theoretical Informatics, Third Latin American Symposium,
Campinas, Brazil, April, 20-24, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1380},
pages = {141--150},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054317},
doi = {10.1007/BFB0054317},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/FariaFN98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FariaFM98,
author = {Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Candido Ferreira Xavier de Mendon{\c{c}}a Neto},
editor = {Juraj Hromkovic and
Ondrej S{\'{y}}kora},
title = {Splitting Number is NP-complete},
booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop,
{WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1517},
pages = {285--297},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/10692760\_23},
doi = {10.1007/10692760\_23},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FariaFM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/irregular/FrancaF95,
author = {Felipe M. G. Fran{\c{c}}a and
Lu{\'{e}}rbio Faria},
editor = {Afonso Ferreira and
Jos{\'{e}} D. P. Rolim},
title = {Optimal Mapping of Neighbourhood-Constrained Systems},
booktitle = {Parallel Algorithms for Irregularly Structured Problems, Second International
Workshop, {IRREGULAR} '95, Lyon, France, September 4-6, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {980},
pages = {165--170},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60321-2\_14},
doi = {10.1007/3-540-60321-2\_14},
timestamp = {Tue, 14 May 2019 10:00:36 +0200},
biburl = {https://dblp.org/rec/conf/irregular/FrancaF95.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-21 18:23 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:
