Search Results - "Moura, Phablo F. S." :: K.UTB vyhledávací portál | TBU Library Retrieval Portal

The convex recoloring problem: polyhedra, facets and computational experiments

The convex recoloring problem: polyhedra, facets and computational experiments

by Campêlo, Manoel, Freire, Alexandre S., Lima, Karla R., Moura, Phablo F. S., Wakabayashi, Yoshiko
Published in Mathematical programming (01.03.2016)

Get full text

Journal Article

Strong inequalities and a branch-and-price algorithm for the convex recoloring problem

Strong inequalities and a branch-and-price algorithm for the convex recoloring problem

by Campêlo, Manoel, Freire, Alexandre S., Moura, Phablo F.S., Soares, Joel C.
Published in European journal of operational research (16.11.2022)

Get full text

Journal Article

Partitioning a graph into balanced connected classes: Formulations, separation and experiments

Partitioning a graph into balanced connected classes: Formulations, separation and experiments

by Miyazawa, Flávio K., Moura, Phablo F.S., Ota, Matheus J., Wakabayashi, Yoshiko
Published in European journal of operational research (16.09.2021)

Get full text

Journal Article

Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number

Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number

by Aboulker, Pierre, Cohen, Nathann, Havet, Frédéric, Lochet, William, Moura, Phablo F. S., Thomassé, Stéphan
Published in The Electronic journal of combinatorics (19.07.2019)

Get full text

Journal Article

Balanced connected partitions of graphs: approximation, parameterization and lower bounds

Balanced connected partitions of graphs: approximation, parameterization and lower bounds

by Moura, Phablo F. S., Ota, Matheus J., Wakabayashi, Yoshiko
Published in Journal of combinatorial optimization (01.07.2023)

Get full text

Journal Article

Strong intractability results for generalized convex recoloring problems

Strong intractability results for generalized convex recoloring problems

by Moura, Phablo F.S., Wakabayashi, Yoshiko
Published in Discrete Applied Mathematics (15.07.2020)

Get full text

Journal Article

The k-hop connected dominating set problem: approximation and hardness

The k-hop connected dominating set problem: approximation and hardness

by Coelho, Rafael S., Moura, Phablo F. S., Wakabayashi, Yoshiko
Published in Journal of combinatorial optimization (01.11.2017)

Get full text

Journal Article

On the proper orientation number of bipartite graphs

On the proper orientation number of bipartite graphs

by Araujo, Julio, Cohen, Nathann, de Rezende, Susanna F., Havet, Frédéric, Moura, Phablo F.S.
Published in Theoretical computer science (09.02.2015)

Get full text

Journal Article

Polyhedral approach to weighted connected matchings in general graphs

Polyhedral approach to weighted connected matchings in general graphs

by Phillippe Samer, Moura, Phablo F S
Published in arXiv.org (09.10.2023)

Get full text

Paper Journal Article

Polyhedral approach to weighted connected matchings in general graphs

Polyhedral approach to weighted connected matchings in general graphs

by Samer, Phillippe, Moura, Phablo F.S.
Published in Discrete Applied Mathematics (31.12.2024)

Get full text

Journal Article

Approximations for the Steiner Multicycle problem

Approximations for the Steiner Multicycle problem

by Fernandes, Cristina G., Lintzmayer, Carla N., Moura, Phablo F.S.
Published in Theoretical computer science (12.12.2024)

Get full text

Journal Article

Seymour's Second Neighborhood Conjecture for orientations of (pseudo)random graphs

Seymour's Second Neighborhood Conjecture for orientations of (pseudo)random graphs

by Botler, Fábio, Moura, Phablo F.S., Naia, Tássio
Published in Discrete mathematics (01.12.2023)

Get full text

Journal Article

Randomized approximation scheme for Steiner Multi Cycle in the Euclidean plane

Randomized approximation scheme for Steiner Multi Cycle in the Euclidean plane

by Lintzmayer, Carla N., Miyazawa, Flávio K., Moura, Phablo F.S., Xavier, Eduardo C.
Published in Theoretical computer science (02.10.2020)

Get full text

Journal Article

Optimal k-fold colorings of webs and antiwebs

Optimal k-fold colorings of webs and antiwebs

by Campêlo, Manoel, Corrêa, Ricardo C, Moura, Phablo F S, Santos, Marcio C
Published in arXiv.org (29.08.2011)

Get full text

Paper Journal Article

Lifted, projected and subgraph-induced inequalities for the representatives k-fold coloring polytope

Lifted, projected and subgraph-induced inequalities for the representatives k-fold coloring polytope

by Campêlo, Manoel, Moura, Phablo F.S., Santos, Marcio C.
Published in Discrete optimization (01.08.2016)

Get full text

Journal Article

Approximation and Parameterized Algorithms for Balanced Connected Partition Problems

Approximation and Parameterized Algorithms for Balanced Connected Partition Problems

by Moura, Phablo F. S., Ota, Matheus Jun, Wakabayashi, Yoshiko
Published in Algorithms and Discrete Applied Mathematics (2022)

Get full text

Book Chapter

On optimal k-fold colorings of webs and antiwebs

On optimal k-fold colorings of webs and antiwebs

by Campêlo, Manoel, Corrêa, Ricardo C., Moura, Phablo F.S., Santos, Marcio C.
Published in Discrete Applied Mathematics (01.01.2013)

Get full text

Journal Article

On the connected (sub)partition polytope

On the connected (sub)partition polytope

by Moura, Phablo F. S, Leus, Roel, Yaman, Hande
Year of Publication 03.01.2024

Get full text

Journal Article

Compact formulations and valid inequalities for parallel machine scheduling with conflicts

Compact formulations and valid inequalities for parallel machine scheduling with conflicts

by Moura, Phablo F. S, Leus, Roel, Yaman, Hande
Year of Publication 22.12.2023

Get full text

Journal Article

Approximations for the Steiner Multicycle Problem

Approximations for the Steiner Multicycle Problem

by Fernandes, Cristina G, Lintzmayer, Carla N, Moura, Phablo F. S
Year of Publication 14.08.2023

Get full text

Journal Article