Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
 
Zoeken naar met titel:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             77 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A Computational Study of Conflict Graphs and Aggressive Cut Separation in Integer Programming Brito, Samuel Souza
 2015
 50 C p. 355-360
6 p.
 artikel
2 A counting lemma for sparse pseudorandom hypergraphs Kohayakawa, Y.
 2015
 50 C p. 421-426
6 p.
 artikel
3 A Faster Test for 4-Flow-Criticality in Snarks Carneiro, André Breda
 2015
 50 C p. 193-198
6 p.
 artikel
4 A hierarchical network formation model Atabati, Omid
 2015
 50 C p. 379-384
6 p.
 artikel
5 A min-max relation in flowgraphs Ferreira, Carlos E.
 2015
 50 C p. 109-114
6 p.
 artikel
6 An algebraic-perturbation variant of Barvinok's algorithm Lee, Jon
 2015
 50 C p. 15-20
6 p.
 artikel
7 An algorithm for realizing Euclidean distance matrices Alencar, Jorge
 2015
 50 C p. 397-402
6 p.
 artikel
8 An algorithm for solving parametric integer program Fu, Norie
 2015
 50 C p. 299-305
7 p.
 artikel
9 A new reversible circuit synthesis algorithm based on cycle representations of permutations Ribeiro, A.C.
 2015
 50 C p. 187-192
6 p.
 artikel
10 A polyhedral approach to locating-dominating sets in graphs Argiroffo, Gabriela R.
 2015
 50 C p. 89-94
6 p.
 artikel
11 Approximating Minimum k-Section in Trees with Linear Diameter Fernandes, Cristina G.
 2015
 50 C p. 71-76
6 p.
 artikel
12 A Proof for a Conjecture of Gorgol Campos, Victor
 2015
 50 C p. 367-372
6 p.
 artikel
13 A Strengthened General Cut-Generating Procedure for the Stable Set Polytope Corrêa, Ricardo C.
 2015
 50 C p. 261-266
6 p.
 artikel
14 b-continuity and the lexicographic product of graphs Linhares Sales, Cláudia
 2015
 50 C p. 139-144
6 p.
 artikel
15 Budgeted sensor placement for source localization on trees Celis, L.E.
 2015
 50 C p. 65-70
6 p.
 artikel
16 Chronological Rectangle Digraphs Huang, Jing
 2015
 50 C p. 157-162
6 p.
 artikel
17 Compatibility, Incompatibility, Tree-Width, and Forbidden Phylogenetic Minors Vakati, Sudheer
 2015
 50 C p. 337-342
6 p.
 artikel
18 Complexity of determining the maximum infection time in the geodetic convexity Benevides, Fabricio
 2015
 50 C p. 403-408
6 p.
 artikel
19 Computing an Evolutionary Ordering is Hard Bulteau, Laurent
 2015
 50 C p. 255-260
6 p.
 artikel
20 Decompositions of highly connected graphs into paths of length five Botler, F.
 2015
 50 C p. 211-216
6 p.
 artikel
21 Diagonalization of generalized lollipop graphs Del-Vecchio, Renata R.
 2015
 50 C p. 41-46
6 p.
 artikel
22 Edge-colorings avoiding fixed rainbow stars Hoppen, Carlos
 2015
 50 C p. 275-280
6 p.
 artikel
23 Efficient and Perfect domination on circular-arc graphs Lin, Min Chih
 2015
 50 C p. 307-312
6 p.
 artikel
24 Excluding clocks Aboulker, Pierre
 2015
 50 C p. 103-108
6 p.
 artikel
25 Flow-based formulation for the maximum leaf spanning tree problem Reis, M.F.
 2015
 50 C p. 205-210
6 p.
 artikel
26 Fly-automata for checking monadic second-order properties of graphs of bounded tree-width Courcelle, Bruno
 2015
 50 C p. 3-8
6 p.
 artikel
27 Fractional Turan's theorem and bounds for the chromatic number Martínez, Leonardo
 2015
 50 C p. 415-420
6 p.
 artikel
28 Geodeticity of the contour of chordal bipartite graphs Artigas, D.
 2015
 50 C p. 237-242
6 p.
 artikel
29 Graph Saturation Games Riet, Ago-Erik
 2015
 50 C p. 349-354
6 p.
 artikel
30 Graphs with few trivial critical ideals Alfaro, Carlos A.
 2015
 50 C p. 391-396
6 p.
 artikel
31 High degrees in recursive trees Eslava, Laura
 2015
 50 C p. 451-456
6 p.
 artikel
32 Hypohamiltonian Snarks Have a 5-Flow de Freitas, Breno Lima
 2015
 50 C p. 199-204
6 p.
 artikel
33 Inapproximability of the lid-chromatic number Martins, Nicolas
 2015
 50 C p. 121-126
6 p.
 artikel
34 Isolation in graphs Hansberg, Adriana
 2015
 50 C p. 465-470
6 p.
 artikel
35 Kneser Transversals Chappelon, Jonathan
 2015
 50 C p. 385-390
6 p.
 artikel
36 k-tuple chromatic number of the cartesian product of graphs Bonomo, Flavia
 2015
 50 C p. 243-248
6 p.
 artikel
37 Many disjoint edges in topological graphs Ruiz-Vargas, Andres J.
 2015
 50 C p. 29-34
6 p.
 artikel
38 Minimum Size Tree-decompositions Li, Bi
 2015
 50 C p. 21-27
7 p.
 artikel
39 Minor related row family inequalities for the set covering polyhedron of circulant matrices Torres, Luis M.
 2015
 50 C p. 325-330
6 p.
 artikel
40 NP-completeness of the {k}-packing function problem in graphs Leoni, V.
 2015
 50 C p. 115-120
6 p.
 artikel
41 On containment graphs of paths in a tree Alcón, Liliana
 2015
 50 C p. 175-180
6 p.
 artikel
42 On f-Reversible Processes on Graphs Dourado, Mitre C.
 2015
 50 C p. 231-236
6 p.
 artikel
43 On Graphs with Induced Matching Number Almost Equal to Matching Number Duarte, Marcio Antônio
 2015
 50 C p. 9-14
6 p.
 artikel
44 On oriented relative clique number Das, Sandip
 2015
 50 C p. 95-101
7 p.
 artikel
45 On path decompositions of 2k-regular graphs Botler, Fábio
 2015
 50 C p. 163-168
6 p.
 artikel
46 On Rotational Symmetries of Drawings of Coherent Periodic Graphs Araki, Tetsuya
 2015
 50 C p. 373-378
6 p.
 artikel
47 On second iterated clique graphs that are also third iterated clique graphs De Caria, Pablo
 2015
 50 C p. 319-324
6 p.
 artikel
48 On the average path length of a cycle plus random edges Ralaivaosaona, D.
 2015
 50 C p. 287-292
6 p.
 artikel
49 On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid Alcón, Liliana
 2015
 50 C p. 249-254
6 p.
 artikel
50 On the chromatic index of cographs and join graphs Cunha Lima, Alex R.
 2015
 50 C p. 433-438
6 p.
 artikel
51 On the hereditary (p, q)-Helly property of hypergraphs, cliques, and bicliques Dourado, Mitre C.
 2015
 50 C p. 361-366
6 p.
 artikel
52 On the Online Min-Wait Relocation Problem Halffmann, Pascal
 2015
 50 C p. 281-286
6 p.
 artikel
53 On the Path Avoiding Forbidden Pairs Polytope Blanco, Marco
 2015
 50 C p. 343-348
6 p.
 artikel
54 On unit interval graphs with integer endpoints Durán, G.
 2015
 50 C p. 445-450
6 p.
 artikel
55 Optimal Edge Fault-Tolerant Bijective Embedding of a Complete Graph over a Cycle Canale, Eduardo A.
 2015
 50 C p. 217-222
6 p.
 artikel
56 Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles Schaudt, Oliver
 2015
 50 C p. 313-318
6 p.
 artikel
57 Partitions of Rectilinear Polygons with Minimum Stabbing Number Piva, Breno
 2015
 50 C p. 267-273
7 p.
 artikel
58 Pebbling in 2-Paths Alcón, Liliana
 2015
 50 C p. 145-150
6 p.
 artikel
59 Preface – VIII Latin-american Algorithms, Graphs and Optimization Symposium Campêlo, Manoel
 2015
 50 C p. 1-2
2 p.
 artikel
60 Quasiperfect Domination in Trees Cáceres, Jose
 2015
 50 C p. 439-444
6 p.
 artikel
61 Ramsey-type numbers involving graphs and hypergraphs with large girth Hàn, Hiệp
 2015
 50 C p. 457-463
7 p.
 artikel
62 Roman domination in subgraphs of grids Nascimento, Samuel
 2015
 50 C p. 77-82
6 p.
 artikel
63 Some links between identifying codes and separating, dominating and total dominating sets in graphs Nasini, Graciela
 2015
 50 C p. 181-186
6 p.
 artikel
64 Steinberg-like theorems for backbone colouring Araujo, J.
 2015
 50 C p. 223-229
7 p.
 artikel
65 Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs Couto, F.
 2015
 50 C p. 133-138
6 p.
 artikel
66 The caterpillar-packing polytope Marenco, Javier
 2015
 50 C p. 47-52
6 p.
 artikel
67 The 1,2-Conjecture for powers of cycles Luiz, A.G.
 2015
 50 C p. 83-88
6 p.
 artikel
68 The Flood-It game parameterized by the vertex cover number Souza, Uéverton dos Santos
 2015
 50 C p. 35-40
6 p.
 artikel
69 The k-hop connected dominating set problem: hardness and polyhedra Coelho, Rafael S.
 2015
 50 C p. 59-64
6 p.
 artikel
70 The Online Prize-Collecting Facility Location Problem San Felice, Mário César
 2015
 50 C p. 151-156
6 p.
 artikel
71 The Ring Tree Facility Location Problem Abe, Fabio Henrique N.
 2015
 50 C p. 331-336
6 p.
 artikel
72 Three-colourability of planar graphs with no 5- or triangular {3,6}-cycles Farzad, Babak
 2015
 50 C p. 409-414
6 p.
 artikel
73 Tight lower bounds on the number of bicliques in false-twin-free graphs Groshaus, Marina
 2015
 50 C p. 293-298
6 p.
 artikel
74 Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Subgraph Problem Boyd, Sylvia
 2015
 50 C p. 427-432
6 p.
 artikel
75 Trajectory clustering of points in R Fernandes, Cristina G.
 2015
 50 C p. 53-58
6 p.
 artikel
76 Using SPQR-trees to speed up algorithms based on 2-cutset decompositions de Figueiredo, C.M.H.
 2015
 50 C p. 169-174
6 p.
 artikel
77 Weighted antimagic labeling: an algorithmic approach Matamala, Martín
 2015
 50 C p. 127-132
6 p.
 artikel
                             77 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland