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
 
                             65 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A Branch and Price Algorithm for List Coloring Problem Lucci, Mauro
 2019
 346 C p. 613-624
 artikel
2 A Branch-and-Price Algorithm for the Ring-Tree Facility Location Problem Abe, Fabio H.N.
 2019
 346 C p. 3-14
 artikel
3 A Characterization of Claw-free CIS Graphs and New Results on the Order of CIS Graphs Alcón, Liliana
 2019
 346 C p. 15-27
 artikel
4 Adapting The Directed Grid Theorem into an FPT Algorithm Campos, Victor
 2019
 346 C p. 229-240
 artikel
5 A General Method for Forbidden Induced Subgraph Sandwich Problem NP-completeness Dantas, Simone
 2019
 346 C p. 393-400
 artikel
6 A GRASP for the Convex Recoloring Problem in Graphs Dantas, Ana Paula dos Santos
 2019
 346 C p. 379-391
 artikel
7 Algebras, Graphs and Thetas de Carli Silva, Marcel K.
 2019
 346 C p. 275-283
 artikel
8 A Multi-agent Transgenetic Algorithm for the Bi-objective Spanning Tree Problem Fernandes, Islame F.C.
 2019
 346 C p. 449-460
 artikel
9 An Integer Programming Approach for the 2-class Single-group Classification Problem Corrêa, Ricardo C.
 2019
 346 C p. 321-331
 artikel
10 Anti-Ramsey Threshold of Cycles for Sparse Graphs Barros, G.F.
 2019
 346 C p. 89-98
 artikel
11 A Polynomial-time Approximation Scheme for the MAXSPACE Advertisement Problem da Silva, Mauro R.C.
 2019
 346 C p. 699-710
 artikel
12 Approximation Algorithms for Sorting Permutations by Length-Weighted Short Rearrangements Alexandrino, Alexsandro Oliveira
 2019
 346 C p. 29-40
 artikel
13 Approximations for Restrictions of The Budgeted and Generalized Maximum Coverage Problems Piva, Breno
 2019
 346 C p. 667-676
 artikel
14 A α -Spectrum of a Firefly Graph Brondani, André Ebling
 2019
 346 C p. 209-219
 artikel
15 Backbone Coloring of Graphs with Galaxy Backbones Araujo, Camila
 2019
 346 C p. 53-64
 artikel
16 Circuits and Circulant Minors Bianchi, Silvia
 2019
 346 C p. 147-158
 artikel
17 Colouring the Normalized Laplacian Coutinho, Gabriel
 2019
 346 C p. 345-354
 artikel
18 Computing the Determinant of the Distance Matrix of a Bicyclic Graph Dratman, Ezequiel
 2019
 346 C p. 413-423
 artikel
19 Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges Hoppen, Carlos
 2019
 346 C p. 535-544
 artikel
20 Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete Jiménez, Andrea
 2019
 346 C p. 545-556
 artikel
21 Decomposing Split Graphs into Locally Irregular Graphs Lintzmayer, C.N.
 2019
 346 C p. 603-612
 artikel
22 Equitable Total Chromatic Number of K r×p for p Even da Silva, Anderson G.
 2019
 346 C p. 685-697
 artikel
23 Even-power of Cycles With Many Vertices are Type 1 Total Colorable Zorzi, Alesom
 2019
 346 C p. 747-758
 artikel
24 Facet-generating Procedures for the Maximum-impact Coloring Polytope Braga, Mónica
 2019
 346 C p. 199-208
 artikel
25 Families of Induced Trees and Their Intersection Graphs De Caria, Pablo
 2019
 346 C p. 265-274
 artikel
26 Fast Winning Strategies for the Maker-Breaker Domination Game Gledel, Valentin
 2019
 346 C p. 473-484
 artikel
27 FPT Algorithms to Enumerate and Count Acyclic and Totally Cyclic Orientations Oliveira, Farley Soares
 2019
 346 C p. 655-666
 artikel
28 Graphs with Girth at Least 8 are b-continuous Ibiapina, Allen
 2019
 346 C p. 677-684
 artikel
29 Hardness and Efficiency on Minimizing Maximum Distances for Graphs With Few P 4's and (k,ℓ)-graphs Couto, Fernanda
 2019
 346 C p. 355-367
 artikel
30 Hull and Geodetic Numbers for Some Classes of Oriented Graphs Araujo, Julio
 2019
 346 C p. 77-88
 artikel
31 Identifying Codes in the Complementary Prism of Cycles Cappelle, Márcia R.
 2019
 346 C p. 241-251
 artikel
32 Large Immersions in Graphs with Independence Number 3 and 4 Bustamante, S.
 2019
 346 C p. 221-228
 artikel
33 Linial's Conjecture for Arc-spine Digraphs Yoshimura, Lucas R.
 2019
 346 C p. 735-746
 artikel
34 Metric Dimension: from Graphs to Oriented Graphs Bensmail, Julien
 2019
 346 C p. 111-123
 artikel
35 Minimization of Gini Impurity: NP-completeness and Approximation Algorithm via Connections with the k-means Problem Laber, Eduardo
 2019
 346 C p. 567-576
 artikel
36 On Adjacent-vertex-distinguishing Total Colourings of Powers of Cycles, Hypercubes and Lattice Graphs Alvarado, J.D.
 2019
 346 C p. 41-51
 artikel
37 On Caterpillars of Game Chromatic Number 4 Furtado, Ana
 2019
 346 C p. 461-472
 artikel
38 On Coloring a Class of Claw-free Graphs Dai, Yingjun
 2019
 346 C p. 369-377
 artikel
39 On Computing the Path Number of a Graph Botler, F.
 2019
 346 C p. 185-197
 artikel
40 On Edge-magic Labelings of Forests Cerioli, Márcia R.
 2019
 346 C p. 299-307
 artikel
41 On the Complexity of Gap-[2]-vertex-labellings of Subcubic Bipartite Graphs Weffort-Santos, C.A.
 2019
 346 C p. 725-734
 artikel
42 On the Computational Complexity of the Helly Number in the P 3 and Related Convexities Carvalho, Moisés T.
 2019
 346 C p. 285-297
 artikel
43 On the Iterated Edge-Biclique Operator Legay, Sylvain
 2019
 346 C p. 577-587
 artikel
44 On the Minimum Eccentricity Isometric Cycle Problem Birmelé, Étienne
 2019
 346 C p. 159-169
 artikel
45 On the Unavoidability of Oriented Trees Dross, François
 2019
 346 C p. 425-436
 artikel
46 On Tuza's Conjecture for Triangulations and Graphs with Small Treewidth Botler, F.
 2019
 346 C p. 171-183
 artikel
47 Open-independent, Open-locating-dominating Sets in Complementary Prism Graphs Cappelle, Márcia R.
 2019
 346 C p. 253-264
 artikel
48 P 3-Hull Number of Graphs with Diameter Two Cappelle, Márcia R.
 2019
 346 C p. 309-320
 artikel
49 Preface Coutinho, Gabriel
 2019
 346 C p. 1-2
 artikel
50 PSPACE-hardness of Two Graph Coloring Games Costa, Eurinardo
 2019
 346 C p. 333-344
 artikel
51 Quasilinear Approximation Scheme for Steiner Multi Cycle in the Euclidean plane Lintzmayer, Carla N.
 2019
 346 C p. 589-601
 artikel
52 Recognizing Graph Search Trees Beisegel, Jesse
 2019
 346 C p. 99-110
 artikel
53 Remarks on an Edge-coloring Problem Hoppen, Carlos
 2019
 346 C p. 511-521
 artikel
54 Sigma Coloring on Powers of Paths and Some Families of Snarks Gonzaga, Luis Gustavo da Soledade
 2019
 346 C p. 485-496
 artikel
55 Spanning Trees of Dense Directed Graphs Mycroft, Richard
 2019
 346 C p. 645-654
 artikel
56 Subclasses of Circular-Arc Bigraphs: Helly, Normal and Proper Groshaus, Marina
 2019
 346 C p. 497-509
 artikel
57 The Chromatic Index of Proper Circular-arc Graphs of Odd Maximum Degree which are Chordal Bernardi, João Pedro W.
 2019
 346 C p. 125-133
 artikel
58 The 2D Subarray Polytope Koch, Ivo
 2019
 346 C p. 557-566
 artikel
59 The Generalized Dependency Constrained Spanning Tree Problem Viana, Luiz Alberto do Carmo
 2019
 346 C p. 711-723
 artikel
60 The Geodesic Classification Problem on Graphs de Araújo, Paulo Henrique Macêdo
 2019
 346 C p. 65-76
 artikel
61 The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations Argiroffo, G.
 2019
 346 C p. 135-145
 artikel
62 Total Domination in Regular Graphs Hoppen, Carlos
 2019
 346 C p. 523-533
 artikel
63 Tuple Domination on Graphs with the Consecutive-zeros Property Dobson, M.P.
 2019
 346 C p. 401-411
 artikel
64 Two Problems on Interval Counting Medeiros, Lívia Salgado
 2019
 346 C p. 625-643
 artikel
65 Variable Neighborhood Descent Branching applied to the Multi-Way Number Partitioning Problem Faria, Alexandre Frias
 2019
 346 C p. 437-447
 artikel
                             65 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland