Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             30 results found
no title author magazine year volume issue page(s) type
1 Algorithms to approximately count and sample conforming colorings of graphs Miracle, Sarah
2016
210 C p. 133-149
article
2 Almost empty monochromatic triangles in planar point sets Basu, Deepan
2016
210 C p. 207-213
article
3 A note on the middle levels problem Gusmão, Andréia C.S.
2016
210 C p. 290-296
article
4 A polyhedral study of the maximum stable set problem with weights on vertex-subsets Campêlo, Manoel
2016
210 C p. 223-234
article
5 Approximate robust optimization for the Connected Facility Location problem Bardossy, M. Gisela
2016
210 C p. 246-260
article
6 A survey-based approach for designing the lines of a rapid transit network Escudero, L.F.
2016
210 C p. 14-34
article
7 Clique cycle-transversals in distance-hereditary graphs Brandstädt, Andreas
2016
210 C p. 38-44
article
8 Component-cardinality-constrained critical node problem in graphs Lalou, M.
2016
210 C p. 150-163
article
9 Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations Jiménez, Andrea
2016
210 C p. 45-60
article
10 Contents 2016
210 C p. v-vi
article
11 Diffuse reflection diameter in simple polygons Barequet, Gill
2016
210 C p. 123-132
article
12 Edge intersection graphs of L -shaped paths in grids Cameron, Kathie
2016
210 C p. 185-194
article
13 Edge separators for quasi-binary trees Ramírez Alfonsín, Jorge Luis
2016
210 C p. 284-289
article
14 Exploring the concept of perfection in 3-hypergraphs García-Colín, Natalia
2016
210 C p. 164-170
article
15 Generalized minor inequalities for the set covering polyhedron related to circulant matrices Tolomei, Paola B.
2016
210 C p. 214-222
article
16 Greedy flipping of pancakes and burnt pancakes Sawada, Joe
2016
210 C p. 61-74
article
17 Hull number: P 5 -free graphs and reduction rules Araujo, J.
2016
210 C p. 171-175
article
18 Lift-and-project ranks of the stable set polytope of joined a -perfect graphs Bianchi, S.
2016
210 C p. 176-184
article
19 Near-linear-time algorithm for the geodetic Radon number of grids Dourado, Mitre Costa
2016
210 C p. 277-283
article
20 Null and non-rainbow colorings of projective plane and sphere triangulations Arocha, Jorge L.
2016
210 C p. 195-199
article
21 On basic chordal graphs and some of its subclasses De Caria, Pablo
2016
210 C p. 261-276
article
22 On Ramsey numbers of complete graphs with dropped stars Chappelon, Jonathan
2016
210 C p. 200-206
article
23 On the closest point to the origin in transportation polytopes Calvillo, Gilberto
2016
210 C p. 88-102
article
24 On the monotonicity of process number Nisse, Nicolas
2016
210 C p. 103-111
article
25 Preface: LAGOS’13: Seventh Latin-American Algorithms, Graphs, and Optimization Symposium, Playa del Carmen, México — 2013 Correa, José
2016
210 C p. 1-3
article
26 Rainbow copies of C 4 in edge-colored hypercubes Balogh, József
2016
210 C p. 35-37
article
27 Repetition-free longest common subsequence of random sequences Fernandes, Cristina G.
2016
210 C p. 75-87
article
28 Slash and burn on graphs — Firefighting with general weights Costa, Vitor
2016
210 C p. 4-13
article
29 Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs Galeana-Sánchez, Hortensia
2016
210 C p. 235-245
article
30 The cost of perfection for matchings in graphs Brazil, E.V.
2016
210 C p. 112-122
article
                             30 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands