Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs von Figueiredo, Celina M. H., Lopes, Raul, Melo, Alexsander A., Silva, Ana

Volltext

Complexity-separating graph classes for vertex, edge and total colouring von de Figueiredo, Celina M.H.

Volltext

Revising Johnson’s table for the 21st century von de Figueiredo, Celina M.H., de Melo, Alexsander A., Sasaki, Diana, Silva, Ana

Volltext

IFORS' Operational Research Hall of Fame: Clóvis Caesar Gonzaga von de Figueiredo, Celina, Karas, Elizabeth W., Sagastizábal, Claudia

Volltext

On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems von Melo, Alexsander A., Figueiredo, Celina M. H., Souza, Uéverton dos Santos

Volltext

Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete von de Figueiredo, Celina M. H., de Melo, Alexsander A., Oliveira, Fabiano S., Silva, Ana

Volltext

Sandwich and probe problems for excluding paths von de Figueiredo, Celina M.H., Spirkl, Sophie

Volltext

A multivariate analysis of the strict terminal connection problem von Melo, Alexsander A., Figueiredo, Celina M.H., Souza, Uéverton S.

Volltext

A computational complexity comparative study of graph tessellation problems von Abreu, Alexandre, Cunha, Luís, de Figueiredo, Celina, Kowada, Luis, Marquezino, Franklin, Portugal, Renato, Posner, Daniel

Volltext

MaxCut on permutation graphs is NP‐complete von Figueiredo, Celina M. H., Melo, Alexsander A., Oliveira, Fabiano S., Silva, Ana

Volltext

Computing the zig-zag number of directed graphs von Dourado, Mitre C., de Figueiredo, Celina M.H., de Melo, Alexsander A., de Oliveira Oliveira, Mateus, Souza, Uéverton S.

Volltext

A reversible circuit synthesis algorithm with progressive increase of controls in generalized Toffoli gates von Dalcumune, Edinelco, Brasil Kowada, Luis Antonio, Ribeiro, Andre da Cunha, Herrera de Figueiredo, Celina Miraglia, Marquezino, Franklin de Lima

Volltext

Timber game as a counting problem von Furtado, Ana, Dantas, Simone, de Figueiredo, Celina M.H., Gravier, Sylvain

Volltext

The Sandwich Problem for Decompositions and Almost Monotone Properties von Chudnovsky, Maria, de Figueiredo, Celina M. H., Spirkl, Sophie

Volltext

On the computational difficulty of the terminal connection problem von de Melo, Alexsander A., de Figueiredo, Celina M.H., Souza, Uéverton S.

Volltext

On the computational complexity of closest genome problems von Cunha, Luís Felipe I., Feijão, Pedro, dos Santos, Vinícius F., Kowada, Luis Antonio B., de Figueiredo, Celina M.H.

Volltext

Canonical cuts of path powers von Alcon, Liliana, Faria, Luerbio, Figueiredo, Celina, Gutierrez, Marisa, Klein, Sulamita, Souza, Ueverton, Sucupira, Rubens

Volltext

The (k,ℓ)partitioned probe problem: NP-complete versus polynomial dichotomy von Dantas, Simone, Faria, Luerbio, de Figueiredo, Celina M.H., Teixeira, Rafael B.

Volltext

The P versus NP–complete dichotomy of some challenging problems in graph theory von de Figueiredo, Celina M.H.

Volltext

The (k,ℓ) unpartitioned probe problem NP-complete versus polynomial dichotomy von Dantas, Simone, Faria, Luerbio, de Figueiredo, Celina M.H., Teixeira, Rafael B.

Volltext