default search action
Discrete Applied Mathematics, Volume 210
Volume 210, September 2016
- José Correa, Guillermo Durán, Luérbio Faria, Miguel A. Pizaña, Gelasio Salazar:
Preface: LAGOS'13: Seventh Latin-American Algorithms, Graphs, and Optimization Symposium, Playa del Carmen, México - 2013. 1-3 - Vítor Costa, Simone Dantas, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
Slash and burn on graphs - Firefighting with general weights. 4-13 - Laureano F. Escudero
, Susana Muñoz:
A survey-based approach for designing the lines of a rapid transit network. 14-34 - József Balogh, Michelle Delcourt, Bernard Lidický
Rainbow copies of C4 in edge-colored hypercubes. 35-37 - Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira
Clique cycle-transversals in distance-hereditary graphs. 38-44 - Andrea Jiménez
Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations. 45-60 - Joe Sawada, Aaron Williams:
Greedy flipping of pancakes and burnt pancakes. 61-74 - Cristina G. Fernandes
Repetition-free longest common subsequence of random sequences. 75-87 - Gilberto Calvillo, David Romero:
On the closest point to the origin in transportation polytopes. 88-102 - Nicolas Nisse, Ronan Pardo Soares:
On the monotonicity of process number. 103-111 - Emilio Vital Brazil, Celina M. H. de Figueiredo
The cost of perfection for matchings in graphs. 112-122 - Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow:
Diffuse reflection diameter in simple polygons. 123-132 - Sarah Miracle, Dana Randall:
Algorithms to approximately count and sample conforming colorings of graphs. 133-149 - Mohammed Lalou
Component-cardinality-constrained critical node problem in graphs. 150-163 - Natalia García-Colín, Amanda Montejano
Exploring the concept of perfection in 3-hypergraphs. 164-170 - Júlio Araújo
Hull number: P5-free graphs and reduction rules. 171-175 - Silvia M. Bianchi, Mariana S. Escalante, M. S. Montelar:
Lift-and-project ranks of the stable set polytope of joined a-perfect graphs. 176-184 - Kathie Cameron, Steven Chaplick
Edge intersection graphs of L-shaped paths in grids. 185-194 - Jorge L. Arocha, Amanda Montejano
Null and non-rainbow colorings of projective plane and sphere triangulations. 195-199 - Jonathan Chappelon
On Ramsey numbers of complete graphs with dropped stars. 200-206 - Deepan Basu, Kinjal Basu, Bhaswar B. Bhattacharya, Sandip Das:
Almost empty monochromatic triangles in planar point sets. 207-213 - Paola B. Tolomei, Luis Miguel Torres
Generalized minor inequalities for the set covering polyhedron related to circulant matrices. 214-222 - Manoel B. Campêlo
A polyhedral study of the maximum stable set problem with weights on vertex-subsets. 223-234 - Hortensia Galeana-Sánchez, Mucuy-kak Guevara
Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs. 235-245 - M. Gisela Bardossy, S. Raghavan
Approximate robust optimization for the Connected Facility Location problem. 246-260 - Pablo De Caria, Marisa Gutierrez:
On basic chordal graphs and some of its subclasses. 261-276 - Mitre Costa Dourado, Vinícius Gusmão Pereira de Sá, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Near-linear-time algorithm for the geodetic Radon number of grids. 277-283 - Jorge Luis Ramírez Alfonsín, Serge Tishchenko:
Edge separators for quasi-binary trees. 284-289 - Andréia C. S. Gusmão, Letícia Rodrigues Bueno
A note on the middle levels problem. 290-296
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-26 00:54 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: