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

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

Volltext

A faster 1.375-approximation algorithm for sorting by transpositions von Cunha, Luís Felipe I, Kowada, Luis Antonio B, Hausen, Rodrigo de A, de Figueiredo, Celina M H

Volltext

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

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

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

Volltext

The chain graph sandwich problem von Dantas, Simone, de Figueiredo, Celina M. H., Golumbic, Martin Charles, Klein, Sulamita, Maffray, Frédéric

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

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

Volltext

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

Volltext

Blind-friendly von Neumann’s Heads or Tails von de Sá, Inícius G Pereira, de Figueiredo, Celina MH

Volltext

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

Volltext

Advancing the Transposition Distance and Diameter through Lonely Permutations von Cunha, Luís Felipe I., Kowada, Luis Antonio B., de A. Hausen, Rodrigo, de Figueiredo, Celina M. H.

Volltext

On the embedding of cone graphs in the line with distinct distances between neighbors von Zhou, Rodrigo M., de Figueiredo, Celina M.H., Machado, Raphael C.S., de Sá, Vinícius G. Pereira

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

On the forbidden induced subgraph sandwich problem von Dantas, Simone, de Figueiredo, Celina M.H., da Silva, Murilo V.G., Teixeira, Rafael B.

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 Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the n-Cube von Faria, Luerbio, de Figueiredo, Celina M. H., Richter, R. Bruce, Vrt'o, Imrich

Volltext

The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem von Dantas, Simone, de Figueiredo, Celina M.H., Maffray, Frédéric, Teixeira, Rafael B.

Volltext