default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Notes in Discrete Mathematics, Volume 50
Volume 50, December 2015
- Manoel B. Campêlo, Ricardo C. Corrêa
, Cláudia Linhares Sales, Rudini M. Sampaio:
Preface - VIII Latin-american Algorithms, Graphs and Optimization Symposium. 1-2 - Bruno Courcelle:
Fly-automata for checking monadic second-order properties of graphs of bounded tree-width. 3-8 - Márcio Antônio Duarte, Felix Joos, Lucia Draque Penso, Dieter Rautenbach, Uéverton dos Santos Souza:
On Graphs with Induced Matching Number Almost Equal to Matching Number. 9-14 - Jon Lee, Daphne E. Skipper:
An algebraic-perturbation variant of Barvinok's algorithm. 15-20 - Bi Li, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan:
Minimum Size Tree-decompositions. 21-27 - Andres J. Ruiz-Vargas:
Many disjoint edges in topological graphs. 29-34 - Uéverton dos Santos Souza, Frances A. Rosamond, Michael R. Fellows, Fábio Protti, Maise Dantas da Silva:
The Flood-It game parameterized by the vertex cover number. 35-40 - Renata R. Del-Vecchio, David Pokrass Jacobs, Vilmar Trevisan, Cybele T. M. Vinagre:
Diagonalization of generalized lollipop graphs. 41-46 - Javier Marenco:
The caterpillar-packing polytope. 47-52 - Cristina G. Fernandes, Marcio T. I. Oshiro:
Trajectory clustering of points in R. 53-58 - Rafael S. Coelho, Phablo F. S. Moura, Yoshiko Wakabayashi:
The k-hop connected dominating set problem: hardness and polyhedra. 59-64 - L. Elisa Celis, Filip Pavetic, Brunella Spinelli, Patrick Thiran:
Budgeted sensor placement for source localization on trees. 65-70 - Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz:
Approximating Minimum k-Section in Trees with Linear Diameter. 71-76 - Samuel Nascimento, Rudini Menezes Sampaio:
Roman domination in subgraphs of grids. 77-82 - Atílio G. Luiz, C. N. Campos, Simone Dantas, Diana Sasaki:
The 1, 2-Conjecture for powers of cycles. 83-88 - Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Katrin Wagler:
A polyhedral approach to locating-dominating sets in graphs. 89-94 - Sandip Das, Swathyprabhu Mj, Sagnik Sen:
On oriented relative clique number. 95-101 - Pierre Aboulker, Zhentao Li, Stéphan Thomassé:
Excluding clocks. 103-108 - Carlos E. Ferreira, Álvaro Junio Pereira Franco:
A min-max relation in flowgraphs. 109-114 - Valeria A. Leoni, Maria Patricia Dobson, Erica G. Hinrichsen:
NP-completeness of the {k}-packing function problem in graphs. 115-120 - Nicolas Almeida Martins, Rudini Menezes Sampaio:
Inapproximability of the lid-chromatic number. 121-126 - Martín Matamala, José Zamora:
Weighted antimagic labeling: an algorithmic approach. 127-132 - Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos:
Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs. 133-138 - Cláudia Linhares Sales, Rafael Vargas, Leonardo Sampaio Rocha:
b-continuity and the lexicographic product of graphs. 139-144 - Liliana Alcón, Marisa Gutierrez, Glenn Hurlbert:
Pebbling in 2-Paths. 145-150 - Mário César San Felice, Sin-Shuen Cheung, Orlando Lee, David P. Williamson:
The Online Prize-Collecting Facility Location Problem. 151-156 - Jing Huang, Josh Manzer:
Chronological Rectangle Digraphs. 157-162 - Fábio Botler, Andrea Jiménez:
On path decompositions of 2k-regular graphs. 163-168 - Celina M. H. de Figueiredo, Hélio B. Macêdo Filho, Z. Li, Raphael Carlos Santos Machado, Nicolas Trotignon:
Using SPQR-trees to speed up algorithms based on 2-cutset decompositions. 169-174 - Liliana Alcón, Noemí Gudiño, Marisa Gutierrez:
On containment graphs of paths in a tree. 175-180 - Graciela L. Nasini, Pablo Daniel Torres:
Some links between identifying codes and separating, dominating and total dominating sets in graphs. 181-186 - A. C. Ribeiro, Luis A. B. Kowada, Franklin L. Marquezino, Celina M. H. de Figueiredo:
A new reversible circuit synthesis algorithm based on cycle representations of permutations. 187-192 - André Breda Carneiro, Cândida Nunes da Silva, Brendan D. McKay:
A Faster Test for 4-Flow-Criticality in Snarks. 193-198 - Breno Lima de Freitas, Cândida Nunes da Silva, Cláudio Leonardo Lucchesi:
Hypohamiltonian Snarks Have a 5-Flow. 199-204 - Marcio Felix Reis, Orlando Lee, Fábio Luiz Usberti:
Flow-based formulation for the maximum leaf spanning tree problem. 205-210 - Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi:
Decompositions of highly connected graphs into paths of length five. 211-216 - Eduardo A. Canale, Claudio E. Risso:
Optimal Edge Fault-Tolerant Bijective Embedding of a Complete Graph over a Cycle. 217-222 - Júlio Araújo, Frédéric Havet, Mathieu Schmitt:
Steinberg-like theorems for backbone colouring. 223-229 - Mitre Costa Dourado, Carlos Vinícius G. C. Lima, Jayme Luiz Szwarcfiter:
On f-Reversible Processes on Graphs. 231-236 - Danilo Artigas, R. Sritharan:
Geodeticity of the contour of chordal bipartite graphs. 237-242 - Flavia Bonomo, Ivo Koch, Pablo Daniel Torres, Mario Valencia-Pabon:
k-tuple chromatic number of the cartesian product of graphs. 243-248 - Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, María Pía Mazzoleni, Bernard Ries, Mario Valencia-Pabon:
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. 249-254 - Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri:
Computing an Evolutionary Ordering is Hard. 255-260 - Ricardo C. Corrêa, Javier Marenco, Diego Delle Donne, Ivo Koch:
A Strengthened General Cut-Generating Procedure for the Stable Set Polytope. 261-266 - Breno Piva, Cid C. de Souza:
Partitions of Rectilinear Polygons with Minimum Stabbing Number. 267-273 - Carlos Hoppen, Hanno Lefmann, Knut Odermann, Juliana Sanches:
Edge-colorings avoiding fixed rainbow stars. 275-280 - Pascal Halffmann, Sven O. Krumke, Alain Quilliot, Annegret Katrin Wagler, Jan-Thierry Wegener:
On the Online Min-Wait Relocation Problem. 281-286 - Dimbinaina Ralaivaosaona, S. M. O. H. Taha:
On the average path length of a cycle plus random edges. 287-292 - Marina Groshaus, Leandro Montero:
Tight lower bounds on the number of bicliques in false-twin-free graphs. 293-298 - Norie Fu, Takafumi Shibuta:
An algorithm for solving parametric integer program. 299-305 - Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
Efficient and Perfect domination on circular-arc graphs. 307-312 - Oliver Schaudt, Maya Stein:
Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles. 313-318 - Pablo De Caria, Miguel A. Pizaña:
On second iterated clique graphs that are also third iterated clique graphs. 319-324 - Luis Miguel Torres:
Minor related row family inequalities for the set covering polyhedron of circulant matrices. 325-330 - Fabio Henrique N. Abe, Edna Ayako Hoshino, Alessandro Hill:
The Ring Tree Facility Location Problem. 331-336 - Sudheer Vakati, David Fernández-Baca:
Compatibility, Incompatibility, Tree-Width, and Forbidden Phylogenetic Minors. 337-342 - Marco Blanco, Ralf Borndörfer, Michael Brückner, Nam-Dung Hoang, Thomas Schlechte:
On the Path Avoiding Forbidden Pairs Polytope. 343-348 - Ago-Erik Riet, Jonathan D. Lee:
Graph Saturation Games. 349-354 - Samuel Souza Brito, Haroldo Gambini Santos, Marcus Poggi:
A Computational Study of Conflict Graphs and Aggressive Cut Separation in Integer Programming. 355-360 - Mitre Costa Dourado, Luciano N. Grippo, Martín Darío Safe:
On the hereditary (p, q)-Helly property of hypergraphs, cliques, and bicliques. 361-366 - Victor A. Campos, Raul Lopes:
A Proof for a Conjecture of Gorgol. 367-372 - Tetsuya Araki, Norie Fu:
On Rotational Symmetries of Drawings of Coherent Periodic Graphs. 373-378 - Omid Atabati, Babak Farzad:
A hierarchical network formation model. 379-384 - Jonathan Chappelon, Luis Pedro Montejano, Jorge L. Ramírez Alfonsín, Leonardo Martínez-Sandoval, Luis Montejano:
Kneser Transversals. 385-390 - Carlos A. Alfaro, Carlos E. Valencia:
Graphs with few trivial critical ideals. 391-396 - Jorge Alencar, Tibérius O. Bonates, Carlile Lavor, Leo Liberti:
An algorithm for realizing Euclidean distance matrices. 397-402 - Fabrício Benevides, Victor A. Campos, Mitre Costa Dourado, Ana Silva:
Complexity of determining the maximum infection time in the geodetic convexity. 403-408 - Babak Farzad, Asiyeh Sanaei:
Three-colourability of planar graphs with no 5- or triangular {3, 6}-cycles. 409-414 - Leonardo Martínez-Sandoval, Luis Montejano:
Fractional Turan's theorem and bounds for the chromatic number. 415-420 - Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz:
A counting lemma for sparse pseudorandom hypergraphs. 421-426 - Sylvia C. Boyd, Philippe Legault:
Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Subgraph Problem. 427-432 - Alex R. Cunha Lima, Georgia Garcia, Leandro M. Zatesko, Sheila Morais de Almeida:
On the chromatic index of cographs and join graphs. 433-438 - José Cáceres, María Luz Puertas, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo:
Quasiperfect Domination in Trees. 439-444 - Guillermo Durán, Fernando Fernández Slezak, Luciano N. Grippo, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
On unit interval graphs with integer endpoints. 445-450 - Laura Eslava, Louigi Addario-Berry:
High degrees in recursive trees. 451-456 - Hiêp Hàn, Troy Retter, Vojtech Rödl, Mathias Schacht:
Ramsey-type numbers involving graphs and hypergraphs with large girth. 457-463 - Adriana Hansberg, Yair Caro:
Isolation in graphs. 465-470
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 2025-05-05 20:37 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:
