| Graph tansformations preserving the stability number | Benjamin Leveque (LIF-Marseille),
Dominique de Werra (EPF Lausanne) |
| Skew partition sandwich problem is NP-complete | Rafael Teixeira (Universidade Federal do Rio de Janeiro),
Simone Dantas (Universidade Federal Fluminense),
Celina Figueiredo (UFRJ) |
| On the Metric Dimension of Infinite Graphs |
Ignacio Pelayo (Universitat Politècnica de Catalunya),
José Cáceres (Universidad de Almeria),
Carmen Hernando (Universitat Politècnica de Catalunya),
Mercè Mora (Universitat Politècnica de Catalunya),
Maria Puertas (Universidad de Almeria) |
|
Grundy number on P4-classes | Júlio César Araújo (Universidade Federal do Ceará),
Claudia Linhares Sales (Universidade Federal do Ceará) |
| Polynomial Time Recognition of Uniform Cocircuit Graphs | Kolja Knauer (Technical University Berlin) |
| A polyhedral study of the acyclic coloring problem | Mónica Braga (National University of General Sarmiento),
Javier Marenco (University of Buenos Aires) |
| On minimal forbidden subgraph characterizations of balanced graphs |
Flavia Bonomo (Universidad de Buenos Aires),
Guillermo Durán (Universidad de Buenos Aires y Universidad de Chile),
Martín Safe (CONICET and Universidad de Buenos Aires),
Annegret Wagler (Otto-von-Guericke-University Magdeburg) |
| A branch&cut algorithm for the maximum common edge subgraph problem |
Gordana Manic' (Universidade Federal do ABC),
Cid C. de Souza (UNICAMP),
Laura Bahiense (COPPE-Produção / UFRJ) |
| On the polynomial time computability of the circular chromatic number for some superclasses of perfect graphs | Arnaud Pecher (University of Bordeaux 1, LaBRI, INRIA),
Annegret Wagler (Otto-von-Guericke-University Magdeburg) |
| Impact of a varying capacity on the all pairs 2-route network flows |
Madiagne Diallo (PUC-Rio),
Serigne Gueye (Université Le Havre),
Pascal Berthome (ENSI BOURGES) |
| Maximizing the algebraic connectivity for a subclass of caterpillars | Oscar Rojo (Universidad Católica del Norte),
Luis Medina (Universidad Católica del Norte),
Nair Abreu (Universidade Federal do Rio de Janeiro),
Claudia Justel (Instituto Militar de Engenharia) |
| Minimal separators in P4-tidy graphs | Vagner Pedrotti (UNICAMP),
Célia Picinin de Mello (UNICAMP) |
| Invariant sets under permutation, extremal graphs, and covering codes | Emerson Monte Carmelo (Universidade Estadual de Maringá) |
| Upper and lower bounding procedures for the minimum caterpillar spanning problem | Yuri Frota (University of Campinas (UNICAMP)),
Luidi Simonetti (University of Campinas (UNICAMP)),
Cid C. de Souza (UNICAMP) |
| The Chvatal closure of generalized stable sets in bidirected graphs |
Manoel Campelo (Universidade Federal do Ceará),
Gérard Cornuéjols (Carnegie Mellon & LIF - Univ. of Marseilles) |
| Gaps in discrete random samples: extended abstract | Pawel Hitczenko (Drexel University) |
| A Branch-and-Cut-and-Price Approach for the Capacitated $m$-Ring-Star Problem | Cid C. de Souza (UNICAMP),
Edna Hoshino (University of Campinas) |
| Strength of facets for the set covering and set packing polyhedra on circulant matrices |
Silvia María Bianchi (Universidad Nacional de Rosario),
Mariana Escalante (CONICET and University of Rosario),
Maria Susana Montelar (University of Rosario) |
| Properties of an Approximability-related Parameter on Circular Complete Graphs |
Robert Engström (Linköping University),
Tommy Färnqvist (Linköping University),
Peter Jonsson (Linköping University),
Johan Thapper (Linköping University) |
| On the dominating set polytope of web graphs | Silvia María Bianchi (Universidad Nacional de Rosario),
Graciela Nasini (Universidad Nacional de Rosario),
Paola Tolomei (Universidad Nacional de Rosario - CONICET) |
| Minimal vertex separators and new characterizations for dually chordal graphs | Marisa Gutierrez (Universidad Nacional de la Plata),
Pablo De Caria (Departamento de Matemática. FCE. Universidad Nacional de La Plata) |
| Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized |
Cristiano Arbex (Universidade Federal de Minas Gerais),
Alexandre Cunha (Federal University of Minas Gerais),
Geraldo Robson Mateus (UFMG),
Leonardo Martinez (UFMG) |
| The Minimum Cost Hop-and-root constrained forest in Wireless Sensor Networks |
Carla Bechelane (Universidade Federal de Minas Gerais),
Alexandre Cunha (Federal University of Minas Gerais),
Geraldo Robson Mateus (UFMG) |
| On the Pfaffian Number of Graphs | Alberto Alexandre Miranda (UNICAMP: Universidade Estadual de Campinas),
Claudio Lucchesi (IC-UNICAMP) |
| Convergence Time to Nash Equilibrium in Selfish Bin Packing | André Vignatti (UNICAMP),
Flávio Miyazawa (IC-UNICAMP) |
| Note on strong refutation algorithms for random k-SAT formulas | Hiep Han (Humboldt-Universität zu Berlin),
Yury Person (Humboldt-Universität zu Berlin),
Mathias Schacht (Humboldt-Universität zu Berlin) |
| Optimization throughput, service rate, and buffer allocation in finite queueing networks | Frederico Cruz (Federal University of Minas Gerais) |
| Mixed Binary Euclid Algorithm | Sidi Mohamed Sedjelmaci (University of Paris 13 Villetaneuse, LIPN CNRS UMR 7030) |
| Acyclic Vertex Coloring of Graphs of Maximum Degree 6 | Satish Varagani (International Institute of Information Technology, Hyderabad),
Kishore Yadav (International Institute of Information Technology, Hyderabad),
Kishore Kothapalli (International Institute of Information Technology, Hyderabad),
Venkaiah Vadlamudi (International Institute of Information Technology, Hyderabad) |
| A Note on Permutation Regularity |
Rudini Sampaio (Universidade Federal de Ceará),
Carlos Hoppen (Universidade de São Paulo),
Yoshiharu Kohayakawa (Universidade de Sao Paulo) |
| Cycle transversals in bounded degree graphs | Marina Groshaus (Universidad de Buenos Aires),
Pavol Hell (Simon Fraser University),
Sulamita Klein (UFRJ),
Loana Nogueira (UFF),
Fabio Protti (Universidade Federal Fluminense) |
| A polyhedral study of the maximum edge subgraph problem | Flavia Bonomo (Universidad de Buenos Aires),
Javier Marenco (University of Buenos Aires),
Daniela Saban (National University of General Sarmiento),
Nicolás Stier-Moses (Columbia University) |
| On Q-spectral integral variation | Maria Aguieiras (IM-UFRJ),
Renata Del-Vecchio (Universidade Federal Fluminense),
Steve Kirkland (University of Regina),
Nair Abreu (Universidade Federal do Rio de Janeiro) |
|
B-coloring of m-tight graphs | Leonardo Sampaio (Federal University of Ceará),
Claudia Linhares Sales (Universidade Federal do Ceará) |
| On coloring problems with local constraints | Flavia Bonomo (Universidad de Buenos Aires),
Yuri Faenza (Universita di Roma "Tor Vergata"),
Gianpaolo Oriolo (Universita di Roma "Tor Vergata") |
| On s-t paths and trails in edge-colored graphs |
Laurent Gourvès (Université Paris Dauphine, LAMSADE),
Adria Lyra (UFF),
Carlos Alberto Martinhon (Universidade Federal Fluminense),
Jérôme Monnot (Université Paris Dauphine, LAMSADE),
Fabio Protti (Universidade Federal Fluminense) |
| Distance-Hereditary Comparability Graphs | Gabriele Di Stefano (University of L'Aquila) |
| A Characterization of Graphs with Fractional Total Chromatic Number Equal to Delta + 2 | Takehiro Ito (Graduate School of Information Sciences, Tohoku University),
William Kennedy (McGill University),
Bruce Reed (McGill University) |
| The number of convergent graphs under the biclique operator with no twin vertices is finite |
Leandro Montero (Universidad de Buenos Aires),
Marina Groshaus (Universidad de Buenos Aires) |
| Short Models for Unit Interval Graphs | Min-Chih Lin (Universidade de Buenos Aires),
Francisco Soulignac (Universidad de Buenos Aires),
Jayme Szwarcfiter (Universidade Federal do Rio de Janiero (UFRJ)) |
| Impartial Solitaire Clobber played on Powers of Paths |
Telma Para (Universidade Federal do Rio de Janeiro),
Sylvain Gravier (Institut Joseph Fourier),
Simone Dantas (Universidade Federal Fluminense) |
| A Concurrent Implementation of Skip Graphs | Hammurabi Mendes (Universidade de São Paulo),
Cristina Fernandes (University of São Paulo) |
| On the basis graph of a bicolored matroid | Ana Paulina Figueroa (Universidad Autonoma Metropolitana), Eduardo Rivera-Campo (Universidad Autonoma Metropolitana) |
| Good edge-labelling of graphs | Júlio César Araújo (Universidade Federal do Ceará),
Nathann Cohen (University of Nice-Sophia Antipolis),
Frédéric Giroire (CNRS),
Frederic Havet (CNRS & INRIA Sophia-Antipolis) |
|
b-chromatic Number of Cacti | Ana Silva (Université Joseph Fourier),
Victor Campos (Universidade Federal do Ceará),
Claudia Linhares Sales (Universidade Federal do Ceará),
Frédéric Maffray (IMAG) |
|
Clique-coloring circular-arc graphs | Márcia Cerioli (Universidade Federal do Rio de Janeiro),
André Korenchendler (Universidade Federal do Rio de Janeiro) |
| Minimum Sum Coloring of $P_4$-sparse graphs | Flavia Bonomo (Universidad de Buenos Aires),
Mario Valencia-Pabon (LIPN, Universite Paris-Nord) |
| On L(2,1)-coloring split, chordal bipartite and weakly chordal graphs | Márcia Cerioli (Universidade Federal do Rio de Janeiro),
Daniel Posner (Universidade Federal do Rio de Janeiro) |
| Boltzmann sampling of ordered structures |
Olivier Roussel (Université Pierre et Marie Curie),
Michèle Soria (Université Pierre et Marie Curie) |
| The chromatic number of random lifts of $K_5\setminus e$ | Dirk Oliver Theis (Universite Libre de Bruxelles),
Babak Farzad (Brock University) |
| The exact weighted independent set problem in perfect graphs and related classes | Martin Milanic (University of Primorska),
Jérôme Monnot (Université Paris Dauphine, LAMSADE) |
| Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals |
Mitre Dourado (Universidade Federal Rural do Rio de Janeiro),
Rodolfo de Oliveira (Universidade Federal do Rio de Janeiro),
Fabio Protti (Universidade Federal Fluminense) |
| Degree Sequence of Tight Distance Graphs | Jose Zamora (Departamento de Matematicas, Universidad Andres Bello),
Martin Matamala (Universidad de Chile) |
| Almost spanning subgraphs of random graphs after adversarial edge removal |
Julia Boettcher (Technische Universitaet Muenchen),
Yoshiharu Kohayakawa (Universidade de Sao Paulo),
Anusch Taraz (Technische Universität München) |
| On the clique behavior of circulants with three small jumps | Francisco Larrión (UNAM),
Miguel Pizaña (Universidad Autónoma Metropolitana (Iztapalapa)),
Rafael Villarroel-Flores (Universidad Autónoma del Estado de Hidalgo) |
| A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives |
Laura Bahiense (COPPE-Produção / UFRJ),
Yuri Frota (University of Campinas (UNICAMP)),
Nelson Maculan (Federal University of Rio de Janeiro (UFRJ)),
Thiago Noronha (PUC-Rio),
Celso Ribeiro (Instituto de Computação (UFF)) |
| Intersection Dimension and Maximum Degree |
Aravind Natarajan (The Institute of Mathematical Sciences),
Chinthamani Subramanian (Institute of Mathematical Sciences) |
| A Set Partitioning Approach to Shunting | Carlos Cardonha (Technische Universität Berlin) |
