Júlio Araújo

Orcid: 0000-0001-7074-2753

Affiliations:
  • Federal University of Ceará, Department of Mathematics, Fortaleza, Ceará, Brazil
  • INRIA, France (former)


According to our database1, Júlio Araújo authored at least 39 papers between 2009 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
The iteration time and the general position number in graph convexities.
Appl. Math. Comput., 2025

2024
On the hull number on cycle convexity of graphs.
Inf. Process. Lett., January, 2024

On the parameterized complexity of computing good edge-labelings.
CoRR, 2024

2023
On Finding the Best and Worst Orientations for the Metric Dimension.
Algorithmica, October, 2023

Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets.
Algorithmica, February, 2023

The general position number and the iteration time in the P3 convexity.
CoRR, 2023

2022
Backbone coloring of graphs with galaxy backbones.
Discret. Appl. Math., 2022

Hull and geodetic numbers for some classes of oriented graphs.
Discret. Appl. Math., 2022

On the hull and interval numbers of oriented graphs.
CoRR, 2022

Introducing lop-Kernels: A Framework for Kernelization Lower Bounds.
Algorithmica, 2022

2021
On the proper orientation number of chordal graphs.
Theor. Comput. Sci., 2021

A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020
Cycle convexity and the tunnel number of links.
CoRR, 2020

On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths.
Algorithmica, 2020

Dual Parameterization of Weighted Coloring.
Algorithmica, 2020

2019
Weighted proper orientations of trees and graphs of bounded treewidth.
Theor. Comput. Sci., 2019

Backbone Coloring of Graphs with Galaxy Backbones.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Hull and Geodetic Numbers for Some Classes of Oriented Graphs.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018
Ruling out FPT algorithms for Weighted Coloring on forests.
Theor. Comput. Sci., 2018

On interval number in cycle convexity.
Discret. Math. Theor. Comput. Sci., 2018

Steinberg-like theorems for backbone colouring.
Discret. Appl. Math., 2018

Circular backbone colorings: On matching and tree backbones of planar graphs.
Discret. Appl. Math., 2018

2017
On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring.
J. Graph Theory, 2017

2016
Proper orientation of cacti.
Theor. Comput. Sci., 2016

Hull number: P<sub>5</sub>-free graphs and reduction rules.
Discret. Appl. Math., 2016

Energy Efficient Content Distribution.
Comput. J., 2016

2015
On the proper orientation number of bipartite graphs.
Theor. Comput. Sci., 2015

2014
Weighted Coloring in Trees.
SIAM J. Discret. Math., 2014

Eulerian and Hamiltonian dicycles in Directed hypergraphs.
Discret. Math. Algorithms Appl., 2014

2013
On the hull number of some graph classes.
Theor. Comput. Sci., 2013

A Hajós-like theorem for weighted coloring.
J. Braz. Comput. Soc., 2013

Connectivity Inference in Mass Spectrometry Based Structure Determination.
Proceedings of the Algorithms - ESA 2013, 2013

2012
Graph Coloring and Graph Convexity. (Coloration et convexité dans les graphes).
PhD thesis, 2012

Weighted improper colouring.
J. Discrete Algorithms, 2012

On the Grundy number of graphs with few P<sub>4</sub>'s.
Discret. Appl. Math., 2012

Good edge-labelling of graphs.
Discret. Appl. Math., 2012

2011
On the hull number of some graph classes.
Electron. Notes Discret. Math., 2011

Hybrid Approaches for Distributed Storage Systems.
Proceedings of the Data Management in Grid and Peer-to-Peer Systems, 2011

2009
Grundy number on P<sub>4</sub>-classes.
Electron. Notes Discret. Math., 2009


  Loading...