default search action
10th LAGOS 2019: Belo Horizonte, Brazil
- Gabriel Coutinho, Yoshiharu Kohayakawa, Vinícius Fernandes dos Santos, Sebastián Urrutia:
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2019, Belo Horizonte, Brazil, June 2-7, 2019. Electronic Notes in Theoretical Computer Science 346, Elsevier 2019 - Gabriel Coutinho, Yoshiharu Kohayakawa, Vinícius Fernandes dos Santos, Sebastián Urrutia:
Preface. 1-2 - Fabio Henrique N. Abe, Edna Ayako Hoshino, Alessandro Hill
, Roberto Baldacci
A Branch-and-Price Algorithm for the Ring-Tree Facility Location Problem. 3-14 - Liliana Alcón, Marisa Gutierrez, Martin Milanic:
A Characterization of Claw-free CIS Graphs and New Results on the Order of CIS Graphs. 15-27 - Alexsandro Oliveira Alexandrino, Guilherme Henrique Santos Miranda, Carla Negri Lintzmayer
Approximation Algorithms for Sorting Permutations by Length-Weighted Short Rearrangements. 29-40 - José D. Alvarado, Simone Dantas, Rodrigo Marinho
On Adjacent-vertex-distinguishing Total Colourings of Powers of Cycles, Hypercubes and Lattice Graphs. 41-51 - Camila Araujo, Júlio Araújo
Backbone Coloring of Graphs with Galaxy Backbones. 53-64 - Paulo Henrique Macêdo de Araújo
The Geodesic Classification Problem on Graphs. 65-76 - Júlio Araújo
Hull and Geodetic Numbers for Some Classes of Oriented Graphs. 77-88 - Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar
Anti-Ramsey Threshold of Cycles for Sparse Graphs. 89-98 - Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler
Recognizing Graph Search Trees. 99-110 - Julien Bensmail, Fionn Mc Inerney
Metric Dimension: from Graphs to Oriented Graphs. 111-123 - João Pedro W. Bernardi, Murilo V. G. da Silva, André Luiz Pires Guedes
The Chromatic Index of Proper Circular-arc Graphs of Odd Maximum Degree which are Chordal. 125-133 - Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Wagler:
The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations. 135-145 - Silvia M. Bianchi, Graciela L. Nasini, Paola B. Tolomei, Luis Miguel Torres
Circuits and Circulant Minors. 147-158 - Etienne Birmelé, Fabien de Montgolfier, Léo Planche:
On the Minimum Eccentricity Isometric Cycle Problem. 159-169 - Fábio Botler
On Tuza's Conjecture for Triangulations and Graphs with Small Treewidth. 171-183 - Fábio Botler
On Computing the Path Number of a Graph. 185-197 - Mónica Braga
Facet-generating Procedures for the Maximum-impact Coloring Polytope. 199-208 - André Ebling Brondani, Carla Silva Oliveira
Aα-Spectrum of a Firefly Graph. 209-219 - Sebastián Bustamante, Daniel A. Quiroz
Large Immersions in Graphs with Independence Number 3 and 4. 221-228 - Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau
Adapting The Directed Grid Theorem into an FPT Algorithm. 229-240 - Márcia R. Cappelle, Erika M. M. Coelho, Hebert Coelho, Lucia Draque Penso, Dieter Rautenbach:
Identifying Codes in the Complementary Prism of Cycles. 241-251 - Márcia R. Cappelle, Erika M. M. Coelho, Les R. Foulds, Humberto J. Longo
Open-independent, Open-locating-dominating Sets in Complementary Prism Graphs. 253-264 - Pablo De Caria:
Families of Induced Trees and Their Intersection Graphs. 265-274 - Marcel Kenji de Carli Silva, Gabriel Coutinho, Chris D. Godsil, David E. Roberson
Algebras, Graphs and Thetas. 275-283 - Moisés T. Carvalho, Simone Dantas, Mitre Costa Dourado, Daniel F. D. Posner, Jayme Luiz Szwarcfiter:
On the Computational Complexity of the Helly Number in the P3 and Related Convexities. 285-297 - Márcia R. Cerioli, Cristina G. Fernandes
On Edge-magic Labelings of Forests. 299-307 - Márcia R. Cappelle, Erika M. M. Coelho, Hebert Coelho, Braully R. Silva, Fábio Protti, Uéverton S. Souza
P3-Hull Number of Graphs with Diameter Two. 309-320 - Ricardo C. Corrêa, Manuela Blaum, Javier Marenco, Ivo Koch, Marcelo Mydlarz:
An Integer Programming Approach for the 2-class Single-group Classification Problem. 321-331 - Eurinardo Rodrigues Costa, Victor Lage Pessoa, Rudini Menezes Sampaio
PSPACE-hardness of Two Graph Coloring Games. 333-344 - Gabriel Coutinho, Rafael Grandsire, Célio Passos:
Colouring the Normalized Laplacian. 345-354 - Fernanda Couto
Hardness and Efficiency on Minimizing Maximum Distances for Graphs With Few P4's and (k, ℓ)-graphs. 355-367 - Yingjun Dai, Angèle M. Foley, Chính T. Hoàng:
On Coloring a Class of Claw-free Graphs: To the memory of Frédéric Maffray. 369-377 - Ana Paula dos Santos Dantas, Cid Carvalho de Souza, Zanoni Dias:
A GRASP for the Convex Recoloring Problem in Graphs. 379-391 - Simone Dantas, Celina M. H. de Figueiredo, Priscila Petito, Rafael B. Teixeira:
A General Method for Forbidden Induced Subgraph Sandwich Problem NP-completeness. 393-400 - Maria Patricia Dobson, Valeria A. Leoni, Maria Inés Lopez Pujato:
Tuple Domination on Graphs with the Consecutive-zeros Property. 401-411 - Ezequiel Dratman
Computing the Determinant of the Distance Matrix of a Bicyclic Graph. 413-423 - François Dross, Frédéric Havet:
On the Unavoidability of Oriented Trees. 425-436 - Alexandre Frias Faria, Sérgio Ricardo de Souza, Elisangela Martins de Sá
Variable Neighborhood Descent Branching applied to the Multi-Way Number Partitioning Problem. 437-447 - Islame F. C. Fernandes, Sílvia M. D. M. Maia, Elizabeth Ferreira Gouvea Goldbarg, Marco César Goldbarg:
A Multi-agent Transgenetic Algorithm for the Bi-objective Spanning Tree Problem. 449-460 - Ana Luísa C. Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier:
On Caterpillars of Game Chromatic Number 4. 461-472 - Valentin Gledel, Vesna Irsic, Sandi Klavzar:
Fast Winning Strategies for the Maker-Breaker Domination Game. 473-484 - Luis Gustavo da Soledade Gonzaga
Sigma Coloring on Powers of Paths and Some Families of Snarks. 485-496 - Marina Groshaus, André Luiz Pires Guedes
Subclasses of Circular-Arc Bigraphs: Helly, Normal and Proper. 497-509 - Carlos Hoppen
Remarks on an Edge-coloring Problem. 511-521 - Carlos Hoppen
Total Domination in Regular Graphs. 523-533 - Carlos Hoppen
Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges. 535-544 - Andrea Jiménez
Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete. 545-556 - Ivo Koch, Javier Marenco:
The 2D Subarray Polytope. 557-566 - Eduardo Sany Laber, Lucas Murtinho:
Minimization of Gini Impurity: NP-completeness and Approximation Algorithm via Connections with the k-means Problem. 567-576 - Sylvain Legay, Leandro Montero:
On the Iterated Edge-Biclique Operator. 577-587 - Carla Negri Lintzmayer
Quasilinear Approximation Scheme for Steiner Multi Cycle in the Euclidean plane. 589-601 - Carla Negri Lintzmayer
Decomposing Split Graphs into Locally Irregular Graphs. 603-612 - Mauro Lucci, Graciela L. Nasini, Daniel Severín
A Branch and Price Algorithm for List Coloring Problem. 613-624 - Lívia Salgado Medeiros, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
Two Problems on Interval Counting. 625-643 - Richard Mycroft, Tássio Naia
Spanning Trees of Dense Directed Graphs. 645-654 - Farley Soares Oliveira, Hidefumi Hiraishi, Hiroshi Imai:
FPT Algorithms to Enumerate and Count Acyclic and Totally Cyclic Orientations. 655-666 - Breno Piva
Approximations for Restrictions of The Budgeted and Generalized Maximum Coverage Problems. 667-676 - Allen Ibiapina, Ana Silva
Graphs with Girth at Least 8 are b-continuous. 677-684 - Anderson G. da Silva, Simone Dantas, Diana Sasaki:
Equitable Total Chromatic Number of Kr×p for p Even. 685-697 - Mauro Roberto Costa da Silva, Rafael C. S. Schouery
A Polynomial-time Approximation Scheme for the MAXSPACE Advertisement Problem. 699-710 - Luiz Alberto do Carmo Viana, Manoel B. Campêlo
The Generalized Dependency Constrained Spanning Tree Problem. 711-723 - Celso A. Weffort-Santos, C. N. Campos
On the Complexity of Gap-[2]-vertex-labellings of Subcubic Bipartite Graphs. 725-734 - Lucas R. Yoshimura, Maycon Sambinelli
Linial's Conjecture for Arc-spine Digraphs. 735-746 - Alesom Zorzi, Celina M. H. de Figueiredo, Raphael Machado, Uéverton S. Souza
Even-power of Cycles With Many Vertices are Type 1 Total Colorable. 747-758
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-04 20:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: