default search action
Phablo F. S. Moura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Phillippe Samer
, Phablo F. S. Moura
Polyhedral approach to weighted connected matchings in general graphs. Discret. Appl. Math. 359: 143-152 (2024) - [j17]Cristina G. Fernandes, Carla Negri Lintzmayer
Approximations for the Steiner Multicycle problem. Theor. Comput. Sci. 1020: 114836 (2024) - 2023
- [j16]Fábio Botler
Seymour's Second Neighborhood Conjecture for orientations of (pseudo)random graphs. Discret. Math. 346(12): 113583 (2023) - [j15]Phablo F. S. Moura
Balanced connected partitions of graphs: approximation, parameterization and lower bounds. J. Comb. Optim. 45(5): 127 (2023) - [i9]Cristina G. Fernandes, Carla Negri Lintzmayer
Approximations for the Steiner Multicycle Problem. CoRR abs/2308.07471 (2023) - [i8]Phillippe Samer, Phablo F. S. Moura:
Polyhedral approach to weighted connected matchings in general graphs. CoRR abs/2310.05733 (2023) - [i7]Phablo F. S. Moura, Roel Leus, Hande Yaman:
Scheduling with conflicts: formulations, valid inequalities, and computational experiments. CoRR abs/2312.14777 (2023) - 2022
- [j14]Manoel B. Campêlo
Strong inequalities and a branch-and-price algorithm for the convex recoloring problem. Eur. J. Oper. Res. 303(1): 54-65 (2022) - [c4]Phablo F. S. Moura
Approximation and Parameterized Algorithms for Balanced Connected Partition Problems. CALDAM 2022: 211-223 - [c3]Cristina G. Fernandes
Approximations for the Steiner Multicycle Problem. LATIN 2022: 188-203 - 2021
- [j13]Flávio Keidi Miyazawa, Phablo F. S. Moura
Partitioning a graph into balanced connected classes: Formulations, separation and experiments. Eur. J. Oper. Res. 293(3): 826-836 (2021) - [i6]Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi:
Approximation and parameterized algorithms to find balanced connected partitions of graphs. CoRR abs/2108.10398 (2021) - 2020
- [j12]Phablo F. S. Moura
Strong intractability results for generalized convex recoloring problems. Discret. Appl. Math. 281: 252-260 (2020) - [j11]Carla Negri Lintzmayer
Randomized approximation scheme for Steiner Multi Cycle in the Euclidean plane. Theor. Comput. Sci. 835: 134-155 (2020) - [c2]Flávio Keidi Miyazawa, Phablo F. S. Moura
Cut and Flow Formulations for the Balanced Connected k-Partition Problem. ISCO 2020: 128-139
2010 – 2019
- 2019
- [j10]Pierre Aboulker, Nathann Cohen, Frédéric Havet, William Lochet, Phablo F. S. Moura
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number. Electron. J. Comb. 26(3): 3 (2019) - [c1]Carla Negri Lintzmayer
Quasilinear Approximation Scheme for Steiner Multi Cycle in the Euclidean plane. LAGOS 2019: 589-601 - [i5]Flávio Keidi Miyazawa, Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi:
Integer Programming Approaches to Balanced Connected k-Partition. CoRR abs/1911.05723 (2019) - [i4]Manoel B. Campêlo, Phablo F. S. Moura, Joel C. Soares:
Polyhedral study of the Convex Recoloring problem. CoRR abs/1911.11099 (2019) - 2017
- [b1]Phablo F. S. Moura:
Graph colorings and digraph subdivisions. University of São Paulo, Brazil, 2017 - [j9]Phablo F. S. Moura
Strong intractability of generalized convex recoloring problems. Electron. Notes Discret. Math. 62: 93-98 (2017) - [j8]Rafael S. Coelho
The k-hop connected dominating set problem: approximation and hardness. J. Comb. Optim. 34(4): 1060-1083 (2017) - 2016
- [j7]Manoel B. Campêlo
Lifted, projected and subgraph-induced inequalities for the representatives k-fold coloring polytope. Discret. Optim. 21: 131-156 (2016) - [j6]Manoel B. Campêlo
The convex recoloring problem: polyhedra, facets and computational experiments. Math. Program. 156(1-2): 303-330 (2016) - 2015
- [j5]Rafael S. Coelho, Phablo F. S. Moura
The k-hop connected dominating set problem: hardness and polyhedra. Electron. Notes Discret. Math. 50: 59-64 (2015) - [j4]Júlio Araújo
On the proper orientation number of bipartite graphs. Theor. Comput. Sci. 566: 59-75 (2015) - [i3]Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos:
Facet-defining inequalities for the representatives k-fold coloring polytope. CTW 2015: 73-76 - [i2]Manoel B. Campêlo, Alexandre S. Freire, Phablo F. S. Moura, Yoshiko Wakabayashi:
Convex recoloring: inapproximability and a polyhedral study. CTW 2015: 117-120 - 2013
- [j3]Manoel B. Campêlo
On optimal k-fold colorings of webs and antiwebs. Discret. Appl. Math. 161(1-2): 60-70 (2013) - [j2]Manoel B. Campêlo
Polyhedral studies on the convex recoloring problem. Electron. Notes Discret. Math. 44: 233-238 (2013) - [j1]Manoel B. Campêlo
On the representatives k-fold coloring polytope. Electron. Notes Discret. Math. 44: 239-244 (2013) - 2011
- [i1]Manoel B. Campêlo, Ricardo C. Corrêa, Phablo F. S. Moura, Marcio Costa Santos:
Optimal k-fold colorings of webs and antiwebs. CoRR abs/1108.5757 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 20:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: