nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A better step-off algorithm for the knapsack problem
|
Greenberg, Harold |
|
1980 |
1-10 |
1 |
p. 21-25 5 p. |
artikel |
2 |
A binary search problem on graphs
|
Franzkeit, Reinhard |
|
1992 |
1-10 |
1 |
p. 83-86 4 p. |
artikel |
3 |
About the design of oligo-chips
|
Guénoche, A. |
|
2005 |
1-10 |
1 |
p. 57-67 11 p. |
artikel |
4 |
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
|
Hernández-Pérez, Hipólito |
|
2004 |
1-10 |
1 |
p. 126-139 14 p. |
artikel |
5 |
A characterisation of all feasible solutions to an integer program
|
Williams, H.P. |
|
1983 |
1-10 |
1 |
p. 147-155 9 p. |
artikel |
6 |
A characterization problem on underlying graphs of line digraphs
|
El Sahili, Amine |
|
2005 |
1-10 |
1 |
p. 99-101 3 p. |
artikel |
7 |
A class of heuristics for the constrained forest problem
|
Laszlo, Michael |
|
2006 |
1-10 |
1 |
p. 6-14 9 p. |
artikel |
8 |
A combinatorial approach to the problem of self-assembly
|
Smetanich, Yakov S. |
|
1995 |
1-10 |
1 |
p. 45-65 21 p. |
artikel |
9 |
A concise characterization of 3D simple points
|
Fourey, Sébastien |
|
2003 |
1-10 |
1 |
p. 59-80 22 p. |
artikel |
10 |
A constrained sports scheduling problem
|
de Werra, D. |
|
1990 |
1-10 |
1 |
p. 41-49 9 p. |
artikel |
11 |
A convoy scheduling problem
|
Bovet, J. |
|
1991 |
1-10 |
1 |
p. 1-14 14 p. |
artikel |
12 |
A course in number theory and cryptography
|
|
|
1990 |
1-10 |
1 |
p. 131- 1 p. |
artikel |
13 |
Adapting polyhedral properties from facility to hub location problems
|
Hamacher, Horst W. |
|
2004 |
1-10 |
1 |
p. 104-116 13 p. |
artikel |
14 |
Addendum
|
Tseng, F.T. |
|
1988 |
1-10 |
1 |
p. 87-88 2 p. |
artikel |
15 |
Δ additive and Δ ultra-additive maps, Gromov's trees, and the Farris transform
|
Dress, A. |
|
2005 |
1-10 |
1 |
p. 51-73 23 p. |
artikel |
16 |
A decision method for Parikh slenderness of context-free languages
|
Honkala, Juha |
|
1997 |
1-10 |
1 |
p. 1-4 4 p. |
artikel |
17 |
A decision procedure on partially commutative free monoids
|
De Luca, Aldo |
|
1986 |
1-10 |
1 |
p. 105-108 4 p. |
artikel |
18 |
A difficulty in particular Shannon-like games
|
Yamasaki, Yōhei |
|
1991 |
1-10 |
1 |
p. 87-90 4 p. |
artikel |
19 |
A duality property for the set of all feasible solutions to an integer program
|
Paz, Azaria |
|
1986 |
1-10 |
1 |
p. 57-66 10 p. |
artikel |
20 |
A duality theorem for linear congruences
|
Williams, H.P. |
|
1984 |
1-10 |
1 |
p. 93-103 11 p. |
artikel |
21 |
A fast algorithm for maximum integral two-commodity flow in planar graphs
|
Korach, Ephraim |
|
1993 |
1-10 |
1 |
p. 77-83 7 p. |
artikel |
22 |
A fast approximation algorithm for the multicovering problem
|
Hall, Nicholas G. |
|
1986 |
1-10 |
1 |
p. 35-40 6 p. |
artikel |
23 |
A game of cops and robbers
|
Aigner, M. |
|
1984 |
1-10 |
1 |
p. 1-12 12 p. |
artikel |
24 |
A generalization of the stable matching problem
|
Tan, Jimmy J.M. |
|
1995 |
1-10 |
1 |
p. 87-102 16 p. |
artikel |
25 |
A general theory of equilibrium selection in games
|
|
|
1990 |
1-10 |
1 |
p. 126-127 2 p. |
artikel |
26 |
A graph-theoretic generalization of the Sauer-Shelah lemma
|
Cesa-Bianchi, Nicolò |
|
1998 |
1-10 |
1 |
p. 27-35 9 p. |
artikel |
27 |
A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids
|
Goecke, Oskar |
|
1988 |
1-10 |
1 |
p. 39-49 11 p. |
artikel |
28 |
A greedy approximation algorithm for the group Steiner problem
|
Chekuri, Chandra |
|
2006 |
1-10 |
1 |
p. 15-34 20 p. |
artikel |
29 |
A greedy reduction algorithm for setup optimization
|
Faigle, Ulrich |
|
1992 |
1-10 |
1 |
p. 73-79 7 p. |
artikel |
30 |
A Griesmer bound for linear codes over finite quasi-Frobenius rings
|
Shiromoto, Keisuke |
|
2003 |
1-10 |
1 |
p. 263-274 12 p. |
artikel |
31 |
A hierarchy of relaxations and convex hull characterizations for mixed-integer zero—one programming problems
|
Sherali, Hanif D. |
|
1994 |
1-10 |
1 |
p. 83-106 24 p. |
artikel |
32 |
A hypocoloring model for batch scheduling
|
de Werra, D. |
|
2005 |
1-10 |
1 |
p. 3-26 24 p. |
artikel |
33 |
Algebraic flows in regular matroids
|
Hamacher, Horst |
|
1980 |
1-10 |
1 |
p. 27-38 12 p. |
artikel |
34 |
Algorithm for statistical alignment of two sequences derived from a Poisson sequence length distribution
|
Miklós, István |
|
2003 |
1-10 |
1 |
p. 79-84 6 p. |
artikel |
35 |
Algorithmic complexity of protein identification: combinatorics of weighted strings
|
Cieliebak, Mark |
|
2004 |
1-10 |
1 |
p. 27-46 20 p. |
artikel |
36 |
Algorithms and complexity for least median of squares regression
|
Steele, J.M. |
|
1986 |
1-10 |
1 |
p. 93-100 8 p. |
artikel |
37 |
Aligning two fragmented sequences
|
Veeramachaneni, Vamsi |
|
2003 |
1-10 |
1 |
p. 119-143 25 p. |
artikel |
38 |
A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
|
Asano, Takao |
|
1984 |
1-10 |
1 |
p. 1-15 15 p. |
artikel |
39 |
A linear-time algorithm for computing the intersection of all odd cycles in a graph
|
Cai, Leizhen |
|
1997 |
1-10 |
1 |
p. 27-34 8 p. |
artikel |
40 |
Almost fully-parallel parentheses matching
|
Berkman, Omer |
|
1995 |
1-10 |
1 |
p. 11-28 18 p. |
artikel |
41 |
A lower bound for tree resolution
|
McClurkin, David J. |
|
1994 |
1-10 |
1 |
p. 37-53 17 p. |
artikel |
42 |
A lower bound on the weight hierarchies of product codes
|
Schaathun, Hans Georg |
|
2003 |
1-10 |
1 |
p. 251-261 11 p. |
artikel |
43 |
A Manhattan channel router with good theoretical and practical performance
|
Wieners-Lummer, Charlotte |
|
1992 |
1-10 |
1 |
p. 83-104 22 p. |
artikel |
44 |
A Many-Valued Approach to Deduction and Reasoning for Artificial Intelligence
|
|
|
1993 |
1-10 |
1 |
p. 90- 1 p. |
artikel |
45 |
A mathematical programming model for the long term development of an off-shore gas field
|
Beale, E.M.L. |
|
1983 |
1-10 |
1 |
p. 1-9 9 p. |
artikel |
46 |
A maxmin problem on finite automata
|
Champarnaud, J.-M. |
|
1989 |
1-10 |
1 |
p. 91-96 6 p. |
artikel |
47 |
A multifacility location problem on median spaces
|
Chepoi, Victor |
|
1996 |
1-10 |
1 |
p. 1-29 29 p. |
artikel |
48 |
A multi-scale algorithm for drawing graphs nicely
|
Hadany, Ronny |
|
2001 |
1-10 |
1 |
p. 3-21 19 p. |
artikel |
49 |
An addition algorithm in Jacobian of C ab curves
|
Arita, Seigo |
|
2003 |
1-10 |
1 |
p. 13-31 19 p. |
artikel |
50 |
An algebraic and combinatorial approach to the analysis of line drawings of polyhedra
|
Sugihara, Kōkichi |
|
1984 |
1-10 |
1 |
p. 77-104 28 p. |
artikel |
51 |
An algorithm for collapsing sign alternating sequences of real numbers
|
Kleitman, Daniel J. |
|
1983 |
1-10 |
1 |
p. 49-53 5 p. |
artikel |
52 |
An algorithm for single machine sequencing with release dates to minimize maximum cost
|
Zdrzak̵a, Stanisa̵w |
|
1989 |
1-10 |
1 |
p. 73-89 17 p. |
artikel |
53 |
An algorithm for single machine sequencing with release dates to minimize total weighted completion time
|
Hariri, A.M.A. |
|
1983 |
1-10 |
1 |
p. 99-109 11 p. |
artikel |
54 |
An algorithm for solving partial differential parametric systems
|
Wang, Jimin |
|
2004 |
1-10 |
1 |
p. 105-116 12 p. |
artikel |
55 |
Analysis of 3gpp-MAC and two-key 3gpp-MAC
|
Knudsen, Lars R |
|
2003 |
1-10 |
1 |
p. 181-191 11 p. |
artikel |
56 |
An application of discrete mathematics in the design of an open pit mine
|
Caccetta, L. |
|
1988 |
1-10 |
1 |
p. 1-19 19 p. |
artikel |
57 |
An applied point pattern matching problem: comparing 2D patterns of protein spots
|
Hoffmann, F. |
|
1999 |
1-10 |
1 |
p. 75-88 14 p. |
artikel |
58 |
An approximation algorithm for a single-machine scheduling problem with release times and delivery times
|
Nowicki, Eugeniusz |
|
1994 |
1-10 |
1 |
p. 69-79 11 p. |
artikel |
59 |
An approximation algorithm for scheduling on three dedicated machines
|
Goemans, Michel X. |
|
1995 |
1-10 |
1 |
p. 49-59 11 p. |
artikel |
60 |
An approximation algorithm for the maximum cut problem and its experimental analysis
|
Bertoni, A. |
|
2001 |
1-10 |
1 |
p. 3-12 10 p. |
artikel |
61 |
An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
|
Nagamochi, Hiroshi |
|
2003 |
1-10 |
1 |
p. 83-113 31 p. |
artikel |
62 |
An assignment algorithm with applications to integrated circuit layout
|
Atallah, Mikhail J |
|
1986 |
1-10 |
1 |
p. 9-22 14 p. |
artikel |
63 |
An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem
|
Anily, Shoshana |
|
2004 |
1-10 |
1 |
p. 22-39 18 p. |
artikel |
64 |
An efficient algorithm for computing the distance between close partitions
|
Porumbel, Daniel Cosmin |
|
2011 |
1-10 |
1 |
p. 53-59 7 p. |
artikel |
65 |
An efficient algorithm for finding a two-pair, and its applications
|
Arikati, Srinivasa R. |
|
1991 |
1-10 |
1 |
p. 71-74 4 p. |
artikel |
66 |
An efficient parallel logarithmic time algorithm for the channel routing problem
|
Wagner, Dorothea |
|
1992 |
1-10 |
1 |
p. 73-81 9 p. |
artikel |
67 |
An enumerative algorithm for the frequency assignment problem
|
Mannino, Carlo |
|
2003 |
1-10 |
1 |
p. 155-169 15 p. |
artikel |
68 |
A network theory approach to the rigidity of skeletal structures part II. Laman’s theorem and topological formulae
|
Recski, András |
|
1984 |
1-10 |
1 |
p. 63-68 6 p. |
artikel |
69 |
A new algorithm for Jordan sorting: its average-case analysis
|
Sojka, E. |
|
1999 |
1-10 |
1 |
p. 127-140 14 p. |
artikel |
70 |
A new algorithm to find the shortest paths between all pairs of nodes
|
Gallo, G. |
|
1982 |
1-10 |
1 |
p. 23-35 13 p. |
artikel |
71 |
A new competitive algorithm for group testing
|
Bar-Noy, Amotz |
|
1994 |
1-10 |
1 |
p. 29-38 10 p. |
artikel |
72 |
A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
|
Barth, Dominique |
|
1997 |
1-10 |
1 |
p. 115- 1 p. |
artikel |
73 |
A new lad curve-fitting algorithm: Slightly overdetermined equation systems in L 1
|
Seneta, Eugene |
|
1984 |
1-10 |
1 |
p. 79-91 13 p. |
artikel |
74 |
A new linear storage, polynomial-time approximation scheme for the subset-sum problem
|
Fischetti, Matteo |
|
1990 |
1-10 |
1 |
p. 61-77 17 p. |
artikel |
75 |
A new lower bound for the single row facility layout problem
|
Amaral, André R.S. |
|
2009 |
1-10 |
1 |
p. 183-190 8 p. |
artikel |
76 |
A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
|
Cai, Jin-Yi |
|
2003 |
1-10 |
1 |
p. 9-31 23 p. |
artikel |
77 |
An extension of Christofides heuristic to the k-person travelling salesman problem
|
Frieze, A.M. |
|
1983 |
1-10 |
1 |
p. 79-83 5 p. |
artikel |
78 |
An external memory data structure for shortest path queries
|
Hutchinson, David |
|
2003 |
1-10 |
1 |
p. 55-82 28 p. |
artikel |
79 |
An improved lower bound for the bin packing problem
|
Chen, Bintong |
|
1996 |
1-10 |
1 |
p. 81-94 14 p. |
artikel |
80 |
An isomorphism between the p-adic integers and a ring associated with a tiling of N-space by permutohedra
|
Kitto, Wei Z. |
|
1994 |
1-10 |
1 |
p. 39-51 13 p. |
artikel |
81 |
Announcement
|
|
|
1994 |
1-10 |
1 |
p. 99- 1 p. |
artikel |
82 |
Announcement
|
|
|
1986 |
1-10 |
1 |
p. 105- 1 p. |
artikel |
83 |
An NP-complete matching problem
|
Plaisted, David A. |
|
1980 |
1-10 |
1 |
p. 65-72 8 p. |
artikel |
84 |
An O(mlog logD) algorithm for shortest paths
|
Karlsson, Rolf G. |
|
1983 |
1-10 |
1 |
p. 91-93 3 p. |
artikel |
85 |
An O(n) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices
|
van der Veen, Jack A.A. |
|
1993 |
1-10 |
1 |
p. 57-75 19 p. |
artikel |
86 |
Anonymous secret sharing schemes
|
Blundo, C. |
|
1997 |
1-10 |
1 |
p. 13-28 16 p. |
artikel |
87 |
An optimal algorithm for finding dominating cycles in circular-arc graphs
|
Keil, J.Mark |
|
1992 |
1-10 |
1 |
p. 25-34 10 p. |
artikel |
88 |
An optimization problem on graphs
|
Du, Ding-Zhu |
|
1986 |
1-10 |
1 |
p. 101-104 4 p. |
artikel |
89 |
A note on approximate inclusion-exclusion
|
Melkman, Avraham A |
|
1997 |
1-10 |
1 |
p. 23-26 4 p. |
artikel |
90 |
A note on collections of graphs with non-surjective lambda labelings
|
Georges, John P. |
|
2005 |
1-10 |
1 |
p. 92-98 7 p. |
artikel |
91 |
A note on finding a maximum empty rectangle
|
Atallah, Mikhail J |
|
1986 |
1-10 |
1 |
p. 87-91 5 p. |
artikel |
92 |
A note on Frank's generalized polymatroids
|
Fujishige, Satoru |
|
1984 |
1-10 |
1 |
p. 105-109 5 p. |
artikel |
93 |
A note on identities of two-dimensional languages
|
Dolinka, Igor |
|
2005 |
1-10 |
1 |
p. 43-50 8 p. |
artikel |
94 |
A note on isomorphic simulation of automata by networks of two-state automata
|
Ésik, Zoltán |
|
1991 |
1-10 |
1 |
p. 77-82 6 p. |
artikel |
95 |
A note on Nordhaus–Gaddum inequalities for domination
|
Erfang, Shan |
|
2004 |
1-10 |
1 |
p. 83-85 3 p. |
artikel |
96 |
A note on occurrence of gapped patterns in i.i.d. sequences
|
Pozdnyakov, Vladimir |
|
2008 |
1-10 |
1 |
p. 93-102 10 p. |
artikel |
97 |
A note on odd/even cycles
|
Lubiw, Anna |
|
1988 |
1-10 |
1 |
p. 87-92 6 p. |
artikel |
98 |
A note on off-line machines with ‘brownian’ input heads
|
Ruohonen, Keijo |
|
1984 |
1-10 |
1 |
p. 69-75 7 p. |
artikel |
99 |
A note on perfect Lee-codes over small alphabets
|
Lepistö, Timo |
|
1981 |
1-10 |
1 |
p. 73-74 2 p. |
artikel |
100 |
A note on subtrees rooted along the primary path of a binary tree
|
Troutman, Brent M. |
|
1993 |
1-10 |
1 |
p. 87-93 7 p. |
artikel |
101 |
A note on the occupational degeneracy for dimers on a saturated two-dimensional lattice space
|
Hock, J.L. |
|
1984 |
1-10 |
1 |
p. 101-104 4 p. |
artikel |
102 |
An out-of-kilter method for the algebraic circulation problem
|
Brucker, P. |
|
1985 |
1-10 |
1 |
p. 1-18 18 p. |
artikel |
103 |
Antisymmetrical neural networks
|
Goles, E |
|
1986 |
1-10 |
1 |
p. 97-100 4 p. |
artikel |
104 |
A polymatroid associated with convex games
|
Kaneko, Hiroshi |
|
1986 |
1-10 |
1 |
p. 33-45 13 p. |
artikel |
105 |
A polynomial algorithm for an open shop problem with unit processing times and tree constraints
|
Bräsel, H. |
|
1995 |
1-10 |
1 |
p. 11-21 11 p. |
artikel |
106 |
A polynomial algorithm for constructing the clique graph of a line graph
|
Hedman, Bruce |
|
1986 |
1-10 |
1 |
p. 61-66 6 p. |
artikel |
107 |
Application of cover-free codes and combinatorial designs to two-stage testing
|
Berger, Toby |
|
2003 |
1-10 |
1 |
p. 11-26 16 p. |
artikel |
108 |
Applications of discrete mathematics
|
|
|
1990 |
1-10 |
1 |
p. 127-128 2 p. |
artikel |
109 |
Applications of edge coverings by cliques
|
Roberts, Fred S. |
|
1985 |
1-10 |
1 |
p. 93-109 17 p. |
artikel |
110 |
Approximate location of relevant variables under the crossover distribution
|
Damaschke, Peter |
|
2004 |
1-10 |
1 |
p. 47-67 21 p. |
artikel |
111 |
Approximate protein folding in the HP side chain model on extended cubic lattices
|
Heun, Volker |
|
2003 |
1-10 |
1 |
p. 163-177 15 p. |
artikel |
112 |
Approximating the treewidth of AT-free graphs
|
Bouchitté, Vincent |
|
2003 |
1-10 |
1 |
p. 11-37 27 p. |
artikel |
113 |
Approximation algorithms and relaxations for a service provision problem on a telecommunication network
|
Dye, Shane |
|
2003 |
1-10 |
1 |
p. 63-81 19 p. |
artikel |
114 |
Approximation algorithms for hitting objects with straight lines
|
Hassin, Refael |
|
1991 |
1-10 |
1 |
p. 29-42 14 p. |
artikel |
115 |
Approximation algorithms for some vehicle routing problems
|
Bazgan, Cristina |
|
2005 |
1-10 |
1 |
p. 27-42 16 p. |
artikel |
116 |
Approximations of Lovász extensions and their induced interaction index
|
Marichal, Jean-Luc |
|
2008 |
1-10 |
1 |
p. 11-24 14 p. |
artikel |
117 |
A property of real-time trellis automata
|
Yu, Sheng |
|
1986 |
1-10 |
1 |
p. 117-119 3 p. |
artikel |
118 |
A prospect for a general method of constructing t-designs
|
Hedayat, A.S. |
|
1993 |
1-10 |
1 |
p. 31-50 20 p. |
artikel |
119 |
A qualitative analysis of x ̇ =Ax+b
|
Bone, Terrence |
|
1988 |
1-10 |
1 |
p. 9-30 22 p. |
artikel |
120 |
A ramp model for distributed key distribution schemes
|
Blundo, Carlo |
|
2003 |
1-10 |
1 |
p. 47-64 18 p. |
artikel |
121 |
A remark on evolutionary systems
|
Csuhaj-Varjú, Erzsébet |
|
2005 |
1-10 |
1 |
p. 111-115 5 p. |
artikel |
122 |
A representation theorem of the suffixes of characteristic sequences
|
Wai-Fong, Chuan |
|
1998 |
1-10 |
1 |
p. 47-57 11 p. |
artikel |
123 |
A shifting algorithm for constrained min-max partition on trees
|
Agasi, Eliezer |
|
1993 |
1-10 |
1 |
p. 1-28 28 p. |
artikel |
124 |
A simple expected running time analysis for randomized “divide and conquer” algorithms
|
Dean, Brian C. |
|
2006 |
1-10 |
1 |
p. 1-5 5 p. |
artikel |
125 |
A simplified NP-complete satisfiability problem
|
Tovey, Craig A. |
|
1984 |
1-10 |
1 |
p. 85-89 5 p. |
artikel |
126 |
A solvable case of quadratic 0–1 programming
|
Barahona, Francisco |
|
1986 |
1-10 |
1 |
p. 23-26 4 p. |
artikel |
127 |
Aspects mathematics des reseaux de petri
|
|
|
1990 |
1-10 |
1 |
p. 132- 1 p. |
artikel |
128 |
A sufficient condition for polynomial distribution-dependent learnability
|
Anthony, Martin |
|
1997 |
1-10 |
1 |
p. 1-12 12 p. |
artikel |
129 |
Asymptotically optimal gossiping in radio networks
|
Ravishankar, Krishnamurthi |
|
1995 |
1-10 |
1 |
p. 61-82 22 p. |
artikel |
130 |
Asymptotic number of symmetries in locally restricted trees
|
Kennedy, J.W. |
|
1990 |
1-10 |
1 |
p. 121-124 4 p. |
artikel |
131 |
A system of linear equations related to the transportation problem with application to probability theory
|
Lin, T.F. |
|
1986 |
1-10 |
1 |
p. 47-56 10 p. |
artikel |
132 |
A ternary search problem on graphs
|
Andreae, Thomas |
|
1989 |
1-10 |
1 |
p. 1-10 10 p. |
artikel |
133 |
A three-dimensional matching model for perishable production scheduling
|
Arbib, Claudio |
|
1999 |
1-10 |
1 |
p. 1-15 15 p. |
artikel |
134 |
A transfinite form of Sibson's interpolant
|
Gross, L. |
|
1999 |
1-10 |
1 |
p. 33-50 18 p. |
artikel |
135 |
Attacking a public key cryptosystem based on tree replacement
|
Vasco, María Isabel González |
|
2007 |
1-10 |
1 |
p. 61-67 7 p. |
artikel |
136 |
Augmented nodal matrices and normal trees
|
Riaza, Ricardo |
|
2010 |
1-10 |
1 |
p. 44-61 18 p. |
artikel |
137 |
Augmenting graphs for independent sets
|
Alekseev, Vladimir E. |
|
2004 |
1-10 |
1 |
p. 3-10 8 p. |
artikel |
138 |
Author index
|
|
|
1999 |
1-10 |
1 |
p. 89- 1 p. |
artikel |
139 |
Average distance and domination number
|
Dankelmann, P. |
|
1997 |
1-10 |
1 |
p. 21-35 15 p. |
artikel |
140 |
Axiomatic characterizations of generalized values
|
Marichal, Jean-Luc |
|
2007 |
1-10 |
1 |
p. 26-43 18 p. |
artikel |
141 |
Balanced vertex-orderings of graphs
|
Biedl, Therese |
|
2005 |
1-10 |
1 |
p. 27-48 22 p. |
artikel |
142 |
Balancing modular transfer lines with serial–parallel activation of spindle heads at stations
|
Dolgui, A. |
|
2009 |
1-10 |
1 |
p. 68-89 22 p. |
artikel |
143 |
Basic formulas and languages
|
Ehrenfeucht, A. |
|
1982 |
1-10 |
1 |
p. 11-22 12 p. |
artikel |
144 |
Bifurcation structure of a discrete neuronal equation
|
Cosnard, Michel |
|
1988 |
1-10 |
1 |
p. 21-34 14 p. |
artikel |
145 |
Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones
|
Hwang, F.K. |
|
1991 |
1-10 |
1 |
p. 83-86 4 p. |
artikel |
146 |
Bipartite permutation graphs with application to the minimum buffer size problem
|
Lai, Ten-Hwang |
|
1997 |
1-10 |
1 |
p. 33-55 23 p. |
artikel |
147 |
Bisecting de Bruijn and Kautz graphs
|
Rolim, José |
|
1998 |
1-10 |
1 |
p. 87-97 11 p. |
artikel |
148 |
Bit-optimal decoding of codes whose Tanner graphs are trees
|
Soljanin, E |
|
2003 |
1-10 |
1 |
p. 293-303 11 p. |
artikel |
149 |
Block linear majorants in quadratic 0–1 optimization
|
Boros, Endre |
|
2004 |
1-10 |
1 |
p. 52-71 20 p. |
artikel |
150 |
Book announcement
|
|
|
1992 |
1-10 |
1 |
p. 87-90 4 p. |
artikel |
151 |
Book announcement
|
|
|
1980 |
1-10 |
1 |
p. 85-87 3 p. |
artikel |
152 |
Book announcements
|
|
|
1993 |
1-10 |
1 |
p. 105-108 4 p. |
artikel |
153 |
Book announcements
|
|
|
1995 |
1-10 |
1 |
p. 97-99 3 p. |
artikel |
154 |
Book announcements
|
|
|
1993 |
1-10 |
1 |
p. 95-98 4 p. |
artikel |
155 |
Book announcements
|
|
|
1996 |
1-10 |
1 |
p. 93-95 3 p. |
artikel |
156 |
Book announcements
|
|
|
1991 |
1-10 |
1 |
p. 75-78 4 p. |
artikel |
157 |
Book announcements
|
|
|
1991 |
1-10 |
1 |
p. 93-97 5 p. |
artikel |
158 |
Book announcements
|
|
|
1992 |
1-10 |
1 |
p. 95-97 3 p. |
artikel |
159 |
Book announcements
|
|
|
1982 |
1-10 |
1 |
p. 75-78 4 p. |
artikel |
160 |
Book announcements
|
|
|
1989 |
1-10 |
1 |
p. 97-98 2 p. |
artikel |
161 |
Book announcements
|
|
|
1984 |
1-10 |
1 |
p. 105-108 4 p. |
artikel |
162 |
Book announcements
|
|
|
1988 |
1-10 |
1 |
p. 99-100 2 p. |
artikel |
163 |
Boolean reasoning: The logic of Boolean equations
|
|
|
1993 |
1-10 |
1 |
p. 82- 1 p. |
artikel |
164 |
Bounding sample size with the Vapnik-Chervonenkis dimension
|
Shawe-Taylor, John |
|
1993 |
1-10 |
1 |
p. 65-73 9 p. |
artikel |
165 |
Broadcasting in random graphs
|
Frieze, Alan |
|
1994 |
1-10 |
1 |
p. 77-79 3 p. |
artikel |
166 |
Broadcasting with random faults
|
Bienstock, Daniel |
|
1988 |
1-10 |
1 |
p. 1-7 7 p. |
artikel |
167 |
Broadcasts in graphs
|
Dunbar, Jean E. |
|
2006 |
1-10 |
1 |
p. 59-75 17 p. |
artikel |
168 |
Calculating growth rates and moments for additive cellular automata
|
Willson, Stephen J. |
|
1992 |
1-10 |
1 |
p. 47-65 19 p. |
artikel |
169 |
Call for papers
|
|
|
1984 |
1-10 |
1 |
p. 113- 1 p. |
artikel |
170 |
Cellular automata can generate fractals
|
Willson, Stephen J. |
|
1984 |
1-10 |
1 |
p. 91-99 9 p. |
artikel |
171 |
Cellular logic image processing
|
|
|
1990 |
1-10 |
1 |
p. 129- 1 p. |
artikel |
172 |
Certain Boolean equations
|
Banković, D. |
|
1992 |
1-10 |
1 |
p. 21-27 7 p. |
artikel |
173 |
Characterization of optimal key set protocols
|
Mizuki, Takaaki |
|
2003 |
1-10 |
1 |
p. 213-236 24 p. |
artikel |
174 |
Chronological orderings of interval graphs
|
Skrien, D. |
|
1984 |
1-10 |
1 |
p. 69-83 15 p. |
artikel |
175 |
Circular avoiding sequences with prescribed sum
|
Clark, Dean S. |
|
1993 |
1-10 |
1 |
p. 27-36 10 p. |
artikel |
176 |
Classes of bipartite graphs related to chordal graphs
|
Brandstädt, Andreas |
|
1991 |
1-10 |
1 |
p. 51-60 10 p. |
artikel |
177 |
Classes of regular and context-free languages over countably infinite alphabets
|
Otto, Friedrich |
|
1985 |
1-10 |
1 |
p. 41-56 16 p. |
artikel |
178 |
Classic squares and broadcast squares
|
Valerio, M. |
|
1994 |
1-10 |
1 |
p. 89-96 8 p. |
artikel |
179 |
Classification of normalized cluster methods in an order theoretic model
|
Baulieu, Forrest B. |
|
1991 |
1-10 |
1 |
p. 1-29 29 p. |
artikel |
180 |
clever or smart: Strategies for the online target date assignment problem
|
Gassner, Elisabeth |
|
2010 |
1-10 |
1 |
p. 71-79 9 p. |
artikel |
181 |
Clin d'oeil on L 1-embeddable planar graphs
|
Chepoi, Victor |
|
1997 |
1-10 |
1 |
p. 3-19 17 p. |
artikel |
182 |
Clique covering and clique partition in generalizations of line graphs
|
Prisner, Erich |
|
1995 |
1-10 |
1 |
p. 93-98 6 p. |
artikel |
183 |
Clique tree inequalities define facets of the asymmetric traveling salesman polytope
|
Fischetti, Matteo |
|
1995 |
1-10 |
1 |
p. 9-18 10 p. |
artikel |
184 |
Closure spaces that are not uniquely generated
|
Jamison, Robert E. |
|
2005 |
1-10 |
1 |
p. 69-79 11 p. |
artikel |
185 |
Clustering and domination in perfect graphs
|
Corneil, D.G. |
|
1984 |
1-10 |
1 |
p. 27-39 13 p. |
artikel |
186 |
Codage des polyominos convexes et équations pour l'énumération suivant l'aire
|
Bousquet-Mélou, Mireille |
|
1994 |
1-10 |
1 |
p. 21-43 23 p. |
artikel |
187 |
Coloring drawings of bipartite graphs: A problem in automated assembly
|
Sinden, F.W. |
|
1993 |
1-10 |
1 |
p. 55-68 14 p. |
artikel |
188 |
Coloring some classes of mixed graphs
|
Ries, B. |
|
2007 |
1-10 |
1 |
p. 1-6 6 p. |
artikel |
189 |
Coloring the square of the Kneser graph KG ( 2 k + 1 , k ) and the Schrijver graph SG ( 2 k + 2 , k )
|
Chen, Jun-Yo |
|
2009 |
1-10 |
1 |
p. 170-176 7 p. |
artikel |
190 |
Column scrambler for the GPT cryptosystem
|
Ourivski, A.V. |
|
2003 |
1-10 |
1 |
p. 207-221 15 p. |
artikel |
191 |
Combinatorial algorithms
|
|
|
1983 |
1-10 |
1 |
p. 103-104 2 p. |
artikel |
192 |
Combinatorial optimization
|
|
|
2005 |
1-10 |
1 |
p. 120-122 3 p. |
artikel |
193 |
Combinatorial problems on series-parallel graphs
|
Takamizawa, K. |
|
1981 |
1-10 |
1 |
p. 75-76 2 p. |
artikel |
194 |
Combinatorial properties of boundary NLC graph languages
|
Rozenberg, Grzegorz |
|
1987 |
1-10 |
1 |
p. 59-73 15 p. |
artikel |
195 |
Combinatorial variability of vapnik-chervonenkis classes with applications to sample compression schemes
|
Ben-David, Shai |
|
1998 |
1-10 |
1 |
p. 3-25 23 p. |
artikel |
196 |
Compact scheduling of zero–one time operations in multi-stage systems
|
Giaro, Krzysztof |
|
2004 |
1-10 |
1 |
p. 95-103 9 p. |
artikel |
197 |
Competitive video on demand schedulers for popular movies
|
Bouras, Christos |
|
2003 |
1-10 |
1 |
p. 49-61 13 p. |
artikel |
198 |
Completely unimodal numberings of a simple polytope
|
Williamson Hoke, Kathy |
|
1988 |
1-10 |
1 |
p. 69-81 13 p. |
artikel |
199 |
Completeness of temporal logics over infinite intervals
|
Wang, Hanpin |
|
2004 |
1-10 |
1 |
p. 87-103 17 p. |
artikel |
200 |
Complexity classification of some edge modification problems
|
Natanzon, Assaf |
|
2001 |
1-10 |
1 |
p. 109-128 20 p. |
artikel |
201 |
Complexity of the directed spanning cactus problem
|
Palbom, Anna |
|
2005 |
1-10 |
1 |
p. 81-91 11 p. |
artikel |
202 |
Complexity of the generalized conjugacy problem
|
Geun Hahn, Sang |
|
2003 |
1-10 |
1 |
p. 33-36 4 p. |
artikel |
203 |
Complexity of tree homomorphisms
|
Hell, P. |
|
1996 |
1-10 |
1 |
p. 23-36 14 p. |
artikel |
204 |
Compositional complexity of Boolean functions
|
Abelson, Harold |
|
1982 |
1-10 |
1 |
p. 1-10 10 p. |
artikel |
205 |
Computability and logic
|
|
|
1990 |
1-10 |
1 |
p. 129- 1 p. |
artikel |
206 |
Computational methods in number theory, Part I
|
|
|
1984 |
1-10 |
1 |
p. 112- 1 p. |
artikel |
207 |
Computational methods in number theory, Part II
|
|
|
1984 |
1-10 |
1 |
p. 112- 1 p. |
artikel |
208 |
Computer solution of linear programs
|
|
|
1990 |
1-10 |
1 |
p. 127- 1 p. |
artikel |
209 |
Computing discrete logarithms with the parallelized kangaroo method
|
Teske, Edlyn |
|
2003 |
1-10 |
1 |
p. 61-82 22 p. |
artikel |
210 |
Computing matrix period in max-min algebra
|
Gavalec, Martin |
|
1997 |
1-10 |
1 |
p. 63-70 8 p. |
artikel |
211 |
Computing maximum mean cuts
|
McCormick, S.Thomas |
|
1994 |
1-10 |
1 |
p. 53-70 18 p. |
artikel |
212 |
Computing roots of graphs is hard
|
Motwani, Rajeev |
|
1994 |
1-10 |
1 |
p. 81-88 8 p. |
artikel |
213 |
Computing zeta functions for ordinary formal groups over finite fields
|
Satoh, Takakazu |
|
2003 |
1-10 |
1 |
p. 51-60 10 p. |
artikel |
214 |
Conditions for the existence of solutions of the three-dimensional planar transportation problem
|
Vlach, Milan |
|
1986 |
1-10 |
1 |
p. 61-78 18 p. |
artikel |
215 |
Conjunctive prediction of an ordinal criterion variable on the basis of binary predictors
|
Lombardi, L. |
|
2005 |
1-10 |
1 |
p. 91-100 10 p. |
artikel |
216 |
Connectivity in multi-factor designs
|
|
|
1983 |
1-10 |
1 |
p. 107- 1 p. |
artikel |
217 |
Connectivity of k-extendable graphs with large k
|
Lou, Dingjun |
|
2004 |
1-10 |
1 |
p. 55-61 7 p. |
artikel |
218 |
Consecutive interval query and dynamic programming on intervals
|
Aggarwal, Alok |
|
1998 |
1-10 |
1 |
p. 1-24 24 p. |
artikel |
219 |
Consensus algorithms for the generation of all maximal bicliques
|
Alexe, Gabriela |
|
2004 |
1-10 |
1 |
p. 11-21 11 p. |
artikel |
220 |
Consensus functions on trees that satisfy an independence axiom
|
McMorris, F.R. |
|
1993 |
1-10 |
1 |
p. 47-55 9 p. |
artikel |
221 |
Constrained partitioning problems
|
Hwang, Frank K. |
|
1994 |
1-10 |
1 |
p. 93-96 4 p. |
artikel |
222 |
Constrained partitioning problems
|
Burkard, Rainer E. |
|
1990 |
1-10 |
1 |
p. 21-34 14 p. |
artikel |
223 |
Constructing efficient simulated annealing algorithms
|
Duque-Antón, Manuel |
|
1997 |
1-10 |
1 |
p. 115- 1 p. |
artikel |
224 |
Constructing status injective graphs
|
Pachter, Lior |
|
1997 |
1-10 |
1 |
p. 107-113 7 p. |
artikel |
225 |
Construction of sports schedules with multiple venues
|
de Werra, D. |
|
2006 |
1-10 |
1 |
p. 47-58 12 p. |
artikel |
226 |
Contemporary issues in decision making
|
|
|
1993 |
1-10 |
1 |
p. 83-84 2 p. |
artikel |
227 |
Contents
|
|
|
2009 |
1-10 |
1 |
p. vii-viii nvt p. |
artikel |
228 |
Contents
|
|
|
2010 |
1-10 |
1 |
p. vii- 1 p. |
artikel |
229 |
Contents
|
|
|
2003 |
1-10 |
1 |
p. vii-viii nvt p. |
artikel |
230 |
Contents
|
|
|
2003 |
1-10 |
1 |
p. ix-x nvt p. |
artikel |
231 |
Contents
|
|
|
2003 |
1-10 |
1 |
p. ix- 1 p. |
artikel |
232 |
Contents
|
|
|
2003 |
1-10 |
1 |
p. vii- 1 p. |
artikel |
233 |
Contents
|
|
|
2011 |
1-10 |
1 |
p. v- 1 p. |
artikel |
234 |
Contents
|
|
|
2004 |
1-10 |
1 |
p. ix- 1 p. |
artikel |
235 |
Contents
|
|
|
2004 |
1-10 |
1 |
p. vii-viii nvt p. |
artikel |
236 |
Contents
|
|
|
2006 |
1-10 |
1 |
p. viii-ix nvt p. |
artikel |
237 |
Contents
|
|
|
2005 |
1-10 |
1 |
p. ix- 1 p. |
artikel |
238 |
Contents
|
|
|
2005 |
1-10 |
1 |
p. vii-viii nvt p. |
artikel |
239 |
Contents
|
|
|
2005 |
1-10 |
1 |
p. ix-x nvt p. |
artikel |
240 |
Contents
|
|
|
2007 |
1-10 |
1 |
p. vii- 1 p. |
artikel |
241 |
Contents
|
|
|
2008 |
1-10 |
1 |
p. vii-viii nvt p. |
artikel |
242 |
Contents all nrs. if necessary
|
|
|
2003 |
1-10 |
1 |
p. vii-viii nvt p. |
artikel |
243 |
Contents all nrs. if necessary
|
|
|
2003 |
1-10 |
1 |
p. vii-viii nvt p. |
artikel |
244 |
Contents Vol. 136/1
|
|
|
2004 |
1-10 |
1 |
p. viii-ix nvt p. |
artikel |
245 |
Conversion of coloring algorithms into maximum weight independent set algorithms
|
Erlebach, Thomas |
|
2005 |
1-10 |
1 |
p. 107-125 19 p. |
artikel |
246 |
Corrigendum
|
Mahmoud, Hosam M. |
|
1991 |
1-10 |
1 |
p. 91- 1 p. |
artikel |
247 |
Counting bichromatic evolutionary trees
|
Erdős, Péter L. |
|
1993 |
1-10 |
1 |
p. 1-8 8 p. |
artikel |
248 |
Counting representable sets on simple graphs
|
Jeavons, Peter G. |
|
1993 |
1-10 |
1 |
p. 33-46 14 p. |
artikel |
249 |
Covering symmetric semi-monotone functions
|
Grappe, Roland |
|
2008 |
1-10 |
1 |
p. 138-144 7 p. |
artikel |
250 |
Covering with latin transversals
|
Alon, Noga |
|
1995 |
1-10 |
1 |
p. 1-10 10 p. |
artikel |
251 |
Critically indecomposable graphs
|
Dubey, Chandan K. |
|
2009 |
1-10 |
1 |
p. 149-163 15 p. |
artikel |
252 |
Cross-correlations of linearly and quadratically related geometric sequences and GMW sequences
|
Klapper, A. |
|
1993 |
1-10 |
1 |
p. 1-20 20 p. |
artikel |
253 |
Cycle structure of edge labelled graphs
|
Diamond, James S. |
|
1993 |
1-10 |
1 |
p. 51-62 12 p. |
artikel |
254 |
Cyclically permutable representations of cyclic codes
|
Smith, Derek H. |
|
2008 |
1-10 |
1 |
p. 76-81 6 p. |
artikel |
255 |
Cyclic bandwidth with an edge added
|
Chan, W.H. |
|
2008 |
1-10 |
1 |
p. 131-137 7 p. |
artikel |
256 |
Cyclic codes of length 2 e over Z 4
|
Abualrub, Taher |
|
2003 |
1-10 |
1 |
p. 3-9 7 p. |
artikel |
257 |
Cyclic codes over Z 4 of oddly even length
|
Blackford, Thomas |
|
2003 |
1-10 |
1 |
p. 27-46 20 p. |
artikel |
258 |
Deadlock prevention by acyclic orientations
|
Bermond, Jean-Claude |
|
2003 |
1-10 |
1 |
p. 31-47 17 p. |
artikel |
259 |
Decision analysis of management judgement
|
|
|
1994 |
1-10 |
1 |
p. 97-98 2 p. |
artikel |
260 |
Decision problems and regular chain code picture languages
|
Dassow, Jürgen |
|
1993 |
1-10 |
1 |
p. 29-49 21 p. |
artikel |
261 |
Deltahedra are realizable as simplicial convex polyhedra
|
Lehel, J. |
|
1980 |
1-10 |
1 |
p. 81-84 4 p. |
artikel |
262 |
Denumerations of rooted trees and multisets
|
de Bruijn, N.G. |
|
1983 |
1-10 |
1 |
p. 25-33 9 p. |
artikel |
263 |
Designing algorithms by sampling
|
Goldberg, M.K. |
|
2001 |
1-10 |
1 |
p. 59-75 17 p. |
artikel |
264 |
Design of electricity supply networks
|
Boffey, T.B. |
|
1983 |
1-10 |
1 |
p. 25-38 14 p. |
artikel |
265 |
Detection of the discrete convexity of polyominoes
|
Debled-Rennesson, Isabelle |
|
2003 |
1-10 |
1 |
p. 115-133 19 p. |
artikel |
266 |
Deterministic and stochastic scheduling
|
|
|
1983 |
1-10 |
1 |
p. 105-106 2 p. |
artikel |
267 |
Difference graphs
|
Hammer, Peter L. |
|
1990 |
1-10 |
1 |
p. 35-44 10 p. |
artikel |
268 |
Digital pseudomanifolds, digital weakmanifolds and Jordan–Brouwer separation theorem
|
Khachan, Mohammed |
|
2003 |
1-10 |
1 |
p. 45-57 13 p. |
artikel |
269 |
Directed cartesian-product graphs have unique factorizations that can be computed in polynomial time
|
Feigenbaum, Joan |
|
1986 |
1-10 |
1 |
p. 105-110 6 p. |
artikel |
270 |
Directed rectangle-visibility graphs have unbounded dimension
|
Romanik, Kathleen |
|
1997 |
1-10 |
1 |
p. 35-39 5 p. |
artikel |
271 |
Discrete Dirichlet integral formula
|
Kayano, Takashi |
|
1988 |
1-10 |
1 |
p. 53-68 16 p. |
artikel |
272 |
Discrete infinite transportation problems
|
Kortanek, Kenneth O. |
|
1995 |
1-10 |
1 |
p. 19-33 15 p. |
artikel |
273 |
Discrete location theory
|
|
|
1992 |
1-10 |
1 |
p. 93-94 2 p. |
artikel |
274 |
Disjoint paths in symmetric digraphs
|
Jarry, A. |
|
2009 |
1-10 |
1 |
p. 90-97 8 p. |
artikel |
275 |
Distance-related invariants on polygraphs
|
Juvan, Martin |
|
1997 |
1-10 |
1 |
p. 57-71 15 p. |
artikel |
276 |
Distances in cocomparability graphs and their powers
|
Damaschke, Peter |
|
1992 |
1-10 |
1 |
p. 67-72 6 p. |
artikel |
277 |
Divisor generating functions and insertion into a heap
|
Uchimura, Keisuke |
|
1987 |
1-10 |
1 |
p. 73-81 9 p. |
artikel |
278 |
Drawing graphs on rectangular grids
|
Schäffter, Markus |
|
1995 |
1-10 |
1 |
p. 75-89 15 p. |
artikel |
279 |
Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
|
Sherali, Hanif D. |
|
1988 |
1-10 |
1 |
p. 51-68 18 p. |
artikel |
280 |
Dualization of regular Boolean functions
|
Crama, Y. |
|
1987 |
1-10 |
1 |
p. 79-85 7 p. |
artikel |
281 |
Dynamic maintenance and visualization of molecular surfaces
|
Bajaj, Chandrajit L. |
|
2003 |
1-10 |
1 |
p. 23-51 29 p. |
artikel |
282 |
Edge colouring line graphs of unicyclic graphs
|
Cai, Leizhen |
|
1992 |
1-10 |
1 |
p. 75-82 8 p. |
artikel |
283 |
Edge deletion preserving the diameter of the hypercube
|
Bouabdallah, A. |
|
1995 |
1-10 |
1 |
p. 91-95 5 p. |
artikel |
284 |
Edge ranking of graphs is hard
|
Lam, Tak Wah |
|
1998 |
1-10 |
1 |
p. 71-86 16 p. |
artikel |
285 |
Editorial
|
Battati, Roberto |
|
2001 |
1-10 |
1 |
p. 1- 1 p. |
artikel |
286 |
Editorial
|
Lengauer, Thomas |
|
1992 |
1-10 |
1 |
p. 1-3 3 p. |
artikel |
287 |
Editorial
|
Borgefors, Gunilla |
|
2003 |
1-10 |
1 |
p. 1-2 2 p. |
artikel |
288 |
Editorial Board
|
|
|
2009 |
1-10 |
1 |
p. v-vi nvt p. |
artikel |
289 |
Editorial Board
|
|
|
2010 |
1-10 |
1 |
p. v-vi nvt p. |
artikel |
290 |
Editorial Board
|
|
|
2003 |
1-10 |
1 |
p. v-vi nvt p. |
artikel |
291 |
Editorial Board
|
|
|
2003 |
1-10 |
1 |
p. v-vii nvt p. |
artikel |
292 |
Editorial board
|
|
|
2003 |
1-10 |
1 |
p. v-vii nvt p. |
artikel |
293 |
Editorial Board
|
|
|
1995 |
1-10 |
1 |
p. v-vi nvt p. |
artikel |
294 |
Editorial Board
|
|
|
1995 |
1-10 |
1 |
p. v-vi nvt p. |
artikel |
295 |
Editorial board
|
|
|
1991 |
1-10 |
1 |
p. iii-iv nvt p. |
artikel |
296 |
Editorial Board
|
|
|
1992 |
1-10 |
1 |
p. iii-iv nvt p. |
artikel |
297 |
Editorial board
|
|
|
1994 |
1-10 |
1 |
p. iii-iv nvt p. |
artikel |
298 |
Editorial Board
|
|
|
1997 |
1-10 |
1 |
p. i-ii nvt p. |
artikel |
299 |
Editorial Board
|
|
|
1992 |
1-10 |
1 |
p. iii-iv nvt p. |
artikel |
300 |
Editorial Board
|
|
|
1993 |
1-10 |
1 |
p. iii-iv nvt p. |
artikel |
301 |
Editorial Board
|
|
|
1994 |
1-10 |
1 |
p. ii-iii nvt p. |
artikel |
302 |
Editorial Board
|
|
|
1994 |
1-10 |
1 |
p. v-vi nvt p. |
artikel |
303 |
Editorial board
|
|
|
1994 |
1-10 |
1 |
p. iii-iv nvt p. |
artikel |
304 |
Editorial Board
|
|
|
1995 |
1-10 |
1 |
p. IFC- 1 p. |
artikel |
305 |
Editorial Board
|
|
|
1995 |
1-10 |
1 |
p. iii-iv nvt p. |
artikel |
306 |
Editorial Board
|
|
|
1995 |
1-10 |
1 |
p. v-vi nvt p. |
artikel |
307 |
Editorial Board
|
|
|
1995 |
1-10 |
1 |
p. v-vi nvt p. |
artikel |
308 |
Editorial board
|
|
|
1993 |
1-10 |
1 |
p. iii-iv nvt p. |
artikel |
309 |
Editorial Board
|
|
|
1992 |
1-10 |
1 |
p. iii-iv nvt p. |
artikel |
310 |
Editorial Board
|
|
|
1997 |
1-10 |
1 |
p. iii-iv nvt p. |
artikel |
311 |
Editorial Board
|
|
|
1997 |
1-10 |
1 |
p. v-vi nvt p. |
artikel |
312 |
Editorial Board
|
|
|
1997 |
1-10 |
1 |
p. IFC- 1 p. |
artikel |
313 |
Editorial Board
|
|
|
1997 |
1-10 |
1 |
p. iii-iv nvt p. |
artikel |
314 |
Editorial Board
|
|
|
1996 |
1-10 |
1 |
p. IFC- 1 p. |
artikel |
315 |
Editorial Board
|
|
|
1996 |
1-10 |
1 |
p. IFC- 1 p. |
artikel |
316 |
Editorial Board
|
|
|
1996 |
1-10 |
1 |
p. iii-iv nvt p. |
artikel |
317 |
Editorial board
|
|
|
1991 |
1-10 |
1 |
p. ii-iii nvt p. |
artikel |
318 |
Editorial board
|
|
|
1991 |
1-10 |
1 |
p. v-vi nvt p. |
artikel |
319 |
Editorial board
|
|
|
1993 |
1-10 |
1 |
p. iii-iv nvt p. |
artikel |
320 |
Editorial Board
|
|
|
1992 |
1-10 |
1 |
p. iii-iv nvt p. |
artikel |
321 |
Editorial Board
|
|
|
1993 |
1-10 |
1 |
p. iii-iv nvt p. |
artikel |
322 |
Editorial Board
|
|
|
1993 |
1-10 |
1 |
p. iii-iv nvt p. |
artikel |
323 |
Editorial board
|
|
|
1994 |
1-10 |
1 |
p. ii-iii nvt p. |
artikel |
324 |
Editorial Board
|
|
|
1998 |
1-10 |
1 |
p. IFC- 1 p. |
artikel |
325 |
Editorial Board
|
|
|
1998 |
1-10 |
1 |
p. v-vi nvt p. |
artikel |
326 |
Editorial Board
|
|
|
1999 |
1-10 |
1 |
p. v- 1 p. |
artikel |
327 |
Editorial Board
|
|
|
1999 |
1-10 |
1 |
p. IFC- 1 p. |
artikel |
328 |
Editorial Board
|
|
|
1990 |
1-10 |
1 |
p. iii-iv nvt p. |
artikel |
329 |
Editorial Board
|
|
|
1988 |
1-10 |
1 |
p. OFC- 1 p. |
artikel |
330 |
Editorial Board
|
|
|
1983 |
1-10 |
1 |
p. ii- 1 p. |
artikel |
331 |
Editorial Board
|
|
|
1984 |
1-10 |
1 |
p. iv- 1 p. |
artikel |
332 |
Editorial Board
|
|
|
1986 |
1-10 |
1 |
p. ii- 1 p. |
artikel |
333 |
Editorial Board
|
|
|
1987 |
1-10 |
1 |
p. ii- 1 p. |
artikel |
334 |
Editorial board
|
|
|
1993 |
1-10 |
1 |
p. iii-iv nvt p. |
artikel |
335 |
Editorial board
|
|
|
1990 |
1-10 |
1 |
p. iii-iv nvt p. |
artikel |
336 |
Editorial board
|
|
|
1984 |
1-10 |
1 |
p. iii- 1 p. |
artikel |
337 |
Editorial board
|
|
|
1983 |
1-10 |
1 |
p. IFC- 1 p. |
artikel |
338 |
Editorial Board
|
|
|
1988 |
1-10 |
1 |
p. ii- 1 p. |
artikel |
339 |
Editorial Board
|
|
|
1987 |
1-10 |
1 |
p. ii- 1 p. |
artikel |
340 |
Editorial Board
|
|
|
1989 |
1-10 |
1 |
p. ii- 1 p. |
artikel |
341 |
Editorial Board
|
|
|
1985 |
1-10 |
1 |
p. IFC- 1 p. |
artikel |
342 |
Editorial Board
|
|
|
1981 |
1-10 |
1 |
p. ii- 1 p. |
artikel |
343 |
Editorial Board
|
|
|
1986 |
1-10 |
1 |
p. IFC- 1 p. |
artikel |
344 |
Editorial Board
|
|
|
1984 |
1-10 |
1 |
p. iv- 1 p. |
artikel |
345 |
Editorial Board
|
|
|
1988 |
1-10 |
1 |
p. IFC- 1 p. |
artikel |
346 |
Editorial Board
|
|
|
1985 |
1-10 |
1 |
p. ii- 1 p. |
artikel |
347 |
Editorial board
|
|
|
1982 |
1-10 |
1 |
p. ii- 1 p. |
artikel |
348 |
Editorial Board
|
|
|
1985 |
1-10 |
1 |
p. ii- 1 p. |
artikel |
349 |
Editorial Board
|
|
|
1986 |
1-10 |
1 |
p. ii- 1 p. |
artikel |
350 |
Editorial Board
|
|
|
1980 |
1-10 |
1 |
p. ii- 1 p. |
artikel |
351 |
Editorial board
|
|
|
1990 |
1-10 |
1 |
p. v-vi nvt p. |
artikel |
352 |
Editorial Board
|
|
|
2004 |
1-10 |
1 |
p. v-vii nvt p. |
artikel |
353 |
Editorial Board
|
|
|
2004 |
1-10 |
1 |
p. v-vii nvt p. |
artikel |
354 |
Editorial Board
|
|
|
2004 |
1-10 |
1 |
p. v-vi nvt p. |
artikel |
355 |
Editorial Board
|
|
|
2006 |
1-10 |
1 |
p. v-vii nvt p. |
artikel |
356 |
Editorial Board
|
|
|
2005 |
1-10 |
1 |
p. v-vi nvt p. |
artikel |
357 |
Editorial Board
|
|
|
2005 |
1-10 |
1 |
p. v-vii nvt p. |
artikel |
358 |
Editorial Board
|
|
|
2005 |
1-10 |
1 |
p. v-vii nvt p. |
artikel |
359 |
Editorial Board
|
|
|
2007 |
1-10 |
1 |
p. v-vi nvt p. |
artikel |
360 |
Editorial Board
|
|
|
2008 |
1-10 |
1 |
p. v-vi nvt p. |
artikel |
361 |
Editorial Board Page
|
|
|
2003 |
1-10 |
1 |
p. v-vi nvt p. |
artikel |
362 |
Editors
|
|
|
2003 |
1-10 |
1 |
p. v-vi nvt p. |
artikel |
363 |
Editors nr. 1
|
|
|
2003 |
1-10 |
1 |
p. v-vi nvt p. |
artikel |
364 |
Efficient algorithms and codes for k-cardinality assignment problems
|
Dell'Amico, Mauro |
|
2001 |
1-10 |
1 |
p. 25-40 16 p. |
artikel |
365 |
Efficient implementation of a shifting algorithm
|
Perl, Yehoshua |
|
1985 |
1-10 |
1 |
p. 71-80 10 p. |
artikel |
366 |
Efficiently solvable special cases of bottleneck travelling salesman problems
|
Burkard, R.E. |
|
1991 |
1-10 |
1 |
p. 61-76 16 p. |
artikel |
367 |
Efficient m-ary balanced codes
|
Tallini, L.G. |
|
1999 |
1-10 |
1 |
p. 17-56 40 p. |
artikel |
368 |
Efficient parallel recognition algorithms of cographs and distance hereditary graphs
|
Dahlhaus, Elias |
|
1995 |
1-10 |
1 |
p. 29-44 16 p. |
artikel |
369 |
Efficient polynomial algorithms for distributive lattices
|
Bordat, Jean-Paul |
|
1991 |
1-10 |
1 |
p. 31-50 20 p. |
artikel |
370 |
Electronic Circuits: Design and Applications
|
|
|
1993 |
1-10 |
1 |
p. 90-91 2 p. |
artikel |
371 |
Elementary linear algebra
|
|
|
1992 |
1-10 |
1 |
p. 95- 1 p. |
artikel |
372 |
Enumeration of perfect matchings of a type of Cartesian products of graphs
|
Yan, Weigen |
|
2006 |
1-10 |
1 |
p. 145-157 13 p. |
artikel |
373 |
Equivalence among optimization problems on matrix sets
|
Burgin, M.S. |
|
1983 |
1-10 |
1 |
p. 13-24 12 p. |
artikel |
374 |
Equivalence of some LP-based lower bounds for the Golomb ruler problem
|
Meyer, Christophe |
|
2006 |
1-10 |
1 |
p. 120-144 25 p. |
artikel |
375 |
Erratum
|
Simeone, B. |
|
1991 |
1-10 |
1 |
p. 77- 1 p. |
artikel |
376 |
Erratum
|
|
|
1997 |
1-10 |
1 |
p. 103- 1 p. |
artikel |
377 |
Erratum
|
|
|
1999 |
1-10 |
1 |
p. 85-87 3 p. |
artikel |
378 |
Erratum
|
Pardalos, Panos M. |
|
1988 |
1-10 |
1 |
p. 89- 1 p. |
artikel |
379 |
Establishing determinantal inequalities for positive-definite matrices
|
Cerdeira, J.Orestes |
|
1995 |
1-10 |
1 |
p. 13-24 12 p. |
artikel |
380 |
Euclidean spanner graphs with degree four
|
Salowe, Jeffrey S. |
|
1994 |
1-10 |
1 |
p. 55-66 12 p. |
artikel |
381 |
Euler is standing in line dial-a-ride problems with precedence-constraints
|
Hauptmeier, D. |
|
2001 |
1-10 |
1 |
p. 87-107 21 p. |
artikel |
382 |
Every toroidal graph without adjacent triangles is ( 4 , 1 ) * -choosable
|
Xu, Baogang |
|
2007 |
1-10 |
1 |
p. 74-78 5 p. |
artikel |
383 |
Expanding and forwarding
|
Solé, Patrick |
|
1995 |
1-10 |
1 |
p. 67-78 12 p. |
artikel |
384 |
Expanding and forwarding parameters of product graphs
|
Qian, Jianguo |
|
2004 |
1-10 |
1 |
p. 63-82 20 p. |
artikel |
385 |
Experimenting an approximation algorithm for the LCS
|
Bonizzoni, Paola |
|
2001 |
1-10 |
1 |
p. 13-24 12 p. |
artikel |
386 |
Experiments in integer programming
|
Johnson, Ellis L. |
|
1980 |
1-10 |
1 |
p. 39-55 17 p. |
artikel |
387 |
Extensions of a theorem of Balas
|
Blair, C.E. |
|
1984 |
1-10 |
1 |
p. 11-26 16 p. |
artikel |
388 |
Extremal values for ratios of distances in trees
|
Barefoot, C.A. |
|
1997 |
1-10 |
1 |
p. 37-56 20 p. |
artikel |
389 |
Facets of the k-partition polytope
|
Chopra, Sunil |
|
1995 |
1-10 |
1 |
p. 27-48 22 p. |
artikel |
390 |
Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs
|
Bang-Jensen, Jørgen |
|
1993 |
1-10 |
1 |
p. 75-79 5 p. |
artikel |
391 |
Fast detection and display of symmetry in outerplanar graphs
|
Manning, Joseph |
|
1992 |
1-10 |
1 |
p. 13-35 23 p. |
artikel |
392 |
Faster isometric embedding in products of complete graphs
|
Aurenhammer, Franz |
|
1994 |
1-10 |
1 |
p. 17-28 12 p. |
artikel |
393 |
Fast information sharing in a complete network
|
Sunderam, V.S. |
|
1993 |
1-10 |
1 |
p. 75-86 12 p. |
artikel |
394 |
Fast recognition algorithms for classes of partial cubes
|
Brešar, Boštjan |
|
2003 |
1-10 |
1 |
p. 51-61 11 p. |
artikel |
395 |
f-Factors in bipartite (mf)-graphs
|
Liu, Guizhen |
|
2004 |
1-10 |
1 |
p. 45-54 10 p. |
artikel |
396 |
Field theory: Classical foundations and multiplicative groups
|
|
|
1990 |
1-10 |
1 |
p. 130-131 2 p. |
artikel |
397 |
Finding a central vertex in an HHD-free graph
|
Chepoi, Victor |
|
2003 |
1-10 |
1 |
p. 93-111 19 p. |
artikel |
398 |
Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
|
Schieber, Baruch |
|
1990 |
1-10 |
1 |
p. 97-111 15 p. |
artikel |
399 |
Finding a Δ-regular supergraph of minimum order
|
Bodlaender, Hans L |
|
2003 |
1-10 |
1 |
p. 3-9 7 p. |
artikel |
400 |
Finding degeneracies among sets of lines
|
Leblanc, Alain |
|
1995 |
1-10 |
1 |
p. 49-60 12 p. |
artikel |
401 |
Finding the maximum and minimum
|
Aigner, Martin |
|
1997 |
1-10 |
1 |
p. 1-12 12 p. |
artikel |
402 |
Finite metrics in switching classes
|
Ehrenfeucht, Andrzej |
|
2007 |
1-10 |
1 |
p. 68-73 6 p. |
artikel |
403 |
Fixed-parameter complexity of λ-labelings
|
Fiala, Jiřı́ |
|
2001 |
1-10 |
1 |
p. 59-72 14 p. |
artikel |
404 |
Fluctuation bounds for sock-sorting and other stochastic processes
|
Steinsaltz, David |
|
1998 |
1-10 |
1 |
p. 109-123 15 p. |
artikel |
405 |
(2+f(n))-SAT and its properties
|
Zhao, Yunlei |
|
2004 |
1-10 |
1 |
p. 3-11 9 p. |
artikel |
406 |
Foreword
|
Bonuccelli, Maurizio |
|
2003 |
1-10 |
1 |
p. 1- 1 p. |
artikel |
407 |
Foreword
|
Tokuyama, Takeshi |
|
2003 |
1-10 |
1 |
p. 1- 1 p. |
artikel |
408 |
Formal methods in artificial intelligence
|
|
|
1990 |
1-10 |
1 |
p. 125- 1 p. |
artikel |
409 |
Forwarding index of cube-connected cycles
|
Yan, Jun |
|
2009 |
1-10 |
1 |
p. 1-7 7 p. |
artikel |
410 |
Fourth international symposium on graph theory and combinatorics
|
|
|
1990 |
1-10 |
1 |
p. 133- 1 p. |
artikel |
411 |
Fractional domination of strong direct products
|
Fisher, David C. |
|
1994 |
1-10 |
1 |
p. 89-91 3 p. |
artikel |
412 |
Fractional matchings and the Edmonds-Gallai theorem
|
Pulleyblank, W.R |
|
1987 |
1-10 |
1 |
p. 51-58 8 p. |
artikel |
413 |
From hypertrees to arboreal quasi-ultrametrics
|
Brucker, François |
|
2005 |
1-10 |
1 |
p. 3-26 24 p. |
artikel |
414 |
Functorial scaling of ordinal data
|
Pollandt, Silke |
|
2005 |
1-10 |
1 |
p. 101-111 11 p. |
artikel |
415 |
Fundamentals of matrix computations
|
|
|
1992 |
1-10 |
1 |
p. 94-95 2 p. |
artikel |
416 |
Fundamentals of pattern recognition
|
|
|
1991 |
1-10 |
1 |
p. 79-82 4 p. |
artikel |
417 |
Gale diagrams of convex polytopes and positive spanning sets of vectors
|
Marcus, Daniel A. |
|
1984 |
1-10 |
1 |
p. 47-67 21 p. |
artikel |
418 |
Game theory and mathematical economics
|
|
|
1983 |
1-10 |
1 |
p. 103- 1 p. |
artikel |
419 |
Generalization of a theorem on the parametric maximum flow problem
|
Arai, Tadashi |
|
1993 |
1-10 |
1 |
p. 69-74 6 p. |
artikel |
420 |
Generalized hexagonal systems with each hexagon being resonant
|
Fuji, Zhang |
|
1992 |
1-10 |
1 |
p. 67-73 7 p. |
artikel |
421 |
Generalized list T-colorings of cycles
|
Fiala, Jiří |
|
2005 |
1-10 |
1 |
p. 13-25 13 p. |
artikel |
422 |
Generalized vertex covering in interval graphs
|
Marathe, Madhav V. |
|
1992 |
1-10 |
1 |
p. 87-93 7 p. |
artikel |
423 |
Generating hard and diverse test sets for NP-hard graph problems
|
Sanchis, Laura A. |
|
1995 |
1-10 |
1 |
p. 35-66 32 p. |
artikel |
424 |
Generating permutations with given ups and downs
|
van Baronaigien, D.Roelants |
|
1992 |
1-10 |
1 |
p. 57-65 9 p. |
artikel |
425 |
Generation of key predistribution schemes using secret sharing schemes
|
Sáez, Germán |
|
2003 |
1-10 |
1 |
p. 239-249 11 p. |
artikel |
426 |
Genetic algorithms in coding theory — a table for A3(n,d)
|
Vaessens, R.J.M. |
|
1993 |
1-10 |
1 |
p. 71-87 17 p. |
artikel |
427 |
Geometric algorithms and combinatorial optimization
|
|
|
1990 |
1-10 |
1 |
p. 129-130 2 p. |
artikel |
428 |
Geometric methods to solve max-ordering location problems
|
Ehrgott, Matthias |
|
1999 |
1-10 |
1 |
p. 3-20 18 p. |
artikel |
429 |
Geometric tree graphs of points in convex position
|
Hernando, M.C. |
|
1999 |
1-10 |
1 |
p. 51-66 16 p. |
artikel |
430 |
Goppa-like bounds for the generalized Feng–Rao distances
|
Farrán, J.I. |
|
2003 |
1-10 |
1 |
p. 145-156 12 p. |
artikel |
431 |
Graph coloring on coarse grained multicomputers
|
Gebremedhin, Assefaw Hadish |
|
2003 |
1-10 |
1 |
p. 179-198 20 p. |
artikel |
432 |
Graph homomorphisms with infinite targets
|
MacGillivray, Gary |
|
1994 |
1-10 |
1 |
p. 29-35 7 p. |
artikel |
433 |
Graphs in which all Hamiltonian cycles have the same length
|
Kryński, Stanisław |
|
1994 |
1-10 |
1 |
p. 87-89 3 p. |
artikel |
434 |
Graphs with most number of three point induced connected subgraphs
|
Boesch, F.T. |
|
1995 |
1-10 |
1 |
p. 1-10 10 p. |
artikel |
435 |
Graph-theoretical properties of parallelism in the digital plane
|
Veelaert, Peter |
|
2003 |
1-10 |
1 |
p. 135-160 26 p. |
artikel |
436 |
Guide for authors
|
|
|
2003 |
1-10 |
1 |
p. I-IV nvt p. |
artikel |
437 |
Guide for authors
|
|
|
2003 |
1-10 |
1 |
p. I-IV nvt p. |
artikel |
438 |
Guide for authors
|
|
|
2004 |
1-10 |
1 |
p. I-IV nvt p. |
artikel |
439 |
Guide for authors
|
|
|
2004 |
1-10 |
1 |
p. I-IV nvt p. |
artikel |
440 |
Guide for authors
|
|
|
2004 |
1-10 |
1 |
p. I-IV nvt p. |
artikel |
441 |
Guide for authors
|
|
|
2006 |
1-10 |
1 |
p. I-V nvt p. |
artikel |
442 |
Guide for authors
|
|
|
2005 |
1-10 |
1 |
p. I-IV nvt p. |
artikel |
443 |
Guide for authors
|
|
|
2005 |
1-10 |
1 |
p. I-IV nvt p. |
artikel |
444 |
Guide for authors
|
|
|
2005 |
1-10 |
1 |
p. I-IV nvt p. |
artikel |
445 |
Hamiltonian threshold graphs
|
Harary, Frank |
|
1987 |
1-10 |
1 |
p. 11-15 5 p. |
artikel |
446 |
Hamiltonicity in 3-domination-critical graphs with α = δ + 2
|
Tian, Feng |
|
1999 |
1-10 |
1 |
p. 57-70 14 p. |
artikel |
447 |
Heat conduction on graphs
|
Abu-Jaradeh, Nafiz |
|
1994 |
1-10 |
1 |
p. 1-16 16 p. |
artikel |
448 |
Helicopter search problems, bandwidth and pathwidth
|
Fomin, F.V. |
|
1998 |
1-10 |
1 |
p. 59-70 12 p. |
artikel |
449 |
Higher weights and graded rings for binary self-dual codes
|
Dougherty, Steven T. |
|
2003 |
1-10 |
1 |
p. 121-143 23 p. |
artikel |
450 |
Homomorphically full graphs
|
Brewster, Richard |
|
1996 |
1-10 |
1 |
p. 23-31 9 p. |
artikel |
451 |
Homotopy in digital spaces
|
Ayala, R. |
|
2003 |
1-10 |
1 |
p. 3-24 22 p. |
artikel |
452 |
How to count efficiently all affine roots of a polynomial system
|
Emiris, Ioannis Z |
|
1999 |
1-10 |
1 |
p. 21-32 12 p. |
artikel |
453 |
How to find a point on a line within a fixed distance
|
Hipke, Christoph |
|
1999 |
1-10 |
1 |
p. 67-73 7 p. |
artikel |
454 |
Image sythesis: Elementary algorithms
|
|
|
1990 |
1-10 |
1 |
p. 128- 1 p. |
artikel |
455 |
Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
|
Punnen, Abraham P. |
|
1994 |
1-10 |
1 |
p. 91-93 3 p. |
artikel |
456 |
Improving the efficiency of parallel minimum spanning tree algorithms
|
Chong, Ka Wong |
|
2003 |
1-10 |
1 |
p. 33-54 22 p. |
artikel |
457 |
Incomparability in parallel computation
|
Grolmusz, Vince |
|
1990 |
1-10 |
1 |
p. 63-78 16 p. |
artikel |
458 |
Independence and average distance in graphs
|
Firby, Peter |
|
1997 |
1-10 |
1 |
p. 27-37 11 p. |
artikel |
459 |
Independence in connected graphs
|
Harant, Jochen |
|
2011 |
1-10 |
1 |
p. 79-86 8 p. |
artikel |
460 |
Independent sets in extensions of 2 K 2 -free graphs
|
Lozin, Vadim V. |
|
2005 |
1-10 |
1 |
p. 74-80 7 p. |
artikel |
461 |
Integer knapsack and flow covers with divisible coefficients: polyhedra, optimization and separation
|
Pochet, Yves |
|
1995 |
1-10 |
1 |
p. 57-74 18 p. |
artikel |
462 |
“Integer-making” theorems
|
Beck, József |
|
1981 |
1-10 |
1 |
p. 1-8 8 p. |
artikel |
463 |
Integer programming by long division
|
Cuninghame-Green, R.A. |
|
1981 |
1-10 |
1 |
p. 19-25 7 p. |
artikel |
464 |
Integer programming in VLSI design
|
Raghavan, Prabhakar |
|
1992 |
1-10 |
1 |
p. 29-43 15 p. |
artikel |
465 |
Interpolation of the discrete logarithm in F q by Boolean functions and by polynomials in several variables modulo a divisor of q−1
|
Lange, Tanja |
|
2003 |
1-10 |
1 |
p. 193-206 14 p. |
artikel |
466 |
Intersecting codes and separating codes
|
Cohnen, G |
|
2003 |
1-10 |
1 |
p. 75-83 9 p. |
artikel |
467 |
Intersection graphs of Helly families of subtrees
|
Gavril, Fǎnicǎ |
|
1996 |
1-10 |
1 |
p. 45-56 12 p. |
artikel |
468 |
Intertwined infinite binary words
|
Grytczuk, Jarosław |
|
1996 |
1-10 |
1 |
p. 95-99 5 p. |
artikel |
469 |
Introduction to coding theory
|
|
|
1983 |
1-10 |
1 |
p. 106- 1 p. |
artikel |
470 |
Invariant sets of arcs in network flow problems
|
Anstee, R.P |
|
1986 |
1-10 |
1 |
p. 1-7 7 p. |
artikel |
471 |
Inverse optimization in high-speed networks
|
Faragó, András |
|
2003 |
1-10 |
1 |
p. 83-98 16 p. |
artikel |
472 |
Inverted orders for monotone scoring rules
|
Fishburn, Peter C. |
|
1981 |
1-10 |
1 |
p. 27-36 10 p. |
artikel |
473 |
Irreducible polynomials and linear recurring arrays
|
Mulan, Liu |
|
1997 |
1-10 |
1 |
p. 93-99 7 p. |
artikel |
474 |
Isostatic bar and joint frameworks in the plane with irreducible pure conditions
|
Penne, Rudi |
|
1994 |
1-10 |
1 |
p. 37-57 21 p. |
artikel |
475 |
Iterative characterizations of Boolean algebras
|
Simovici, Dan |
|
1986 |
1-10 |
1 |
p. 111-116 6 p. |
artikel |
476 |
Jackson's pseudo-preemptive schedule and cumulative scheduling problems
|
Carlier, Jacques |
|
2004 |
1-10 |
1 |
p. 80-94 15 p. |
artikel |
477 |
Joint performance of greedy heuristics for the integer knapsack problem
|
Kohli, Rajeev |
|
1995 |
1-10 |
1 |
p. 37-48 12 p. |
artikel |
478 |
Labeling algorithms for domination problems in sun-free chordal graphs
|
Chang, Gerard J. |
|
1988 |
1-10 |
1 |
p. 21-34 14 p. |
artikel |
479 |
Langages sur des alphabets infinis
|
Autebert, Jean-Michel |
|
1980 |
1-10 |
1 |
p. 1-20 20 p. |
artikel |
480 |
Lattice valued relations and automata
|
Muir, A. |
|
1984 |
1-10 |
1 |
p. 65-78 14 p. |
artikel |
481 |
Layouts for mobility management in wireless ATM networks
|
Flammini, Michele |
|
2009 |
1-10 |
1 |
p. 98-111 14 p. |
artikel |
482 |
Les derivees partielles des fonctions pseudo-booleennes generalisees
|
Ghilezan, Coriolan |
|
1982 |
1-10 |
1 |
p. 37-45 9 p. |
artikel |
483 |
Limits of theory sequences over algebraically closed fields and applications
|
Li, Wei |
|
2004 |
1-10 |
1 |
p. 23-43 21 p. |
artikel |
484 |
Linear and combinatorial sharing problems
|
Zimmermann, Uwe |
|
1986 |
1-10 |
1 |
p. 85-104 20 p. |
artikel |
485 |
Linear broadcast encryption schemes
|
Padró, Carles |
|
2003 |
1-10 |
1 |
p. 223-238 16 p. |
artikel |
486 |
Linear cellular automata, finite automata and Pascal's triangle
|
Allouche, J.-P |
|
1996 |
1-10 |
1 |
p. 1-22 22 p. |
artikel |
487 |
Linear objective functions on certain classes of greedoids
|
Goetschel Jr., Roy H. |
|
1986 |
1-10 |
1 |
p. 11-16 6 p. |
artikel |
488 |
Linear relations for p-harmonic functions
|
Kurata, Hisayasu |
|
2008 |
1-10 |
1 |
p. 103-109 7 p. |
artikel |
489 |
Linear sections of the general linear group: A geometric approach
|
Ryan, Charles T. |
|
1992 |
1-10 |
1 |
p. 81-86 6 p. |
artikel |
490 |
Linear time algorithms for NP-hard problems restricted to partial k-trees
|
Arnborg, Stefan |
|
1989 |
1-10 |
1 |
p. 11-24 14 p. |
artikel |
491 |
Linear-time separation algorithms for the three-index assignment polytope
|
Balas, Egon |
|
1993 |
1-10 |
1 |
p. 1-12 12 p. |
artikel |
492 |
Listing minimal edge-covers of intersecting families with applications to connectivity problems
|
Nutov, Zeev |
|
2009 |
1-10 |
1 |
p. 112-117 6 p. |
artikel |
493 |
Locally restricted colorings
|
Blöchliger, Ivo |
|
2006 |
1-10 |
1 |
p. 158-165 8 p. |
artikel |
494 |
Local optimization on graphs
|
Llewellyn, Donna Crystel |
|
1993 |
1-10 |
1 |
p. 93-94 2 p. |
artikel |
495 |
Logic programming languages constraints, functions and objects
|
|
|
1994 |
1-10 |
1 |
p. 99- 1 p. |
artikel |
496 |
Longest alternating subsequences of k-ary words
|
Mansour, Toufik |
|
2008 |
1-10 |
1 |
p. 119-124 6 p. |
artikel |
497 |
Lower bounds and reduction procedures for the bin packing problem
|
Martello, Silvano |
|
1990 |
1-10 |
1 |
p. 59-70 12 p. |
artikel |
498 |
Lower bounds for recognizing small cliques on CRCW PRAM's
|
Beame, Paul |
|
1990 |
1-10 |
1 |
p. 3-20 18 p. |
artikel |
499 |
Lower bounds for the clique and the chromatic numbers of a graph
|
Edwards, C.S. |
|
1983 |
1-10 |
1 |
p. 51-64 14 p. |
artikel |
500 |
MAD trees and distance-hereditary graphs
|
Dahlhaus, E. |
|
2003 |
1-10 |
1 |
p. 151-167 17 p. |
artikel |
501 |
Many-to-one simulation in E0L forms is decidable
|
Ehrenfeucht, A. |
|
1980 |
1-10 |
1 |
p. 73-76 4 p. |
artikel |
502 |
Matchability and k -maximal matchings
|
Dean, Brian C. |
|
2011 |
1-10 |
1 |
p. 15-22 8 p. |
artikel |
503 |
Matchings and paths in the cube
|
Bollobás, Béla |
|
1997 |
1-10 |
1 |
p. 1-8 8 p. |
artikel |
504 |
Matchings in benzene chains
|
Farrell, E.J. |
|
1984 |
1-10 |
1 |
p. 45-54 10 p. |
artikel |
505 |
Matchings in pentagonal chains
|
Farrell, E.J. |
|
1984 |
1-10 |
1 |
p. 31-40 10 p. |
artikel |
506 |
Mathematical crystal growth I
|
Klarner, D.A. |
|
1981 |
1-10 |
1 |
p. 47-52 6 p. |
artikel |
507 |
Mathematical modelling of energy systems
|
|
|
1983 |
1-10 |
1 |
p. 104- 1 p. |
artikel |
508 |
Matrice de ramification des arbres binaires
|
Penaud, J.G. |
|
1991 |
1-10 |
1 |
p. 1-21 21 p. |
artikel |
509 |
Matrices generated by semilattices
|
Karlander, Johan |
|
1995 |
1-10 |
1 |
p. 51-56 6 p. |
artikel |
510 |
Matroid optimization with the interleaving of two ordered sets
|
Gusfield, Dan |
|
1984 |
1-10 |
1 |
p. 41-50 10 p. |
artikel |
511 |
Maximal dynamic polymatroid flows and applications
|
Hamacher, Horst W. |
|
1986 |
1-10 |
1 |
p. 41-54 14 p. |
artikel |
512 |
Maximal path length of binary trees
|
Cameron, Helen |
|
1994 |
1-10 |
1 |
p. 15-35 21 p. |
artikel |
513 |
Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
|
Billionnet, A. |
|
1985 |
1-10 |
1 |
p. 1-11 11 p. |
artikel |
514 |
Maximizing traveling salesman problem for special matrices
|
Blokh, D. |
|
1995 |
1-10 |
1 |
p. 83-86 4 p. |
artikel |
515 |
Maximum independent set and maximum clique algorithms for overlap graphs
|
Čenek, Eowyn |
|
2003 |
1-10 |
1 |
p. 77-91 15 p. |
artikel |
516 |
Min algebraic duality
|
Llewellyn, Donna Crystal |
|
1987 |
1-10 |
1 |
p. 87-90 4 p. |
artikel |
517 |
Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
|
Ronse, Christian |
|
1988 |
1-10 |
1 |
p. 67-79 13 p. |
artikel |
518 |
Minimizing makespan with release times on identical parallel batching machines
|
Li, Shuguang |
|
2005 |
1-10 |
1 |
p. 127-134 8 p. |
artikel |
519 |
Minimizing the number of tardy job units under release time constraints
|
Hochbaum, Dorit S. |
|
1990 |
1-10 |
1 |
p. 45-57 13 p. |
artikel |
520 |
Minimizing the sum of weighted completion times with unrestricted weights
|
Dell'Amico, Mauro |
|
1995 |
1-10 |
1 |
p. 25-41 17 p. |
artikel |
521 |
Minimum dispersion problems
|
Punnen, Abraham P. |
|
1997 |
1-10 |
1 |
p. 93-102 10 p. |
artikel |
522 |
Minimum spanning hypertrees
|
Tomescu, Ioan |
|
1994 |
1-10 |
1 |
p. 67-76 10 p. |
artikel |
523 |
Mixed interval hypergraphs
|
Bulgaru, Elena |
|
1997 |
1-10 |
1 |
p. 29-41 13 p. |
artikel |
524 |
Mixture decomposition of distributions by copulas in the symbolic data analysis framework
|
Diday, E. |
|
2005 |
1-10 |
1 |
p. 27-41 15 p. |
artikel |
525 |
Monotonically labelled Motzkin trees
|
Blieberger, Johann |
|
1987 |
1-10 |
1 |
p. 9-24 16 p. |
artikel |
526 |
Monotonicity of single-seat preferential election rules
|
Woodall, Douglas R. |
|
1997 |
1-10 |
1 |
p. 81-98 18 p. |
artikel |
527 |
Multicommodity flows in graphs
|
Okamura, Haruko |
|
1983 |
1-10 |
1 |
p. 55-62 8 p. |
artikel |
528 |
Multidimensional cell lists for investigating 3-manifolds
|
Kovalevsky, Vladimir |
|
2003 |
1-10 |
1 |
p. 25-43 19 p. |
artikel |
529 |
Multiterminal duality and three-terminal series-parallelness
|
McKee, T.A. |
|
1987 |
1-10 |
1 |
p. 47-53 7 p. |
artikel |
530 |
Mutual exclusion scheduling with interval graphs or related classes, Part I
|
Gardi, Frédéric |
|
2009 |
1-10 |
1 |
p. 19-35 17 p. |
artikel |
531 |
Narrowness, pathwidth, and their application in natural language processing
|
Kornai, András |
|
1992 |
1-10 |
1 |
p. 87-92 6 p. |
artikel |
532 |
Necessary solvability conditions of systems of linear extremal equations
|
Butkovič, Peter |
|
1985 |
1-10 |
1 |
p. 19-26 8 p. |
artikel |
533 |
Neighborhood subtree tolerance graphs
|
Bibelnieks, Eric |
|
1993 |
1-10 |
1 |
p. 13-26 14 p. |
artikel |
534 |
Network flows: Theory, algorithms and applications
|
|
|
1994 |
1-10 |
1 |
p. 99- 1 p. |
artikel |
535 |
Network models in optimization and their applications in practice
|
|
|
1994 |
1-10 |
1 |
p. 98-99 2 p. |
artikel |
536 |
Neural Computing, an Introduction
|
|
|
1993 |
1-10 |
1 |
p. 89- 1 p. |
artikel |
537 |
Neural Networks: Theory and Applications
|
|
|
1993 |
1-10 |
1 |
p. 89-90 2 p. |
artikel |
538 |
New clique and independent set algorithms for circle graphs
|
Apostolico, Alberto |
|
1992 |
1-10 |
1 |
p. 1-24 24 p. |
artikel |
539 |
New results in the worst-case analysis for flow-shop scheduling
|
Nowicki, Eugeniusz |
|
1993 |
1-10 |
1 |
p. 21-41 21 p. |
artikel |
540 |
Node-searching problem on block graphs
|
Chou, Hsin-Hung |
|
2008 |
1-10 |
1 |
p. 55-75 21 p. |
artikel |
541 |
No-hole k-tuple (r + 1)-distant colorings
|
Troxell, Denise Sakai |
|
1996 |
1-10 |
1 |
p. 67-85 19 p. |
artikel |
542 |
No-hole k-tuple (r + 1)-distant colorings of odd cycles
|
Guichard, David R. |
|
1996 |
1-10 |
1 |
p. 87-92 6 p. |
artikel |
543 |
Non-abelian key agreement protocols
|
Anshel, Iris |
|
2003 |
1-10 |
1 |
p. 3-12 10 p. |
artikel |
544 |
Nondegenerate functions and permutations
|
O'Connor, Luke |
|
1997 |
1-10 |
1 |
p. 41-57 17 p. |
artikel |
545 |
Note on scheduling intervals on-line
|
Faigle, Ulrich |
|
1995 |
1-10 |
1 |
p. 13-17 5 p. |
artikel |
546 |
NP-completeness of a family of graph-colouring problems
|
Irving, Robert W. |
|
1983 |
1-10 |
1 |
p. 111-117 7 p. |
artikel |
547 |
NP-completeness of edge-colouring some restricted graphs
|
Cai, Leizhen |
|
1991 |
1-10 |
1 |
p. 15-27 13 p. |
artikel |
548 |
NP-completeness of some edge-disjoint paths problems
|
Vygen, Jens |
|
1995 |
1-10 |
1 |
p. 83-90 8 p. |
artikel |
549 |
Numerical issues in statistical computing for the social scientist
|
|
|
2005 |
1-10 |
1 |
p. 116- 1 p. |
artikel |
550 |
Numerical representation of PQI interval orders
|
Ngo The, An |
|
2005 |
1-10 |
1 |
p. 125-146 22 p. |
artikel |
551 |
Object recognition by computer: The role of geometric constraints
|
|
|
1993 |
1-10 |
1 |
p. 81-82 2 p. |
artikel |
552 |
Offensive r -alliances in graphs
|
Fernau, Henning |
|
2009 |
1-10 |
1 |
p. 177-182 6 p. |
artikel |
553 |
On a complete set of generators for dot-depth two
|
Blanchet-Sadri, F. |
|
1994 |
1-10 |
1 |
p. 1-25 25 p. |
artikel |
554 |
On acyclic conjugated molecules with minimal energies
|
Zhang, Fuji |
|
1999 |
1-10 |
1 |
p. 71-84 14 p. |
artikel |
555 |
On an application of convexity to discrete systems
|
Poljak, Svatopluk |
|
1986 |
1-10 |
1 |
p. 27-32 6 p. |
artikel |
556 |
On an edge ranking problem of trees and graphs
|
Iyer, Ananth.V. |
|
1991 |
1-10 |
1 |
p. 43-52 10 p. |
artikel |
557 |
On an extremal problem concerning the interval number of a graph
|
Andreae, Thomas |
|
1986 |
1-10 |
1 |
p. 1-9 9 p. |
artikel |
558 |
On an interpolation property of outerplanar graphs
|
Lih, Ko-Wei |
|
2006 |
1-10 |
1 |
p. 166-172 7 p. |
artikel |
559 |
On approximating the b-chromatic number
|
Corteel, Sylvie |
|
2005 |
1-10 |
1 |
p. 106-110 5 p. |
artikel |
560 |
On approximation problems related to the independent set and vertex cover problems
|
Bar-Yehuda, R. |
|
1984 |
1-10 |
1 |
p. 1-10 10 p. |
artikel |
561 |
On a problem concerning tolerance graphs
|
Andreae, Thomas |
|
1993 |
1-10 |
1 |
p. 73-78 6 p. |
artikel |
562 |
On a problem of P. Erdős
|
Antonia, Carla |
|
1996 |
1-10 |
1 |
p. 75-79 5 p. |
artikel |
563 |
On combinatorial structures of line drawings of polyhedra
|
Imai, Hiroshi |
|
1985 |
1-10 |
1 |
p. 79-92 14 p. |
artikel |
564 |
On 4-connected claw-free well-covered graphs
|
Hartnell, Bert |
|
1996 |
1-10 |
1 |
p. 57-65 9 p. |
artikel |
565 |
On constructing the elimination tree
|
Zhu, Yunzhou |
|
1994 |
1-10 |
1 |
p. 93-98 6 p. |
artikel |
566 |
On determining non-isotopic configurations of points on a circle
|
He, Xin |
|
1995 |
1-10 |
1 |
p. 33-50 18 p. |
artikel |
567 |
On dimer coverings of rectangles of fixed width
|
Stanley, Richard P. |
|
1985 |
1-10 |
1 |
p. 81-87 7 p. |
artikel |
568 |
On equidistant constant weight codes
|
Fu, Fang-Wei |
|
2003 |
1-10 |
1 |
p. 157-164 8 p. |
artikel |
569 |
One-to-many node-disjoint paths in ( n , k ) -star graphs
|
Xiang, Yonghong |
|
2010 |
1-10 |
1 |
p. 62-70 9 p. |
artikel |
570 |
On Frieze's χ(3) limit for lengths of minimal spanning trees
|
Steele, J.Michael |
|
1987 |
1-10 |
1 |
p. 99-103 5 p. |
artikel |
571 |
On Halin subgraphs and supergraphs
|
Horton, S.B. |
|
1995 |
1-10 |
1 |
p. 19-35 17 p. |
artikel |
572 |
On island sequences of labelings with a condition at distance two
|
Adams, Sarah Spence |
|
2010 |
1-10 |
1 |
p. 1-7 7 p. |
artikel |
573 |
On k-ary n-cubes: theory and applications
|
Mao, Weizhen |
|
2003 |
1-10 |
1 |
p. 171-193 23 p. |
artikel |
574 |
On minimum matrix representation of closure operations
|
Bennett, F.E. |
|
1990 |
1-10 |
1 |
p. 25-40 16 p. |
artikel |
575 |
On monochromatic component size for improper colourings
|
Edwards, Keith |
|
2005 |
1-10 |
1 |
p. 89-105 17 p. |
artikel |
576 |
On morphic generation of regular languages
|
Harju, T. |
|
1986 |
1-10 |
1 |
p. 55-60 6 p. |
artikel |
577 |
On non-intersecting Eulerian circuits
|
Bent, Samuel W. |
|
1987 |
1-10 |
1 |
p. 87-94 8 p. |
artikel |
578 |
On paths avoiding forbidden pairs of vertices in a graph
|
Yinnone, Hananya |
|
1997 |
1-10 |
1 |
p. 85-92 8 p. |
artikel |
579 |
On polyhedra induced by point sets in space
|
Agarwal, Pankaj K. |
|
2008 |
1-10 |
1 |
p. 42-54 13 p. |
artikel |
580 |
On pre-periods of discrete influence systems
|
Poljak, Svatopluk |
|
1986 |
1-10 |
1 |
p. 33-39 7 p. |
artikel |
581 |
On pseudounimodular matrices
|
Martelli, Mario |
|
1993 |
1-10 |
1 |
p. 113-117 5 p. |
artikel |
582 |
On quasi-Cayley graphs
|
Gauyacq, Ginette |
|
1997 |
1-10 |
1 |
p. 43-58 16 p. |
artikel |
583 |
On Ramsey numbers of fans
|
Lin, Qizhong |
|
2009 |
1-10 |
1 |
p. 191-194 4 p. |
artikel |
584 |
On randomized broadcasting in Star graphs
|
Elsässer, R. |
|
2009 |
1-10 |
1 |
p. 126-139 14 p. |
artikel |
585 |
On signed digraphs with all cycles negative
|
Chaty, Guy |
|
1988 |
1-10 |
1 |
p. 83-85 3 p. |
artikel |
586 |
On some geometric methods in scheduling theory: a survey
|
Sevast'janov, S.V. |
|
1994 |
1-10 |
1 |
p. 59-82 24 p. |
artikel |
587 |
On specifying Boolean functions by labelled examples
|
Anthony, Martin |
|
1995 |
1-10 |
1 |
p. 1-25 25 p. |
artikel |
588 |
On the approximability of average completion time scheduling under precedence constraints
|
Woeginger, Gerhard J |
|
2003 |
1-10 |
1 |
p. 237-252 16 p. |
artikel |
589 |
On the asymptotic behaviour of Lee-codes
|
Astola, Jaakko |
|
1984 |
1-10 |
1 |
p. 13-23 11 p. |
artikel |
590 |
On the average similarity degree between solutions of random k-SAT and random CSPs
|
Xu, Ke |
|
2004 |
1-10 |
1 |
p. 125-149 25 p. |
artikel |
591 |
On the b -coloring of P 4 -tidy graphs
|
Velasquez, Clara Inés Betancur |
|
2011 |
1-10 |
1 |
p. 60-68 9 p. |
artikel |
592 |
On the bipartition of graphs
|
Buser, Peter |
|
1984 |
1-10 |
1 |
p. 105-109 5 p. |
artikel |
593 |
On the channel capacity of read/write isolated memory
|
Cohn, Martin |
|
1995 |
1-10 |
1 |
p. 1-8 8 p. |
artikel |
594 |
On the chromatic forcing number of a random graph
|
McDiarmid, Colin |
|
1983 |
1-10 |
1 |
p. 123-132 10 p. |
artikel |
595 |
On the complexity of cutting-plane proofs
|
Cook, W. |
|
1987 |
1-10 |
1 |
p. 25-38 14 p. |
artikel |
596 |
On the complexity of finding multi-constrained spanning trees
|
Camerini, P.M. |
|
1983 |
1-10 |
1 |
p. 39-50 12 p. |
artikel |
597 |
On the complexity of the dual method for maximum balanced flows
|
Zimmermann, Uwe |
|
1994 |
1-10 |
1 |
p. 77-88 12 p. |
artikel |
598 |
On the complexity of the embedding problem for hypercube related graphs
|
Wagner, A. |
|
1993 |
1-10 |
1 |
p. 75-95 21 p. |
artikel |
599 |
On the complexity of two circle connecting problems
|
Huang, Nen-Fu |
|
1993 |
1-10 |
1 |
p. 17-32 16 p. |
artikel |
600 |
On the computational complexity of a merge recognition problem
|
Mansfield, Anthony |
|
1983 |
1-10 |
1 |
p. 119-122 4 p. |
artikel |
601 |
On the computational complexity of upper total domination
|
Fang, Qizhi |
|
2004 |
1-10 |
1 |
p. 13-22 10 p. |
artikel |
602 |
On the consistency of the minimum evolution principle of phylogenetic inference
|
Denis, François |
|
2003 |
1-10 |
1 |
p. 63-77 15 p. |
artikel |
603 |
On the covering radius of long binary BCH codes
|
Tietäinen, A |
|
1987 |
1-10 |
1 |
p. 75-77 3 p. |
artikel |
604 |
On the dependence of the maximum cycle mean of a matrix on permutations of the rows and columns
|
Butkovič, Peter |
|
1989 |
1-10 |
1 |
p. 45-53 9 p. |
artikel |
605 |
On the directionality of interval orders
|
Bouchitté, Vincent |
|
1994 |
1-10 |
1 |
p. 87-92 6 p. |
artikel |
606 |
On the discrete version of Picone's identity
|
Amghibech, S. |
|
2008 |
1-10 |
1 |
p. 1-10 10 p. |
artikel |
607 |
On the equivalence between roof duality and Lagrangian duality for unconstrained 0–1 quadratic programming problems
|
Adams, Warren P. |
|
1994 |
1-10 |
1 |
p. 1-20 20 p. |
artikel |
608 |
On the existence problem of the total domination vertex critical graphs
|
Sohn, Moo Young |
|
2011 |
1-10 |
1 |
p. 46-52 7 p. |
artikel |
609 |
On the expressive power of CNF formulas of bounded tree- and clique-width
|
Briquel, Irenée |
|
2011 |
1-10 |
1 |
p. 1-14 14 p. |
artikel |
610 |
On the generation of powers by OS schemes
|
Bucher, W. |
|
1989 |
1-10 |
1 |
p. 33-43 11 p. |
artikel |
611 |
On the LU factorization of the Vandermonde matrix
|
Yang, Sheng-liang |
|
2005 |
1-10 |
1 |
p. 102-105 4 p. |
artikel |
612 |
On “the matching polynomial of a polygraph”
|
Broersma, H.J. |
|
1993 |
1-10 |
1 |
p. 79-86 8 p. |
artikel |
613 |
On the matching polynomial of subdivision graphs
|
Yan, Weigen |
|
2009 |
1-10 |
1 |
p. 195-200 6 p. |
artikel |
614 |
On the maximum capacity augmentation algorithm for the maximum flow problem
|
Goldfarb, Donald |
|
1993 |
1-10 |
1 |
p. 9-16 8 p. |
artikel |
615 |
On the membership problem for regular DNLC grammars
|
Aalbersberg, IJ.J. |
|
1986 |
1-10 |
1 |
p. 79-85 7 p. |
artikel |
616 |
On the negation-limited circuit complexity of merging
|
Amano, Kazuyuki |
|
2003 |
1-10 |
1 |
p. 3-8 6 p. |
artikel |
617 |
On the non-minimal codewords in binary Reed–Muller codes
|
Borissov, Yuri |
|
2003 |
1-10 |
1 |
p. 65-74 10 p. |
artikel |
618 |
On the NP-hardness of edge-deletion and -contraction problems
|
Watanabe, Toshimasa |
|
1983 |
1-10 |
1 |
p. 63-78 16 p. |
artikel |
619 |
On the number of edges in the transitive closure of a graph
|
McColl, W.F. |
|
1986 |
1-10 |
1 |
p. 67-73 7 p. |
artikel |
620 |
On the number of spanning trees and Eulerian tours in iterated line digraphs
|
Huaxiao, Zhang |
|
1997 |
1-10 |
1 |
p. 59-67 9 p. |
artikel |
621 |
On the ordering of graphs with respect to their matching numbers
|
Gutman, Ivan |
|
1986 |
1-10 |
1 |
p. 25-33 9 p. |
artikel |
622 |
On the order of the largest induced tree in a random graph
|
Palka, Zbigniew |
|
1986 |
1-10 |
1 |
p. 75-83 9 p. |
artikel |
623 |
On the quadratic assignment problem
|
Frieze, A.M. |
|
1983 |
1-10 |
1 |
p. 89-98 10 p. |
artikel |
624 |
On the recognition of permuted bottleneck Monge matrices
|
Klinz, Bettina |
|
1995 |
1-10 |
1 |
p. 43-74 32 p. |
artikel |
625 |
On the revised Szeged index
|
Xing, Rundan |
|
2011 |
1-10 |
1 |
p. 69-78 10 p. |
artikel |
626 |
On the r,s-SAT satisfiability problem and a conjecture of Tovey
|
Dubois, Olivier |
|
1990 |
1-10 |
1 |
p. 51-60 10 p. |
artikel |
627 |
On the splicing operation
|
Păun, Gheorghe |
|
1996 |
1-10 |
1 |
p. 57-79 23 p. |
artikel |
628 |
On the stability properties of linear dynamic time-varying unforced systems involving switches between parameterizations from topologic considerations via graph theory
|
De la Sen, M. |
|
2007 |
1-10 |
1 |
p. 7-25 19 p. |
artikel |
629 |
On the unit interval number of a graph
|
Andreae, Thomas |
|
1988 |
1-10 |
1 |
p. 1-7 7 p. |
artikel |
630 |
On the value of a random minimum spanning tree problem
|
Frieze, A.M. |
|
1985 |
1-10 |
1 |
p. 47-56 10 p. |
artikel |
631 |
On the variance of Shannon products of graphs
|
Balogh, József |
|
2008 |
1-10 |
1 |
p. 110-118 9 p. |
artikel |
632 |
On the windy postman problem
|
Guan, Meigu |
|
1984 |
1-10 |
1 |
p. 41-46 6 p. |
artikel |
633 |
On totally dual integral systems
|
Kabadi, S.N. |
|
1990 |
1-10 |
1 |
p. 87-104 18 p. |
artikel |
634 |
On unicyclic graphs whose second largest eigenvalue dose not exceed 1
|
Xu, Guang-Hui |
|
2004 |
1-10 |
1 |
p. 117-124 8 p. |
artikel |
635 |
Optimal irreversible dynamos in chordal rings
|
Flocchini, P |
|
2001 |
1-10 |
1 |
p. 23-42 20 p. |
artikel |
636 |
Optimal key for taxons ordered in accordance with their frequencies
|
Krichevskii, R.E. |
|
1981 |
1-10 |
1 |
p. 67-72 6 p. |
artikel |
637 |
Optimal parallel construction of prescribed tournaments
|
Soroker, Danny |
|
1990 |
1-10 |
1 |
p. 113-125 13 p. |
artikel |
638 |
Optimal parallel machines scheduling with availability constraints
|
Gharbi, Anis |
|
2005 |
1-10 |
1 |
p. 63-87 25 p. |
artikel |
639 |
Optimal transmission schedules in TWDM optical passive star networks
|
Lee, Sang-Kyu |
|
1997 |
1-10 |
1 |
p. 81-91 11 p. |
artikel |
640 |
Optimization days 1982
|
|
|
1982 |
1-10 |
1 |
p. 79- 1 p. |
artikel |
641 |
Ordered sets
|
|
|
1983 |
1-10 |
1 |
p. 105- 1 p. |
artikel |
642 |
Ordinal and symbolic data analysis
|
Doignon, Jean-Paul |
|
2005 |
1-10 |
1 |
p. 1-2 2 p. |
artikel |
643 |
Oriented matroid systems
|
Huseby, Arne Bang |
|
2011 |
1-10 |
1 |
p. 31-45 15 p. |
artikel |
644 |
Parallel computational fluid dynamics, implementations and results
|
|
|
1994 |
1-10 |
1 |
p. 107- 1 p. |
artikel |
645 |
Parallel machine scheduling with time dependent processing times
|
Chen, Zhi-Long |
|
1996 |
1-10 |
1 |
p. 81-93 13 p. |
artikel |
646 |
Parallel machines scheduling with nonsimultaneous machine available time
|
Lee, Chung-Yee |
|
1991 |
1-10 |
1 |
p. 53-61 9 p. |
artikel |
647 |
Parallel recognition of complement reducible graphs and cotree construction
|
Kirkpatrick, D.G. |
|
1990 |
1-10 |
1 |
p. 79-96 18 p. |
artikel |
648 |
Parallel sorting
|
Bollobás, Béla |
|
1983 |
1-10 |
1 |
p. 1-11 11 p. |
artikel |
649 |
Parametric shortest path algorithms with an application to cyclic staffing
|
Karp, Richard M. |
|
1981 |
1-10 |
1 |
p. 37-45 9 p. |
artikel |
650 |
Paroids: a canonical format for combinatorial optimization
|
Rardin, Ronald L. |
|
1992 |
1-10 |
1 |
p. 37-56 20 p. |
artikel |
651 |
Path-independence and closure operators with the anti-exchange property
|
Koshevoy, Gleb A. |
|
2005 |
1-10 |
1 |
p. 81-89 9 p. |
artikel |
652 |
Paths to marriage stability
|
Abeledo, Hernan |
|
1995 |
1-10 |
1 |
p. 1-12 12 p. |
artikel |
653 |
p-competition numbers
|
Kim, Suh-ryung |
|
1993 |
1-10 |
1 |
p. 87-92 6 p. |
artikel |
654 |
Performances of parallel branch and bound algorithms with best-first search
|
Mans, Bernard |
|
1996 |
1-10 |
1 |
p. 57-74 18 p. |
artikel |
655 |
Physical network design to facilitate capacity reallocation
|
Harms, Janelle |
|
2003 |
1-10 |
1 |
p. 129-153 25 p. |
artikel |
656 |
Point matching under non-uniform distortions
|
Akutsu, Tatsuya |
|
2003 |
1-10 |
1 |
p. 5-21 17 p. |
artikel |
657 |
Point placement on the line by distance data
|
Damaschke, Peter |
|
2003 |
1-10 |
1 |
p. 53-62 10 p. |
artikel |
658 |
Polygon scheduling
|
Hurink, Johann |
|
1996 |
1-10 |
1 |
p. 37-55 19 p. |
artikel |
659 |
Polynomial algorithms for restricted Euclidean p-centre problems
|
Aupperle, Larry |
|
1989 |
1-10 |
1 |
p. 25-31 7 p. |
artikel |
660 |
Polynomial graph-colorings
|
Gutjahr, Wolfgang |
|
1992 |
1-10 |
1 |
p. 29-45 17 p. |
artikel |
661 |
Polynomial-time algorithms for regular set-covering and threshold synthesis
|
Peled, Uri N. |
|
1985 |
1-10 |
1 |
p. 57-69 13 p. |
artikel |
662 |
Practical genetic algorithms
|
|
|
2005 |
1-10 |
1 |
p. 119- 1 p. |
artikel |
663 |
Preface
|
Istrail, Sorin |
|
2003 |
1-10 |
1 |
p. 1-3 3 p. |
artikel |
664 |
Preface
|
Choie, YoungJu |
|
2003 |
1-10 |
1 |
p. 1- 1 p. |
artikel |
665 |
Preface
|
Kratsch, D |
|
2003 |
1-10 |
1 |
p. 1- 1 p. |
artikel |
666 |
Preface
|
Carlet, C. |
|
2003 |
1-10 |
1 |
p. 1- 1 p. |
artikel |
667 |
Preface
|
|
|
1997 |
1-10 |
1 |
p. 1-2 2 p. |
artikel |
668 |
Preface
|
Noltemeier, Hartmut |
|
1999 |
1-10 |
1 |
p. 1- 1 p. |
artikel |
669 |
Preface
|
Fich, F.E. |
|
1990 |
1-10 |
1 |
p. 1-2 2 p. |
artikel |
670 |
Preface
|
|
|
1985 |
1-10 |
1 |
p. 1-93 93 p. |
artikel |
671 |
Preface
|
Wilson, L.B. |
|
1983 |
1-10 |
1 |
p. v- 1 p. |
artikel |
672 |
Preface
|
Ibaraki, Toshihide |
|
1990 |
1-10 |
1 |
p. 1- 1 p. |
artikel |
673 |
Preface
|
Gendreau, Michel |
|
2004 |
1-10 |
1 |
p. 1-2 2 p. |
artikel |
674 |
Preface
|
Cicalese, Ferdinando |
|
2004 |
1-10 |
1 |
p. 1-2 2 p. |
artikel |
675 |
Preface
|
Chen, Jianer |
|
2004 |
1-10 |
1 |
p. 1- 1 p. |
artikel |
676 |
Preference modeling on totally ordered sets by the Sugeno integral
|
Rico, A. |
|
2005 |
1-10 |
1 |
p. 113-124 12 p. |
artikel |
677 |
Preserving approximation in the Min—Weighted Set Cover Problem
|
Gambosi, Giorgio |
|
1997 |
1-10 |
1 |
p. 13-22 10 p. |
artikel |
678 |
Principal structures of submodular systems
|
Fujishige, Satoru |
|
1980 |
1-10 |
1 |
p. 77-79 3 p. |
artikel |
679 |
Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
|
Franco, John |
|
1983 |
1-10 |
1 |
p. 77-87 11 p. |
artikel |
680 |
Probabilistic analysis of two k-cluster problems
|
Cooper, C. |
|
1994 |
1-10 |
1 |
p. 27-51 25 p. |
artikel |
681 |
Probabilistic asymptotic properties of some combinatorial optimization problems
|
Burkard, Rainer E. |
|
1985 |
1-10 |
1 |
p. 21-29 9 p. |
artikel |
682 |
Probabilistic performance of a heuristic for the satisfiability problem
|
Franco, John |
|
1988 |
1-10 |
1 |
p. 35-51 17 p. |
artikel |
683 |
Probabilities within optimal strategies for tournament games
|
Fisher, David C. |
|
1995 |
1-10 |
1 |
p. 87-91 5 p. |
artikel |
684 |
Properties of positive functions and the dynamics of associated automata networks
|
Eric Goles, C.H. |
|
1987 |
1-10 |
1 |
p. 39-46 8 p. |
artikel |
685 |
Pseudo-models and propositional Horn inference
|
Ganter, Bernhard |
|
2005 |
1-10 |
1 |
p. 43-55 13 p. |
artikel |
686 |
Query efficient implementation of graphs of bounded clique-width
|
Courcelle, B. |
|
2003 |
1-10 |
1 |
p. 129-150 22 p. |
artikel |
687 |
Rainbow domination on trees
|
Chang, Gerard J. |
|
2010 |
1-10 |
1 |
p. 8-12 5 p. |
artikel |
688 |
Randomised algorithms
|
Welsh, D.J.A. |
|
1983 |
1-10 |
1 |
p. 133-145 13 p. |
artikel |
689 |
Random small Hamming weight products with applications to cryptography
|
Hoffstein, Jeffrey |
|
2003 |
1-10 |
1 |
p. 37-49 13 p. |
artikel |
690 |
Random walks and electrical resistances in products of graphs
|
Bollobás, Béla |
|
1997 |
1-10 |
1 |
p. 69-79 11 p. |
artikel |
691 |
Random walks with absorbing points
|
Shapiro, Louis |
|
1992 |
1-10 |
1 |
p. 57-67 11 p. |
artikel |
692 |
Reality rules: 2 picturing the world in mathematics. The frontier
|
|
|
1994 |
1-10 |
1 |
p. 109- 1 p. |
artikel |
693 |
Reality rules:1 picturing the world in mathematics. The fundamentals
|
|
|
1994 |
1-10 |
1 |
p. 108- 1 p. |
artikel |
694 |
Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity
|
Boesch, F.T. |
|
1981 |
1-10 |
1 |
p. 9-18 10 p. |
artikel |
695 |
Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem
|
Guíñez, F. |
|
2011 |
1-10 |
1 |
p. 23-30 8 p. |
artikel |
696 |
Recent advances in algoritms and combinatorics
|
|
|
2005 |
1-10 |
1 |
p. 117- 1 p. |
artikel |
697 |
Recognition of d-dimensional Monge arrays
|
Rudolf, Rüdiger |
|
1994 |
1-10 |
1 |
p. 71-82 12 p. |
artikel |
698 |
Recognition of q-Horn formulae in linear time
|
Boros, Endre |
|
1994 |
1-10 |
1 |
p. 1-13 13 p. |
artikel |
699 |
Recognition problems and communication complexity
|
Wiener, Gábor |
|
2004 |
1-10 |
1 |
p. 109-123 15 p. |
artikel |
700 |
Recognizing brittle graphs: remarks on a paper of Hoàng and Khouzam
|
Schäffer, Alejandro A. |
|
1991 |
1-10 |
1 |
p. 29-35 7 p. |
artikel |
701 |
Recognizing DNA graphs is difficult
|
Pendavingh, Rudi |
|
2003 |
1-10 |
1 |
p. 85-94 10 p. |
artikel |
702 |
Recognizing hidden bicircular networks
|
Shull, Randy |
|
1993 |
1-10 |
1 |
p. 13-53 41 p. |
artikel |
703 |
Recognizing renamable generalized propositional Horn formulas is NP-complete
|
Eiter, Thomas |
|
1995 |
1-10 |
1 |
p. 23-31 9 p. |
artikel |
704 |
Rectangle-visibility representations of bipartite graphs
|
Dean, Alice M. |
|
1997 |
1-10 |
1 |
p. 9-25 17 p. |
artikel |
705 |
Regeneration in IL systems
|
Kelemenová, Alica |
|
1988 |
1-10 |
1 |
p. 81-86 6 p. |
artikel |
706 |
Reload cost problems: minimum diameter spanning tree
|
Wirth, Hans-Christoph |
|
2001 |
1-10 |
1 |
p. 73-85 13 p. |
artikel |
707 |
Relocalization — theory and practice
|
Karch, Oliver |
|
1999 |
1-10 |
1 |
p. 89-108 20 p. |
artikel |
708 |
Representative graphs of r-regular partial planes and representation of orthomodular posets
|
Anger, F.D. |
|
1986 |
1-10 |
1 |
p. 1-10 10 p. |
artikel |
709 |
Reseaux et polynomes de denombrement
|
Borie, Ph. |
|
1987 |
1-10 |
1 |
p. 83-86 4 p. |
artikel |
710 |
Resolution search
|
Chvátal, V |
|
1997 |
1-10 |
1 |
p. 81-99 19 p. |
artikel |
711 |
Resource allocation problems: Algorithmic approach
|
|
|
1990 |
1-10 |
1 |
p. 132- 1 p. |
artikel |
712 |
Right invariant metrics and measures of presortedness
|
Estivill-Castro, Vladimir |
|
1993 |
1-10 |
1 |
p. 1-16 16 p. |
artikel |
713 |
RNA pseudoknot structures with arc-length ≥ 3 and stack-length ≥ σ
|
Jin, Emma Y. |
|
2010 |
1-10 |
1 |
p. 25-36 12 p. |
artikel |
714 |
Robust universal complete codes for transmission and compression
|
Fraenkel, Aviezri S. |
|
1996 |
1-10 |
1 |
p. 31-55 25 p. |
artikel |
715 |
Rounding in symmetric matrices and undirected graphs
|
Hell, Pavol |
|
1996 |
1-10 |
1 |
p. 1-21 21 p. |
artikel |
716 |
Routing permutations and 2–1 routing requests in the hypercube
|
Baudon, Olivier |
|
2001 |
1-10 |
1 |
p. 43-58 16 p. |
artikel |
717 |
Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI
|
Recski, András |
|
2007 |
1-10 |
1 |
p. 44-52 9 p. |
artikel |
718 |
Scale-sensitive dimensions and skeleton estimates for classification
|
Horváth, Márta |
|
1998 |
1-10 |
1 |
p. 37-61 25 p. |
artikel |
719 |
Schedule-induced posets
|
Radermacher, F.J. |
|
1986 |
1-10 |
1 |
p. 67-91 25 p. |
artikel |
720 |
Scheduling independent two processor tasks on a uniform duo-processor system
|
Błaz̀ewicz, J. |
|
1990 |
1-10 |
1 |
p. 11-20 10 p. |
artikel |
721 |
Scheduling jobs with fixed start and end times
|
Arkin, Esther M. |
|
1987 |
1-10 |
1 |
p. 1-8 8 p. |
artikel |
722 |
Scheduling sports competitions with a given distribution of times
|
Blest, D.C. |
|
1988 |
1-10 |
1 |
p. 9-19 11 p. |
artikel |
723 |
Scheduling subject to resource constraints: classification and complexity
|
Blazewicz, J. |
|
1983 |
1-10 |
1 |
p. 11-24 14 p. |
artikel |
724 |
Search and sweep numbers of finite directed acyclic graphs
|
Nowakowski, Richard J. |
|
1993 |
1-10 |
1 |
p. 1-11 11 p. |
artikel |
725 |
Searching with mobile agents in networks with liars
|
Hanusse, Nicolas |
|
2004 |
1-10 |
1 |
p. 69-85 17 p. |
artikel |
726 |
Semantics of programming languages
|
|
|
1994 |
1-10 |
1 |
p. 107- 1 p. |
artikel |
727 |
Sequencing by hybridization with isothermic oligonucleotide libraries
|
Błażewicz, Jacek |
|
2004 |
1-10 |
1 |
p. 40-51 12 p. |
artikel |
728 |
Several classes of (2 m −1,w,2) optical orthogonal codes
|
Ding, Cunsheng |
|
2003 |
1-10 |
1 |
p. 103-120 18 p. |
artikel |
729 |
Sharing video on demand
|
Bar-Noy, Amotz |
|
2003 |
1-10 |
1 |
p. 3-30 28 p. |
artikel |
730 |
Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model
|
Lin, Ji-Cherng |
|
2009 |
1-10 |
1 |
p. 140-148 9 p. |
artikel |
731 |
Signed graphs
|
Zaslavsky, Thomas |
|
1982 |
1-10 |
1 |
p. 47-74 28 p. |
artikel |
732 |
Sign solvable graphs
|
Maybee, John S. |
|
1980 |
1-10 |
1 |
p. 57-63 7 p. |
artikel |
733 |
Simulated annealing and boltzmann machines: A stochastic approach to combinatorial optimization and neural computing
|
|
|
1990 |
1-10 |
1 |
p. 131- 1 p. |
artikel |
734 |
Simulated annealing-parallelization techniques
|
|
|
1994 |
1-10 |
1 |
p. 98- 1 p. |
artikel |
735 |
Size of context in regenerative IL systems
|
Kelemenová, Alica |
|
1990 |
1-10 |
1 |
p. 117-119 3 p. |
artikel |
736 |
Solving makespan minimization problems with Lagrangean decomposition
|
Guignard, Monique |
|
1993 |
1-10 |
1 |
p. 17-29 13 p. |
artikel |
737 |
Solving NP-hard problems in ‘almost trees’: Vertex cover
|
Coppersmith, Don |
|
1985 |
1-10 |
1 |
p. 27-45 19 p. |
artikel |
738 |
Solving restricted line location problems via a dual interpretation
|
Schöbel, Anita |
|
1999 |
1-10 |
1 |
p. 109-125 17 p. |
artikel |
739 |
Solving the Euclidean bottleneck biconnected edge subgraph problem by 2-relative neighborhood graphs
|
Chang, M.S. |
|
1992 |
1-10 |
1 |
p. 1-12 12 p. |
artikel |
740 |
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
|
Hung, Ruo-Wei |
|
2006 |
1-10 |
1 |
p. 76-105 30 p. |
artikel |
741 |
Some combinatorial properties of self-reading sequences
|
Istrate, Gabriel |
|
1994 |
1-10 |
1 |
p. 83-86 4 p. |
artikel |
742 |
Some constacyclic codes over Z 2 k and binary quasi-cyclic codes
|
Tapia-Recillas, H. |
|
2003 |
1-10 |
1 |
p. 305-316 12 p. |
artikel |
743 |
Some constructions of superimposed codes in Euclidean spaces
|
Danev, Danyo |
|
2003 |
1-10 |
1 |
p. 85-101 17 p. |
artikel |
744 |
Some generalized type functional dependencies formalized as equality set on matrices
|
Demetrovics, J. |
|
1983 |
1-10 |
1 |
p. 35-47 13 p. |
artikel |
745 |
Some lower bounds for constant weight codes
|
Honkala, Iiro |
|
1987 |
1-10 |
1 |
p. 95-98 4 p. |
artikel |
746 |
Some models of graphs for scheduling sports competitions
|
de Werra, D. |
|
1988 |
1-10 |
1 |
p. 47-65 19 p. |
artikel |
747 |
Some new results concerning three counterfeit coins problem
|
Bošnjak, Ivica |
|
1994 |
1-10 |
1 |
p. 81-85 5 p. |
artikel |
748 |
Some new two-weight codes and strongly regular graphs
|
Brouwer, A.E. |
|
1985 |
1-10 |
1 |
p. 111-114 4 p. |
artikel |
749 |
Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
|
de Werra, D. |
|
1993 |
1-10 |
1 |
p. 103-104 2 p. |
artikel |
750 |
Some results about the interval number of a graph
|
Maas, Christoph |
|
1983 |
1-10 |
1 |
p. 99-102 4 p. |
artikel |
751 |
Some results concerning the complexity of restricted colorings of graphs
|
Kubale, Marek |
|
1992 |
1-10 |
1 |
p. 35-46 12 p. |
artikel |
752 |
Some results on visibility graphs
|
Andreae, Thomas |
|
1992 |
1-10 |
1 |
p. 5-17 13 p. |
artikel |
753 |
SONET/SDH ring assignment with capacity constraints
|
Goldschmidt, Olivier |
|
2003 |
1-10 |
1 |
p. 99-128 30 p. |
artikel |
754 |
Space graphs and sphericity
|
Maehara, Hiroshi |
|
1984 |
1-10 |
1 |
p. 55-64 10 p. |
artikel |
755 |
Special issue of DAM on the vapnik-chervonenkis dimension
|
Shawe-Taylor, John |
|
1998 |
1-10 |
1 |
p. 1-2 2 p. |
artikel |
756 |
Special issue of discrete applied mathematics on connections between logic and combinatorial topics with emphasis on probabilistic aspects and bounding the length of proofs
|
|
|
1989 |
1-10 |
1 |
p. 99-101 3 p. |
artikel |
757 |
Special issue of discrete applied mathematics on interconnection networks
|
|
|
1988 |
1-10 |
1 |
p. 101- 1 p. |
artikel |
758 |
Special Issue title Page
|
|
|
2003 |
1-10 |
1 |
p. iii- 1 p. |
artikel |
759 |
Splitting a graph into disjoint induced paths or cycles
|
Le, Hoàng-Oanh |
|
2003 |
1-10 |
1 |
p. 199-212 14 p. |
artikel |
760 |
Stability number and chromatic number of tolerance graphs
|
Narasimhan, Giri |
|
1992 |
1-10 |
1 |
p. 47-56 10 p. |
artikel |
761 |
Stability number of bull- and chair-free graphs revisited
|
Brandstädt, Andreas |
|
2003 |
1-10 |
1 |
p. 39-50 12 p. |
artikel |
762 |
Stable matchings and linear inequalities
|
Abeledo, Hernán G. |
|
1994 |
1-10 |
1 |
p. 1-27 27 p. |
artikel |
763 |
Stage-graph representations
|
Kranakis, Evangelos |
|
1997 |
1-10 |
1 |
p. 71-80 10 p. |
artikel |
764 |
Statistics for research
|
|
|
1992 |
1-10 |
1 |
p. 93- 1 p. |
artikel |
765 |
Steiner's problem in graphs: heuristic methods
|
Voß, Stefan |
|
1992 |
1-10 |
1 |
p. 45-72 28 p. |
artikel |
766 |
Stochasticity and partial order
|
|
|
1983 |
1-10 |
1 |
p. 106- 1 p. |
artikel |
767 |
String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
|
Lange, Klaus-Jörn |
|
1987 |
1-10 |
1 |
p. 17-30 14 p. |
artikel |
768 |
Strong qualitative independence
|
Katona, Gyula O.H. |
|
2004 |
1-10 |
1 |
p. 87-95 9 p. |
artikel |
769 |
Strong regularity of matrices — a survey of results
|
Butkovič, Peter |
|
1994 |
1-10 |
1 |
p. 45-68 24 p. |
artikel |
770 |
Strong thinning and polyhedric approximation of the surface of a voxel object
|
Burguet, Jasmine |
|
2003 |
1-10 |
1 |
p. 93-114 22 p. |
artikel |
771 |
Structural properties of matroid matchings
|
Vande Vate, John H. |
|
1992 |
1-10 |
1 |
p. 69-85 17 p. |
artikel |
772 |
Structural rigidity II: Almost infinitesimally rigid bar frameworks
|
Rosenberg, I.G |
|
1986 |
1-10 |
1 |
p. 41-59 19 p. |
artikel |
773 |
Structure of decoders for multivalued encodings
|
Capocelli, Renato M. |
|
1989 |
1-10 |
1 |
p. 55-71 17 p. |
artikel |
774 |
Studies on hypergraphs I: hyperforests
|
Zhang, Lianwen |
|
1993 |
1-10 |
1 |
p. 95-112 18 p. |
artikel |
775 |
Subtree isomorphism is in random NC
|
Gibbons, Phillip B. |
|
1990 |
1-10 |
1 |
p. 35-62 28 p. |
artikel |
776 |
Supereulerianity of k -edge-connected graphs with a restriction on small bonds
|
Niu, Zhaohong |
|
2010 |
1-10 |
1 |
p. 37-43 7 p. |
artikel |
777 |
Surface digitizations by dilations which are tunnel-free
|
Lincke, C. |
|
2003 |
1-10 |
1 |
p. 81-91 11 p. |
artikel |
778 |
Surrogate duality relaxation for job shop scheduling
|
Fisher, M.L. |
|
1983 |
1-10 |
1 |
p. 65-75 11 p. |
artikel |
779 |
Symposium on ordered sets
|
|
|
1981 |
1-10 |
1 |
p. 77-78 2 p. |
artikel |
780 |
Synchronization and Linearity
|
|
|
1994 |
1-10 |
1 |
p. 108- 1 p. |
artikel |
781 |
System design modeling and methamodelling
|
|
|
1993 |
1-10 |
1 |
p. 84- 1 p. |
artikel |
782 |
Testing homotopy equivalence is isomorphism complete
|
Zalcstein, Yechezkel |
|
1986 |
1-10 |
1 |
p. 101-104 4 p. |
artikel |
783 |
Tetris–Hashing or optimal table compression
|
Galli, Nicola |
|
2001 |
1-10 |
1 |
p. 41-58 18 p. |
artikel |
784 |
The algorithmics of folding proteins on lattices
|
Chandru, Vijay |
|
2003 |
1-10 |
1 |
p. 145-161 17 p. |
artikel |
785 |
The allocation problem in hardware design
|
Jansen, Klaus |
|
1993 |
1-10 |
1 |
p. 37-46 10 p. |
artikel |
786 |
The application of mathematics in industry
|
|
|
1983 |
1-10 |
1 |
p. 104-105 2 p. |
artikel |
787 |
The artificial intelligence debate: False starts, real foundations
|
|
|
1990 |
1-10 |
1 |
p. 125- 1 p. |
artikel |
788 |
The art of modelling dynamic systems: forecasting for chaos randomness, and determinism
|
|
|
1992 |
1-10 |
1 |
p. 95-96 2 p. |
artikel |
789 |
The availability of crumbling wall quorum systems
|
Peleg, David |
|
1997 |
1-10 |
1 |
p. 69-83 15 p. |
artikel |
790 |
The average dimension of the hull of cyclic codes
|
Skersys, Gintaras |
|
2003 |
1-10 |
1 |
p. 275-292 18 p. |
artikel |
791 |
The base of the intersection of two free submonoids
|
Book, Ronald V. |
|
1985 |
1-10 |
1 |
p. 13-20 8 p. |
artikel |
792 |
The binding number of Halin graphs
|
Skowrońska, Mirosława |
|
1988 |
1-10 |
1 |
p. 93-97 5 p. |
artikel |
793 |
The box-TDI system associated with 2-edge connected spanning subgraphs
|
Chen, Xujin |
|
2009 |
1-10 |
1 |
p. 118-125 8 p. |
artikel |
794 |
The capacity of monotonic functions
|
Sill, Joseph |
|
1998 |
1-10 |
1 |
p. 95-107 13 p. |
artikel |
795 |
The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications
|
Nehme, David |
|
1997 |
1-10 |
1 |
p. 57-68 12 p. |
artikel |
796 |
The communication complexity of interval orders
|
Faigle, Ulrich |
|
1992 |
1-10 |
1 |
p. 19-28 10 p. |
artikel |
797 |
The complementary class of generalized flow cover inequalities
|
Stallaert, Jan I.A. |
|
1997 |
1-10 |
1 |
p. 73-80 8 p. |
artikel |
798 |
The complexity of a periodic sequence over GF(p)
|
Xie, Shenquan |
|
1988 |
1-10 |
1 |
p. 81-86 6 p. |
artikel |
799 |
The complexity of base station positioning in cellular networks
|
Glaßer, Christian |
|
2005 |
1-10 |
1 |
p. 1-12 12 p. |
artikel |
800 |
The complexity of completing partial Latin squares
|
Colbourn, Charles J. |
|
1984 |
1-10 |
1 |
p. 25-30 6 p. |
artikel |
801 |
The complexity of determinacy problem on group testing
|
Yang, Feng |
|
1990 |
1-10 |
1 |
p. 71-81 11 p. |
artikel |
802 |
The complexity of domination problems in circle graphs
|
Keil, J.Mark |
|
1993 |
1-10 |
1 |
p. 51-63 13 p. |
artikel |
803 |
The complexity of finding two disjoint paths with min-max objective function
|
Li, Chung-Lun |
|
1990 |
1-10 |
1 |
p. 105-115 11 p. |
artikel |
804 |
The complexity of minimizing certain cost metrics for k-source spanning trees
|
Connamacher, Harold S. |
|
2003 |
1-10 |
1 |
p. 113-127 15 p. |
artikel |
805 |
The complexity of nonrepetitive coloring
|
Marx, Dániel |
|
2009 |
1-10 |
1 |
p. 13-18 6 p. |
artikel |
806 |
The complexity of short two-person games
|
Chandra, Ashok K. |
|
1990 |
1-10 |
1 |
p. 21-33 13 p. |
artikel |
807 |
The complexity of the locally connected spanning tree problem
|
Cai, Leizhen |
|
2003 |
1-10 |
1 |
p. 63-75 13 p. |
artikel |
808 |
The cost-to-time ratio problem for large or infinite graphs
|
Golitschek, M.v. |
|
1987 |
1-10 |
1 |
p. 1-9 9 p. |
artikel |
809 |
The covering radius of the cycle code of a graph
|
Solé, Patrick |
|
1993 |
1-10 |
1 |
p. 63-70 8 p. |
artikel |
810 |
The degree of approximation of sets in euclidean space using sets with bounded Vapnik-Chervonenkis dimension
|
Maiorov, Vitaly |
|
1998 |
1-10 |
1 |
p. 81-93 13 p. |
artikel |
811 |
The depth and width of local minima in discrete solution spaces
|
Ryan, Jennifer |
|
1995 |
1-10 |
1 |
p. 75-82 8 p. |
artikel |
812 |
The design and analysis of efficient learning algorithms
|
|
|
1994 |
1-10 |
1 |
p. 109- 1 p. |
artikel |
813 |
The discrete Radon transform and its approximate inversion via linear programming
|
Fishburn, Peter |
|
1997 |
1-10 |
1 |
p. 39-61 23 p. |
artikel |
814 |
The dominant of the 2-connected-Steiner-subgraph polytope for W 4-free graphs
|
Coullard, Collette R |
|
1996 |
1-10 |
1 |
p. 33-43 11 p. |
artikel |
815 |
The effect of machine availability on the worst-case performance of LPT
|
Hwang, Hark-Chin |
|
2005 |
1-10 |
1 |
p. 49-61 13 p. |
artikel |
816 |
The effect of side-information on smooth entropy
|
Yang, Bo |
|
2004 |
1-10 |
1 |
p. 151-157 7 p. |
artikel |
817 |
The effect of two cycles on the complexity of colourings by directed graphs
|
Bang-Jensen, Jørgen |
|
1990 |
1-10 |
1 |
p. 1-23 23 p. |
artikel |
818 |
The equivalence classes of LR arrays
|
Lin, Dongdai |
|
1993 |
1-10 |
1 |
p. 47-61 15 p. |
artikel |
819 |
The generalized assignment problem with flexible jobs
|
Rainwater, Chase |
|
2009 |
1-10 |
1 |
p. 49-67 19 p. |
artikel |
820 |
The Hamiltonicity of directed σ-τ Cayley graphs (Or: A tale of backtracking)
|
Ruskey, Frank |
|
1995 |
1-10 |
1 |
p. 75-83 9 p. |
artikel |
821 |
The hierarchical product of graphs
|
Barrière, L. |
|
2009 |
1-10 |
1 |
p. 36-48 13 p. |
artikel |
822 |
The indefinite zero-one quadratic problem
|
Carter, Michael W. |
|
1984 |
1-10 |
1 |
p. 23-44 22 p. |
artikel |
823 |
The Linzertorte problem, or a unified approach to painting, baking and weaving
|
Hochbaum, Dorit S. |
|
1986 |
1-10 |
1 |
p. 17-32 16 p. |
artikel |
824 |
The logic of quantum mechanics
|
|
|
1984 |
1-10 |
1 |
p. 111-112 2 p. |
artikel |
825 |
The majority strategy on graphs
|
Mulder, Henry Martyn |
|
1997 |
1-10 |
1 |
p. 97-105 9 p. |
artikel |
826 |
The matching polynomial of a polygraph
|
Babić, Darko |
|
1986 |
1-10 |
1 |
p. 11-24 14 p. |
artikel |
827 |
The mathematics of nonlinear programming
|
|
|
1990 |
1-10 |
1 |
p. 128-129 2 p. |
artikel |
828 |
The maximum traveling salesman problem on van der Veen matrices
|
Steiner, George |
|
2005 |
1-10 |
1 |
p. 1-2 2 p. |
artikel |
829 |
The minimum number of e -vertex-covers among hypergraphs with e edges of given ranks
|
Chang, F.H. |
|
2009 |
1-10 |
1 |
p. 164-169 6 p. |
artikel |
830 |
The minimum spanning tree problem on a planar graph
|
Matsui, Tomomi |
|
1995 |
1-10 |
1 |
p. 91-94 4 p. |
artikel |
831 |
The nucleolus of homogeneous games with steps
|
Rosenmüller, J. |
|
1994 |
1-10 |
1 |
p. 53-76 24 p. |
artikel |
832 |
The number of vertices whose out-arcs are pancyclic in a 2-strong tournament
|
Li, Ruijuan |
|
2008 |
1-10 |
1 |
p. 88-92 5 p. |
artikel |
833 |
The optimal procedures for quantitative group testing
|
Hao, Fred H. |
|
1990 |
1-10 |
1 |
p. 79-86 8 p. |
artikel |
834 |
Theory of 2–3 Heaps
|
Takaoka, Tadao |
|
2003 |
1-10 |
1 |
p. 115-128 14 p. |
artikel |
835 |
Theory of semi-feasible algorithms
|
|
|
2005 |
1-10 |
1 |
p. 118- 1 p. |
artikel |
836 |
The path-variance problem on tree networks
|
Cáceres, Teresa |
|
2004 |
1-10 |
1 |
p. 72-79 8 p. |
artikel |
837 |
The performance ratio of grouping policies for the joint replenishment problem
|
Queyranne, Maurice |
|
1993 |
1-10 |
1 |
p. 43-72 30 p. |
artikel |
838 |
The permutahedron of series-parallel posets
|
Schulz, Andreas S. |
|
1995 |
1-10 |
1 |
p. 85-90 6 p. |
artikel |
839 |
The permutahedron of series-parallel posets
|
Von Arnim, Annelie |
|
1990 |
1-10 |
1 |
p. 3-9 7 p. |
artikel |
840 |
The proof theoretic strength of the Steinitz exchange theorem
|
Soltys, Michael |
|
2007 |
1-10 |
1 |
p. 53-60 8 p. |
artikel |
841 |
The Ramsey number for a cycle of length six versus a clique of order eight
|
Chen, Yaojun |
|
2009 |
1-10 |
1 |
p. 8-12 5 p. |
artikel |
842 |
The relationship between two algorithms for decisions via sophisticated majority voting with an agenda
|
Reid, K.B. |
|
1991 |
1-10 |
1 |
p. 23-28 6 p. |
artikel |
843 |
The rotation graphs of perfect matchings of plane bipartite graphs
|
Zhang, Heping |
|
1997 |
1-10 |
1 |
p. 5-12 8 p. |
artikel |
844 |
The set of super-stable marriages forms a distributive lattice
|
Spieker, Boris |
|
1995 |
1-10 |
1 |
p. 79-84 6 p. |
artikel |
845 |
The Shields–Harary numbers of K m , n for continuous concave cost functions vanishing at 1
|
Holliday, John |
|
2008 |
1-10 |
1 |
p. 82-87 6 p. |
artikel |
846 |
The shortest-path problem for graphs with random arc-lengths
|
Frieze, A.M. |
|
1985 |
1-10 |
1 |
p. 57-77 21 p. |
artikel |
847 |
The skeleton of the symmetric traveling salesman polytope
|
Sierksma, Gerard |
|
1993 |
1-10 |
1 |
p. 63-74 12 p. |
artikel |
848 |
The strong chromatic number of partial triple systems
|
Colbourn, Charles J. |
|
1988 |
1-10 |
1 |
p. 31-38 8 p. |
artikel |
849 |
The task allocation problem with constant communication
|
Fernandez de la Vega, W. |
|
2003 |
1-10 |
1 |
p. 169-177 9 p. |
artikel |
850 |
The theory of games
|
|
|
1993 |
1-10 |
1 |
p. 83- 1 p. |
artikel |
851 |
The threshold order of a Boolean function
|
Wang, Chi |
|
1991 |
1-10 |
1 |
p. 51-69 19 p. |
artikel |
852 |
The Tietäväinen bound for spherical codes
|
Astola, Jaakko T. |
|
1984 |
1-10 |
1 |
p. 17-21 5 p. |
artikel |
853 |
Tight and loose value automorphisms
|
Roberts, Fred S. |
|
1988 |
1-10 |
1 |
p. 69-79 11 p. |
artikel |
854 |
Tight bounds for synchronous communication of information using bits and silence
|
O'Reilly, Una-May |
|
2003 |
1-10 |
1 |
p. 195-209 15 p. |
artikel |
855 |
Total choosability of planar graphs with maximum degree 4
|
Roussel, Nicolas |
|
2011 |
1-10 |
1 |
p. 87-89 3 p. |
artikel |
856 |
Transforms of pseudo-Boolean random variables
|
Ding, Guoli |
|
2010 |
1-10 |
1 |
p. 13-24 12 p. |
artikel |
857 |
Transient length in sequential iteration of threshold functions
|
Fogelman, F. |
|
1983 |
1-10 |
1 |
p. 95-98 4 p. |
artikel |
858 |
Transitive closure algorithm MEMTC and its performance analysis
|
Hirvisalo, Vesa |
|
2001 |
1-10 |
1 |
p. 77-84 8 p. |
artikel |
859 |
Transitive reduction of a nilpotent boolean matrix
|
Hashimoto, Hiroshi |
|
1984 |
1-10 |
1 |
p. 51-61 11 p. |
artikel |
860 |
Transportation in graphs and the admittance spectrum
|
Maas, Christoph |
|
1987 |
1-10 |
1 |
p. 31-49 19 p. |
artikel |
861 |
Trapezoid graphs and generalizations, geometry and algorithms
|
Felsner, Stefan |
|
1997 |
1-10 |
1 |
p. 13-32 20 p. |
artikel |
862 |
Trapezoid graphs and their coloring
|
Dagan, Ido |
|
1988 |
1-10 |
1 |
p. 35-46 12 p. |
artikel |
863 |
Trees of extremal connectivity index
|
Liu, Huiqing |
|
2006 |
1-10 |
1 |
p. 106-119 14 p. |
artikel |
864 |
Tree-width, path-width, and cutwidth
|
Korach, Ephraim |
|
1993 |
1-10 |
1 |
p. 97-101 5 p. |
artikel |
865 |
Trivial two-stage group testing for complexes using almost disjunct matrices
|
Macula, Anthony J. |
|
2004 |
1-10 |
1 |
p. 97-107 11 p. |
artikel |
866 |
Two machine flow shop scheduling problem with no wait in process: controllable machine speeds
|
Strusevich, Vitaly A. |
|
1995 |
1-10 |
1 |
p. 75-86 12 p. |
artikel |
867 |
Two metrics in a graph theory modeling of organic chemistry
|
Baláž, Vladimír |
|
1992 |
1-10 |
1 |
p. 1-19 19 p. |
artikel |
868 |
Two-path subsets: Efficient counting and applications to performability analysis
|
Ball, Michael O. |
|
1998 |
1-10 |
1 |
p. 25-45 21 p. |
artikel |
869 |
Two remarks on “Expanding and Forwarding” by P. Solé
|
Vrt'o, Imrich |
|
1995 |
1-10 |
1 |
p. 85-89 5 p. |
artikel |
870 |
Two routing problems with the limitation of fuel
|
Ichimori, Tetsuo |
|
1983 |
1-10 |
1 |
p. 85-89 5 p. |
artikel |
871 |
UET scheduling with unit interprocessor communication delays
|
Rayward-Smith, V.J. |
|
1987 |
1-10 |
1 |
p. 55-71 17 p. |
artikel |
872 |
Uncertain information processing in expert systems
|
|
|
1994 |
1-10 |
1 |
p. 99-100 2 p. |
artikel |
873 |
Une amelioration de la methode de Dijkstra pour la recherche d'un plus court chemin dans un reseau
|
Bovet, Jean |
|
1986 |
1-10 |
1 |
p. 93-96 4 p. |
artikel |
874 |
Unicyclic and bicyclic graphs having minimum degree distance
|
Ioan Tomescu, Alexandru |
|
2008 |
1-10 |
1 |
p. 125-130 6 p. |
artikel |
875 |
Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra
|
Hong, Sung-Pil |
|
2008 |
1-10 |
1 |
p. 25-41 17 p. |
artikel |
876 |
Unified all-pairs shortest path algorithms in the chordal hierarchy
|
Han, K. |
|
1997 |
1-10 |
1 |
p. 59-71 13 p. |
artikel |
877 |
Uniqueness of currents in infinite resistive networks
|
Soardi, Paolo M. |
|
1991 |
1-10 |
1 |
p. 37-49 13 p. |
artikel |
878 |
Universal algorithms for evaluating boolean functions
|
Thayse, A. |
|
1981 |
1-10 |
1 |
p. 53-65 13 p. |
artikel |
879 |
Universal covers of graphs: Isomorphism to depth n − 1 implies isomorphism to all depths
|
Norris, N. |
|
1995 |
1-10 |
1 |
p. 61-74 14 p. |
artikel |
880 |
Using graphs for some discrete tomography problems
|
Costa, M.-C. |
|
2006 |
1-10 |
1 |
p. 35-46 12 p. |
artikel |
881 |
Using local adaptations to reconfigure a spanning tree of a network
|
Pruhs, Kirk R. |
|
1995 |
1-10 |
1 |
p. 67-74 8 p. |
artikel |
882 |
Vapnik-Chervonenkis dimension of recurrent neural networks
|
Koiran, Pascal |
|
1998 |
1-10 |
1 |
p. 63-79 17 p. |
artikel |
883 |
Variable neighborhood search for the maximum clique
|
Hansen, Pierre |
|
2004 |
1-10 |
1 |
p. 117-125 9 p. |
artikel |
884 |
Variants of the majority problem
|
Aigner, Martin |
|
2004 |
1-10 |
1 |
p. 3-25 23 p. |
artikel |
885 |
Vertex-symmetric digraphs with small diameter
|
Comellas, F. |
|
1995 |
1-10 |
1 |
p. 1-11 11 p. |
artikel |
886 |
Votes and a half-binomial
|
Frame, J.S. |
|
1985 |
1-10 |
1 |
p. 31-40 10 p. |
artikel |
887 |
Weighted digital distance transforms in four dimensions
|
Borgefors, Gunilla |
|
2003 |
1-10 |
1 |
p. 161-176 16 p. |
artikel |
888 |
Weighted sequence graphs: boosting iterated dynamic programming using locally suboptimal solutions
|
Schwikowski, Benno |
|
2003 |
1-10 |
1 |
p. 95-117 23 p. |
artikel |
889 |
Weil descent of Jacobians
|
Galbraith, Steven D |
|
2003 |
1-10 |
1 |
p. 165-180 16 p. |
artikel |
890 |
When each hexagon of a hexagonal system covers it
|
Zhang, Fu-ji |
|
1991 |
1-10 |
1 |
p. 63-75 13 p. |
artikel |
891 |
Wiener number of hexagonal jagged-rectangles
|
Shiu, W.C. |
|
1997 |
1-10 |
1 |
p. 83-96 14 p. |
artikel |
892 |
Wiener number of vertex-weighted graphs and a chemical application
|
Klavžar, Sandi |
|
1997 |
1-10 |
1 |
p. 73-81 9 p. |
artikel |
893 |
Workshop on applications of combinatorial optimization in science and technology
|
|
|
1990 |
1-10 |
1 |
p. 127-128 2 p. |
artikel |
894 |
Worst case analysis of a graph coloring algorithm
|
Spinrad, Jeremy P. |
|
1985 |
1-10 |
1 |
p. 89-92 4 p. |
artikel |