| TUESDAY | 16TH | |
| 09:00-10:20 | TRANSFER | |
| 10:20-11:20 | CHECK-IN | |
| 11:20-12:20 | REGISTRATION | |
| 12:20-14:20 | LUNCH | |
| 14:20-14:30 | OPENING | |
| 14:30-15:20 | PLENARY TALK | ANDREAS BRANDSTADT |
| 15:20-15:40 | TALK 1 | BICLIQUE TRANSVERSAL AND BICLIQUE INDEPENDENT SET (M. GROSHAUS) |
| 15:40-16:00 | TALK 2 | IMPROVED ALGORITHMS FOR MINIMUM CLIQUE-TRANSVERSAL PROBLEM (M. LIN) |
| 16:00-16:20 | COFFEE BREAK | |
| 16:20-16:40 | TALK 3 | ALGORITHMIC ASPECTS OF STEINER CONVEXITY AND ENUMERATION OF STEINER TREES (R.OLIVEIRA) |
| 16:40-17:00 | TALK 4 | ALLIANCES AND GRAPH CONVEXITY (L. FARIA) |
| 17:00-17:20 | TALK 5 | CONVEX COVERS OF GRAPHS (D. ARTIGAS) |
| 17:20-18:10 | PLENARY TALK | PARTITIONS OF DIRECT PRODUCTS OF COMPLETE GRAPHS INTO INDEPENDENT DOMINATING SETS |
| (MARIO VALENCIA-PABON) | ||
| 19:00-21:00 | DINNER | |
| WEDNESDAY | 17TH | |
| 09:10-10:00 | ORIENTATION OF GRAPHS (ZOLTAN SZIGETI) | |
| 10:00-10:20 | TALK 6 | BICLIQUE-COLORING (P. TERLISKY) |
| 10:20-10:40 | TALK 7 | CLIQUE-PERFECTNESS OF COMPLEMENTS OF LINE GRAPHS (M. D. SAFE) |
| 10:40-11:00 | COFFEE BREAK | |
| 11:00-11:20 | TALK 8 | THERE IS A PATH MODEL THAT REALIZES THE LEAFAGE IN PATH GRAPHS (S. TONDATO) |
| 11:20-11:40 | TALK 9 | AN EVIDENCE FOR LOVASZ CONJECTURE ABOUT HAMILTONIAN PATHS AND CYCLES (A. DA C. RIBEIRO) |
| 11:40-12:00 | TALK 10 | A NECESSARY CONDITION FOR EPT GRAPHS (M. P. MAZZOLENI) |
| 12:00-12:20 | TALK 11 | RESULTS ON DETERMINING THE MINIMUM NUMBER OF LENGTHS IN INTERVAL MODELS (F. OLIVEIRA) |
| 12:20-14:20 | LUNCH | |
| 14:20-14:40 | TALK 12 | NEW RESULTS ON THE TOTAL COLORING OF SNARKS (D. SASAKI) |
| 14:40-15:00 | TALK 13 | ADJACENT VERTEX-DISTINGUISHING TOTAL COLORING OF INDEFFERENCE GRAPHS (V. PEDROTTI) |
| 15:00-15:20 | TALK 14 | ON L(2,1)-COLORING SPLIT PERMUTATION GRAPHS (D. POSNER) |
| 15:20-15:40 | TALK 15 | A NOTE ON CLASS 2 SPLIT GRAPHS (S. M. ALMEIDA) |
| 15:40-16:00 | TALK 16 | ON RECOGNIZING SPLIT CLIQUE GRAPHS (L. ALCON) |
| 16:00-16:20 | COFFEE BREAK | |
| 16:20-16:40 | TALK 17 | CONTRIBUTIONS TO THE CLUSTER EDITING PROBLEM (L. BASTOS) |
| 16:40-17:00 | TALK 18 | GENE CLUSTERS AS INTERSECTIONS OF POWERS OF PATHS (V. COSTA) |
| 17:00-17:20 | PROBLEM | PROBLEM SESSION |
| 17:20-17:40 | PROBLEM | PROBLEM SESSION |
| 17:40-18:30 | ||
| 19:00-21:00 | DINNER | |
| THURSDAY | 18TH | |
| 09:10-10:00 | PLENARY TALK | NEW RESULTS ON DUALLY CHORDAL GRAPHS (MARISA GUTIERREZ) |
| 10:00-10:20 | TALK 19 | FINDING THE P_3 HULL NUMBER OF A CHORDAL GRAPH (C. CENTENO) |
| 10:20-10:40 | TALK 20 | THE CARATHEODORY NUMBER FOR THE P_3 CONVEXITY (E.COELHO) |
| 10:40-11:00 | COFFEE BREAK | |
| 11:00-11:20 | TALK 21 | DECOMPOSITIONS BY MAXCLIQUE SEPARATORS (H. NOBREGA) |
| 11:20-11:40 | TALK 22 | BRANCH AND BOUND ALGORITHMS FOR THE MAXIMUM CLIQUE PROBLEM (R. CARMO) |
| 11:40-12:00 | TALK 23 | GRAPH COLORING IN SCHEDULING PROBLEMS (R.RODRIGUES) |
| 12:00-12:20 | TALK 24 | MATCHINGS IN CARTESIAN PRODUCT OF GRAPHS AND ITS APPLICATIONS TO |
| INTERCONNCECTION NETWORKS (A. ALMEIDA) | ||
| 12:20-14:20 | LUNCH | |
| 14:20-14:40 | TALK 25 | EXTENDING APPLICABILITY OF RANK-DIVERGENCE (M. PIZANA) |
| 14:40-15:00 | TALK 26 | THE IMAGES OF THE CLIQUE OPERATOR AND ITS SQUARE ARE DIFFERENT (P. DE CARIA) |
| 15:00-15:20 | TALK 27 | ON WEIGHTED CLIQUE GRAPHS (F. BONOMO) |
| 15:20-15:40 | TALK 28 | PARAMETERIZED TRACTABILITY OF COST PROBLEMS FOR X-OF-Y GRAPHS (U. SOUZA) |
| 15:40-16:00 | TALK 29 | SHORT COVERING CODES AND SUM-FREE SETS (E. CARMELO) |
| 16:00-16:20 | COFFEE BREAK | |
| 16:20-16:40 | TALK 30 | UPPER BOUNDS AND EXACT VALUES ON TRANSPOSITION DISTANCE IN PERMUTATIONS (L.F.I. CUNHA) |
| 16:40-17:00 | TALK 31 | SPECTRAL PROPERTIES OF KKöJ_N GRAPHS (R. DEL-VECCHIO) |
| 17:00-17:20 | TALK 32 | AN IMPROVEMENT ON POINT LOCATION QUERIES IN A SET OF FAT OBSTACLES AND ON MOTION |
| PLANNING AMIDST FAT OBSTACLES (H. FILHO) | ||
| 17:20-17:40 | ||
| 17:40-18:00 | ||
| 18:30 | TRANSFER - RESTAURANT | |
| 20:00-22:00 | SPECIAL DINNER | |
| FRIDAY | 19TH | |
| 09:00-10:00 | TRANSFER/RIO | |