|
SLIDES – NOTES |
|
Wiebke Bedenknecht (Universitat Hamburg) On the local density problem for graphs of given odd-girth (pdf)
Silvia María Bianchi (Universidad Nacional de Rosario) A Linear-Time Algorithm for the identifying code problem on block graphs (pdf)
Rafael Castro de Andrade (Universidade Federal do Ceará)
Camile Frazão Bordini (Federal University of Paraná) An Approximation Algorithm for the p-Hub Median Problem (pdf)
Fabio Botler (Universidad de Valparaiso) Gallai’s Conjecture for graphs with treewidth 3 (pdf)
Arman Boyaci (Bogazici University) Weighted Upper Domination (pdf)
Andreas Brandstädt (University of Rostock) On Efficient Domination for Some Classes of H–Free Chordal Graphs (pdf)
Rafael Castro de Andrade (Universidade Federal do Ceará) Minimum Linear Arrangements (pdf)
Maria Chudnovsky (Princeton University) Coloring graphs with forbidden induced paths (pdf)
Luana Cordeiro (Universidade Federal Fluminense) On Type 2 Snarks and Dot Products (pdf)
Pablo De Caria (Universidad Nacional de La Plata) On the recognition of neighborhood inclusion posets (pdf)
Rosiane De Freitas (Federal University of Amazonas , Manaus) Facet-inducing inequalities and a cut-and-branch algorithm for the bandwidth coloring polytope based on orientation model (pdf)
Murilo S. de Lima (University of Campinas) On Generalizations of the Parking Permit Problem and Network Leasing Problems (pdf)
Renata R. Del-Vecchio (Universidade Federal Fluminense) Sufficient Conditions for Hyper-Hamiltonicity in Graphs (pdf)
Antoine Deza (Université Paris Sud) Computational determination of the largest lattice polytope diameter (pdf)
Christoph Dürr (Université Paris 6) An Adversarial Model for Scheduling with Testing (pdf)
Mariana Escalante (CONICET- Universidad Rosario) The Minimum Chromatic Violation Problem: A polyhedral Approach (pdf)
Alvaro Javier Fuentes Suarez (INRIA – Sophia Antipolis) Scaffolding skeletons using spherical Voronoi diagrams (pdf)
Celina Figueiredo (Universidade Federal do Rio de Janeiro) Complexity-separating graph classes for vertex, edge and total coloring (pdf)
Isidoro Gitler (CINVESTAV) Delta-Wye Transformations and the Efficient Reduction of Almost-Planar Graphs (pdf)
Luciano Grippo (Universidad Nacional General Sarmiento) On graphs with a single large Laplacian eigenvalue (pdf)
Andre Guedes (Universidade Federal do Paraná) Biclique graph of bipartite permutation graphs (pdf)
Frédéric Havet (Université Nice Sophia Antipolis) Minimum density of identifying codes of king grids (pdf)
Pavol Hell (Simon Fraser University) Correspondence Homomorphisms (pdf)
César Hernandez-Cruz (Universidad Nacional Autónoma México) k-quasi-transitive digraphs of large diameter (pdf)
Lucas Isenmann (LIRMM Montpellier) Möbius Stanchion Systems (pdf)
Marcos Kiwi (Universidad de Chile) Random Hyperbolic Graphs (pdf)
Olga Kuryatnikova (Tilburg University) Upper bounds on the kissing number via copositive programming (pdf)
Monique Laurent (CWI Amsterdam) Combinatorial and algorithmic properties of Robinson matrices (pdf)
Ngoc Khang Le (ENS de Lyon) Detecting an induced subdivision of K4 (pdf)
Tien-Nam Le (ENS de Lyon) Locally self-avoiding Eulerian graphs (pdf)
Orlando Lee (University of Campinas) A 3-approximation algorithm for the maximum leaf k-forest problem (pdf)
William Lochet (Université Côte d’Azur) Bispindle in strongly connected digraphs with large chromatic number (pdf)
Cláudia Linhares Sales (Federal University of Ceará) b-colorings: an structural overview (pdf)
Nelson Maculan (Federal University Rio (UFRJ) Our Colleagues Tom and Jayme (pdf)
Ruxandra Marinescu-Ghemeci (University of Bucharest) On the (di)graphs with (directed) proper connection number two (pdf)
Rodrigo Marinho (Universidade Federal Fluminense) The Solitaire Clobber game and correducibility (pdf)
Alexandre X. Martins (University of Ouro Preto) A column generation approach for the Strong Network Orientation Problem (pdf)
Martin Matamala (Universidad de Chile) Universal Antimagic Graphs (pdf)
Alexsander Melo (Federal University of Rio de Janeiro) Simple Undirected Two-Commodity Integral Flow with a Unitary Demand (pdf)
Martin Milanic (University of Primorska) Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth’s theorem (pdf)
Luis Pedro Montejano (CIMAT) Ramsey for complete graphs with a dropped edge or a triangle (pdf)
Phablo F. S. Moura (Universidade Estadual de Campinas) Strong intractability of generalized convex recoloring problems (pdf)
Nicolas Nisse (Université Côte d’Azur) Recovery of disrupted airline operations using k-Maximum Matching in graphs (pdf)
Mayara Midori Omai (Universidade do Paraná) Adjacent Vertex Distinguishing Edge Coloring on Powers of Paths (pdf)
Irena Penev (University of Leeds) Clique-cutsets beyond chordal graphs (pdf)
Lucia Draque Penso (Ulm University) The Geodetic Hull Number is Hard for Chordal Graphs (pdf)
Henri Perret du Cray (Université Clermont Auvergne) Bounds on Directed star arboricity in some digraph classes (pdf)
HongPhong Pham (Université Paris Sud) Tropical matchings in vertex-colored graphs (pdf)
Christophe Picouleau (CNAM-PARIS) Reducing the Chromatic Number by Vertex or Edge Deletions (pdf)
José Wilson Pinto (Federal University of Rio de Janeiro) Constant Threshold Intersection Graphs of Orthodox Paths in Trees (pdf)
Rafael Veiga Pocai (University of São Paulo) Inapproximability Ratios for Crossing Number (pdf)
Dieter Rautenbach (Universität Ulm) Restricted Types of Matchings (pdf)
Gabriela Ravenna (Universidad Nacional de La Plata- CONICET) On the Existence of Critical Clique-Helly Graphs (pdf)
Ismael Robles (Universidad Autónoma Metropolitana. México) On cliques and bicliques (pdf)
Martin D. Safe (Universidad Nacional del Sur) Forbidden subgraphs of some graphs representable by arcs on a circle (pdf)
Maycon Sambinelli (University of Campinas) Advances in Aharoni-Hartman-Homan’s Conjecture for Split digraphs (pdf)
Ignasi Sau (LIRMM Montpellier) Ruling out FPT algorithms for Weighted Coloring on forests (pdf)
Lex Schrijver (University of Amsterdam) The partially disjoint paths problem (pdf)
Daniel Severin (National University of Rosario) Facets of the polytope of legal sequences (pdf)
Ana Silva (Universidade Federal do Ceará) The lexicographic product of some chordal graphs and of cographs preserves b-continuity (pdf)
Rubens Sucupira (Universidade do Estado do Rio) Maximum Cuts in Edge Colored Graphs (pdf)
Annegret K. Wagler (Université Clermont Auvergne) Fleet management for autonomous vehicles using fows in time-expanded networks (pdf)
Jiawei Wang (University of California) Structure and Interpretation of Dual-Feasible Functions (pdf)