| Tuesday, Nov 3 |
|---|
| 16:45 | Registration |
| 20:00 | Opening cocktail |
| Wednesday, Nov 4 |
|---|
| 8:00 - 8:30 | Registration |
| 8:30 - 8:45 | Opening |
| 8:45 - 9:35 | Technical session 1 (4 papers) |
| TS 1a - Graph theory and algorithms |
| 8:45 - 9:10 | Degree sequence of tight distance graphs (J. Zamora, M. Matamala) |
| 9:10 - 9:35 | Polynomial-time recognition of uniform co-circuit graphs (K. Knauer) |
| TS 1b - Polyhedral combinatorics |
| 8:45 - 9:10 | A polyhedral study of the acyclic coloring problem (M. Braga, J. Marenco) |
| 10:10 - 10:35 | Strength of facets for the set covering and set packing polyhedra on circulant matrices (S. M. Bianchi, M. Escalante, M. S. Montelar) |
| 9:35 - 10:00 | Coffee break |
| 10:00 - 11:00 | Invited talk 1: M. C. Golumbic |
| 11:00 - 12:15 | Technical session 2 (6 papers) |
| TS 2a - Graph Theory |
| 11:00 - 11:25 | On minimal forbidden subgraph characterizations of balanced graphs (F. Bonomo, G. Durán, M. Safe, A. Wagler) |
| 11:25 - 11:50 | Distance-Hereditary Comparability Graphs (G. Di Stefano) |
| 11:50 - 12:15 | Graph tansformations preserving the stability number (B. Leveque, D. de Werra) |
| TS 2b - Combinatorial optimization |
| 11:00 - 11:25 | A branch&cut algorithm for the maximum common edge subgraph problem (G. Manic, C. C. Souza, L. Bahiense) |
| 11:25 - 11:50 | A branch-and-cut algorithm for equitable coloring based on a formulation by representatives (L. Bahiense, Y. Frota, N. Maculan, T. Noronha, C. Ribeiro) |
| 11:50 - 12:15 | A branch-and-cut-and-price approach for the capacitated m-ring-star problem (C. C. Souza, E. Hoshino) |
| 12:15 - 14:00 | Lunch |
| 14:00 - 15:00 | Invited talk 2: D. Williamson |
| 15:00 - 16:15 | Technical session 3 (6 papers) |
| TS 3a - Graph theory |
| 15:00 - 15:25 | Minimal vertex separators and new characterizations for dually chordal graphs (M. Gutierrez, P. De Caria) |
| 15:25 - 15:50 | On L(2,1)-coloring split, chordal bipartite and weakly chordal graphs (M. Cerioli, D. Posner) |
| 15:50 - 16:15 | b-chromatic number of cacti (A. Silva, V. Campos, C. Linhares Sales, F. Maffray) |
| TS 3b - Polyhedral combinatorics and combinatorial optimization |
| 15:00 - 15:25 | On the dominating set polytope of web graphs (S. M. Bianchi, G. Nasini, P. Tolomei) (Universidad Nacional de Rosario - CONICET) |
| 15:25 - 15:50 | A polyhedral study of the maximum edge subgraph problem (F. Bonomo, J. Marenco, D. Saban, N. Stier-Moses) |
| 15:50 - 16:15 | A Set Partitioning Approach to Shunting (C. Cardonha) |
| 16:15 - 16:45 | Coffee break |
| 16:45 - 18:00 | Technical session 4 (6 papers) |
| TS 4a - Graph Theory |
| 16:45 - 17:10 | On the Pfaffian number of graphs (A. A. Miranda, C. L. Lucchesi) |
| 17:10 - 17:35 | Impartial solitaire clobber played on powers of paths (T. Para, S. Gravier, S. Dantas) |
| 17:35 - 18:00 | On the metric dimension of infinite graphs (I. Pelayo, J. Cáceres, C. Hernando, M. Mora, M. Puertas) |
| TS 4b - Algorithms |
| 16:45 - 17:10 | Convergence Time to Nash Equilibrium in Selfish Bin Packing (A. Vignatti, F. Miyazawa) |
| 17:10 - 17:35 | Note on strong refutation algorithms for random k-SAT formulas (H. Han, Y. Person, M. Schacht) |
| 17:35 - 18:00 | Intersection Dimension and Maximum Degree (A. Natarajan, C. Subramanian) |
| Thursday, Nov 5 |
|---|
| 8:45 - 9:35 | Technical session 5 (4 papers) |
| TS 5a - Graph theory |
| 8:45 - 9:10 | On the clique behavior of circulants with three small jumps (F. Larrión, M. Pizaña, R. Villarroel-Flores) |
| 9:10 - 9:35 | The number of convergent graphs under the biclique operator with no twin vertices is finite (L. Montero, M. Groshaus) |
| TS 5b - Combinatorics and graph theory |
| 8:45 - 9:10 | Invariant sets under permutation, extremal graphs, and covering codes (E. Monte Carmelo) |
| 9:10 - 9:35 | A note on permutation regularity (R. Sampaio, C. Hoppen, Y. Kohayakawa) |
| 9:35 - 10:00 | Coffee break |
| 10:00 - 11:00 | Invited talk 3: Pavol Hell |
| 11:00 - 12:15 | Technical session 6 (6 papers) |
| TS 6a - Algorithms and data structures |
| 11:00 - 11:25 | Boltzmann sampling of ordered structures (O. Roussel, M. Soria) |
| 11:25 - 11:50 | A concurrent implementation of skip graphs (H. Mendes, C. Fernandes) |
| 11:50 - 12:15 | Mixed Binary Euclid Algorithm (S. M. Sedjelmaci) |
| TS 6b - Graph theory and algorithms |
| 11:00 - 11:25 | Minimal separators in P_4-tidy graphs (V. Pedrotti, C. P. de Mello) |
| 11:25 - 11:50 | Minimum sum coloring of P_4-sparse graphs (F. Bonomo, M. Valencia-Pabon) |
| 11:50 - 12:15 | Grundy number on P_4-classes (J. C. Araújo, C. Linhares Sales) |
| 12:15 | Lunch |
| 14:00 | Social activity |
| Friday, Nov 6 |
|---|
| 8:45 - 9:35 | Technical session 7 (4 papers) |
| TS 7a - Graph Theory |
| 8:45 - 9:10 | Maximizing the algebraic connectivity for a subclass of caterpillars (O. Rojo, L. Medina, N. Abreu, C. Justel) |
| 9:10 - 9:35 | On Q-spectral integral variation (M. Aguieiras, R. Del-Vecchio, S. Kirkland, N. Abreu) |
| TS 7b - Operations research |
| 8:45 - 9:10 | The minimum cost hop-and-root constrained forest in wireless sensor networks (C. Bechelane, A. Cunha, G. R. Mateus) |
| 9:10 - 9:35 | Optimization throughput, service rate, and buffer allocation in finite queueing networks (F. Cruz) |
| 9:35 - 10:00 | Coffee break |
| 10:00 - 11:00 | Invited talk 4: Celina Figueiredo |
| 11:00 - 12:15 | Technical session 8 (6 papers) |
| TS 8a - Graph theory and complexity |
| 11:00 - 11:25 | Skew partition sandwich problem is NP-complete (R. Teixeira, S. Dantas, C. Figueiredo) |
| 11:25 - 11:50 | Good edge-labelling of graphs (J. C. Araújo, N. Cohen, F. Giroire, F. Havet) |
| 11:50 - 12:15 | On coloring problems with local constraints (F. Bonomo, Y. Faenza, G. Oriolo) |
| TS 8b - Graph theory |
| 11:00 - 11:25 | On the basis graph of a bicolored matroid (A. P. Figueroa, E. Rivera-Campo) |
| 11:25 - 11:50 | The chromatic number of random lifts of K_5\e (D. O. Theis, B. Farzad) |
| 11:50 - 12:15 | The exact weighted independent set problem in perfect graphs and related classes (M. Milanic, J. Monnot) |
| 12:15 - 14:00 | Lunch |
| 14:00 - 15:00 | Invited talk 5: R. Sedgewick |
| 15:00 - 16:15 | Technical session 9 (6 papers) |
| TS 9a - Graph algorithms |
| 15:00 - 15:25 | Cycle transversals in bounded degree graphs (M. Groshaus, P. Hell, S. Klein, L. T. Nogueira, F. Protti) |
| 15:25 - 15:50 | Clique-coloring circular-arc graphs (M. Cerioli, A. Korenchendler) |
| 15:50 - 16:15 | On the polynomial time computability of the circular chromatic number for some superclasses of perfect graphs (A. Pecher, A. Wagler) |
| TS 9b - Combinatorial optimization |
| 15:00 - 15:25 | Upper and lower bounding procedures for the minimum caterpillar spanning problem (Y. Frota, L. Simonetti, C. C. Souza) |
| 15:25 - 15:50 | The Chvatal closure of generalized stable sets in bidirected graphs (M. Campelo, G. Cornuéjols) |
| 15:50 - 16:15 | Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized (C. Arbex, A. Cunha, G. R. Mateus, L. Martinez) |
| 16:15 - 16:45 | Coffee break |
| 16:45 - 18:00 | Poster session |
| Limited $r$-modular and finite $k$-Cayley trees (R. C. Andrade, G. Mota, P. C. L. Silva) |
| Edge-colouring subject to local restrictions (R. Machado, C. Figueiredo) |
| (k, l)-P_4-sparse graphs (R. Bravo, S. Klein, L. T. Nogueira, F. Protti) |
| Determining protein structures using the discretizable molecular distance geometry problem (S. Sallaume, S. martins, L. S. Ochi, W. Gramacho, C. Lavor) |
| Hardness results for the gapped consectutive-ones property problem (C. Chauve, J. Manuch, M. Patterson) |
| Mathematical programming and software debugging (L. Liberti, S. Le Roux, J. Leconte, F. Marinelli) |
| $2K_2$-partition of some classes of graphs (A. Silva, S. Dantas, F. Maffray) |
| Partial characterizations of circle graphs (F. Bonomo, G. Durán, L. Grippo, M. Safe) |
| Min-max priority queue with removal in worst case constant time (V. Campos, R. Corrêa) |
| Counting unlabeled k-path graphs (P. R. C. Pereira, A. Garcia, L. Markenzon) |
| A new encoding for the protein structure prediction problem in lattices (L. Pedro, H. Barbosa, E. Wanner, R. Silva) |
| Revenue maximization in public transport (R. Borndörfer, M. Neumann) |
| 20:30 | Conference dinner |
| Saturday, Nov 7 |
|---|
| 8:45 - 9:35 | Technical session 10 (4 papers) |
| TS 10a - Enumerative combinatorics |
| 8:45 - 9:10 | Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals (M. Dourado, R. Oliveira, F. Protti) |
| 9:10 - 9:35 | Gaps in discrete random samples: extended abstract (P. Hitczenko) |
| TS 10b - Graph theory and algorithms |
| 8:45 - 9:10 | All pairs 2-route flows and varying capacities (M. Diallo, S. Gueye, P. Berthome) |
| 9:10 - 9:35 | On s-t paths and trails in edge-colored graphs (L. Gourvès, A. Lyra, C. A. Martinhon, J. Monnot, F. Protti) |
| 9:35 - 10:00 | Coffee break |
| 10:00 - 11:00 | Invited talk 6: R. Jamison |
| 11:00 - 12:15 | Technical session 11 (6 papers) |
| TS 11a - Graph theory and algorithms |
| 11:00 - 11:25 | Acyclic vertex coloring of graphs of maximum degree 6 (S. Varagani, K. Yadav, K. Kothapalli, V. Vadlamudi) |
| 11:25 - 11:50 | Short models for unit interval graphs (Min-Chih Lin, F. Soulignac, J. L. Szwarcfiter) |
| 11:50 - 12:15 | B-coloring of m-tight graphs (L. Sampaio, C. Linhares Sales) |
| TS 11b - Graph Theory |
| 11:00 - 11:25 | Almost spanning subgraphs of random graphs after adversarial edge removal (J. Boettcher, Y. Kohayakawa, A. Taraz) |
| 11:25 - 11:50 | A characterization of graphs with fractional total chromatic number equal to Delta + 2 (T. Ito, W. Kennedy, B. Reed) |
| 11:50 - 12:15 | Properties of an approximability-related parameter on circular complete graphs (R. Engström, T. Färnqvist, P. Jonsson, J. Thapper) |
| 12:15 | Closing |
