Fábio Protti -
Publications
·
Geodetic convexity and Kneser
graphs.
Applied
Mathematics and Computation
449:15 (2023) 127964 (with M. Bedo, J. V. S. Leite, R. A. Oliveira).
·
Convex geometries over
induced paths with bounded length.
Discrete
Mathematics 346 (2023)
113133 (with M. Gutierrez, S. Tondato).
·
P3-convexity on graphs with diameter two: Computing
hull and interval numbers.
Discrete
Applied Mathematics 321
(2022) 368-378 (with M. R. Cappelle, E. M. M. Coelho, H. Coelho, B. R. Silva,
U. S. Souza).
·
A general framework for path
convexities.
Journal of Combinatorial Optimization 43 (2022) 994-1009 (with J. V. C. Thompson, L. T.
Nogueira, R. S. F. Bravo, M. C. Dourado, U. S. Souza).
Theoretical
Computer Science 909 (2022)
97-109 (with A. D. A. Carneiro, U. S. Souza).
·
Topological
approach for identifying critical measurements and sets in state estimation.
IEEE
Latin America Transactions
20 (2022) 100-107 (with R. C. S. Lima, M. B. Coutto Filho, J. C. S. Souza).
·
Edge clique partition in (k,l)-graphs.
Discrete
Applied Mathematics
306 (2022) 89-97 (with A. A. Jones and R. R. Del-Vecchio).
·
Declawing a graph: Polyhedra
and Branch-and-Cut algorithms.
Journal
of Combinatorial Optimization
42 (2021) 85-124 (with F. C. Fragoso and G. F. de Sousa Filho).
·
The biclique partitioning
polytope.
Discrete
Applied Mathematics
301 (2021) 118-130 (with G. F. Sousa Filho, T. Bulhões, L. A. F. Cabral, L. S.
Ochi, R. G. S. Pinheiro).
·
On clique-inverse graphs of graphs
with bounded clique number.
Journal
of Graph Theory 94:4 (2020)
531-538 (with L. Alcón, S. Gravier, C. Linhares-Sales, G. Ravenna).
·
Mobility, citizens, innovation and
technology in digital and smart cities.
Future Internet
12:2 (2020) no. 22 (with T. A. Oliveira, Y. Gabrich, H. Ramalhinho, M. Oliver,
M. W. Cohen, L. S. Ochi, S. Gueye, A. A. Pinto, D. V. M. Ferreira, I. M.
Coelho, V. N. Coelho).
·
Vector domination in
split-indifference graphs.
Information
Processing Letters
155 (2020) 105899 (with R. L. Mafort).
·
All-path convexity: combinatorial and complexity
aspects.
Ars Combinatoria 148 (2020) 77-87 (with J. C. V. Thompson).
·
An
algorithmic strategy to select vertices as router candidates in a Steiner tree.
Matemática Contemporânea
46 (2019) 265-274 (with J. G. Martinez, R. de Freitas, A. da Silva).
·
Genome rearrangements on
multigenomic models: Applications of graph convexity problems.
Journal
of Computational Biology
26:11 (2019) 1214-1222 (with L. F. I. Cunha).
·
New algorithms for the Minimum
Coloring Cut Problem.
International Transactions in Operational Research 26 (2019) 1868-1883 (with A. Bordini, G. F. Sousa
Filho, T. G. Silva).
·
Deadlock resolution in
wait-for graphs by vertex/arc deletion.
Journal of Combinatorial Optimization 37:2 (2019)
546-562 (with A. D. A. Carneiro, U. S. Souza).
Discrete Mathematics and Theoretical Computer Science 20:2 (2018), 19 pages (with U. S. Souza).
·
On the complete set packing and
set partitioning polytopes: Properties and rank 1 facets.
Operations Research Letters 46 (2018) 389-392 (with Teobaldo Bulhões, Artur
Pessoa, Eduardo Uchoa).
·
Algorithms, kernels and lower
bounds for the flood-it game parameterized by the vertex cover number.
Discrete Applied Mathematics 245 (2018) 94-100 (with M. Fellows, F. Rosamond, M.
Dantas da Silva, U. S. Souza).
·
A computational study of f-reversible processes on graphs.
Discrete Applied Mathematics 245 (2018) 77-93 (with C. V. G. C Lima, L. I. L.
Oliveira, V. C. Barbosa, M. C. Dourado, J. L. Szwarcfiter).
·
And/or-convexity: A graph
convexity based on processes and deadlock models.
Annals of Operations Research 246 (2018) 267-286 (with C. V. G. C. Lima, D.
Rautenbach, U. S. Souza, J. L. Szwarcfiter).
·
A matheuristic for the cell
formation problem.
Optimization Letters 12 (2018) 335-346 (with R. G. S. Pinheiro, I. C.
Martins, L. S. Ochi).
·
On the hardness of finding the
geodetic number of a subcubic graph.
Information Processing Letters 135 (2018) 22-27 (with L. R. Bueno, L. D. Penso, D.
Rautenbach, U. S. Souza).
·
Cograph generation with linear
delay.
Theoretical Computer Science 713 (2018) 1-10 (with A. A. Jones, R. R.
Del-Vecchio).
·
New heuristics for the
bicluster editing problem.
Annals of Operations Research 258 (2017) 781-814 (with G. F. Souza Filho, T. L.
Bulhões Júnior, L. A. F. Cabral, L. S. Ochi).
Theoretical Computer Science 704 (2017) 92-93 (with L. D. Penso, D. Rautenbach, U.
S. Souza).
·
Tractability, hardness, and
kernelization lower bound for and/or graph solution.
Discrete Applied Mathematics 232 (2017) 125-133 (with U. S. Souza).
·
Adaptive event sensing in
networks of autonomous mobile agents.
Journal of Computer and Network Applications 71 (2016) 118-129 (with R. R. Esch, V. C. Barbosa).
·
Clique cycle transversals in
distance-hereditary graphs.
Discrete Applied Mathematics 210 (2016) 38-44 (with A. Brandstädt, S. Esposito, L.
T. Nogueira).
·
On Solving Manufacturing
Cell Formation via Bicluster Editing.
European Journal of Operational Research 254 (2016) 769-779 (with R. G. S. Pinheiro, I. C.
Martins, L. S. Ochi, L. G. Simonetti, A. Subramanian).
·
A parallel hybrid metaheuristic for
bicluster editing.
International Transactions in Operational Research 23 (2016) 409-431 (with G. F. Souza Filho, T. L.
Bulhões Júnior, L. A. F. Cabral, L. S. Ochi).
·
Efficient algorithms for
cluster editing.
Journal of Combinatorial Optimization 31 (2016) 347-371 (with L. Bastos, I. C. Martins, L.
S. Ochi, R. G. S. Pinheiro, A. Subramanian).
·
On the geodetic iteration
number of distance-hereditary graphs.
Discrete
Mathematics 339 (2016) 489-498 (with M. C. Dourado,
R. A. Oliveira, D. Rautenbach).
·
Complexity analysis of
P_3-convexity problems on bounded-degree and planar graphs.
Theoretical Computer Science 607 (2015) 83-95 (with L. D. Penso, D. Rautenbach, U.
S. Souza).
·
Robust recoverable perfect matchings.
Networks
66 (2015) 210-213 (with M. C. Dourado, D. Meierling, L. Penso, D. Rautenbach,
A. Ribeiro de Almeida).
Expert Systems with Applications 42 (2015) 8947-8955 (with I. C. Martins, R. G. S.
Pinheiro, L. S. Ochi).
·
Cycles in complementary
prisms.
Discrete Applied Mathematics 193 (2015) 180-186 (with D. Meierling, D. Rautenbach,
A. R. de Almeida).
·
Tractability and hardness of
flood-filling games on trees.
Theoretical Computer Science 576 (2015) 102-116 (with M. R. Fellows, U. S. Souza,
M. Dantas da Silva).
·
The predecessor existence
problem for k-reversible processes.
Theoretical Computer Science 562 (2015) 406-418 (with L. I. L. Oliveira, V. C.
Barbosa).
·
An algorithmic analysis of Flood-it
and Free-Flood-it on graph powers.
Discrete Mathematics and Theoretical Computer Science. 16:3 (2014) 279-290 (with U. S.
Souza, M. Dantas da Silva).
·
Algorithmic aspects of
Steiner convexity and enumeration of Steiner trees.
Annals of Operations Research 223 (2014) 155-171 (with M. C. Dourado, R. A.
Oliveira).
·
Design of connection
networks with bounded number of non-terminal vertices.
Matemática
Contemporânea 42 (2014) 39-48 (with M. C. Dourado, R.
A. Oliveira, U. S. Souza).
·
(k,l)-sandwich
problems: Why not ask for special kinds of bread?
Matemática
Contemporânea 42 (2014) 17-26 (with F. Couto, L. Faria,
S. Klein, L. T. Nogueira).
·
On Helly hypergraphs with
variable intersection sizes.
Ars Combinatoria 114 (2014) 185-191 (with M. C. Dourado, J. L.
Szwarcfiter).
Ars Combinatoria 112 (2013) 193-204 (with A. R. de Almeida, L.
Markenzon).
·
Clique cycle transversals in graphs
with few P_4's.
Discrete Mathematics and Theoretical Computer Science 15:3 (2013) 13-20 (with R. S. F. Bravo, S. Klein, L.
T. Nogueira).
·
Revisiting the complexity
of And/Or graph solution.
Journal of Computer and System Sciences 79 (2013) 1156-1163 (with M. Dantas da Silva, U. S.
Souza).
·
A statistical method for
generating test sets with a given coverage probability.
International Journal of Information Processing 7:1 (2013) 30-38 (with C. S. F. Neves. E.
A. Schmitz, A. J. S. M. Alencar, J. V. Doria-Junior).
·
Corrigendum: Cycle
transversals in perfect graphs and cographs.
Theoretical Computer Science 487 (2013) 103-105 (with A. Brandstädt, S. F. Brito, S. Klein, L. T.
Nogueira).
·
Cycle transversals in
perfect graphs and cographs.
Theoretical Computer Science 469 (2013) 15-23
(with A. Brandstädt, S. F. Brito, S.
Klein, L. T. Nogueira).
Discrete Mathematics 312:22 (2012) 3357-3363 (with M. C. Dourado, V. B. Le,
D. Rautenbach, J. L. Szwarcfiter).
·
Partitioning extended
P_4-laden graphs into cliques and stable sets.
Information Processing Letters 112 (2012) 829-834 (with R. S. F. Bravo, S. Klein, L.
T. Nogueira, R. M. Sampaio).
·
Complexidade
parametrizada para problemas em grafos E/OU.
Pesquisa
Operacional para o Desenvolvimento 4:2 (2012) 160-174 (with
M. Dantas da Silva, U. S. Souza).
·
On the convexity number of
graphs.
Graphs and Combinatorics 28:3 (2012) 333-345 (with M. C. Dourado, D.
Rautenbach, J. L. Szwarcfiter).
·
Exact and approximation
algorithms for error-detecting even codes.
Theoretical Computer Science 440-441 (2012) 60-72 (with P. E. D. Pinto, J. L.
Szwarcfiter).
RAIRO-Theoretical Informatics and Applications. 45:3
(2011) 331-346 (with M. R. Cerioli, L. Faria, T. O. Ferreira).
·
An improved derandomized
approximation algorithm for the max-controlled set problem.
RAIRO-Theoretical Informatics and Applications 45:2 (2011) 181-196
(with C. A. Martinhon).
·
Cycle transversals in bounded degree
graphs.
Discrete Mathematics and Theoretical Computer Science 13:1 (2011) 45-66 (with M. Groshaus, P. Hell, S.
Klein, L. T. Nogueira).
Discrete Applied Mathematics 159 (2011) 165-173 (with R. S. F. Bravo, S. Klein, L.
T. Nogueira).
·
SUTIL - Network
selection based on utility function and integer linear programming.
Computer
Networks 54 (2010) 2117–2136 (with L. Pirmez, J. C. Carvalho
Jr., L. F. R. C. Carmo, F. C. Delicato, P. F. Pires, M. Pirmez).
·
Complexity results
related to monophonic convexity.
Discrete Applied Mathematics 158 (2010) 1268-1274 (with M. C. Dourado, J. L.
Szwarcfiter).
·
Some remarks on the
geodetic number of a graph.
Discrete Mathematics 310 (2010) 832-837 (with M. C. Dourado, D.
Rautenbach, J. L. Szwarcfiter).
·
On the hull number of
triangle-free graphs.
SIAM Jounal on Discrete Mathematics 23 (2009) 2163-2172 (with M. C. Dourado, D.
Rautenbach, J. L. Szwarcfiter).
·
On the computation of
the hull number of a graph.
Discrete Mathematics 309 (2009) 5668-5674 (with M. C. Dourado, J. G.
Gimbel, J. Kratochvil, J. L. Szwarcfiter).
·
Complexity aspects of the
Helly property: graphs and hypergraphs.
The Electronic Journal of Combinatorics DS 17 (2009) 1-53 (with M. C. Dourado, J. L.
Szwarcfiter).
·
Structured construction
and simulation of nondeterministic stochastic activity networks.
European Journal of Operational Research 198 (2009) 266-274 (with V. C. Barbosa, F. M. L.
Ferreira, D. V. Kling, E. Lopes, E. A. Schmitz).
·
Applying modular
decomposition to parameterized cluster editing problems.
Theory of Computing Systems 44 (2009) 91-104 (with M. Dantas da Silva, J. L.
Szwarcfiter).
·
Improved algorithms for
recognizing p-Helly and hereditary p-Helly hypergraphs.
Information Processing Letters 108 (2008) 247-250 (with M. C. Dourado, M. Lin, J. L.
Szwarcfiter).
·
Extending the geometric
build-up algorithm for the molecular distance geometry problem.
Information Processing Letters 108 (2008) 234-237 (with R. S. Carvalho, C. C.
Lavor).
·
Partition into cliques
for cubic graphs: planar case, complexity and an approximation algorithm.
Discrete Applied Mathematics 156 (2008) 2270-2278 (with M. R. Cerioli, L. Faria,
T. O. Ferreira, C. A. J. Martinhon, B. Reed).
·
On the strong p-Helly
property.
Discrete Applied Mathematics 156 (2008) 1053-1057 (with M. C. Dourado, J. L.
Szwarcfiter).
·
Characterization and
recognition of generalized clique-Helly graphs.
Discrete Applied Mathematics 155 (2007) 2435-2443 (with M. C. Dourado, J. L.
Szwarcfiter).
·
An efficient heuristic
for selecting active nodes in wireless sensor networks.
Computer Networks 50, 18 (2006) 3701-3720 (with F. C. Delicato,
L. Pirmez, J. L. Rezende).
·
Computational aspects of the Helly
property: a survey.
Journal of the Brazilian Computer Society 12,1 (2006) 7-33 (with M. C. Dourado, J. L.
Szwarcfiter).
·
Complexity aspects of
generalized Helly hypergraphs.
Information Processing Letters 99 (2006) 13-18 (with M. C. Dourado, J. L.
Szwarcfiter).
·
List matrix partitions
of chordal graphs.
Theoretical Computer Science 349 (2005) 52-66 (with T. Feder, P. Hell, S. Klein,
L. T. Nogueira).
·
Packing r-cliques in
weighted chordal graphs.
Annals of Operations Research 138 (2005) 179-187 (with P. Hell, S. Klein, L. T.
Nogueira).
·
Parity codes.
RAIRO-Theoretical Informatics and Applications 39 (2005) 263-278 (with P. E. D. Pinto, J. L.
Szwarcfiter).
·
The Helly property on
subfamilies of limited size.
Information Processing Letters 93,2 (2005) 53-56 (with M. C. Dourado, J. L.
Szwarcfiter).
·
Optimal grid representations.
Networks 44 (2004) 187-193 (with M. H. C. Fampa, S. Klein, D. C. A. Rêgo).
·
Partitioning
chordal graphs into independent sets and cliques.
Discrete Applied Mathematics 141 (2004) 185-194 (with P. Hell, S. Klein, L. T.
Nogueira).
·
The (p,q)-Helly property and
its application to the family of cliques of a graph.
Matemática
Contemporânea 25 (2003) 81-90 (with M. C. Dourado,
J. L. Szwarcfiter).
·
On a conjecture
concerning Helly circle graphs.
Pesquisa
Operacional 23 (2003) 221-229 (with G. Durán,
A. Gravano, M. Groshaus, J. L. Szwarcfiter).
·
On the Helly
defect of a graph.
Journal of the Brazilian Computer Society 7 (2002) 48-52 (with M. C. Dourado, J. L.
Szwarcfiter).
·
Particionamento
de grafos cordais em conjuntos independentes e cliques.
Tendências
em Matemática Aplicada e Computacional 3 (2002) 147-155
(with P. Hell, S. Klein, L. T. Nogueira).
·
Clique-inverse graphs of
bipartite graphs.
Journal of Combinatorial Mathematics and Combinatorial
Computing 40 (2002)
193-203 (with J. L. Szwarcfiter).
·
On clique graphs with linear
size.
Congressus Numerantium 143 (2000) 207-219 (with J. L. Szwarcfiter).
·
Clique-inverse
graphs of K_3-free and K_4-free graphs.
Journal of Graph Theory 35 (2000) 257-272 (with J. L. Szwarcfiter).
Some conference
papers
·
Width Parameterizations
for Knot-free Vertex Deletion on Digraphs.
14th
International Symposium on Parameterized and Exact Computation - IPEC 2019.
Munich,
Germany, September 2019.
Leibniz International Proceedings in Informatics - LIPIcs, Vol. 148 (2019), pp. 2:1 -- 2:16,
Schloss Dagstuhl, Leibniz-Zentrum
fuer Informatik.
(with
S. Bessy, M. Bougeret, A. D. A. Carneiro, U. S. Souza)
·
P_3-Hull Number of Graphs
with Diameter Two.
LAGOS
2019 - X Latin American Graphs, Algorithms, and Optimization Symposium.
Belo
Horizonte, Brazil, July 2019.
Electronic Notes in Theoretical Computer Science 346
(2019) 309-320.
(with M. R. Cappelle, E. M. M.
Coelho, H. Coelho, B. R. Silva, U. S. Souza)
·
A General Framework for Path
Convexities.
AAIM
2019 -- Thirteenth International Conference on Algorithmic Aspects in
Information and Management.
Beijing,
China, August 2019.
Lecture Notes in Computer Science 11640 (2019) 272-283.
(with J. V. C. Thompson, L. T.
Nogueira, R. S. F. Bravo, M. C. Dourado, U. S. Souza)
COCOON 2018 -
24rd International Computing and Combinatorics Conference.
Qingdao,
China, July 2018.
Lecture
Notes in Computer Science
10976 (2018) 84-95.
(with A. D. A. Carneiro, U. S. Souza)
·
Closure of Genomic Sets:
Applications of Graph Convexity to Genome Rearrangement Problems.
Joint EURO/ALIO International Conference 2018 on
Applied Combinatorial Optimization.
Bologna,
Italy, June 2018.
Electronic
Notes in Discrete Mathematics 69 (2018) 285-292.
(with
L. F. I. Cunha)
·
Deletion
Graph Problems Based on Deadlock Resolution.
COCOON 2017 -
23rd International Computing and Combinatorics Conference.
Hong
Kong, China, August 2017.
Lecture
Notes in Computer Science 10392
(2017) 75-86.
(with A. D. A. Carneiro, U. S. Souza)
·
Deadlock Models in Distributed Computation: Foundations,
Design and Computational Complexity.
31st ACM/SIGAPP Symposium on Applied Computing.
Pisa, Italy, April 2016, pp 538-541.
(with V. C. Barbosa, A. D. A.
Carneiro, U. S. Souza)
·
Complexity
of Geodetic Number Problem in Graphs with Maximum Degree 4.
CTW 2015 - 13th Cologne-Twente Workshop on Graphs
& Combinatorial Optimization.
Istanbul,
Turkey, May 2015, pp. 197-200.
(with Letícia R. Bueno, Lúcia D.
Penso, Dieter Rautenbach, Uéverton dos S. Souza)
·
The Flood-It Game
Parameterized by the Vertex Cover Number.
LAGOS'15 - VIII Latin-American Graphs, Algorithms and
Optimization Symposium.
Fortaleza,
Brazil, May 2015.
Electronic
Notes in Discrete Mathematics 50 (2015) 35-40.
(with
M. Dantas da Silva, M. R. Fellows, F. Rosamond, U. S. Souza)
·
Meta-heurística GRASP para o Problema
de Particionamento de Grafos por Edição de Arestas.
XVII CLAIO/III CSMIO 2014 - Latin-Iberian-American
Conf. on Oper. Research and Conf. of the Mexican Society of Oper. Research.
Monterrey,
Mexico, October 2014.
(with G. F. Souza Filho, T. L.
Bulhões Júnior, L. A. F. Cabral, L. S. Ochi)
·
On P_3-Convexity of Graphs with Bounded Degree.
AAIM'2014 – 10th Int. Conf. on Algorithmic Aspects of
Information and Management.
Simon
Fraser University, Vancouver, Canada, July 2014.
Lecture
Notes in Computer Science 8546 (2014) 263-274.
(with
L. D. Penso, D. Rautenbach, U. S. Souza)
·
On (k,l)-Graph Sandwich Problems.
FAW-AAIM'2013 – 7th Int. Frontiers of Algorithmics
Wkshp and 9th Int. Conf. on Algorithmic Aspects of Information and Management.
Dalian,
China, June 2013.
Lecture
Notes in Computer Science
7924 (2013) 187-197.
(with
F. Couto, L. Faria, S. Klein, L. T. Nogueira)
·
Parameterized Complexity
of Flood-Filling Games on Trees.
COCOON 2013 - 19th International Computing &
Combinatorics Conference.
Hangzhou,
China, June 2013.
Lecture
Notes in Computer Science
7936 (2013) 531-542.
(with U. S. Souza, M. Dantas da
Silva).
·
Parameterized
And/Or Graph Solution.
CTW 2013 - 12th Cologne-Twente Workshop on Graphs
& Combinatorial Optimization.
University
of Twente, Enschede, The Netherlands, May 2013, pp. 205-208.
(with U. S. Souza and M. Dantas da
Silva)
·
On
Specifying Boundary Conditions for the Graph Sandwich Problem.
CTW 2013 - 12th Cologne-Twente Workshop on Graphs
& Combinatorial Optimization.
University
of Twente, Enschede, The Netherlands, May 2013, pp. 63-66.
(with
F. Couto, L. Faria, S. Klein, L. T. Nogueira)
·
Clique Cycle Transversals
in Distance-Hereditary Graphs (Extended Abstract).
LAGOS'13 - VII Latin-American Graphs, Algorithms and Optimization
Symposium.
Playa
del Carmen, Mexico, April 2013.
Electronic
Notes in Discrete Mathematics 44 (2013) 15-21.
(with A. Brandstädt, S. Esposito, L.
T. Nogueira)
·
Hybrid Metaheuristic for
Bicluster Editing Problem.
EURO Mini Conference XXVIII on Variable Neighbourhood
Search.
Herceg
Novi, Montenegro, October 2012.
Electronic
Notes in Discrete Mathematics 39 (2012) 35-42.
(with G. F. Souza Filho, L. A. F.
Cabral, L. S. Ochi).
·
Towards a Novel
Statistical Method for Generating Test Sets with a Given Coverage Probability.
6th International Conference on Information
Processing, ICIP 2012.
Bangalore,
India, August 10-12, 2012.
Communications
in Computer and Information Science (Print) 292 (2012) 419-425.
(with
A. J. Alencar, J. V. Doria Jr., C. Selem, E. A. Schmitz)
·
Optimal
Variability Selection in Product Line Engineering.
SEKE 2012 - The 24th International Conference on Software
Engineering and Knowledge Engineering.
Redwood
City, USA, July 2012.
(with
R. P. Medeiros, L. G. P. Murta, U. S. Souza)
·
New Branch-and-Bound
Algorithms for k-Cardinality Tree Problems.
LAGOS’11 - VI Latin-American Graphs, Algorithms and
Optimization Symposium.
Bariloche,
Argentina, March-April 2011.
Electronic
Notes in Discrete Mathematics 37 (2011) 27-32.
(with
Y. Frota, L. Simonetti, C. C. de Souza)
·
On
the Complexity of the Edge Guarding Problem.
26th European Workshop on Computational Geometry -
EuroCG 2010.
Dortmund,
Germany, March 2010.
(with
V. H. F. Batista, F. L. B. Ribeiro)
·
Advances
on the List Stubborn Problem.
16th CATS - Computing: the Australasian Theory
Symposium.
Brisbane, Australia, January 2010.
(with S. Dantas, L. Faria, C. M. H.
de Figueiredo, S. Klein, L. T. Nogueira, F. Protti).
·
On s-t Paths and Trails in
Edge-Colored Graphs.
LAGOS'09 - V Latin-American Graphs, Algorithms and
Optimization Symposium.
Gramado,
Brazil, November 2009.
Electronic
Notes in Discrete Mathematics 35 (2009) 221-226.
(with
L. Gourvès, A. Lyra, C. A. Martinhon, J. Monnot)
·
Generating All the Steiner
Trees and Computing Steiner Intervals for a Fixed Number of Terminals.
LAGOS'09 - V Latin-American Graphs, Algorithms and
Optimization Symposium.
Gramado,
Brazil, November 2009.
Electronic
Notes in Discrete Mathematics 35 (2009) 323-328.
(with M. C. Dourado, R. A. Oliveira)
·
Cycle Transversals in
Bounded Degree Graphs.
LAGOS'09 - V Latin-American Graphs, Algorithms and
Optimization Symposium.
Gramado,
Brazil, November 2009.
Electronic
Notes in Discrete Mathematics 35 (2009) 189-195.
(with
M. Groshaus, P. Hell, S. Klein, L. T. Nogueira)
·
Exact and Experimental
Algorithms for a Huffman-Based Error Detecting Code.
TAMC'09 – 6th Annual Conference on Theory and
Applications of Models of Computation.
Chang
Sha, China, May 2009.
Lecture
Notes in Computer Science
5532 (2009) 311-324.
(with
P. E. D. Pinto, J. L. Szwarcfiter)
·
Partitions
of Cographs into Independent Sets and Cliques.
III
Taller Latinoamericano de Clanes en Gráficas.
Guanajuato, Mexico, October 2008.
(with R. S. F. Bravo, S. Klein, L. T.
Nogueira)
·
Clique
Decomposition and the Monophonic Hull Number of a Graph.
III
Taller Latinoamericano de Clanes en Gráficas.
Guanajuato, Mexico, October 2008.
(with
M. C. Dourado, J. L. Szwarcfiter)
·
On
Detecting Deadlock in the Pi-Calculus.
Logic and Theory of Algorithms - Fourth Conference on
Computability in Europe 2008 - CiE 2008.
University
of Athens, Greece, June 2008, pp. 35-44.
(with
T. Azevedo, M. Benevides, M. Sihman)
·
A
Method for Stochastic Modeling of Software Development Process in Constrained
Resource Environments.
The IEEE Systems and Information Engineering Design
Symposium - SIEDS'08.
Charlottesville,
Virginia, April 2008, v. I, pp. 40-45.
(with F. M. L. Ferreira, E. A.
Schmitz, A. J. Alencar)
·
Algorithmic Aspects of
Monophonic Convexity.
LAGOS'07 - IV Latin-American Graphs, Algorithms and
Optimization Symposium.
Puerto
Varas, Chile, November 2007.
Electronic
Notes in Discrete Mathematics 30 (2008) 177-182.
(with
M. C. Dourado, J. L. Szwarcfiter)
·
On
the Computation of some Parameters Related to Convexity of Graphs.
ICDM 2006 - International Conference on Discrete
Mathematics.
Bangalore,
India, December 2006.
RMS
Lecture Notes Series in Mathematics 7 (2006) 101-108.
(with
M. C. Dourado, J. L. Szwarcfiter)
·
Applying Modular Decomposition to
Parameterized Bicluster Editing.
IWPEC 2006 - The Second International Workshop on
Parameterized and Exact Computation.
Zürich,
Switzerland, September 2006.
Lecture
Notes in Computer Science
4169 (2006) 1-12.
(with M. D. da Silva, J. L.
Szwarcfiter)
·
A
Framework for Preparing Experimental Evaluation of Rerouting Mechanisms.
10th IEEE Computer Society International WORDS 2005 - Workshop on
Object-Oriented Real-Time Dependable Systems.
Sedona, Arizona, 2005, 10 pages.
(with L. Pirmez, P. F. Pires, F. C.
Delicato, L. F. R. C. Carmo, et al.)
·
The Helly Property on Subhypergraphs.
GRACO'2005 - Brazilian Symposium on Graphs, Algorithms
and Combinatorics.
Angra dos Reis, Brazil, April 2005.
Electronic
Notes in Discrete Mathematics 19 (2005) 71-77.
(with
M. C. Dourado, J. L. Szwarcfiter)
·
Aplication-Driven Node
Management in Multihop Wireless Sensor Networks.
ICN 2005 - 4th International Conference on Networking. Reunion
Island, April 2005.
Lecture
Notes in Computer Science
3420 (2005) 569-576.
(with F. C. Delicato, L. Pirmez, J.
F. Rezende, L. Rust)
·
A Novel Distributed Scheduling
Algorithm for Resource Sharing under Near-heavy Load.
OPODIS 2004 - 8th Conference on Principles of
Distributed Systems.
Grenoble,
France, December 2004.
Lecture
Notes in Computer Science
3544 (2004) 431-442.
(with D. Carvalho, F. M. G. França,
M. De Gregorio)
LACGA'2004 - Latin-American Conference on
Combinatorics, Graphs and Applications.
Santiago,
Chile, August 2004.
Electronic
Notes in Discrete Mathematics 18 (2004) 73-79.
(with M. R. Cerioli, L. Faria, T. O.
Ferreira)
·
New Advances about a
Conjecture on Helly Circle Graphs.
LACGA'2004 - Latin-American Conference on
Combinatorics, Graphs and Applications.
Santiago,
Chile, August 2004.
Electronic
Notes in Discrete Mathematics 18 (2004) 31-36.
(with J. M. Barrionuevo, A. Calvo, G.
Durán)
·
Characterization and
Recognition of Generalized Clique-Helly Graphs.
WG'2004 - 30th International Workshop on
Graph-Theoretic Concepts in Computer Science.
Hölterhoff
House, Bad Honeff, Germany, June 2004.
Lecture
Notes in Computer Science
3353 (2004) 344-354.
(with
M. C. Dourado, J. L. Szwarcfiter)
·
A Huffman-based Error
Detecting Code.
WEA 2004 - III International Workshop on Efficient and
Experimental Algorithms.
Angra dos Reis, Brazil, May
2004.
Lecture
Notes in Computer Science
3059 (2004) 446-457.
(with
P. E. D. Pinto, J. L. Szwarcfiter)
·
An Improved Derandomized
Approximation Algorithm for the Max-Controlled Set Problem.
WEA 2004 - III International Workshop on Efficient and
Experimental Algorithms.
Angra dos Reis, Brazil, May
2004.
Lecture
Notes in Computer Science
3059 (2004) 341-355.
(with
C. A. Martinhon)
·
List Partitions of
Chordal Graphs.
LATIN 2004 - Latin American Theoretical Informatics.
Buenos
Aires, Argentina, April 2004.
Lecture
Notes in Computer Science
2976 (2004) 100-108.
(with
T. Feder, P. Hell, S. Klein, L. T. Nogueira)
·
Improved
Lower Bounds for Scheduling Ordered Tasks on a Bounded Number of Processors.
XI CLAIO - Latin-Iberian American Congress of
Operations Research.
Concepción,
Chile, October 2002, A37-16.
(with
M. Campêlo, R. Corrêa, N. Maculan)
·
Independent
K_r's in Chordal Graphs.
XI CLAIO - Latin-Iberian American Congress of
Operations Research.
Concepción,
Chile, October 2002, A23-03.
(with
P. Hell, S. Klein, L. T. Nogueira)
·
On Generalized Split
Graphs.
GRACO'2001 - Brazilian Symposium on Graphs, Algorithms
and Combinatorics.
Fortaleza,
Brazil, March 2001.
Electronic
Notes in Discrete Mathematics 7 (2001) 98-101.
(with
P. Hell, S. Klein, L. T. Nogueira)
·
ILP Formulations for
Scheduling Ordered Tasks on a Bounded Number of Processors.
GRACO'2001 - Brazilian Symposium on Graphs, Algorithms and
Combinatorics.
Fortaleza,
Brazil, March 2001.
Electronic
Notes in Discrete Mathematics 7 (2001) 166-169.
(with
M. Campêlo, R. Corrêa, N. Maculan)
·
On the Relations between
Acceptable Programs and Stratifiable Classes.
SBIA'98 - 14th Brazilian Symposium on Artificial
Intelligence.
Porto
Alegre, Brazil, November 1998.
Lecture
Notes in Artificial Intelligence 1515 (1998) 141-150.
(with
G. Zaverucha)
·
Recognizing Classes of Logic
Programs.
WOLLIC'97 - 4th Workshop on Logic, Language,
Information and Computation.
Fortaleza,
Brazil, August 1997.
Logic
Journal of the IGPL
5 (1997) 913-915.
(with
G. Zaverucha)
·
On Computing All Maximal
Cliques Distributedly.
IRREGULAR'97 - 4th International Symposium on Solving
Irregularly Structured Problems in Parallel.
Paderborn,
Germany, June 1997.
Lecture
Notes in Computer Science
1253 (1997) 37-48.
(with
F. M. G. França, J. L. Szwarcfiter)