default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 245
Volume 245, August 2018
- Manoel B. Campêlo, Thomas M. Liebling, Rudini Menezes Sampaio
:
Preface: LAGOS'15 - Eighth Latin-American Algorithms, Graphs, and Optimization Symposium, Fortaleza, Brazil - 2015. 1-3 - Javier Marenco:
The caterpillar-packing polytope. 4-15 - Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Katrin Wagler:
Polyhedra associated with identifying codes in graphs. 16-27 - Ricardo C. Corrêa, Diego Delle Donne, Ivo Koch, Javier Marenco:
General cut-generating procedures for the stable set polytope. 28-41 - David Fernández-Baca, Sudheer Vakati:
On compatibility and incompatibility of collections of unrooted phylogenetic trees. 42-58 - Bastien Cazaux, Eric Rivals:
Relationship between superstring and compression measures: New insights on the greedy conjecture. 59-64 - Carlos Eduardo Ferreira, Álvaro Junio Pereira Franco:
A min-max relation in flowgraphs and some applications. 65-76 - Carlos Vinícius G. C. Lima, Leonardo I. L. Oliveira, Valmir C. Barbosa, Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
A computational study of f-reversible processes on graphs. 77-93 - Michael R. Fellows, Fábio Protti, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza:
Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number. 94-100 - Hélio B. Macêdo Filho, Celina M. H. de Figueiredo, Z. Li, Raphael Machado:
Using SPQR-trees to speed up recognition algorithms based on 2-cutsets. 101-108 - Bi Li, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan:
Minimum size tree-decompositions. 109-127 - Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi:
Decomposing highly connected graphs into paths of length five. 128-138 - Liliana Alcón, Noemí Gudiño, Marisa Gutierrez:
Recent results on containment graphs of paths in a tree. 139-147 - Danilo Artigas, R. Sritharan:
On the contour of bipartite graphs. 148-154 - Júlio Araújo, Frédéric Havet, Mathieu Schmitt:
Steinberg-like theorems for backbone colouring. 155-167 - Guillermo Durán, Fernando Fernández Slezak, Luciano N. Grippo, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
Recognition and characterization of unit interval graphs with integer endpoints. 168-176 - Flavia Bonomo, Ivo Koch, Pablo Daniel Torres, Mario Valencia-Pabon:
k-tuple colorings of the Cartesian product of graphs. 177-182 - Alesom Zorzi, Leandro M. Zatesko:
On the chromatic index of join graphs and triangle-free graphs with large maximum degree. 183-189 - Jing Huang:
Non-edge orientation and vertex ordering characterizations of some classes of bigraphs. 190-193 - Martín Matamala, José Zamora:
Weighted antimagic labeling. 194-201 - Victor A. Campos, Raul Lopes:
A proof for a conjecture of Gorgol. 202-207 - Ricardo Cordeiro Corrêa, Carlos Hoppen, Rudini Menezes Sampaio:
Limits of k-dimensional poset sequences. 208-219 - David Pokrass Jacobs, Vilmar Trevisan, Fernando Tura:
Eigenvalue location in cographs. 220-235 - Bruno Courcelle:
Fly-automata for checking MSO2 graph properties. 236-252 - Norie Fu, Takafumi Shibuta:
An algebraic algorithm for solving parametric integer programs. 253-264
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-10-02 20:33 CEST 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:
