Fabiano de S. Oliveira

Orcid: 0000-0002-8498-2472

According to our database1, Fabiano de S. Oliveira authored at least 27 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete.
Discret. Comput. Geom., April, 2024

Linear-time algorithms for eliminating claws in graphs.
Int. Trans. Oper. Res., January, 2024

2023
MaxCut on permutation graphs is NP-complete.
J. Graph Theory, September, 2023

Thinness and its variations on some graph families and coloring graphs of bounded thinness.
CoRR, 2023

Mixed integer programming and quadratic programming formulations for the interval count problem.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022
Restricted Hamming-Huffman trees.
RAIRO Oper. Res., 2022

Grid straight-line embeddings of trees with a minimum number of bends per path.
Inf. Process. Lett., 2022

On subclasses of interval count two and on Fishburn's conjecture.
Discret. Appl. Math., 2022

Precedence thinness in graphs.
Discret. Appl. Math., 2022

Thinness of product graphs.
Discret. Appl. Math., 2022

Edge Intersection Graphs of Paths on a Triangular Grid.
CoRR, 2022

2021
B1-EPG representations using block-cutpoint trees.
CoRR, 2021

Minimum Number of Bends of Paths of Trees in a Grid Embedding.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020
Maximum cut on interval graphs of interval count five is NP-complete.
CoRR, 2020

2019
Two Problems on Interval Counting.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018
Recognition and characterization of unit interval graphs with integer endpoints.
Discret. Appl. Math., 2018

Sketching Data Structures for Massive Graph Problems.
Proceedings of the Heterogeneous Data Management, Polystores, and Analytics for Healthcare, 2018

2017
A note on counting independent terms in asymptotic expressions of computational complexity.
Optim. Lett., 2017

2016
On the mediation of program allocation in high-demand environments.
CoRR, 2016

2015
On unit interval graphs with integer endpoints.
Electron. Notes Discret. Math., 2015

Counting independent terms in big-oh notation.
CoRR, 2015

2014
Revisiting deadlock prevention: A probabilistic approach.
Networks, 2014

Graphs of interval count two with a given partition.
Inf. Process. Lett., 2014

2012
The interval count of interval graphs and orders: a short survey.
J. Braz. Comput. Soc., 2012

2011
On counting interval lengths of interval graphs.
Discret. Appl. Math., 2011

2010
Extreme Cliques in Interval Graphs.
Ars Comb., 2010

2008
Linear-Interval Dimension and PI Orders.
Electron. Notes Discret. Math., 2008


  Loading...