Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Protti, F{\'a}bio"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tractability and hardness of flood-filling games on trees
Michael R. Fellows
,
Uéverton dos Santos Souza
,
Fábio Protti
,
Maise Dantas da Silva
Theoretical Computer Science
576
, 2015, pp. 102-116
The predecessor-existence problem for
k
-reversible processes
Leonardo I.L. Oliveira
,
Valmir C. Barbosa
,
Fábio Protti
Theoretical Computer Science
562
, 2014, pp. 406-418
Cycle transversals in perfect graphs and cographs
Andreas Brandstädt
,
Synara Brito
,
Sulamita Klein
,
Loana Tito Nogueira
,
Fábio Protti
Theoretical Computer Science
469
, 2013, pp. 15-23
Corrigendum to ``Cycle transversals in perfect graphs and cographs''
Andreas Brandstädt
,
Synara Brito
,
Sulamita Klein
,
Loana Tito Nogueira
,
Fábio Protti
Theoretical Computer Science
487
, 2013, pp. 103-105
Parameterized complexity of flood-filling games on trees
Uéverton dos Santos Souza
,
Fábio Protti
,
Maise Dantas da Silva
Lecture Notes in Computer Science
7936
, 2013, pp. 531-542
Revisiting the complexity of and/or graph solution
Uéverton dos Santos Souza
,
Fábio Protti
,
Maise Dantas da Silva
Journal of Computer and System Sciences
79
(7), 2013, pp. 1156-1163
Partitioning extended
P_4
-laden graphs into cliques and stable sets
Raquel S.F. Bravo
,
Sulamita Klein
,
Loana T. Nogueira
,
Fábio Protti
,
Rudini M. Sampaio
Information Processing Letters
112
(21), 2012, pp. 829-834
On the convexity number of graphs
Mitre C. Dourado
,
Fábio Protti
,
Dieter Rautenbach
,
Jayme L. Szwarcfiter
Graphs and Combinatorics
28
(3), 2012, pp. 333-345
Exact and approximation algorithms for error-detecting even codes
Paulo E.D. Pinto
,
Fábio Protti
,
Jayme L. Szwarcfiter
Theoretical Computer Science
440-441
, 2012, pp. 60-72
On the hull number of triangle-free graphs
Mitre C. Dourado
,
Fábio Protti
,
Dieter Rautenbach
,
Jayme L. Szwarcfiter
SIAM Journal on Discrete Mathematics
23
(4), 2009-2010, pp. 2163-2172
Applying modular decomposition to parameterized cluster editing problems
Fábio Protti
,
Maise Dantas da Silva
,
Jayme Luiz Szwarcfiter
Theory of Computing Systems
44
(1), 2009, pp. 91-104
Improved algorithms for recognizing
p
-Helly and hereditary
p
-Helly hypergraphs
Mitre C. Dourado
,
Min Chih Lin
,
Fábio Protti
,
Jayme L. Szwarcfiter
Information Processing Letters
108
(4), 2008, pp. 247-250
Extending the geometric build-up algorithm for the molecular distance geometry problem
Ricardo dos Santos Carvalho
,
Carlile Lavor
,
Fábio Protti
Information Processing Letters
108
(4), 2008, pp. 234-237
Complexity aspects of generalized Helly hypergraphs
Mitre C. Dourado
,
Fábio Protti
,
Jayme L. Szwarcfiter
Information Processing Letters
99
(1), 2006, pp. 13-18
List matrix partitions of chordal graphs
Tomás Feder
,
Pavol Hell
,
Sulamita Klein
,
Loana Tito Nogueira
,
Fábio Protti
Theoretical Computer Science
349
(1), 2005, pp. 52-66
Characterization and recognition of generalized clique-Helly graphs
Mitre Costa Dourado
,
Fábio Protti
,
Jayme Luiz Szwarcfiter
Lecture Notes in Computer Science
3353
, 2004, pp. 344-354