Fábio Protti

Silvia B. Tondato

Discret. Math., 2023

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

[BibT_eX]

[DOI]

CoRR, 2023

All-path convexity: Combinatorial and complexity aspects.

[BibT_eX]

[DOI]

João Vinicius C. Thompson

CoRR, 2023

Computing the hull and interval numbers in the weakly toll convexity.

[BibT_eX]

[DOI]

CoRR, 2023

Geodetic convexity and kneser graphs.

[BibT_eX]

[DOI]

Marcos V. N. Bedo

João V. S. Leite

Erika Morais Martins Coelho

Appl. Math. Comput., 2023

A Greedy Heuristic for Majority Target Set Selection in Social Networks.

[BibT_eX]

[DOI]

Braully Rocha da Silva

Hebert Coelho da Coelho

Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2023

2022

On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem.

[BibT_eX]

[DOI]

João Vinicius C. Thompson

Theor. Comput. Sci., 2022

A general framework for path convexities.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Edge clique partition in (k, ℓ)-graphs.

[BibT_eX]

[DOI]

Átila A. Jones

Renata R. Del-Vecchio

Discret. Appl. Math., 2022

P3-convexity on graphs with diameter two: Computing hull and interval numbers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Weakly toll convexity and proper interval graphs.

[BibT_eX]

[DOI]

CoRR, 2022

Characterizations of graph classes via convex geometries: A survey.

[BibT_eX]

[DOI]

Rudini Menezes Sampaio

CoRR, 2022

2021

Declawing a graph: polyhedra and Branch-and-Cut algorithms.

[BibT_eX]

[DOI]

Felipe C. Fragoso

J. Comb. Optim., 2021

The biclique partitioning polytope.

[BibT_eX]

[DOI]

Teobaldo Bulhões

Rian G. S. Pinheiro

Discret. Appl. Math., 2021

2020

On clique-inverse graphs of graphs with bounded clique number.

[BibT_eX]

[DOI]

Liliana Alcón

Sylvain Gravier

Cláudia Linhares Sales

Gabriela Ravenna

J. Graph Theory, 2020

Vector Domination in split-indifference graphs.

[BibT_eX]

[DOI]

Rodrigo Lamblet Mafort

Inf. Process. Lett., 2020

Mobility, Citizens, Innovation and Technology in Digital and Smart Cities.

[BibT_eX]

[DOI]

Diógenes V. M. Ferreira

Igor Machado Coelho

Vitor Nazário Coelho

Future Internet, 2020

2019

Deadlock resolution in wait-for graphs by vertex/arc deletion.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

Genome Rearrangements on Multigenomic Models: Applications of Graph Convexity Problems.

[BibT_eX]

[DOI]

Luís Felipe I. Cunha

J. Comput. Biol., 2019

New algorithms for the minimum coloring cut problem.

[BibT_eX]

[DOI]

Augusto Bordini

Thiago Gouveia da Silva

Int. Trans. Oper. Res., 2019

P3-Hull Number of Graphs with Diameter Two.

[BibT_eX]

[DOI]

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

Width Parameterizations for Knot-Free Vertex Deletion on Digraphs.

[BibT_eX]

[DOI]

Stéphane Bessy

Marin Bougeret

Alan Diêgo A. Carneiro

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2018

Cograph generation with linear delay.

[BibT_eX]

[DOI]

Átila A. Jones

Renata R. Del-Vecchio

Theor. Comput. Sci., 2018

On the complete set packing and set partitioning polytopes: Properties and rank 1 facets.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2018

A matheuristic for the cell formation problem.

[BibT_eX]

[DOI]

Rian Gabriel S. Pinheiro

Ivan C. Martins

Optim. Lett., 2018

On the hardness of finding the geodetic number of a subcubic graph.

[BibT_eX]

[DOI]

Letícia Rodrigues Bueno

Inf. Process. Lett., 2018

Closure of genomic sets: applications of graph convexity to genome rearrangement problems.

[BibT_eX]

[DOI]

Luís Felipe I. Cunha

Electron. Notes Discret. Math., 2018

Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs.

[BibT_eX]

[DOI]

Carlos Vinícius G. C. Lima

Discret. Math. Theor. Comput. Sci., 2018

A computational study of f-reversible processes on graphs.

[BibT_eX]

[DOI]

Leonardo I. L. Oliveira

Valmir C. Barbosa

Discret. Appl. Math., 2018

Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number.

[BibT_eX]

[DOI]

Michael R. Fellows

Frances A. Rosamond

Carlos Vinícius G. C. Lima

Discret. Appl. Math., 2018

And/or-convexity: a graph convexity based on processes and deadlock models.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2018

Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion - A Deadlock Resolution Graph Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Corrigendum to "Complexity analysis of P3-convexity problems on bounded-degree and planar graphs" [Theoret. Comput. Sci. 607 Part 1 (2015) 83-95].

[BibT_eX]

[DOI]

Lucia Draque Penso

Theor. Comput. Sci., 2017

Tractability, hardness, and kernelization lower bound for and/or graph solution.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Decycling a Graph by the Removal of a Matching: Characterizations for Special Classes.

[BibT_eX]

[DOI]

CoRR, 2017

New algorithms for the Minimum Coloring Cut Problem.

[BibT_eX]

[DOI]

Augusto Bordini

CoRR, 2017

New heuristics for the Bicluster Editing Problem.

[BibT_eX]

[DOI]

Teobaldo L. Bulhões Júnior

Ann. Oper. Res., 2017

Deletion Graph Problems Based on Deadlock Resolution.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

Adaptive event sensing in networks of autonomous mobile agents.

[BibT_eX]

[DOI]

Rodrigo R. Esch

Valmir C. Barbosa

J. Netw. Comput. Appl., 2016

Efficient algorithms for cluster editing.

[BibT_eX]

[DOI]

Rian Gabriel S. Pinheiro

J. Comb. Optim., 2016

A parallel hybrid metaheuristic for bicluster editing.

[BibT_eX]

[DOI]

Teobaldo L. Bulhões Júnior

Int. Trans. Oper. Res., 2016

On solving manufacturing cell formation via Bicluster Editing.

[BibT_eX]

[DOI]

Luidi Gelabert Simonetti

Anand Subramanian

Eur. J. Oper. Res., 2016

On the geodetic iteration number of distance-hereditary graphs.

[BibT_eX]

[DOI]

Discret. Math., 2016

Deadlock models in distributed computation: foundations, design, and computational complexity.

[BibT_eX]

[DOI]

Alan Diêgo A. Carneiro

Proceedings of the 31st Annual ACM Symposium on Applied Computing, 2016

2015

Complexity analysis of P3-convexity problems on bounded-degree and planar graphs.

[BibT_eX]

[DOI]

Lucia Draque Penso

Theor. Comput. Sci., 2015

The predecessor-existence problem for k-reversible processes.

[BibT_eX]

[DOI]

Leonardo I. L. Oliveira

Theor. Comput. Sci., 2015

Tractability and hardness of flood-filling games on trees.

[BibT_eX]

[DOI]

Michael R. Fellows

Theor. Comput. Sci., 2015

Robust recoverable perfect matchings.

[BibT_eX]

[DOI]

Aline Ribeiro de Almeida

Networks, 2015

A hybrid iterated local search and variable neighborhood descent heuristic applied to the cell formation problem.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2015

The Flood-It game parameterized by the vertex cover number.

[BibT_eX]

[DOI]

Frances A. Rosamond

Michael R. Fellows

Electron. Notes Discret. Math., 2015

Cycles in complementary prisms.

[BibT_eX]

[DOI]

Dirk Meierling

Aline Ribeiro de Almeida

Discret. Appl. Math., 2015

Parameterized mixed cluster editing via modular decomposition.

[BibT_eX]

[DOI]

CoRR, 2015

Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4.

[BibT_eX]

Letícia Rodrigues Bueno

Lucia Draque Penso

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

An algorithmic analysis of Flood-it and Free-Flood-it on graph powers.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

On Helly Hypergraphs with Variable Intersection Sizes.

[BibT_eX]

Ars Comb., 2014

Algorithmic aspects of Steiner convexity and enumeration of Steiner trees.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2014

On P 3-Convexity of Graphs with Bounded Degree.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013

Corrigendum to "Cycle transversals in perfect graphs and cographs" [Theoret. Comput. Sci. 469(2013) 15-23].

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Cycle transversals in perfect graphs and cographs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Revisiting the complexity of and/or graph solution.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

Clique cycle transversals in distance-hereditary graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Clique cycle transversals in graphs with few P4's.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2013

An energy function and its application to the periodic behavior of k-reversible processes.

[BibT_eX]

[DOI]

Leonardo I. L. Oliveira

CoRR, 2013

Matching Preclusion Number in Cartesian Product of Graphs and its Application to Interconnection Networks.

[BibT_eX]

Aline Ribeiro de Almeida

Lilian Markenzon

Ars Comb., 2013

Parameterized and/or graph solution.

[BibT_eX]

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

On specifying boundary conditions for the graph sandwich problem.

[BibT_eX]

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

Parameterized Complexity of Flood-Filling Games on Trees.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

On (k, ℓ)-Graph Sandwich Problems.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2013

2012

Exact and approximation algorithms for error-detecting even codes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Partitioning extended P4-laden graphs into cliques and stable sets.

[BibT_eX]

[DOI]

Rudini Menezes Sampaio

Inf. Process. Lett., 2012

On the Convexity Number of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2012

Hybrid Metaheuristic for Bicluster Editing Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2012

Mixed unit interval graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

V Latin-American Algorithms, Graphs, and Optimization Symposium - Gramado, Brazil, 2009.

[BibT_eX]

[DOI]

Carlos Eduardo Ferreira

Discret. Appl. Math., 2012

Optimal Variability Selection in Product Line Engineering.

[BibT_eX]

Rafael Pinto Medeiros

Leonardo Gresta Paulino Murta

Proceedings of the 24th International Conference on Software Engineering & Knowledge Engineering (SEKE'2012), 2012

2011

An improved derandomized approximation algorithm for the max-controlled set problem.

[BibT_eX]

[DOI]

Carlos A. J. Martinhon

Cristiane Selem Ferreira Neves

RAIRO Theor. Informatics Appl., 2011

A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2011

New branch-and-bound algorithms for k-cardinality tree problems.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Characterization and recognition of P4-sparse graphs partitionable into k independent sets and l cliques.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Towards a Novel Statistical Method for Generating Test Sets with a Given Coverage Probability.

[BibT_eX]

Eber Assis Schmitz

Antonio Juarez Alencar

Proceedings of the 23rd International Conference on Software Engineering & Knowledge Engineering (SEKE'2011), 2011

2010

On the Hull Number of Triangle-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Some remarks on the geodetic number of a graph.

[BibT_eX]

[DOI]

Discret. Math., 2010

Complexity results related to monophonic convexity.

[BibT_eX]

[DOI]

Jaime Cesar de Carvalho Jr.

Discret. Appl. Math., 2010

SUTIL - Network selection based on utility function and integer linear programming.

[BibT_eX]

[DOI]

Luci Pirmez

Flávia Coimbra Delicato

Luiz Fernando Rust C. Carmo

Paulo F. Pires

Marcos Pirmez

Comput. Networks, 2010

Advances on the List Stubborn Problem.

[BibT_eX]

[DOI]

Simone Dantas

Luérbio Faria

Celina M. H. de Figueiredo

Sulamita Klein

Loana Tito Nogueira

Proceedings of the Theory of Computing 2010, 2010

2009

Applying Modular Decomposition to Parameterized Cluster Editing Problems.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

Structured construction and simulation of nondeterministic stochastic activity networks.

[BibT_eX]

[DOI]

Fernando M. L. Ferreira

Eur. J. Oper. Res., 2009

Preface.

[BibT_eX]

[DOI]

Thomas M. Liebling

Carlos Eduardo Ferreira

Electron. Notes Discret. Math., 2009

Cycle transversals in bounded degree graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

On s-t paths and trails in edge-colored graphs.

[BibT_eX]

[DOI]

Laurent Gourvès

Adria Lyra

Carlos A. J. Martinhon

Jérôme Monnot

Electron. Notes Discret. Math., 2009

Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

On the computation of the hull number of a graph.

[BibT_eX]

[DOI]

Discret. Math., 2009

Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

2008

Improved algorithms for recognizing p.

[BibT_eX]

[DOI]

Min Chih Lin

Ricardo dos Santos Carvalho

Inf. Process. Lett., 2008

Extending the geometric build-up algorithm for the molecular distance geometry problem.

[BibT_eX]

[DOI]

Carlile Lavor

Inf. Process. Lett., 2008

Algorithmic Aspects of Monophonic Convexity.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

On the strong p-Helly property.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Partition into cliques for cubic graphs: Planar case, complexity and approximation.

[BibT_eX]

[DOI]

Márcia R. Cerioli

Luérbio Faria

Talita O. Ferreira

Carlos A. J. Martinhon

Bruce A. Reed

Discret. Appl. Math., 2008

2007

Characterization and recognition of generalized clique-Helly graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2006

Computational Aspects of the Helly Property: a Survey.

[BibT_eX]

[DOI]

J. Braz. Comput. Soc., 2006

Complexity aspects of generalized Helly hypergraphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

On simulating nondeterministic stochastic activity networks

[BibT_eX]

[DOI]

Fernando M. L. Ferreira

CoRR, 2006

An efficient heuristic for selecting active nodes in wireless sensor networks.

[BibT_eX]

[DOI]

Flávia Coimbra Delicato

Luci Pirmez

José Ferreira de Rezende

Comput. Networks, 2006

Applying Modular Decomposition to Parameterized Bicluster Editing.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

2005

List matrix partitions of chordal graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Parity codes.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2005

The Helly property on subfamilies of limited size.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

The Helly property on subhypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Packing r-Cliques in Weighted Chordal Graphs.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2005

Application-Driven Node Management in Multihop Wireless Sensor Networks.

[BibT_eX]

[DOI]

Flávia Coimbra Delicato

Luiz F. Rust da Costa Carmo

José Ferreira de Rezende

Luci Pirmez

Proceedings of the Networking, 2005

2004

Optimal grid representations.

[BibT_eX]

[DOI]

Marcia Helena Costa Fampa

Sulamita Klein

Debora Cristina Alves Rêgo

Networks, 2004

On Clique-inverse graphs of Kp-free graphs.

[BibT_eX]

[DOI]

Sylvain Gravier

Cláudia Linhares Sales

Electron. Notes Discret. Math., 2004

On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

New advances about a conjecture on Helly circle graphs.

[BibT_eX]

[DOI]

Juan Manuel Barrionuevo

Aureliano Calvo

Guillermo Durán

Electron. Notes Discret. Math., 2004

Partitioning chordal graphs into independent sets and cliques.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

A Huffman-Based Error Detecting Code.

[BibT_eX]

[DOI]

Diego Moreira de Araujo Carvalho

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

A Novel Distributed Scheduling Algorithm for Resource Sharing Under Near-Heavy Load.

[BibT_eX]

[DOI]

Massimo De Gregorio

Felipe M. G. França

Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

List Partitions of Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2001

On the helly defect of a graph.

[BibT_eX]

J. Braz. Comput. Soc., 2001

On generalized split graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

2000

Clique-inverse graphs of K3-free and K4-free graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

1998

On the Relations between Acceptable Programs and Stratifiable Classes.

[BibT_eX]

[DOI]

Gerson Zaverucha

Proceedings of the Advances in Artificial Intelligence, 1998

1997

On Computing All Maximal Cliques Distributedly.

[BibT_eX]

[DOI]

Felipe M. G. França