default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabiano de S. Oliveira
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva
:
Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete. Discret. Comput. Geom. 71(3): 893-917 (2024)- [j16]Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Linear-time algorithms for eliminating claws in graphs. Int. Trans. Oper. Res. 31(1): 296-315 (2024) - 2023
- [j15]Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva:
MaxCut on permutation graphs is NP-complete. J. Graph Theory 104(1): 5-16 (2023) - [c6]Lívia Salgado Medeiros, Fabiano de S. Oliveira, Abilio Lucena, Jayme Luiz Szwarcfiter:
Mixed integer programming and quadratic programming formulations for the interval count problem. LAGOS 2023: 283-291 - [i12]Flavia Bonomo-Braberman, Eric Brandwein, Fabiano de S. Oliveira, Moysés S. Sampaio Jr., Agustín Sansone, Jayme Luiz Szwarcfiter:
Thinness and its variations on some graph families and coloring graphs of bounded thinness. CoRR abs/2303.06070 (2023) - 2022
- [j14]Flavia Bonomo-Braberman, Carolina Lucía Gonzalez, Fabiano de Souza Oliveira, Moysés S. Sampaio Jr., Jayme Luiz Szwarcfiter:
Thinness of product graphs. Discret. Appl. Math. 312: 52-71 (2022) - [j13]Flavia Bonomo-Braberman, Fabiano de S. Oliveira, Moysés S. Sampaio Jr., Jayme Luiz Szwarcfiter:
Precedence thinness in graphs. Discret. Appl. Math. 323: 76-95 (2022) - [j12]Mathew C. Francis, Lívia Salgado Medeiros, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
On subclasses of interval count two and on Fishburn's conjecture. Discret. Appl. Math. 323: 236-251 (2022) - [j11]Vitor Tocci F. de Luca, Nestaly Marín, Fabiano de S. Oliveira, Adriana Ramírez-Vigueras, Oriol Andreu Solé-Pi, Jayme Luiz Szwarcfiter, Jorge Urrutia:
Grid straight-line embeddings of trees with a minimum number of bends per path. Inf. Process. Lett. 174: 106210 (2022) - [j10]Min Chih Lin, Fabiano de S. Oliveira, Paulo E. D. Pinto, Moysés S. Sampaio Jr., Jayme Luiz Szwarcfiter:
Restricted Hamming-Huffman trees. RAIRO Oper. Res. 56(3): 1823-1839 (2022) - [i11]Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva:
MaxCut on Permutation Graphs is NP-complete. CoRR abs/2202.13955 (2022) - [i10]Vitor Tocci Ferreira de Luca, María Pía Mazzoleni, Fabiano de S. Oliveira, Tanilson D. Santos, Jayme Luiz Szwarcfiter:
Edge Intersection Graphs of Paths on a Triangular Grid. CoRR abs/2203.04250 (2022) - 2021
- [c5]Vitor Tocci Ferreira de Luca, Fabiano de Souza Oliveira, Jayme Luiz Szwarcfiter:
Minimum Number of Bends of Paths of Trees in a Grid Embedding. LAGOS 2021: 118-126 - [c4]Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva:
Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete. MFCS 2021: 38:1-38:15 - [i9]Vitor Tocci F. de Luca, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
B1-EPG representations using block-cutpoint trees. CoRR abs/2106.05312 (2021) - [i8]Vitor Tocci F. de Luca, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
Minimum Number of Bends of Paths of Trees in a Grid Embedding. CoRR abs/2109.02733 (2021) - 2020
- [c3]Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Linear-Time Algorithms for Eliminating Claws in Graphs. COCOON 2020: 14-26 - [i7]Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Linear-time Algorithms for Eliminating Claws in Graphs. CoRR abs/2004.05672 (2020) - [i6]Flavia Bonomo-Braberman, Carolina Lucía Gonzalez, Fabiano de S. Oliveira, Moysés S. Sampaio Jr., Jayme Luiz Szwarcfiter:
Thinness of product graphs. CoRR abs/2006.16887 (2020) - [i5]Flavia Bonomo-Braberman, Fabiano de S. Oliveira, Moysés S. Sampaio Jr., Jayme Luiz Szwarcfiter:
Precedence thinness in graphs. CoRR abs/2006.16991 (2020) - [i4]Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva:
Maximum cut on interval graphs of interval count five is NP-complete. CoRR abs/2012.09804 (2020)
2010 – 2019
- 2019
- [c2]Lívia Salgado Medeiros, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
Two Problems on Interval Counting. LAGOS 2019: 625-643 - 2018
- [j9]Guillermo Durán, Fernando Fernández Slezak, Luciano N. Grippo, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
Recognition and characterization of unit interval graphs with integer endpoints. Discret. Appl. Math. 245: 168-176 (2018) - [c1]Juan P. A. Lopes, Fabiano de S. Oliveira, Paulo E. D. Pinto, Valmir C. Barbosa:
Sketching Data Structures for Massive Graph Problems. Poly/DMAH@VLDB 2018: 57-67 - 2017
- [j8]Fabiano de S. Oliveira, Valmir C. Barbosa:
A note on counting independent terms in asymptotic expressions of computational complexity. Optim. Lett. 11(8): 1757-1765 (2017) - 2016
- [i3]Fabiano de S. Oliveira, Valmir C. Barbosa:
On the mediation of program allocation in high-demand environments. CoRR abs/1604.08137 (2016) - 2015
- [j7]Guillermo Durán, Fernando Fernández Slezak, Luciano N. Grippo, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
On unit interval graphs with integer endpoints. Electron. Notes Discret. Math. 50: 445-450 (2015) - [i2]Fabiano de S. Oliveira, Valmir Carneiro Barbosa:
Counting independent terms in big-oh notation. CoRR abs/1512.09363 (2015) - 2014
- [j6]Felix Joos, Christian Löwenstein, Fabiano de S. Oliveira, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Graphs of interval count two with a given partition. Inf. Process. Lett. 114(10): 542-546 (2014) - [j5]Fabiano de S. Oliveira, Valmir Carneiro Barbosa:
Revisiting deadlock prevention: A probabilistic approach. Networks 63(2): 203-210 (2014) - 2012
- [j4]Márcia R. Cerioli, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
The interval count of interval graphs and orders: a short survey. J. Braz. Comput. Soc. 18(2): 103-112 (2012) - 2011
- [j3]Márcia R. Cerioli, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
On counting interval lengths of interval graphs. Discret. Appl. Math. 159(7): 532-543 (2011) - 2010
- [j2]Márcia R. Cerioli, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
Extreme Cliques in Interval Graphs. Ars Comb. 94 (2010) - [i1]Fabiano de S. Oliveira, Valmir Carneiro Barbosa:
Revisiting deadlock prevention: a probabilistic approach. CoRR abs/1010.4411 (2010)
2000 – 2009
- 2008
- [j1]Márcia R. Cerioli, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
Linear-Interval Dimension and PI Orders. Electron. Notes Discret. Math. 30: 111-116 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 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:
