Ana Silva

Fabiano de S. Oliveira

Discret. Comput. Geom., April, 2024

Mengerian graphs: Characterization and recognition.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., February, 2024

On the hull number on cycle convexity of graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., January, 2024

2023

On Finding the Best and Worst Orientations for the Metric Dimension.

[BibT_eX]

[DOI]

Algorithmica, October, 2023

MaxCut on permutation graphs is NP-complete.

[BibT_eX]

[DOI]

Fabiano de S. Oliveira

J. Graph Theory, September, 2023

Eulerian Walks in Temporal Graphs.

[BibT_eX]

[DOI]

Andrea Marino

Algorithmica, March, 2023

On Computing Optimal Temporal Branchings and Spanning Subgraphs.

[BibT_eX]

[DOI]

CoRR, 2023

Deciding the Erdős-Pósa Property in 3-Connected Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Snapshot Disjointness in Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

On Computing Large Temporal (Unilateral) Connected Components.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

On Computing Optimal Temporal Branchings.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022

Coloring temporal graphs.

[BibT_eX]

[DOI]

Andrea Marino

J. Comput. Syst. Sci., 2022

Revising Johnson's table for the 21st century.

[BibT_eX]

[DOI]

Diana Sasaki

Discret. Appl. Math., 2022

Backbone coloring of graphs with galaxy backbones.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Menger's Theorem for Temporal Paths (Not Walks).

[BibT_eX]

[DOI]

CoRR, 2022

Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage.

[BibT_eX]

[DOI]

Raul Lopes

Proceedings of the WALCOM: Algorithms and Computation, 2022

2021

On the proper orientation number of chordal graphs.

[BibT_eX]

[DOI]

Vinícius Fernandes dos Santos

Alexandre A. Cezar

Carlos V. G. C. Lima

Luiz Alberto do Carmo Viana

Theor. Comput. Sci., 2021

A unifying model for locally constrained spanning tree problems.

[BibT_eX]

[DOI]

Manoel B. Campêlo

Ignasi Sau

J. Comb. Optim., 2021

Edge-Disjoint Branchings in Temporal Digraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

Coloring Problems on Bipartite Graphs of Small Diameter.

[BibT_eX]

[DOI]

Guilherme de C. M. Gomes

Electron. J. Comb., 2021

Königsberg Sightseeing: Eulerian Walks in Temporal Graphs.

[BibT_eX]

[DOI]

Andrea Marino

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Mengerian Temporal Graphs Revisited.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2020

b-continuity and partial Grundy coloring of graphs with large girth.

[BibT_eX]

[DOI]

Discret. Math., 2020

Connected greedy coloring of H-free graphs.

[BibT_eX]

[DOI]

Esdras Mota

Leonardo S. Rocha

Discret. Appl. Math., 2020

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

[BibT_eX]

[DOI]

Fabiano de S. Oliveira

Tatiane Fernandes Figueiredo

CoRR, 2020

Cycle convexity and the tunnel number of links.

[BibT_eX]

[DOI]

CoRR, 2020

The sociotechnical teams formation problem: a mathematical optimization approach.

[BibT_eX]

[DOI]

Manoel B. Campêlo

Ann. Oper. Res., 2020

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

[BibT_eX]

[DOI]

Algorithmica, 2020

Dual Parameterization of Weighted Coloring.

[BibT_eX]

[DOI]

Vinícius Fernandes dos Santos

Ignasi Sau

Algorithmica, 2020

Edge-Disjoint Branchings in Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019

Weighted proper orientations of trees and graphs of bounded treewidth.

[BibT_eX]

[DOI]

Ignasi Sau

Theor. Comput. Sci., 2019

Graphs with Girth at Least 8 are b-continuous.

[BibT_eX]

[DOI]

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Backbone Coloring of Graphs with Galaxy Backbones.

[BibT_eX]

[DOI]

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Graphs with small fall-spectrum.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

On Orthogonal Vector Edge Coloring.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Circular backbone colorings: On matching and tree backbones of planar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Edge-b-Coloring Trees.

[BibT_eX]

[DOI]

Algorithmica, 2018

2017

On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring.

[BibT_eX]

[DOI]

Júlio César Silva Araújo

Alexandre A. Cezar

J. Graph Theory, 2017

On the b-Continuity of the Lexicographic Product of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2017

The b-Continuity of Graphs with Large Girth.

[BibT_eX]

[DOI]

Graphs Comb., 2017

The lexicographic product of some chordal graphs and of cographs preserves b-continuity.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

2016

The maximum infection time in the geodesic and monophonic convexities.

[BibT_eX]

[DOI]

Fabrício Benevides

Mitre Costa Dourado

Theor. Comput. Sci., 2016

Proper orientation of cacti.

[BibT_eX]

[DOI]

Frédéric Havet

Theor. Comput. Sci., 2016

Graphs with large girth are b-continuous.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

2015

Complexity of determining the maximum infection time in the geodetic convexity.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Graphs of girth at least 7 have high b-chromatic number.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects.

[BibT_eX]

[DOI]

Fabrício Benevides

Mitre Costa Dourado

Eur. J. Comb., 2015

The b-chromatic index of graphs.

[BibT_eX]

[DOI]

Nicolas Almeida Martins

Marcio Costa Santos

Discret. Math., 2015

Graphs with few P<sub>4</sub>'s under the convexity of paths of order three.

[BibT_eX]

[DOI]

Jayme Luiz Szwarcfiter

Discret. Appl. Math., 2015

2014

Fixed-parameter algorithms for the cocoloring problem.

[BibT_eX]

[DOI]

Sulamita Klein

Discret. Appl. Math., 2014

Connected Greedy Colourings.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013

Backbone colouring: Tree backbones with small diameter in planar graphs.

[BibT_eX]

[DOI]

Frédéric Havet

Theor. Comput. Sci., 2013

b-chromatic index of graphs.

[BibT_eX]

[DOI]

Nicolas Almeida Martins

Marcio Costa Santos

Electron. Notes Discret. Math., 2013

b-colouring the Cartesian product of trees and some other graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

2012

b-Coloring graphs with large girth.

[BibT_eX]

[DOI]

Victor A. E. de Farias

J. Braz. Comput. Soc., 2012

b-colouring outerplanar graphs with large girth.

[BibT_eX]

[DOI]

Discret. Math., 2012

2k<sub>2</sub>-partition of some classes of graphs.

[BibT_eX]

[DOI]

Simone Dantas

Discret. Appl. Math., 2012

Graphs with Few P4's Under the Convexity of Paths of Order Three.

[BibT_eX]

Jayme Luiz Szwarcfiter

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

Two Fixed-Parameter Algorithms for the Cocoloring Problem.

[BibT_eX]

[DOI]

Sulamita Klein

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

A bound on the treewidth of planar even-hole-free graphs.

[BibT_eX]

[DOI]

Aline Alves da Silva

Discret. Appl. Math., 2010

2009

b-chromatic number of cacti.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

2008

Even-hole-free planar graphs have bounded treewidth.

[BibT_eX]

[DOI]

Aline Alves da Silva