Digital Library
Close Browse articles from a journal
 
Search for with title:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             56 results found
no title author magazine year volume issue page(s) type
1 A 3-approximation for the pathwidth of Halin graphs Fomin, Fedor V.
 2004
 17 C p. 157-162
6 p.
 article
2 About the b-continuity of graphs Faik, Taoufik
 2004
 17 C p. 151-156
6 p.
 article
3 Algorithms for finding minimum fundamental cycle bases in graphs Amaldi, Edoardo
 2004
 17 C p. 29-33
5 p.
 article
4 An asymmetric vehicle routing problem arising in the collection and disposal of special waste Aringhieri, Roberto
 2004
 17 C p. 41-47
7 p.
 article
5 An Improved Discrepancy Approach to Declustering Doerr, Benjamin
 2004
 17 C p. 129-133
5 p.
 article
6 An improved local search algorithm for 3-SAT Brueggemann, Tobias
 2004
 17 C p. 69-73
5 p.
 article
7 A particular class of graphic matroids Maffioli, Francesco
 2004
 17 C p. 219-222
4 p.
 article
8 A Primal-Dual Method for Approximating Tree Cover with Two Weights Doi, Takashi
 2004
 17 C p. 135-140
6 p.
 article
9 A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks Lozovanu, D.
 2004
 17 C p. 209-214
6 p.
 article
10 Behzad-Vizing conjecture and Cartesian product graphs Zmazek, Blaž
 2004
 17 C p. 297-300
4 p.
 article
11 Clique algorithms for classifying substructures in generalized quadrangles Cajkova, Miroslava
 2004
 17 C p. 75-79
5 p.
 article
12 Clique, chromatic, and Lovász numbers of certain circulant graphs Brimkov, Valentin E.
 2004
 17 C p. 63-67
5 p.
 article
13 Coloring Graphs with Minimal Edge Load Ahuja, Nitin
 2004
 17 C p. 9-13
5 p.
 article
14 Computing Optimal Discrete Morse Functions Joswig, Michael
 2004
 17 C p. 191-195
5 p.
 article
15 Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming Tardella, Fabio
 2004
 17 C p. 257-262
6 p.
 article
16 Covering Graphs by Colored Stable Sets Faigle, Ulrich
 2004
 17 C p. 145-149
5 p.
 article
17 Decomposition of consecutive-1 matrices and applications Hamacher, Horst W.
 2004
 17 C p. 3-
1 p.
 article
18 Discrepancy of Sums of Arithmetic Progressions Hebbinghaus, Nils
 2004
 17 C p. 185-189
5 p.
 article
19 Dynamic programming algorithms for the elementary shortest path problem with resource constraints Righini, Giovanni
 2004
 17 C p. 247-249
3 p.
 article
20 Exact algorithms for a discrete metric labeling problem Nicosia, Gaia
 2004
 17 C p. 223-227
5 p.
 article
21 Extended Distance-Hereditary Graphs Aïder, Méziane
 2004
 17 C p. 15-17
3 p.
 article
22 Fast and Simple Algorithms for Weighted Perfect Matching Wattenhofer, Mirjam
 2004
 17 C p. 285-291
7 p.
 article
23 Heavy cycles in k-connected weighted graphs Zhang, Shenggui
 2004
 17 C p. 293-296
4 p.
 article
24 Knowledge State Algorithms and the 2-Server Problem Bein, Wolfgang W.
 2004
 17 C p. 49-
1 p.
 article
25 k-Pseudosnakes in n-dimensional Hypercubes Prisner, Erich
 2004
 17 C p. 237-240
4 p.
 article
26 Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs Chen, William Y.C.
 2004
 17 C p. 93-98
6 p.
 article
27 Minimum-Cost Single-Source 2-Splittable Flow Kolliopoulos, Stavros G.
 2004
 17 C p. 197-201
5 p.
 article
28 Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs Detti, Paolo
 2004
 17 C p. 117-122
6 p.
 article
29 Minimum Weighted Feedback Vertex Set on Diamonds Carrabs, F.
 2004
 17 C p. 87-91
5 p.
 article
30 More on orbital matrices Gropp, Harald
 2004
 17 C p. 179-183
5 p.
 article
31 Multiway cut and integer flow problems in trees Costa, Marie-Christine
 2004
 17 C p. 105-109
5 p.
 article
32 Network design with grooming constraints Belotti, Pietro
 2004
 17 C p. 51-56
6 p.
 article
33 New exponential neighbourhood for polynomially solvable TSPs Deineko, V.
 2004
 17 C p. 111-115
5 p.
 article
34 On a packet scheduling problem for smart antennas and polyhedra defined by circular-ones matrices Gijswijt, Dion
 2004
 17 C p. 175-178
4 p.
 article
35 On cliques associated to 3-set packing problems Torres, Luis M.
 2004
 17 C p. 263-267
5 p.
 article
36 On Deviation Measures in Stochastic Integer Programming Märkert, Andreas
 2004
 17 C p. 215-218
4 p.
 article
37 On ( P 5 , P ¯ 5 ) -sparse graphs and other families Fouquet, Jean-Luc
 2004
 17 C p. 163-167
5 p.
 article
38 On the generation of bicliques of a graph Dias, Vânia M.F.
 2004
 17 C p. 123-127
5 p.
 article
39 On the Strongly Connected and Biconnected Components of the Complement of Graphs Nikolopoulos, Stavros D.
 2004
 17 C p. 229-235
7 p.
 article
40 Polynomial solvability of Mader's edge-disjoint paths problem Stougie, Leen
 2004
 17 C p. 7-
1 p.
 article
41 Preface Liberti, Leo
 2004
 17 C p. 1-
1 p.
 article
42 Semi–preemptive routing on a line Räbiger, Dirk
 2004
 17 C p. 241-246
6 p.
 article
43 Subdivision of the hierarchy of H-colorable graph classes by circulant graphs Uejima, Akihiro
 2004
 17 C p. 269-274
6 p.
 article
44 Submodular function minimization in Z n and searching in Monge arrays Queyranne, Maurice
 2004
 17 C p. 5-
1 p.
 article
45 The complexity of arc-colorings for directed hypergraphs Vietri, Andrea
 2004
 17 C p. 281-284
4 p.
 article
46 The Cut Number of the n-Cube, Boolean Methods and a Geometric Connection to Threshold Logic Emamy-K., M.R.
 2004
 17 C p. 141-143
3 p.
 article
47 The demand-dependent optimization of regular train timetables Chierici, Alessandro
 2004
 17 C p. 99-104
6 p.
 article
48 The Kissing Number Problem: A New Result from Global Optimization Liberti, Leo
 2004
 17 C p. 203-207
5 p.
 article
49 The Multicommodity Multilevel Bottleneck Assignment Problem Aringhieri, Roberto
 2004
 17 C p. 35-40
6 p.
 article
50 The Proper Interval Colored Graph problem for caterpillar trees Àlvarez, C.
 2004
 17 C p. 23-28
6 p.
 article
51 The Ramsey Numbers of Paths Versus Kipases Salman, A.N.M.
 2004
 17 C p. 251-255
5 p.
 article
52 The set of prime extensions of a graph: the finite and the infinite case Giakoumakis, Vassilis
 2004
 17 C p. 169-174
6 p.
 article
53 To be or not to be Yutsis Van Dyck, D.
 2004
 17 C p. 275-279
5 p.
 article
54 Tree Decompositions of Graphs: Saving Memory in Dynamic Programming Betzler, Nadja
 2004
 17 C p. 57-62
6 p.
 article
55 Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm Cantone, Domenico
 2004
 17 C p. 81-86
6 p.
 article
56 Virtual Private Network Design Under Traffic Uncertainty Altın, A.
 2004
 17 C p. 19-22
4 p.
 article
                             56 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands