2023
On the generalized Helly property of hypergraphs, cliques, and bicliques.
Discret. Appl. Math., May, 2023
Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci 24: 1 (2022) #3].
CoRR, 2023
The general position number and the iteration time in the P3 convexity.
CoRR, 2023
Computing the hull and interval numbers in the weakly toll convexity.
CoRR, 2023
2022
The hull number in the convexity of induced paths of order 3.
Theor. Comput. Sci., 2022
A general framework for path convexities.
J. Comb. Optim., 2022
On the monophonic rank of a graph.
Discret. Math. Theor. Comput. Sci., 2022
Computing the zig-zag number of directed graphs.
Discret. Appl. Math., 2022
Computational and structural aspects of the geodetic and the hull numbers of shadow graphs.
Discret. Appl. Math., 2022
On the Δ-interval and the Δ-convexity numbers of graphs and graph products.
Discret. Appl. Math., 2022
Expanded-clique graphs and the domination problem.
CoRR, 2022
On restricted completions of chordal and trivially perfect graphs.
CoRR, 2022
Weakly toll convexity and proper interval graphs.
CoRR, 2022
Characterizations of graph classes via convex geometries: A survey.
CoRR, 2022
Computing the hull number in toll convexity.
Ann. Oper. Res., 2022
2020
On the Carathéodory and exchange numbers of geodetic convexity in graphs.
Theor. Comput. Sci., 2020
Computing the hull number in Δ-convexity.
Theor. Comput. Sci., 2020
Partial immunization of trees.
Discret. Optim., 2020
Complexity aspects of ℓ-chord convexities.
Discret. Appl. Math., 2020
Global defensive alliances in the lexicographic product of paths and cycles.
Discret. Appl. Math., 2020
A note on homomorphisms of Kneser hypergraphs.
Appl. Math. Comput., 2020
On the Geodetic and Hull Numbers of Shadow Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020
2019
On the Computational Complexity of the Helly Number in the <i>P</i><sub>3</sub> and Related Convexities.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
2018
A computational study of f-reversible processes on graphs.
Discret. Appl. Math., 2018
2017
The Geodetic Hull Number is Hard for Chordal Graphs.
Electron. Notes Discret. Math., 2017
Inapproximability results and bounds for the Helly and Radon numbers of a graph.
Discret. Appl. Math., 2017
Geodetic convexity parameters for (q, q-4)-graphs.
Discret. Appl. Math., 2017
2016
On the geodetic hull number of P<sub>k</sub>-free graphs.
Theor. Comput. Sci., 2016
Computing role assignments of split graphs.
Theor. Comput. Sci., 2016
The maximum infection time in the geodesic and monophonic convexities.
Theor. Comput. Sci., 2016
On the geodetic iteration number of distance-hereditary graphs.
Discret. Math., 2016
Near-linear-time algorithm for the geodetic Radon number of grids.
Discret. Appl. Math., 2016
Complexity aspects of the triangle path convexity.
Discret. Appl. Math., 2016
Slash and burn on graphs - Firefighting with general weights.
Discret. Appl. Math., 2016
Geodetic Convexity Parameters for Graphs with Few Short Induced Paths.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016
2015
Inapproximability results for graph convexity parameters.
Theor. Comput. Sci., 2015
Robust recoverable perfect matchings.
Networks, 2015
On f-Reversible Processes on Graphs.
Electron. Notes Discret. Math., 2015
On the hereditary (p, q)-Helly property of hypergraphs, cliques, and bicliques.
Electron. Notes Discret. Math., 2015
Complexity of determining the maximum infection time in the geodetic convexity.
Electron. Notes Discret. Math., 2015
The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects.
Eur. J. Comb., 2015
Inapproximability results related to monophonic convexity.
Discret. Appl. Math., 2015
Algorithms and Properties for Positive Symmetrizable Matrices.
CoRR, 2015
2014
Scheduling problem with multi-purpose parallel machines.
Discret. Appl. Math., 2014
On defensive alliances and strong global offensive alliances.
Discret. Appl. Math., 2014
The Carathéodory number of the P<sub>3</sub> convexity of chordal graphs.
Discret. Appl. Math., 2014
On Helly Hypergraphs with Variable Intersection Sizes.
Ars Comb., 2014
Algorithmic aspects of Steiner convexity and enumeration of Steiner trees.
Ann. Oper. Res., 2014
Connected Greedy Colourings.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014
2013
On the Carathéodory number of interval and graph convexities.
Theor. Comput. Sci., 2013
Polynomial time algorithm for the Radon number of grids in the geodetic convexity.
Electron. Notes Discret. Math., 2013
On the geodetic Radon number of grids.
Discret. Math., 2013
More fires and more fighters.
Discret. Appl. Math., 2013
Forbidden subgraphs and the König-Egerváry property.
Discret. Appl. Math., 2013
On the contour of graphs.
Discret. Appl. Math., 2013
Algorithmic and structural aspects of the P 3-Radon number.
Ann. Oper. Res., 2013
Geodetic sets and periphery.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013
2012
Reversible iterative graph processes.
Theor. Comput. Sci., 2012
Characterization and recognition of Radon-independent sets in split graphs.
Inf. Process. Lett., 2012
On the Convexity Number of Graphs.
Graphs Comb., 2012
The colorful Helly theorem and general hypergraphs.
Eur. J. Comb., 2012
An upper bound on the P<sub>3</sub>-Radon number.
Discret. Math., 2012
Mixed unit interval graphs.
Discret. Math., 2012
On the Radon Number for P 3-Convexity.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012
2011
Irreversible conversion of graphs.
Theor. Comput. Sci., 2011
Forbidden subgraphs and the Kőnig property.
Electron. Notes Discret. Math., 2011
On the Carathéodory Number for the Convexity of Paths of Order Three.
Electron. Notes Discret. Math., 2011
On finite convexity spaces induced by sets of paths in graphs.
Discret. Math., 2011
Partitioning a graph into convex sets.
Discret. Math., 2011
The South Zone: Distributed Algorithms for Alliances.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011
2010
On the Hull Number of Triangle-Free Graphs.
SIAM J. Discret. Math., 2010
Scheduling on parallel machines considering job-machine dependency constraints.
Electron. Notes Discret. Math., 2010
Convex Partitions of Graphs induced by Paths of Order Three.
Discret. Math. Theor. Comput. Sci., 2010
Some remarks on the geodetic number of a graph.
Discret. Math., 2010
Complexity results related to monophonic convexity.
Discret. Appl. Math., 2010
Brief Announcement: On Reversible and Irreversible Conversions.
Proceedings of the Distributed Computing, 24th International Symposium, 2010
2009
Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals.
Electron. Notes Discret. Math., 2009
On the Convexity of Paths of Length Two in Undirected Graphs.
Electron. Notes Discret. Math., 2009
The Colorful Helly Property for Hypergraphs.
Electron. Notes Discret. Math., 2009
On the computation of the hull number of a graph.
Discret. Math., 2009
Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs.
Ann. Oper. Res., 2009
2008
Helly Property, Clique Graphs, Complementary Graph Classes, and Sandwich Problems.
J. Braz. Comput. Soc., 2008
Improved algorithms for recognizing p.
Inf. Process. Lett., 2008
Algorithmic Aspects of Monophonic Convexity.
Electron. Notes Discret. Math., 2008
On the strong p-Helly property.
Discret. Appl. Math., 2008
2007
Convex Partitions of Graphs.
Electron. Notes Discret. Math., 2007
Characterization and recognition of generalized clique-Helly graphs.
Discret. Appl. Math., 2007
2006
Computational Aspects of the Helly Property: a Survey.
J. Braz. Comput. Soc., 2006
Complexity aspects of generalized Helly hypergraphs.
Inf. Process. Lett., 2006
2005
The Helly property on subfamilies of limited size.
Inf. Process. Lett., 2005
Helly Property and Sandwich Graphs.
Electron. Notes Discret. Math., 2005
The Helly property on subhypergraphs.
Electron. Notes Discret. Math., 2005
2001
On the helly defect of a graph.
J. Braz. Comput. Soc., 2001
