Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             81 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A column generation based algorithm for the robust graph coloring problem Yüceoğlu, Birol
2017
41-50 P2 p. 340-352
13 p.
artikel
2 Alexandroff pretopologies for structuring the digital plane Šlapal, Josef
2017
41-50 P2 p. 323-334
12 p.
artikel
3 A linear-time algorithm to compute the triangular hull of a digital object Sarkar, Apurba
2017
41-50 P2 p. 408-423
16 p.
artikel
4 A new algorithmic framework for basic problems on binary images Asano, T.
2017
41-50 P2 p. 376-392
17 p.
artikel
5 An M A -digitization of Hausdorff spaces by using a connectedness graph of the Marcus–Wyse topology Han, Sang-Eon
2017
41-50 P2 p. 335-347
13 p.
artikel
6 Antichains and completely separating systems—A catalogue and applications Grüttmüller, Martin
2014
41-50 P2 p. 165-180
16 p.
artikel
7 A pair of equivalent sequential and fully parallel 3D surface-thinning algorithms Palágyi, Kálmán
2017
41-50 P2 p. 348-361
14 p.
artikel
8 A polyhedral approach for the equitable coloring problem Méndez-Díaz, Isabel
2014
41-50 P2 p. 413-426
14 p.
artikel
9 Application of neighborhood sequences in communication of hexagonal networks Nagy, Benedek
2017
41-50 P2 p. 424-440
17 p.
artikel
10 Approximately counting paths and cycles in a graph Yamamoto, Masaki
2017
41-50 P2 p. 381-387
7 p.
artikel
11 A simple PTAS for weighted matroid matching on strongly base orderable matroids Soto, José A.
2014
41-50 P2 p. 406-412
7 p.
artikel
12 Asymptotically optimal algorithms for geometric Max TSP and Max m-PSP Shenmaier, V.V.
2014
41-50 P2 p. 214-219
6 p.
artikel
13 Bounds on the independence number of a graph in terms of order, size and maximum degree Rad, Nader Jafari
2017
41-50 P2 p. 210-219
10 p.
artikel
14 Characterization of the allowed patterns of signed shifts Archer, Kassie
2017
41-50 P2 p. 97-109
13 p.
artikel
15 Characterizing acyclic graphs by labeling edges Urrutia, Sebastián
2014
41-50 P2 p. 492-499
8 p.
artikel
16 Chinese Postman Problem on edge-colored multigraphs Gutin, Gregory
2017
41-50 P2 p. 196-202
7 p.
artikel
17 Circular-arc hypergraphs: Rigidity via connectedness Köbler, Johannes
2017
41-50 P2 p. 220-228
9 p.
artikel
18 Completely independent spanning trees in some regular graphs Darties, Benoit
2017
41-50 P2 p. 163-174
12 p.
artikel
19 Compositional inverses and complete mappings over finite fields Tuxanidy, Aleksandr
2017
41-50 P2 p. 318-329
12 p.
artikel
20 Computing and counting longest paths on circular-arc graphs in polynomial time Mertzios, George B.
2014
41-50 P2 p. 383-399
17 p.
artikel
21 Contents 2017
41-50 P2 p. v-
1 p.
artikel
22 Contents 2017
41-50 P2 p. v-vi
nvt p.
artikel
23 Contents 2014
41-50 P2 p. v-vi
nvt p.
artikel
24 Contents 2014
41-50 P2 p. v-vi
nvt p.
artikel
25 Contracting chordal graphs and bipartite graphs to paths and trees Heggernes, Pinar
2014
41-50 P2 p. 444-449
6 p.
artikel
26 Convex recoloring of paths Lima, Karla Roberta
2014
41-50 P2 p. 450-459
10 p.
artikel
27 Counting unique-sink orientations Foniok, Jan
2014
41-50 P2 p. 155-164
10 p.
artikel
28 Discrete rigid registration: A local graph-search approach Ngo, Phuc
2017
41-50 P2 p. 461-481
21 p.
artikel
29 Distance colorings of hypercubes from Z 2 Z 4 -linear codes Matthews, Gretchen L.
2017
41-50 P2 p. 356-361
6 p.
artikel
30 Envy-free division of discrete cakes Marenco, Javier
2014
41-50 P2 p. 527-531
5 p.
artikel
31 Essential points of the n -cube subset partitioning characterisation Sahakyan, Hasmik
2014
41-50 P2 p. 205-213
9 p.
artikel
32 Exact evaluation of targeted stochastic watershed cuts Malmberg, Filip
2017
41-50 P2 p. 449-460
12 p.
artikel
33 Exploring the complexity of the integer image problem in the max-algebra MacCaig, Marie
2017
41-50 P2 p. 261-275
15 p.
artikel
34 Flooding games on graphs Lagoutte, A.
2014
41-50 P2 p. 532-538
7 p.
artikel
35 Frustration and isoperimetric inequalities for signed graphs Martin, Florian
2017
41-50 P2 p. 276-285
10 p.
artikel
36 Global offensive alliances in graphs and random graphs Harutyunyan, Ararat
2014
41-50 P2 p. 522-526
5 p.
artikel
37 Graph-theoretic and polyhedral combinatorics issues and approaches in imaging sciences Brimkov, Valentin E.
2017
41-50 P2 p. 321-322
2 p.
artikel
38 Harmonious colourings of graphs Drgas-Burchardt, Ewa
2017
41-50 P2 p. 175-184
10 p.
artikel
39 h -restricted connectivity of locally twisted cubes Wei, Chia-Chen
2017
41-50 P2 p. 330-339
10 p.
artikel
40 Interval edge-colorings of composition of graphs Tepanyan, H.H.
2017
41-50 P2 p. 368-374
7 p.
artikel
41 Investigating the b -chromatic number of bipartite graphs by using the bicomplement Alkhateeb, Mais
2014
41-50 P2 p. 113-126
14 p.
artikel
42 LAGOS’11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina — 2011 Bonomo, Flavia
2014
41-50 P2 p. 357-359
3 p.
artikel
43 Limited Packing and Multiple Domination problems: Polynomial time reductions Leoni, V.
2014
41-50 P2 p. 547-553
7 p.
artikel
44 Many-to-many disjoint paths in hypercubes with faulty vertices Li, Xiang-Jun
2017
41-50 P2 p. 229-242
14 p.
artikel
45 Maximization coloring problems on graphs with few P 4 Campos, Victor
2014
41-50 P2 p. 539-546
8 p.
artikel
46 Memory efficient algorithms for cactus graphs and block graphs Brimkov, Boris
2017
41-50 P2 p. 393-407
15 p.
artikel
47 Morphisms for resistive electrical networks Harper, L.H.
2014
41-50 P2 p. 181-193
13 p.
artikel
48 Nonexistence of a few binary orthogonal arrays Boyvalenkov, Peter
2017
41-50 P2 p. 144-150
7 p.
artikel
49 On a directed variation of the 1-2-3 and 1-2 Conjectures Barme, Emma
2017
41-50 P2 p. 123-131
9 p.
artikel
50 On asteroidal sets in chordal graphs Alcón, Liliana
2014
41-50 P2 p. 482-491
10 p.
artikel
51 On Bichromatic Triangle Game Manić, Gordana
2014
41-50 P2 p. 400-405
6 p.
artikel
52 On defensive alliances and strong global offensive alliances Dourado, Mitre C.
2014
41-50 P2 p. 136-141
6 p.
artikel
53 On derivatives of polynomials over finite fields through integration Pasalic, E.
2017
41-50 P2 p. 294-303
10 p.
artikel
54 On-line list coloring of matroids Lasoń, Michał
2017
41-50 P2 p. 353-355
3 p.
artikel
55 On semidefinite least squares and minimal unsatisfiability Anjos, Miguel F.
2017
41-50 P2 p. 79-96
18 p.
artikel
56 On the correspondence between tree representations of chordal and dually chordal graphs De Caria, Pablo
2014
41-50 P2 p. 500-511
12 p.
artikel
57 On the facets of lift-and-project relaxations under graph operations Aguilera, Néstor E.
2014
41-50 P2 p. 360-372
13 p.
artikel
58 On the minimum size of 4-uniform hypergraphs without property B Östergård, Patric R.J.
2014
41-50 P2 p. 199-204
6 p.
artikel
59 On the polyhedra of graceful spheres and circular geodesics Biswas, Ranita
2017
41-50 P2 p. 362-375
14 p.
artikel
60 On topology preservation of mixed operators in triangular, square, and hexagonal grids Kardos, Péter
2017
41-50 P2 p. 441-448
8 p.
artikel
61 Partition into almost straight trails Birkholz, Harald
2014
41-50 P2 p. 127-135
9 p.
artikel
62 Polynomial-time algorithms for special cases of the maximum confluent flow problem Dressler, Daniel
2014
41-50 P2 p. 142-154
13 p.
artikel
63 Preface Brandstädt, Andreas
2014
41-50 P2 p. 101-
1 p.
artikel
64 Q -Factorization of suffixes of two-way infinite extensions of irrational characteristic words Liao, Fang-Yi
2017
41-50 P2 p. 243-260
18 p.
artikel
65 Radio number of trees Bantva, Devsi
2017
41-50 P2 p. 110-122
13 p.
artikel
66 Sharp bounds on the inverse sum indeg index Falahati-Nezhad, Farzaneh
2017
41-50 P2 p. 185-195
11 p.
artikel
67 Size of a phylogenetic network Semple, Charles
2017
41-50 P2 p. 362-367
6 p.
artikel
68 Solving vertex coloring problems as maximum weight stable set problems Cornaz, Denis
2017
41-50 P2 p. 151-162
12 p.
artikel
69 Some advances on Lovász–Schrijver semidefinite programming relaxations of the fractional stable set polytope Bianchi, S.
2014
41-50 P2 p. 460-469
10 p.
artikel
70 Star-critical Ramsey number of F n versus K 4 Haghi, Sh.
2017
41-50 P2 p. 203-209
7 p.
artikel
71 Structural results on circular-arc graphs and circle graphs: A survey and the main open problems Durán, Guillermo
2014
41-50 P2 p. 427-443
17 p.
artikel
72 The a -graph coloring problem Tilley, J.A.
2017
41-50 P2 p. 304-317
14 p.
artikel
73 The hunting of a snark with total chromatic number 5 Sasaki, D.
2014
41-50 P2 p. 470-481
12 p.
artikel
74 The packing coloring problem for lobsters and partner limited graphs Argiroffo, G.
2014
41-50 P2 p. 373-382
10 p.
artikel
75 The price of connectivity for feedback vertex set Belmonte, Rémy
2017
41-50 P2 p. 132-143
12 p.
artikel
76 The variation of the Randić index with regard to minimum and maximum degree Milivojević, Milica
2017
41-50 P2 p. 286-293
8 p.
artikel
77 Tilted Sperner families Leader, Imre
2014
41-50 P2 p. 194-198
5 p.
artikel
78 Triple arrays and related designs Wallis, W.D.
2014
41-50 P2 p. 220-236
17 p.
artikel
79 Two-dimensional strip packing with unloading constraints da Silveira, Jefferson L.M.
2014
41-50 P2 p. 512-521
10 p.
artikel
80 Unital designs with blocking sets Al-Azemi, Abdullah
2014
41-50 P2 p. 102-112
11 p.
artikel
81 Upper bounds for the achromatic and coloring numbers of a graph Wu, Baoyindureng
2017
41-50 P2 p. 375-380
6 p.
artikel
                             81 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland