The following pages link to Phablo F. S. Moura (Q263201):
Displaying 16 items.
- The convex recoloring problem: polyhedra, facets and computational experiments (Q263202) (← links)
- The \(k\)-hop connected dominating set problem: hardness and polyhedra (Q324721) (← links)
- On the proper orientation number of bipartite graphs (Q484321) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope (Q1751169) (← links)
- On optimal \(k\)-fold colorings of webs and antiwebs (Q1759864) (← links)
- Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323) (← links)
- Quasilinear approximation scheme for Steiner multi cycle in the Euclidean plane (Q2132394) (← links)
- Strong intractability results for generalized convex recoloring problems (Q2184691) (← links)
- Randomized approximation scheme for Steiner multi cycle in the Euclidean plane (Q2192387) (← links)
- Cut and flow formulations for the balanced connected \(k\)-partition problem (Q2225055) (← links)
- Subdivisions in digraphs of large out-degree or large dichromatic number (Q2315440) (← links)
- Strong intractability of generalized convex recoloring problems (Q2413156) (← links)
- Strong inequalities and a branch-and-price algorithm for the convex recoloring problem (Q2673556) (← links)
- Seymour's second neighborhood conjecture for orientations of (pseudo)random graphs (Q6080532) (← links)
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds (Q6166191) (← links)
