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
Hilfe
Suche: Author="de Figueiredo, Celina M.H."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient sub-5 approximations for minimum dominating sets in unit disk graphs
Guilherme D. da Fonseca
,
Celina M.H. de Figueiredo
,
Vinícius G. Pereira de Sá
,
Raphael C.S. Machado
Theoretical Computer Science
540-541
, 2014, pp. 70-81
Split clique graph complexity
Liliana Alcón
,
Luerbio Faria
,
Celina M.H. de Figueiredo
,
Marisa Gutierrez
Theoretical Computer Science
506
, 2013, pp. 29-42
Advancing the transposition distance and diameter through lonely permutations
Luís Felipe I. Cunha
,
Luis Antonio B. Kowada
,
Rodrigo De A. Hausen
,
Celina M.H. de Figueiredo
SIAM Journal on Discrete Mathematics
27
(4), 2013, pp. 1682-1709
The same upper bound for both: The 2-page and the rectilinear crossing numbers of the
n
-cube
Luerbio Faria
,
Celina M.H. de Figueiredo
,
R. Bruce Richter
,
Imrich Vrt'o
Lecture Notes in Computer Science
8165
, 2013, pp. 249-260
Split clique graph complexity
Liliana Alcón
,
Luerbio Faria
,
Celina M.H. de Figueiredo
,
Marisa Gutierrez
Lecture Notes in Computer Science
6986
, 2011, pp. 11-22
A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs
Raphael C.S. Machado
,
Celina M.H. de Figueiredo
Networks
57
(3), 2011, pp. 261-269
Complexity dichotomy on partial grid recognition
Vinícius G.P. de Sá
,
Guilherme D. da Fonseca
,
Raphael C.S. Machado
,
Celina M.H. de Figueiredo
Theoretical Computer Science
412
(22), 2011, pp. 2370-2379
Unitary toric classes, the reality and desire diagram, and sorting by transpositions
Rodrigo de A. Hausen
,
Luerbio Faria
,
Celina M.H. de Figueiredo
,
Luis Antonio B. Kowada
SIAM Journal on Discrete Mathematics
24
(3), 2010, pp. 792-807
The complexity of clique graph recognition
Liliana Alcón
,
Luerbio Faria
,
Celina M.H. de Figueiredo
,
Marisa Gutierrez
Theoretical Computer Science
410
(21-23), 2009, pp. 2072-2083
Enclosing weighted points with an almost-unit ball
Celina M.H. de Figueiredo
,
Guilherme D. da Fonseca
Information Processing Letters
109
(21-22), 2009, pp. 1216-1221
The pair completion algorithm for the homogeneous set sandwich problem
Claudson Bornstein
,
Celina M.H. de Figueiredo
,
Vinícius G.P. de Sá
Information Processing Letters
98
(3), 2006, pp. 87-91
Algorithms for the homogeneous set sandwich problem
Celina M.H. de Figueiredo
,
Guilherme D. da Fonseca
,
Vinícius G.P. de Sá
,
Jeremy Spinrad
Algorithmica
46
(2), 2006, pp. 149-180
Generating bicliques of a graph in lexicographic order
Vânia M.F. Dias
,
Celina M.H. de Figueiredo
,
Jayme L. Szwarcfiter
Theoretical Computer Science
337
(1-3), 2005, pp. 240-248
Note on the homogeneous set sandwich problem
Celina M.H. de Figueiredo
,
Vinicius G.P. de Sá
Information Processing Letters
93
(2), 2005, pp. 75-81
Kinetic hanger
Guilherme D. da Fonseca
,
Celina M.H. de Figueiredo
,
Paulo C.P. Carvalho
Information Processing Letters
89
(3), 2004, pp. 151-157
Optimizing bull-free perfect graphs
Celina M.H. de Figueiredo
,
Frédéric Maffray
SIAM Journal on Discrete Mathematics
18
(2), 2004, pp. 226-240
The stable marriage problem with restricted pairs
Vânia M.F. Dias
,
Guilherme D. da Fonseca
,
Celina M.H. de Figueiredo
,
Jayme L. Szwarcfiter
Theoretical Computer Science
306
(1-3), 2003, pp. 391-405
Decompositions for the edge colouring of reduced indifference graphs
Celina M.H. de Figueiredo
,
João Meidanis
,
Célia Picinin de Mello
,
Carmen Ortiz
Theoretical Computer Science
297
(1-3), 2003, pp. 145-155
On the structure of bull-free perfect graphs - 2: The weakley chordal case
Celina M.H. de Figueiredo
,
Frédéric Maffray
,
Oscar Porto
Graphs and Combinatorics
17
(3), 2001, pp. 435-456
Recognition of quasi-Meyniel graphs
Celina M.H. de Figueiredo
,
Kristina Vus̑ković
Discrete Applied Mathematics
113
(2-3), 2001, pp. 255-260
Finding skew partitions efficiently
Celina M.H. de Figueiredo
,
Sulamita Klein
,
Yoshiharu Kohayakawa
,
Bruce A. Reed
Journal of Algorithms
37
(2), 2000, pp. 505-521
Optimal node-degree bounds for the complexity of nonplanarity parameters
Celina M.H. de Figueiredo
,
Luerbio Faria
,
Candido F.X. Mendonça
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 887-888
Even and odd pairs in comparability and in
P_4
-comparability graphs
Celina M.H. de Figueiredo
,
John Gimbel
,
Célia P. Mello
,
Jayme L. Szwarcfiter
Discrete Applied Mathematics
91
(1-3), 1999, pp. 293-297
Total-chromatic number and chromatic index of dually chordal graphs
Celina M.H. de Figueiredo
,
João Meidanis
,
Célia Picinin de Mello
Information Processing Letters
70
(3), 1999, pp. 147-152
On the structure of bull-free perfect graphs
Celina M.H. de Figueiredo
,
Frédéric Maffray
,
Oscar Porto
Graphs and Combinatorics
13
, 1997, pp. 31-55
Seiten 1
2
>