nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Abe Mizrahi and Michael Sullivan, finite mathematics - An applied approach 7th edition (Wiley, New York, 1996) 599 pages
|
|
|
1997 |
31-40 |
2 |
p. 191- 1 p. |
artikel |
2 |
A case of non-convergent dual changes in assignment problems
|
Aráoz, Julián |
|
1985 |
31-40 |
2 |
p. 95-102 8 p. |
artikel |
3 |
A characterization of PQI interval orders
|
Tsoukiàs, A. |
|
2003 |
31-40 |
2 |
p. 387-397 11 p. |
artikel |
4 |
A characterization of uniquely representable interval graphs
|
Fishburn, Peter C. |
|
1985 |
31-40 |
2 |
p. 191-194 4 p. |
artikel |
5 |
Acknowledgement
|
Brucker, Peter |
|
1995 |
31-40 |
2 |
p. 95- 1 p. |
artikel |
6 |
A classification result on weighted { δ v μ + 1 , δ v μ ; N , p 3 } -minihypers
|
Ferret, S. |
|
2006 |
31-40 |
2 |
p. 277-293 17 p. |
artikel |
7 |
A class of acyclic digraphs with interval competition graphs
|
Cho, Han Hyuk |
|
2005 |
31-40 |
2 |
p. 171-180 10 p. |
artikel |
8 |
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
|
Björklund, Henrik |
|
2007 |
31-40 |
2 |
p. 210-229 20 p. |
artikel |
9 |
A comment to: Two classes of edge domination in graphs
|
Jahanbekam, S. |
|
2009 |
31-40 |
2 |
p. 400-401 2 p. |
artikel |
10 |
A commonsense approach to the theory of error correcting codes
|
|
|
1990 |
31-40 |
2 |
p. 189- 1 p. |
artikel |
11 |
A communication problem and directed triple systems
|
Gyárfás, András |
|
1998 |
31-40 |
2 |
p. 139-147 9 p. |
artikel |
12 |
A convex polytope of diameter one
|
Pujari, Arun K. |
|
1983 |
31-40 |
2 |
p. 241-242 2 p. |
artikel |
13 |
A correction to a result in linear programming
|
Murty, Katta G. |
|
1988 |
31-40 |
2 |
p. 177-180 4 p. |
artikel |
14 |
A cutting plane algorithm for graph coloring
|
Méndez-Díaz, Isabel |
|
2008 |
31-40 |
2 |
p. 159-179 21 p. |
artikel |
15 |
Acyclic k-connected subgraphs for distributed alternate routing in communications networks
|
Segal, Moshe |
|
1988 |
31-40 |
2 |
p. 181-189 9 p. |
artikel |
16 |
Addendum to the threshold order of a Boolean function
|
Wang, Chi |
|
1992 |
31-40 |
2 |
p. 207- 1 p. |
artikel |
17 |
Adding activities to the dual instead of cuts to the primal problem
|
Holm, Søren |
|
1987 |
31-40 |
2 |
p. 167-174 8 p. |
artikel |
18 |
Additive similarity measures
|
Leischner, Lutz |
|
2003 |
31-40 |
2 |
p. 303-318 16 p. |
artikel |
19 |
A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits
|
Hasler, M. |
|
1994 |
31-40 |
2 |
p. 169-184 16 p. |
artikel |
20 |
A domain monotonicity theorem for graphs and Hamiltonicity
|
Mohar, Bojan |
|
1992 |
31-40 |
2 |
p. 169-177 9 p. |
artikel |
21 |
Affine equivalence in the AES round function
|
Youssef, A.M. |
|
2005 |
31-40 |
2 |
p. 161-170 10 p. |
artikel |
22 |
Affinity of permutations of F 2 n
|
Hou, Xiang-dong |
|
2006 |
31-40 |
2 |
p. 313-325 13 p. |
artikel |
23 |
A finitely convergent procedure for facial disjunctive programs
|
Sherali, Hanif D. |
|
1982 |
31-40 |
2 |
p. 135-148 14 p. |
artikel |
24 |
A fixed point operator for the generalised maximum satisfiability problem
|
Cochand, M. |
|
1993 |
31-40 |
2 |
p. 117-132 16 p. |
artikel |
25 |
A framework for adaptive sorting
|
Petersson, Ola |
|
1995 |
31-40 |
2 |
p. 153-179 27 p. |
artikel |
26 |
A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
|
Katoh, N. |
|
1992 |
31-40 |
2 |
p. 143-155 13 p. |
artikel |
27 |
A, Gammerman (ed.), computational learning and probabilistic reasoning (Wiley, Chichester, 1996) 312 pages
|
|
|
1997 |
31-40 |
2 |
p. 195- 1 p. |
artikel |
28 |
A generalization of the binary Preparata code
|
Kuzmin, A.S. |
|
2006 |
31-40 |
2 |
p. 337-345 9 p. |
artikel |
29 |
Agent-based randomized broadcasting in large networks
|
Elsässer, Robert |
|
2007 |
31-40 |
2 |
p. 150-160 11 p. |
artikel |
30 |
A genuinely polynomial primal simplex algorithm for the assignment problem
|
Akgül, Mustafa |
|
1993 |
31-40 |
2 |
p. 93-115 23 p. |
artikel |
31 |
Aggregation of nonnegative integer-valued equations
|
Babayev, Djangir A. |
|
1984 |
31-40 |
2 |
p. 125-130 6 p. |
artikel |
32 |
A greedy algorithm for convex geometries
|
Kashiwabara, Kenji |
|
2003 |
31-40 |
2 |
p. 449-465 17 p. |
artikel |
33 |
A group testing problem for hypergraphs of bounded rank
|
Triesch, Eberhard |
|
1996 |
31-40 |
2 |
p. 185-188 4 p. |
artikel |
34 |
A heuristic approach to hard constrained shortest path problems
|
Ribeiro, Celso C. |
|
1985 |
31-40 |
2 |
p. 125-137 13 p. |
artikel |
35 |
A homomorphic characterization of regular languages
|
Culik II, Karel |
|
1982 |
31-40 |
2 |
p. 149-152 4 p. |
artikel |
36 |
Alan D. Taylor, mathematics and politics (Springer, New York, 1995) 284 pages
|
|
|
1997 |
31-40 |
2 |
p. 192- 1 p. |
artikel |
37 |
Algebraic expressions for Kekulé structure counts of nonbranched cata-condensed benzenoid
|
He, Wenjie |
|
1992 |
31-40 |
2 |
p. 91-106 16 p. |
artikel |
38 |
Algorithms and outerplanar conditions for A-trails in plane Eulerian graphs
|
Andersen, Lars Døvling |
|
1998 |
31-40 |
2 |
p. 99-112 14 p. |
artikel |
39 |
Algorithms for finding K-best perfect matchings
|
Chegireddy, Chandra R. |
|
1987 |
31-40 |
2 |
p. 155-165 11 p. |
artikel |
40 |
Algorithms for weak and wide separation of sets
|
Houle, Michael F. |
|
1993 |
31-40 |
2 |
p. 139-159 21 p. |
artikel |
41 |
Algorithms for weakly triangulated graphs
|
Spinrad, Jeremy |
|
1995 |
31-40 |
2 |
p. 181-191 11 p. |
artikel |
42 |
A linear-time algorithm for finding Hamiltonian cycles in tournaments
|
Manoussakis, Y. |
|
1992 |
31-40 |
2 |
p. 199-201 3 p. |
artikel |
43 |
A linear time and space algorithm to recognize interval orders
|
Baldy, Philippe |
|
1993 |
31-40 |
2 |
p. 173-178 6 p. |
artikel |
44 |
A lower bound for a constrained quadratic 0–1 minimization problem
|
Billionnet, Alain |
|
1997 |
31-40 |
2 |
p. 135-146 12 p. |
artikel |
45 |
A lower-bound for the number of productions required for a certain class of languages
|
Alspach, Brian |
|
1983 |
31-40 |
2 |
p. 109-115 7 p. |
artikel |
46 |
Alternative group relaxation of integer programming problems
|
Bertolazzi, P. |
|
1984 |
31-40 |
2 |
p. 143-151 9 p. |
artikel |
47 |
A Maiorana–McFarland type construction for resilient Boolean functions on n variables (n even) with nonlinearity > 2 n - 1 - 2 n / 2 + 2 n / 2 - 2
|
Maitra, Subhamoy |
|
2006 |
31-40 |
2 |
p. 357-369 13 p. |
artikel |
48 |
A matroid generalization of theorems of Lewin and Gallai
|
Kajitani, Yoji |
|
1984 |
31-40 |
2 |
p. 213-216 4 p. |
artikel |
49 |
A Monge property for the d-dimensional transportation problem
|
Bein, Wolfgang W. |
|
1995 |
31-40 |
2 |
p. 97-109 13 p. |
artikel |
50 |
A morphic representation of EOL languages and other ETOL languages
|
Ehrenfeucht, A. |
|
1985 |
31-40 |
2 |
p. 115-122 8 p. |
artikel |
51 |
A multi-level search strategy for the 0–1 Multidimensional Knapsack Problem
|
Boussier, Sylvain |
|
2010 |
31-40 |
2 |
p. 97-109 13 p. |
artikel |
52 |
An adaptive memory algorithm for the k-coloring problem
|
Galinier, Philippe |
|
2008 |
31-40 |
2 |
p. 267-279 13 p. |
artikel |
53 |
An algorithm for a separable integer programming problem with cumulatively bounded variables
|
Dyer, Martin E |
|
1987 |
31-40 |
2 |
p. 135-149 15 p. |
artikel |
54 |
An algorithm to determine a path with minimal cost/capacity ratio
|
Martins, Ernesto Queirós Vieira |
|
1984 |
31-40 |
2 |
p. 189-194 6 p. |
artikel |
55 |
An algorithm to recognize a middle graph
|
Skowrońska, Mirosława |
|
1984 |
31-40 |
2 |
p. 201-208 8 p. |
artikel |
56 |
Analysis of a linear programming heuristic for scheduling unrelated parallel machines
|
Potts, C.N. |
|
1985 |
31-40 |
2 |
p. 155-164 10 p. |
artikel |
57 |
An analysis of the greedy algorithm for partially ordered sets
|
Croitoru, Cornelius |
|
1982 |
31-40 |
2 |
p. 113-117 5 p. |
artikel |
58 |
An ant-based algorithm for coloring graphs
|
Bui, Thang N. |
|
2008 |
31-40 |
2 |
p. 190-200 11 p. |
artikel |
59 |
An approximation algorithm for the hamiltonian walk problem on maximal planar graphs
|
Nishizeki, Takao |
|
1983 |
31-40 |
2 |
p. 211-222 12 p. |
artikel |
60 |
An ε-approximation scheme for combinatorial optimization problems with minimum variance criterion
|
Katoh, Naoki |
|
1992 |
31-40 |
2 |
p. 131-141 11 p. |
artikel |
61 |
Andrey I. Kibzun and Yuri S. Kan, stochastic programming problems with probability and quantile functions (Wiley, Chichester, 1996) 301 pages
|
|
|
1997 |
31-40 |
2 |
p. 195- 1 p. |
artikel |
62 |
An effective formula for the number of solutions of a system of two 0, 1-equations
|
Buzytsky, P.L. |
|
1983 |
31-40 |
2 |
p. 127-133 7 p. |
artikel |
63 |
An efficient algorithm for the complete set partitioning problem
|
Lin, Chien-Hua M. |
|
1983 |
31-40 |
2 |
p. 149-156 8 p. |
artikel |
64 |
An efficient matching algorithm applied in statistical physics
|
Bendisch, J. |
|
1994 |
31-40 |
2 |
p. 139-153 15 p. |
artikel |
65 |
A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
|
Barth, Dominique |
|
1997 |
31-40 |
2 |
p. 99-118 20 p. |
artikel |
66 |
A new enumeration scheme for the knapsack problem
|
Yanasse, Horacio Hideki |
|
1987 |
31-40 |
2 |
p. 235-245 11 p. |
artikel |
67 |
A new reduction method in integer programming
|
Greenberg, Harold |
|
1988 |
31-40 |
2 |
p. 169-172 4 p. |
artikel |
68 |
A new Van der Waerden number
|
Beeler, Michael D. |
|
1983 |
31-40 |
2 |
p. 207- 1 p. |
artikel |
69 |
An exact algorithm for the channel assignment problem
|
Král', Daniel |
|
2005 |
31-40 |
2 |
p. 326-331 6 p. |
artikel |
70 |
An explicit class of codes with good parameters and their duals
|
Ling, San |
|
2006 |
31-40 |
2 |
p. 346-356 11 p. |
artikel |
71 |
An explicit formula for the solution of the Fisher-Wright selection model in population genetics
|
Dorninger, Dietmar |
|
1983 |
31-40 |
2 |
p. 209-211 3 p. |
artikel |
72 |
An extension of the periodicity lemma to longer periods
|
Fraenkel, Aviezri S. |
|
2005 |
31-40 |
2 |
p. 146-155 10 p. |
artikel |
73 |
An extremal problem for edge domination insensitive graphs
|
Dutton, Ronald D. |
|
1988 |
31-40 |
2 |
p. 113-125 13 p. |
artikel |
74 |
An improvement of the Griesmer bound for some small minimum distances
|
Dodunekov, S.M. |
|
1985 |
31-40 |
2 |
p. 103-114 12 p. |
artikel |
75 |
An inequality for polymatroid functions and its applications
|
Boros, E. |
|
2003 |
31-40 |
2 |
p. 255-281 27 p. |
artikel |
76 |
An infinite class of Z-cyclic whist tournaments on v players, v ≡ 1 (mod 4)
|
Finizio, Norman J. |
|
1996 |
31-40 |
2 |
p. 135-146 12 p. |
artikel |
77 |
An interconnection of local maps inducing onto global maps
|
Nasu, Masakazu |
|
1980 |
31-40 |
2 |
p. 125-150 26 p. |
artikel |
78 |
An introduction to parallelism in combinatorial optimization
|
Kindervater, G.A.P. |
|
1986 |
31-40 |
2 |
p. 135-156 22 p. |
artikel |
79 |
An introduction to the analysis of approximation algorithms
|
Kan, A.H.G.Rinnooy |
|
1986 |
31-40 |
2 |
p. 171-185 15 p. |
artikel |
80 |
Announcement
|
|
|
1995 |
31-40 |
2 |
p. 201-202 2 p. |
artikel |
81 |
Announcement
|
|
|
1984 |
31-40 |
2 |
p. 230- 1 p. |
artikel |
82 |
An O(n 2) algorithm for the maximum cycle mean of an n×n bivalent matrix
|
Butkovic, P. |
|
1992 |
31-40 |
2 |
p. 157-162 6 p. |
artikel |
83 |
An O(n log n) algorithm for a maxmin location problem
|
Rangan, C.Pandu |
|
1992 |
31-40 |
2 |
p. 203-205 3 p. |
artikel |
84 |
An optimal parallel connectivity algorithm
|
Vishkin, Uzi |
|
1984 |
31-40 |
2 |
p. 197-207 11 p. |
artikel |
85 |
A note on 3D orthogonal graph drawing
|
Biedl, Therese |
|
2005 |
31-40 |
2 |
p. 189-193 5 p. |
artikel |
86 |
A note on generalizing the maximum lateness criterion for scheduling
|
Hall, Leslie A. |
|
1993 |
31-40 |
2 |
p. 129-137 9 p. |
artikel |
87 |
A note on list improper coloring of plane graphs
|
Dong, Wei |
|
2009 |
31-40 |
2 |
p. 433-436 4 p. |
artikel |
88 |
A note on matchings and separability
|
Cook, W. |
|
1985 |
31-40 |
2 |
p. 203-209 7 p. |
artikel |
89 |
A note on morphic characterization of languages
|
Karhumäki, Juhani |
|
1983 |
31-40 |
2 |
p. 243-246 4 p. |
artikel |
90 |
A note on the minimization of symmetric and general submodular functions
|
Narayanan, H |
|
2003 |
31-40 |
2 |
p. 513-522 10 p. |
artikel |
91 |
Another look at graph coloring via propositional satisfiability
|
Van Gelder, Allen |
|
2008 |
31-40 |
2 |
p. 230-243 14 p. |
artikel |
92 |
An O( tm log D ) Algorithm for shortest paths
|
Hansen, Pierre |
|
1980 |
31-40 |
2 |
p. 151-153 3 p. |
artikel |
93 |
An upper bound for the competition numbers of graphs
|
Kamibeppu, Akira |
|
2010 |
31-40 |
2 |
p. 154-157 4 p. |
artikel |
94 |
A parallel branch and bound algorithm for the quadratic assignment problem
|
Roucairol, Catherine |
|
1987 |
31-40 |
2 |
p. 211-225 15 p. |
artikel |
95 |
A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case
|
Kats, Vladimir |
|
2009 |
31-40 |
2 |
p. 339-355 17 p. |
artikel |
96 |
A polynomial time algorithm for finding the prime factors of cartesian-product graphs
|
Feigenbaum, Joan |
|
1985 |
31-40 |
2 |
p. 123-138 16 p. |
artikel |
97 |
A polynomial-time algorithm for the paired-domination problem on permutation graphs
|
Cheng, T.C.E. |
|
2009 |
31-40 |
2 |
p. 262-271 10 p. |
artikel |
98 |
A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
|
Timkovsky, Vadim G. |
|
1997 |
31-40 |
2 |
p. 185-200 16 p. |
artikel |
99 |
“A posteriori” evaluation of bin packing approximation algorithms
|
Aiello, A. |
|
1980 |
31-40 |
2 |
p. 159-161 3 p. |
artikel |
100 |
Approximating Boolean functions by OBDDs
|
Gronemeier, Andre |
|
2007 |
31-40 |
2 |
p. 194-209 16 p. |
artikel |
101 |
Approximating earliest arrival flows with flow-dependent transit times
|
Baumann, Nadine |
|
2007 |
31-40 |
2 |
p. 161-171 11 p. |
artikel |
102 |
Approximating minimal unsatisfiable subformulae by means of adaptive core search
|
Bruni, Renato |
|
2003 |
31-40 |
2 |
p. 85-100 16 p. |
artikel |
103 |
Approximation techniques for hypergraph partitioning problems
|
Hadley, Scott W. |
|
1995 |
31-40 |
2 |
p. 115-127 13 p. |
artikel |
104 |
A probabilistic analysis of the maximal covering location problem
|
Vohra, Rakesh V. |
|
1993 |
31-40 |
2 |
p. 175-183 9 p. |
artikel |
105 |
A push-relabel framework for submodular function minimization and applications to parametric optimization
|
Fleischer, Lisa |
|
2003 |
31-40 |
2 |
p. 311-322 12 p. |
artikel |
106 |
A random polynomial time algorithm for well-rounding convex bodies
|
Faigle, U. |
|
1995 |
31-40 |
2 |
p. 117-144 28 p. |
artikel |
107 |
A relationship between Gale transforms and Voronoi diagrams
|
Aurenhammer, F. |
|
1990 |
31-40 |
2 |
p. 83-91 9 p. |
artikel |
108 |
A result of Vapnik with applications
|
Anthony, Martin |
|
1994 |
31-40 |
2 |
p. 211- 1 p. |
artikel |
109 |
A review of combinatorial problems arising in feedforward neural network design
|
Amaldi, E. |
|
1994 |
31-40 |
2 |
p. 111-138 28 p. |
artikel |
110 |
A satisfiability procedure for quantified Boolean formulae
|
Plaisted, David A. |
|
2003 |
31-40 |
2 |
p. 291-328 38 p. |
artikel |
111 |
A semidefinite programming-based heuristic for graph coloring
|
Dukanovic, Igor |
|
2008 |
31-40 |
2 |
p. 180-189 10 p. |
artikel |
112 |
A sequencing problem with family setup times
|
Zdrza&z.xl;lka, Stanis&z.xl;law |
|
1996 |
31-40 |
2 |
p. 161-183 23 p. |
artikel |
113 |
A simple a.s. correct algorithm for deciding if a graph has a perfect matching
|
Brito, María Rosa |
|
1995 |
31-40 |
2 |
p. 181-185 5 p. |
artikel |
114 |
A simple linear time algorithm for cograph recognition
|
Habib, Michel |
|
2005 |
31-40 |
2 |
p. 183-197 15 p. |
artikel |
115 |
A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case
|
Galambos, G. |
|
1993 |
31-40 |
2 |
p. 173-178 6 p. |
artikel |
116 |
A smallest augmentation to 3-connect a graph
|
Watanabe, Toshimasa |
|
1990 |
31-40 |
2 |
p. 183-186 4 p. |
artikel |
117 |
A successful algorithm for the undirected Hamiltonian path problem
|
Thompson, Gerald L. |
|
1985 |
31-40 |
2 |
p. 179-195 17 p. |
artikel |
118 |
A survey on Knödel graphs
|
Fertin, Guillaume |
|
2004 |
31-40 |
2 |
p. 173-195 23 p. |
artikel |
119 |
A tight upper bound for group testing in graphs
|
Damaschke, Peter |
|
1994 |
31-40 |
2 |
p. 101-109 9 p. |
artikel |
120 |
A tree representation for P 4-sparse graphs
|
Jamison, B. |
|
1992 |
31-40 |
2 |
p. 115-129 15 p. |
artikel |
121 |
A vector exchange property of submodular systems
|
Faigle, Ulrich |
|
1984 |
31-40 |
2 |
p. 209-211 3 p. |
artikel |
122 |
A very elementary presentation of the Hannenhalli–Pevzner theory
|
Bergeron, Anne |
|
2005 |
31-40 |
2 |
p. 134-145 12 p. |
artikel |
123 |
Avoiding-sequences with minimum sum
|
Clark, Dean S. |
|
1988 |
31-40 |
2 |
p. 103-108 6 p. |
artikel |
124 |
A wrap error attack against NTRUEncrypt
|
Meskanen, Tommi |
|
2006 |
31-40 |
2 |
p. 382-391 10 p. |
artikel |
125 |
Better bounds for perpetual gossiping
|
Scott, A.D. |
|
1997 |
31-40 |
2 |
p. 189-197 9 p. |
artikel |
126 |
Bin packing and multiprocessor scheduling problems with side constraint on job types
|
Morihara, I. |
|
1983 |
31-40 |
2 |
p. 173-191 19 p. |
artikel |
127 |
Bivalent trees and forests or upper bounds for the probability of a union revisited
|
Maurer, Willi |
|
1983 |
31-40 |
2 |
p. 157-171 15 p. |
artikel |
128 |
Bond graphs II: Causality and singularity
|
Lamb, J.D. |
|
1997 |
31-40 |
2 |
p. 143-173 31 p. |
artikel |
129 |
Book announcements
|
|
|
1993 |
31-40 |
2 |
p. 187-190 4 p. |
artikel |
130 |
Book announcements
|
|
|
1994 |
31-40 |
2 |
p. 195-198 4 p. |
artikel |
131 |
Book announcements
|
|
|
1996 |
31-40 |
2 |
p. 193-195 3 p. |
artikel |
132 |
Book announcements
|
|
|
1993 |
31-40 |
2 |
p. 181-184 4 p. |
artikel |
133 |
Book announcements
|
|
|
1992 |
31-40 |
2 |
p. 171-174 4 p. |
artikel |
134 |
Book announcements
|
|
|
1994 |
31-40 |
2 |
p. 205-207 3 p. |
artikel |
135 |
Book announcements
|
|
|
1988 |
31-40 |
2 |
p. 197-198 2 p. |
artikel |
136 |
Book announcements
|
|
|
1989 |
31-40 |
2 |
p. 197-199 3 p. |
artikel |
137 |
Book announcements
|
|
|
1983 |
31-40 |
2 |
p. 215-216 2 p. |
artikel |
138 |
Book announcements
|
|
|
1984 |
31-40 |
2 |
p. 227-229 3 p. |
artikel |
139 |
Book of combinatorial tables
|
|
|
1987 |
31-40 |
2 |
p. 189- 1 p. |
artikel |
140 |
Bounding the number of k-faces in arrangements of hyperplanes
|
Fukuda, Komei |
|
1991 |
31-40 |
2 |
p. 151-165 15 p. |
artikel |
141 |
Bounds on certain multiplications of affine combinations
|
Boyar, Joan |
|
1994 |
31-40 |
2 |
p. 155-167 13 p. |
artikel |
142 |
Bounds on the number of knight's tours
|
Kyek, Olaf |
|
1997 |
31-40 |
2 |
p. 171-181 11 p. |
artikel |
143 |
Broadcasting in one dimension
|
Hell, Pavol |
|
1988 |
31-40 |
2 |
p. 101-111 11 p. |
artikel |
144 |
Broadcasting multiple messages in simultaneous send/receive systems
|
Bar-Noy, Amotz |
|
1994 |
31-40 |
2 |
p. 95-105 11 p. |
artikel |
145 |
C.A. Knoll, M.D. Shaw, J. Johnson and B. Evans (discovering calculus with mathematics) (Wiley, New York, 1995) 340 pages
|
|
|
1997 |
31-40 |
2 |
p. 197- 1 p. |
artikel |
146 |
Call for papers
|
|
|
1988 |
31-40 |
2 |
p. 199- 1 p. |
artikel |
147 |
Call for papers: 1st CCCG first Canadian conference on computational geometry August 21–25, 1989, Montreal, Quebec, Canada
|
|
|
1988 |
31-40 |
2 |
p. 175- 1 p. |
artikel |
148 |
Canonical decompositions of symmetric submodular systems
|
Fujishige, Satoru |
|
1983 |
31-40 |
2 |
p. 175-190 16 p. |
artikel |
149 |
Catastrophic faults in reconfigurable systolic linear arrays
|
De Prisco, Roberto |
|
1997 |
31-40 |
2 |
p. 105-123 19 p. |
artikel |
150 |
Cellular automata, ωω-regular sets, and sofic systems
|
Culik II, Karel |
|
1991 |
31-40 |
2 |
p. 85-101 17 p. |
artikel |
151 |
Characterising ( k , ℓ ) -leaf powers
|
Brandstädt, Andreas |
|
2010 |
31-40 |
2 |
p. 110-122 13 p. |
artikel |
152 |
Characterization of curve map graphs
|
Assmann, S.F. |
|
1984 |
31-40 |
2 |
p. 109-124 16 p. |
artikel |
153 |
Characterization of the inverse of a particular circulant matrix by means of a continued fraction
|
Marrazzini, C. |
|
1980 |
31-40 |
2 |
p. 163-165 3 p. |
artikel |
154 |
Characterizations of consistent marked graphs
|
Roberts, Fred S |
|
2003 |
31-40 |
2 |
p. 357-371 15 p. |
artikel |
155 |
Chordal co-gem-free and ( P 5 ,gem)-free graphs have bounded clique-width
|
Brandstädt, Andreas |
|
2005 |
31-40 |
2 |
p. 232-241 10 p. |
artikel |
156 |
Classification by polynomial surfaces
|
Anthony, Martin |
|
1995 |
31-40 |
2 |
p. 91-103 13 p. |
artikel |
157 |
Classification of P k2
|
Miyakawa, Masahiro |
|
1989 |
31-40 |
2 |
p. 179-192 14 p. |
artikel |
158 |
Close-to-optimal and near-optimal broadcasting in random graphs
|
Gerbessiotis, Alexandros V. |
|
1995 |
31-40 |
2 |
p. 129-150 22 p. |
artikel |
159 |
Coloring graphs by iterated local search traversing feasible and infeasible solutions
|
Caramia, Massimiliano |
|
2008 |
31-40 |
2 |
p. 201-217 17 p. |
artikel |
160 |
Colorings and interpretations: a connection between graphs and grammar forms
|
Maurer, H.A. |
|
1981 |
31-40 |
2 |
p. 119-135 17 p. |
artikel |
161 |
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
|
Makowsky, J.A. |
|
2005 |
31-40 |
2 |
p. 276-290 15 p. |
artikel |
162 |
Colouring steiner quadruple systems
|
Colbourn, Charles J. |
|
1982 |
31-40 |
2 |
p. 103-111 9 p. |
artikel |
163 |
Combinatorial face enumeration in arrangements and oriented matroids
|
Fukuda, Komei |
|
1991 |
31-40 |
2 |
p. 141-149 9 p. |
artikel |
164 |
Combined connectivity augmentation and orientation problems
|
Frank, András |
|
2003 |
31-40 |
2 |
p. 401-419 19 p. |
artikel |
165 |
Comments on “a note on Reed-Muller codes”
|
Kaushik, Manohar Lal |
|
1983 |
31-40 |
2 |
p. 213-214 2 p. |
artikel |
166 |
Communication complexity of two decision problems
|
Björner, Anders |
|
1992 |
31-40 |
2 |
p. 161-163 3 p. |
artikel |
167 |
Communications
|
|
|
1980 |
31-40 |
2 |
p. 171- 1 p. |
artikel |
168 |
Competitive strategies
|
|
|
1984 |
31-40 |
2 |
p. 213- 1 p. |
artikel |
169 |
Complexity results in graph reconstruction
|
Hemaspaandra, Edith |
|
2007 |
31-40 |
2 |
p. 103-118 16 p. |
artikel |
170 |
Comportement periodique des fonctions a seuil binaires et applications
|
Goles, E. |
|
1981 |
31-40 |
2 |
p. 93-105 13 p. |
artikel |
171 |
Computation and cognition: proceedings of the first NEC research symposium
|
|
|
1992 |
31-40 |
2 |
p. 195- 1 p. |
artikel |
172 |
Computer graphics: An introduction to the mathematics and geometry
|
|
|
1990 |
31-40 |
2 |
p. 187- 1 p. |
artikel |
173 |
Computing external farthest neighbors for a simple polygon
|
Agarwal, Pankaj K. |
|
1991 |
31-40 |
2 |
p. 97-111 15 p. |
artikel |
174 |
Computing independent sets in graphs with large girth
|
Murphy, Owen J. |
|
1992 |
31-40 |
2 |
p. 167-170 4 p. |
artikel |
175 |
Computing the branchwidth of interval graphs
|
Kloks, Ton |
|
2005 |
31-40 |
2 |
p. 266-275 10 p. |
artikel |
176 |
Constrained partitioning problems
|
Burkard, Rainer E. |
|
1993 |
31-40 |
2 |
p. 185- 1 p. |
artikel |
177 |
Constructing efficient simulated annealing algorithms
|
Duque-Antón, Manuel |
|
1997 |
31-40 |
2 |
p. 139-159 21 p. |
artikel |
178 |
Constructing fair sports league schedules with regard to strength groups
|
Briskorn, Dirk |
|
2010 |
31-40 |
2 |
p. 123-135 13 p. |
artikel |
179 |
Constructing the relative neighborhood graph in 3-dimensional Euclidean space
|
Jaromczyk, Jerzy W. |
|
1991 |
31-40 |
2 |
p. 181-191 11 p. |
artikel |
180 |
Constructive characterizations for packing and covering with trees
|
Frank, András |
|
2003 |
31-40 |
2 |
p. 347-371 25 p. |
artikel |
181 |
Constructive dual methods for discrete programming
|
Barcia, Paulo |
|
1987 |
31-40 |
2 |
p. 107-117 11 p. |
artikel |
182 |
Constructive generation of very hard 3-colorability instances
|
Mizuno, Kazunori |
|
2008 |
31-40 |
2 |
p. 218-229 12 p. |
artikel |
183 |
Contents
|
|
|
2009 |
31-40 |
2 |
p. vii-viii nvt p. |
artikel |
184 |
Contents
|
|
|
2010 |
31-40 |
2 |
p. vii- 1 p. |
artikel |
185 |
Contents
|
|
|
2003 |
31-40 |
2 |
p. viii-ix nvt p. |
artikel |
186 |
Contents
|
|
|
2003 |
31-40 |
2 |
p. viii-ix nvt p. |
artikel |
187 |
Contents
|
|
|
2004 |
31-40 |
2 |
p. ix- 1 p. |
artikel |
188 |
Contents
|
|
|
2006 |
31-40 |
2 |
p. vii-viii nvt p. |
artikel |
189 |
Contents
|
|
|
2005 |
31-40 |
2 |
p. vii-viii nvt p. |
artikel |
190 |
Contents
|
|
|
2005 |
31-40 |
2 |
p. vii- 1 p. |
artikel |
191 |
Contents
|
|
|
2005 |
31-40 |
2 |
p. ix- 1 p. |
artikel |
192 |
Contents
|
|
|
2007 |
31-40 |
2 |
p. vii-viii nvt p. |
artikel |
193 |
Contents
|
|
|
2008 |
31-40 |
2 |
p. v- 1 p. |
artikel |
194 |
Contents all nrs. if necessary
|
|
|
2003 |
31-40 |
2 |
p. v-vi nvt p. |
artikel |
195 |
Continuous L-cluster methods
|
Janowitz, M.F. |
|
1981 |
31-40 |
2 |
p. 107-112 6 p. |
artikel |
196 |
Convex hulls of samples from spherically symmetric distributions
|
Dwyer, Rex A. |
|
1991 |
31-40 |
2 |
p. 113-132 20 p. |
artikel |
197 |
Coronoid systems with perfect matchings
|
Rong-si, Chen |
|
1996 |
31-40 |
2 |
p. 117-133 17 p. |
artikel |
198 |
Correlation in partially ordered sets
|
Fishburn, Peter C. |
|
1992 |
31-40 |
2 |
p. 173-191 19 p. |
artikel |
199 |
Counting and coding identity trees with fixed diameter and bounded degree
|
Haigh, Claude W. |
|
1984 |
31-40 |
2 |
p. 141-160 20 p. |
artikel |
200 |
Counting dendrograms: A survey
|
Murtagh, Fionn |
|
1984 |
31-40 |
2 |
p. 191-199 9 p. |
artikel |
201 |
Counting the number of p × q integer matrices more concordant than a given matrix
|
Nguyen, Truc T. |
|
1985 |
31-40 |
2 |
p. 187-205 19 p. |
artikel |
202 |
Crosscorrelation of M-sequences and GMW-sequences with the same primitive polynomial
|
Games, Richard A. |
|
1985 |
31-40 |
2 |
p. 139-146 8 p. |
artikel |
203 |
Cutting numbers for the forward loop backward hop network
|
Hu, X.D. |
|
1994 |
31-40 |
2 |
p. 147-161 15 p. |
artikel |
204 |
Cycles generated by sequential iterations
|
Tchuente, Maurice |
|
1988 |
31-40 |
2 |
p. 165-172 8 p. |
artikel |
205 |
Decidability problems for unary output sequential transducers
|
Harju, T. |
|
1991 |
31-40 |
2 |
p. 131-140 10 p. |
artikel |
206 |
Decomposing toroidal graphs into circuits and edges
|
Xu, Baogang |
|
2005 |
31-40 |
2 |
p. 147-159 13 p. |
artikel |
207 |
Defining families of trees with E0L grammars
|
Ottmann, Thomas |
|
1991 |
31-40 |
2 |
p. 195-209 15 p. |
artikel |
208 |
Dichotomy for bounded degree H -colouring
|
Siggers, Mark H. |
|
2009 |
31-40 |
2 |
p. 201-210 10 p. |
artikel |
209 |
Different aspects of coding theory (Robert Calderhank (eds.), (American mathematical society, Providence, RI, 1995) 239 pages
|
|
|
1997 |
31-40 |
2 |
p. 191- 1 p. |
artikel |
210 |
Digraphs with real and gaussian spectra
|
Esser, Friedrich |
|
1980 |
31-40 |
2 |
p. 113-124 12 p. |
artikel |
211 |
Directed Moore hypergraphs
|
Ergincan, Fahir Ö. |
|
1995 |
31-40 |
2 |
p. 117-127 11 p. |
artikel |
212 |
Directed Steiner problems with connectivity constraints
|
Dahl, Geir |
|
1993 |
31-40 |
2 |
p. 109-128 20 p. |
artikel |
213 |
Disjunctive programming
|
Balas, E. |
|
1983 |
31-40 |
2 |
p. 247-248 2 p. |
artikel |
214 |
Distances in a rigid unit-distance graph in the plane
|
Maehara, Hiroshi |
|
1991 |
31-40 |
2 |
p. 193-200 8 p. |
artikel |
215 |
Dividing and conquering the square
|
Llewellyn, Donna C. |
|
1993 |
31-40 |
2 |
p. 131-153 23 p. |
artikel |
216 |
Dominating Cartesian products of cycles
|
Klavžar, Sandi |
|
1995 |
31-40 |
2 |
p. 129-136 8 p. |
artikel |
217 |
Domination, independent domination, and duality in strongly chordal graphs
|
Farber, Martin |
|
1984 |
31-40 |
2 |
p. 115-130 16 p. |
artikel |
218 |
D. Quinney and R. Harding (calculus connections a multimedia adventure) (Wiley, New York, 1996) 120 pages
|
|
|
1997 |
31-40 |
2 |
p. 197- 1 p. |
artikel |
219 |
Dynamic behavior of cyclic automata networks
|
Matamala, Martín |
|
1997 |
31-40 |
2 |
p. 161-184 24 p. |
artikel |
220 |
Dynamic faults have small effect on broadcasting in hypercubes
|
Dobrev, Stefan |
|
2004 |
31-40 |
2 |
p. 155-158 4 p. |
artikel |
221 |
Dynamic monopolies in tori
|
Flocchini, Paola |
|
2004 |
31-40 |
2 |
p. 197-212 16 p. |
artikel |
222 |
Dynamic programming
|
|
|
1984 |
31-40 |
2 |
p. 213- 1 p. |
artikel |
223 |
Edge-disjoint packings of graphs
|
Corneil, Derek G. |
|
1994 |
31-40 |
2 |
p. 135-148 14 p. |
artikel |
224 |
Editorial
|
Kratochvíl, Jan |
|
2007 |
31-40 |
2 |
p. 79-80 2 p. |
artikel |
225 |
Editorial Board
|
|
|
2009 |
31-40 |
2 |
p. v-vi nvt p. |
artikel |
226 |
Editorial Board
|
|
|
2010 |
31-40 |
2 |
p. v-vi nvt p. |
artikel |
227 |
Editorial Board
|
|
|
2003 |
31-40 |
2 |
p. v-vii nvt p. |
artikel |
228 |
Editorial Board
|
|
|
2003 |
31-40 |
2 |
p. v-vii nvt p. |
artikel |
229 |
Editorial Board
|
|
|
2004 |
31-40 |
2 |
p. v-vii nvt p. |
artikel |
230 |
Editorial Board
|
|
|
2006 |
31-40 |
2 |
p. v-vi nvt p. |
artikel |
231 |
Editorial Board
|
|
|
2005 |
31-40 |
2 |
p. v-vi nvt p. |
artikel |
232 |
Editorial Board
|
|
|
2005 |
31-40 |
2 |
p. v-vi nvt p. |
artikel |
233 |
Editorial Board
|
|
|
2005 |
31-40 |
2 |
p. v-vii nvt p. |
artikel |
234 |
Editorial Board
|
|
|
2007 |
31-40 |
2 |
p. v-vi nvt p. |
artikel |
235 |
Edwin K.P. Chong and Stanislaw H. Zak, an introduction to optimization (Wiley, Chichester, 1996) 409 pages
|
|
|
1997 |
31-40 |
2 |
p. 196-197 2 p. |
artikel |
236 |
Efficient algorithms for finding critical subgraphs
|
Desrosiers, C. |
|
2008 |
31-40 |
2 |
p. 244-266 23 p. |
artikel |
237 |
Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
|
Hoàng, Chính T. |
|
1994 |
31-40 |
2 |
p. 133-143 11 p. |
artikel |
238 |
Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs
|
Marathe, M.V. |
|
1996 |
31-40 |
2 |
p. 135-149 15 p. |
artikel |
239 |
Efficient labelling algorithms for the maximum noncrossing matching problem
|
Malucelli, Federico |
|
1993 |
31-40 |
2 |
p. 175-179 5 p. |
artikel |
240 |
E.G. Golshtein and N.V. Tretyakov, modified Lagrangians & monotone maps in optimization (Wiley, Chichester, 1996) 438 pages
|
|
|
1997 |
31-40 |
2 |
p. 194- 1 p. |
artikel |
241 |
Eliminating graphs by means of parallel knock-out schemes
|
Broersma, Hajo |
|
2007 |
31-40 |
2 |
p. 92-102 11 p. |
artikel |
242 |
Embeddings of k -connected graphs of pathwidth k
|
Gupta, Arvind |
|
2005 |
31-40 |
2 |
p. 242-265 24 p. |
artikel |
243 |
Encryption using Hungarian rings
|
Hammer, Joseph |
|
1987 |
31-40 |
2 |
p. 151-155 5 p. |
artikel |
244 |
Entity authentication schemes using braid word reduction
|
Sibert, Hervé |
|
2006 |
31-40 |
2 |
p. 420-436 17 p. |
artikel |
245 |
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
|
Khachiyan, Leonid |
|
2007 |
31-40 |
2 |
p. 137-149 13 p. |
artikel |
246 |
Enumeration of acyclic walks in a graph
|
Babić, Darko |
|
1993 |
31-40 |
2 |
p. 117-123 7 p. |
artikel |
247 |
Enumeration of inequivalent irreducible Goppa codes
|
Ryan, John A. |
|
2006 |
31-40 |
2 |
p. 399-412 14 p. |
artikel |
248 |
Equivalent literal propagation in the DLL procedure
|
Li, Chu-Min |
|
2003 |
31-40 |
2 |
p. 251-276 26 p. |
artikel |
249 |
Errata to “Selecting the top three elements” by M. Aigner: A result of a computer-assisted proof search
|
Eusterbrock, Jutta |
|
1993 |
31-40 |
2 |
p. 131-137 7 p. |
artikel |
250 |
Erratum
|
|
|
1995 |
31-40 |
2 |
p. 199-200 2 p. |
artikel |
251 |
Erratum
|
|
|
1987 |
31-40 |
2 |
p. 187- 1 p. |
artikel |
252 |
Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
|
Winter, Pawel |
|
1993 |
31-40 |
2 |
p. 187-206 20 p. |
artikel |
253 |
Every matroid is a submatroid of a uniformly dense matroid
|
Lai, Hong-Jian |
|
1995 |
31-40 |
2 |
p. 151-160 10 p. |
artikel |
254 |
Exact and approximation algorithms for makespan minimization on unrelated parallel machines
|
Martello, Silvano |
|
1997 |
31-40 |
2 |
p. 169-188 20 p. |
artikel |
255 |
Exact arborescences, matchings and cycles
|
Barahona, Francisco |
|
1987 |
31-40 |
2 |
p. 91-99 9 p. |
artikel |
256 |
Exclusive and essential sets of implicates of Boolean functions
|
Boros, Endre |
|
2010 |
31-40 |
2 |
p. 81-96 16 p. |
artikel |
257 |
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
|
Alber, Jochen |
|
2005 |
31-40 |
2 |
p. 219-231 13 p. |
artikel |
258 |
Experiments in the machine interpretation of visual motion
|
|
|
1992 |
31-40 |
2 |
p. 211- 1 p. |
artikel |
259 |
2-extendability of toroidal polyhexes and Klein-bottle polyhexes
|
Ye, Dong |
|
2009 |
31-40 |
2 |
p. 292-299 8 p. |
artikel |
260 |
Extremal broadcasting problems
|
Labahn, Roger |
|
1989 |
31-40 |
2 |
p. 139-155 17 p. |
artikel |
261 |
Extremal f-trees and embedding spaces for molecular graphs
|
Kennedy, John W. |
|
1983 |
31-40 |
2 |
p. 191-209 19 p. |
artikel |
262 |
Fall colouring of bipartite graphs and cartesian products of graphs
|
Laskar, Renu |
|
2009 |
31-40 |
2 |
p. 330-338 9 p. |
artikel |
263 |
Finding nonnormal bent functions
|
Canteaut, Anne |
|
2006 |
31-40 |
2 |
p. 202-218 17 p. |
artikel |
264 |
Finding the two-core of a tree
|
Becker, Ronald I. |
|
1985 |
31-40 |
2 |
p. 103-113 11 p. |
artikel |
265 |
Fine-grained forward-secure signature schemes without random oracles
|
Camenisch, Jan |
|
2006 |
31-40 |
2 |
p. 175-188 14 p. |
artikel |
266 |
First fit decreasing scheduling on uniform multiprocessors
|
Kunde, Manfred |
|
1985 |
31-40 |
2 |
p. 165-177 13 p. |
artikel |
267 |
Fixed edge-length graph drawing is NP-hard
|
Eades, Peter |
|
1990 |
31-40 |
2 |
p. 111-134 24 p. |
artikel |
268 |
Foreword
|
Fujishige, Satoru |
|
2003 |
31-40 |
2 |
p. 253-254 2 p. |
artikel |
269 |
Foreword
|
Amir, Amihood |
|
2005 |
31-40 |
2 |
p. 123- 1 p. |
artikel |
270 |
Formal Concept Analysis for general objects
|
Prediger, Susanne |
|
2003 |
31-40 |
2 |
p. 337-355 19 p. |
artikel |
271 |
Forwarding and optical indices of a graph
|
Kosowski, Adrian |
|
2009 |
31-40 |
2 |
p. 321-329 9 p. |
artikel |
272 |
From ternary strings to Wiener indices of benzenoid chains
|
Wen-Chung, Huang |
|
1997 |
31-40 |
2 |
p. 113-131 19 p. |
artikel |
273 |
Frustration and stability in random boolean networks
|
Fogelman-Soulie, Françoise |
|
1984 |
31-40 |
2 |
p. 139-156 18 p. |
artikel |
274 |
Functional dependencies in relational databases: A lattice point of view
|
Demetrovics, János |
|
1992 |
31-40 |
2 |
p. 155-185 31 p. |
artikel |
275 |
Games, equations and dot-depth two monoids
|
Blanchet-Sadri, F. |
|
1992 |
31-40 |
2 |
p. 99-111 13 p. |
artikel |
276 |
Generalised graph colouring by a hybrid of local search and constraint programming
|
Prestwich, Steven |
|
2008 |
31-40 |
2 |
p. 148-158 11 p. |
artikel |
277 |
Generalized coloring for tree-like graphs
|
Jansen, Klaus |
|
1997 |
31-40 |
2 |
p. 135-155 21 p. |
artikel |
278 |
Generalized travelling salesman problem through n sets of nodes: the asymmetrical case
|
Laporte, Gilbert |
|
1987 |
31-40 |
2 |
p. 185-197 13 p. |
artikel |
279 |
General vertex disjoint paths in series-parallel graphs
|
Korach, Ephraim |
|
1993 |
31-40 |
2 |
p. 147-164 18 p. |
artikel |
280 |
Generating bent sequences
|
Adams, C.M. |
|
1992 |
31-40 |
2 |
p. 155-159 5 p. |
artikel |
281 |
Generating lower bounds for the linear arrangement problem
|
Liu, Weiguo |
|
1995 |
31-40 |
2 |
p. 137-151 15 p. |
artikel |
282 |
Geometric comparison of combinatorial polytopes
|
Lee, Jon |
|
1994 |
31-40 |
2 |
p. 163-182 20 p. |
artikel |
283 |
Global defensive k -alliances in graphs
|
Rodríguez-Velázquez, J.A. |
|
2009 |
31-40 |
2 |
p. 211-218 8 p. |
artikel |
284 |
Gossiping and broadcasting versus computing functions in networks
|
Dietzfelbinger, Martin |
|
2004 |
31-40 |
2 |
p. 127-153 27 p. |
artikel |
285 |
Gossiping with multiple sends and receives
|
Bagchi, A. |
|
1996 |
31-40 |
2 |
p. 105-116 12 p. |
artikel |
286 |
Grammatical codes of trees
|
Ehrenfeucht, A. |
|
1991 |
31-40 |
2 |
p. 103-129 27 p. |
artikel |
287 |
Graph coloring in the estimation of sparse derivative matrices: Instances and applications
|
Hossain, Shahadat |
|
2008 |
31-40 |
2 |
p. 280-288 9 p. |
artikel |
288 |
Graph minor hierarchies
|
Diestel, Reinhard |
|
2005 |
31-40 |
2 |
p. 167-182 16 p. |
artikel |
289 |
Graph structural properties of non-Yutsis graphs allowing fast recognition
|
Aldred, Robert E.L. |
|
2009 |
31-40 |
2 |
p. 377-386 10 p. |
artikel |
290 |
Graphs whose vertex independence number is unaffected by single edge addition or deletion
|
Gunther, George |
|
1993 |
31-40 |
2 |
p. 167-172 6 p. |
artikel |
291 |
Graph theory and molecular distribution
|
Durand, Dominique |
|
1981 |
31-40 |
2 |
p. 79-91 13 p. |
artikel |
292 |
Greedy linear extensions to minimize jumps
|
El-Zahar, M.H. |
|
1985 |
31-40 |
2 |
p. 143-156 14 p. |
artikel |
293 |
Gross substitution, discrete convexity, and submodularity
|
Danilov, V.I |
|
2003 |
31-40 |
2 |
p. 283-298 16 p. |
artikel |
294 |
Group testing with two defectives
|
Chang, G.J. |
|
1982 |
31-40 |
2 |
p. 97-102 6 p. |
artikel |
295 |
G. Sierksma, linear and integer programming theory and practice (Marcel Dekker, New York, 1996) 673 pages
|
|
|
1997 |
31-40 |
2 |
p. 191- 1 p. |
artikel |
296 |
Guarding rectangular art galleries
|
Czyzowicz, J. |
|
1994 |
31-40 |
2 |
p. 149-157 9 p. |
artikel |
297 |
Guest editors
|
|
|
2006 |
31-40 |
2 |
p. 174- 1 p. |
artikel |
298 |
Guest editors
|
|
|
2007 |
31-40 |
2 |
p. 81- 1 p. |
artikel |
299 |
Guest Editors List for Special Issue Graph Coloring
|
|
|
2008 |
31-40 |
2 |
p. 147- 1 p. |
artikel |
300 |
Guide for authors
|
|
|
2003 |
31-40 |
2 |
p. I-IV nvt p. |
artikel |
301 |
Guide for authors
|
|
|
2003 |
31-40 |
2 |
p. 561-564 4 p. |
artikel |
302 |
Guide for authors
|
|
|
2004 |
31-40 |
2 |
p. I-IV nvt p. |
artikel |
303 |
Guide for authors
|
|
|
2006 |
31-40 |
2 |
p. I-IV nvt p. |
artikel |
304 |
Guide for authors
|
|
|
2005 |
31-40 |
2 |
p. I-IV nvt p. |
artikel |
305 |
Guide for authors
|
|
|
2005 |
31-40 |
2 |
p. I-IV nvt p. |
artikel |
306 |
Guide for authors
|
|
|
2005 |
31-40 |
2 |
p. I-IV nvt p. |
artikel |
307 |
Hamiltonian circuits determining the order of chromosomes
|
Dorninger, Dietmar |
|
1994 |
31-40 |
2 |
p. 159-168 10 p. |
artikel |
308 |
Hamiltonian cycle is polynomial on cocomparability graphs
|
Deogun, Jitender S. |
|
1992 |
31-40 |
2 |
p. 165-172 8 p. |
artikel |
309 |
Hamilton paths in Z-transformation graphs of perfect matchings of hexagonal systems
|
Chen, Rong-si |
|
1997 |
31-40 |
2 |
p. 191-196 6 p. |
artikel |
310 |
Hierarchical approach to the process planning problem
|
Kusiak, Andrew |
|
1987 |
31-40 |
2 |
p. 175-184 10 p. |
artikel |
311 |
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs
|
Bang-Jensen, JØrgen |
|
2003 |
31-40 |
2 |
p. 555-559 5 p. |
artikel |
312 |
Highly connected random geometric graphs
|
Balister, Paul |
|
2009 |
31-40 |
2 |
p. 309-320 12 p. |
artikel |
313 |
Homomorphisms of conjunctive normal forms
|
Szeider, Stefan |
|
2003 |
31-40 |
2 |
p. 351-365 15 p. |
artikel |
314 |
How to cut a cake fairly using a minimal number of cuts
|
Webb, William A. |
|
1997 |
31-40 |
2 |
p. 183-190 8 p. |
artikel |
315 |
How to fake an RSA signature by encoding modular root finding as a SAT problem
|
Fiorini, Claudia |
|
2003 |
31-40 |
2 |
p. 101-127 27 p. |
artikel |
316 |
How to write parallel programs: A first course
|
|
|
1992 |
31-40 |
2 |
p. 209- 1 p. |
artikel |
317 |
Idle regulation in non-clairvoyant scheduling of parallel jobs
|
Tchernykh, Andrei |
|
2009 |
31-40 |
2 |
p. 364-376 13 p. |
artikel |
318 |
IFC (non-1st issue/vol
|
|
|
2003 |
31-40 |
2 |
p. IFC- 1 p. |
artikel |
319 |
Improving graph partitions using submodular functions
|
Patkar, Sachin B. |
|
2003 |
31-40 |
2 |
p. 535-553 19 p. |
artikel |
320 |
Inclusion Relationships Among Permutation Problems
|
Bovet, Daniel P |
|
1987 |
31-40 |
2 |
p. 113-123 11 p. |
artikel |
321 |
Indexing functions and time lower bounds for sorting on a mesh-connected computer
|
Han, Yijie |
|
1992 |
31-40 |
2 |
p. 141-152 12 p. |
artikel |
322 |
Insertion techniques for the heuristic solution of the job shop problem
|
Werner, Frank |
|
1995 |
31-40 |
2 |
p. 191-211 21 p. |
artikel |
323 |
Interactive L systems with a fast local growth
|
Raz, Yoav |
|
1988 |
31-40 |
2 |
p. 163-179 17 p. |
artikel |
324 |
International colloquium on matroid theory
|
|
|
1982 |
31-40 |
2 |
p. 159- 1 p. |
artikel |
325 |
International institute on stochastics and optimizaton
|
|
|
1982 |
31-40 |
2 |
p. 157-158 2 p. |
artikel |
326 |
International Workshop on Network Flow Optimization Theory and Practice
|
|
|
1983 |
31-40 |
2 |
p. 249-250 2 p. |
artikel |
327 |
Intersection graphs of concatenable subtrees of graphs
|
Gavril, F. |
|
1994 |
31-40 |
2 |
p. 195-209 15 p. |
artikel |
328 |
Intersection of algebraic space curves
|
Abhyankar, Shreeram S. |
|
1991 |
31-40 |
2 |
p. 81-96 16 p. |
artikel |
329 |
Introduction to linear programming: applications and extensions
|
|
|
1992 |
31-40 |
2 |
p. 195-196 2 p. |
artikel |
330 |
Is a unit-time job shop not easier than identical parallel machines?
|
Timkovsky, Vadim G. |
|
1998 |
31-40 |
2 |
p. 149-162 14 p. |
artikel |
331 |
Isometric embedding in products of complete graphs
|
Winkler, Peter M. |
|
1984 |
31-40 |
2 |
p. 221-225 5 p. |
artikel |
332 |
Jack Graver, Brigette Servatius and Herman Servatius, combinatorial rigidity (American mathematical society, Providence, RI, 1993) 172 pages
|
|
|
1997 |
31-40 |
2 |
p. 191-192 2 p. |
artikel |
333 |
Job shop scheduling with unit time operations under resource constraints and release dates
|
Szwarcfiter, Jayme Luiz |
|
1987 |
31-40 |
2 |
p. 227-233 7 p. |
artikel |
334 |
k-edge subgraph problems
|
Goldschmidt, Olivier |
|
1997 |
31-40 |
2 |
p. 159-169 11 p. |
artikel |
335 |
Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: properties and algorithms
|
Campello, Ruy Eduardo |
|
1987 |
31-40 |
2 |
p. 119-136 18 p. |
artikel |
336 |
Large Cayley graphs on an abelian group
|
Garcia, C. |
|
1997 |
31-40 |
2 |
p. 125-133 9 p. |
artikel |
337 |
Large (d, D, D′, s)-bipartite digraphs
|
Gómez, J. |
|
1995 |
31-40 |
2 |
p. 103-114 12 p. |
artikel |
338 |
Large planar graphs with given diameter and maximum degree
|
Fellows, M. |
|
1995 |
31-40 |
2 |
p. 133-153 21 p. |
artikel |
339 |
Large survivable nets and the generalized prisms
|
Lai, Hong-Jian |
|
1995 |
31-40 |
2 |
p. 181-185 5 p. |
artikel |
340 |
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets
|
Kullmann, Oliver |
|
2003 |
31-40 |
2 |
p. 209-249 41 p. |
artikel |
341 |
Legendre sums and codes related to QR codes
|
Helleseth, Tor |
|
1992 |
31-40 |
2 |
p. 107-113 7 p. |
artikel |
342 |
Letter to the editor
|
Ning, Qi |
|
1988 |
31-40 |
2 |
p. 173- 1 p. |
artikel |
343 |
Linear binary codes with intersection properties
|
Miklós, D. |
|
1984 |
31-40 |
2 |
p. 187-196 10 p. |
artikel |
344 |
Linear-time modular decomposition of directed graphs
|
McConnell, Ross M. |
|
2005 |
31-40 |
2 |
p. 198-209 12 p. |
artikel |
345 |
Linear time optimization algorithms for P 4-sparse graphs
|
Jamison, Beverly |
|
1995 |
31-40 |
2 |
p. 155-175 21 p. |
artikel |
346 |
List signature schemes
|
Canard, Sébastien |
|
2006 |
31-40 |
2 |
p. 189-201 13 p. |
artikel |
347 |
L ( 2 , 1 ) -labeling of direct product of paths and cycles
|
Jha, Pranava K. |
|
2005 |
31-40 |
2 |
p. 317-325 9 p. |
artikel |
348 |
Local optimization on graphs
|
Llewellyn, Donna Crystal |
|
1989 |
31-40 |
2 |
p. 157-178 22 p. |
artikel |
349 |
Locking based on a pairwise decomposition of the transaction system
|
Lausen, Georg |
|
1992 |
31-40 |
2 |
p. 217-236 20 p. |
artikel |
350 |
Logic and computer science
|
|
|
1992 |
31-40 |
2 |
p. 211-212 2 p. |
artikel |
351 |
Logic-based knowledge representation
|
|
|
1990 |
31-40 |
2 |
p. 188-189 2 p. |
artikel |
352 |
Long cycles and long paths in the Kronecker product of a cycle and a tree
|
Jha, Pranava K. |
|
1997 |
31-40 |
2 |
p. 101-121 21 p. |
artikel |
353 |
Lower bounds for hypergraph Ramsey numbers
|
Abbott, H.L. |
|
1995 |
31-40 |
2 |
p. 177-180 4 p. |
artikel |
354 |
Lower bounds for the job-shop scheduling problem on multi-purpose machines
|
Jurisch, Bernd |
|
1995 |
31-40 |
2 |
p. 145-156 12 p. |
artikel |
355 |
Luc Devroye, Laszlo Gyorfi and Gabor Lugosi, a probabilistic theory of pattern recognition (Springer, New York, 1996) 636 pages
|
|
|
1997 |
31-40 |
2 |
p. 192-194 3 p. |
artikel |
356 |
Machine learning: paradigms and methods
|
|
|
1992 |
31-40 |
2 |
p. 195- 1 p. |
artikel |
357 |
Mathematical crystal growth II
|
Klarner, D.A. |
|
1981 |
31-40 |
2 |
p. 113-117 5 p. |
artikel |
358 |
Mathematical programming with data perturbations i
|
|
|
1984 |
31-40 |
2 |
p. 213- 1 p. |
artikel |
359 |
Mathematical tools in production management
|
|
|
1992 |
31-40 |
2 |
p. 194-195 2 p. |
artikel |
360 |
Matroid optimization with generalized constraints
|
Srinivas, Mandayam A. |
|
1995 |
31-40 |
2 |
p. 161-174 14 p. |
artikel |
361 |
Maximal and stochastic Galois lattices
|
Diday, Edwin |
|
2003 |
31-40 |
2 |
p. 271-284 14 p. |
artikel |
362 |
Maximum number of disjoint paths connecting specified terminals in a graph
|
Yinnone, Hananya |
|
1994 |
31-40 |
2 |
p. 183-195 13 p. |
artikel |
363 |
Measure theoretic approach to the classification of cellular automata
|
Ishii, Shin'ichirou |
|
1992 |
31-40 |
2 |
p. 125-136 12 p. |
artikel |
364 |
Medians and majorities in semimodular posets
|
Powers, R.C. |
|
2003 |
31-40 |
2 |
p. 325-336 12 p. |
artikel |
365 |
Medians in median graphs
|
Bandelt, H.J. |
|
1984 |
31-40 |
2 |
p. 131-142 12 p. |
artikel |
366 |
Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope
|
Granot, Daniel |
|
1984 |
31-40 |
2 |
p. 171-185 15 p. |
artikel |
367 |
Minimizing bumps for posets of width two
|
Zaguia, Nejib |
|
1988 |
31-40 |
2 |
p. 157-162 6 p. |
artikel |
368 |
Minimizing restricted-fanout queries
|
Sagiv, Yehoshua |
|
1992 |
31-40 |
2 |
p. 245-264 20 p. |
artikel |
369 |
Minimum cost flow algorithms for series-parallel networks
|
Bein, Wolfgang W. |
|
1985 |
31-40 |
2 |
p. 117-124 8 p. |
artikel |
370 |
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
|
Fernandes, Cristina G. |
|
2009 |
31-40 |
2 |
p. 272-279 8 p. |
artikel |
371 |
Minimum matrix representation of closure operations
|
Demetrovics, J. |
|
1985 |
31-40 |
2 |
p. 115-128 14 p. |
artikel |
372 |
Minimum perfect bipartite matchings and spanning trees under categorization
|
Richey, Michael B. |
|
1992 |
31-40 |
2 |
p. 147-153 7 p. |
artikel |
373 |
Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover
|
Chlebík, Miroslav |
|
2007 |
31-40 |
2 |
p. 172-179 8 p. |
artikel |
374 |
Modelling piecewise linear concave costs in a tree partitioning problem
|
Aghezzaf, El Houssaine |
|
1994 |
31-40 |
2 |
p. 101-109 9 p. |
artikel |
375 |
Monotonicity paradoxes in the theory of elections
|
Fishburn, Peter C. |
|
1982 |
31-40 |
2 |
p. 119-134 16 p. |
artikel |
376 |
More facets from fences for linear ordering and acyclic subgraph polytopes
|
Leung, Janny |
|
1994 |
31-40 |
2 |
p. 185-200 16 p. |
artikel |
377 |
Multi-source spanning trees: algorithms for minimizing source eccentricities
|
McMahan, H.Brendan |
|
2004 |
31-40 |
2 |
p. 213-222 10 p. |
artikel |
378 |
Natural computation
|
|
|
1990 |
31-40 |
2 |
p. 187-188 2 p. |
artikel |
379 |
Negative circuits for flows and submodular flows
|
Zimmermann, Uwe |
|
1992 |
31-40 |
2 |
p. 179-189 11 p. |
artikel |
380 |
Neural network design and the complexity of learning
|
|
|
1992 |
31-40 |
2 |
p. 196- 1 p. |
artikel |
381 |
New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities
|
Murota, Kazuo |
|
2003 |
31-40 |
2 |
p. 495-512 18 p. |
artikel |
382 |
New clique and independent set algorithms for circle graphs
|
Apostolico, Alberto |
|
1993 |
31-40 |
2 |
p. 179-180 2 p. |
artikel |
383 |
New results on the completion time variance minimization
|
Kubiak, Wieslaw |
|
1995 |
31-40 |
2 |
p. 157-168 12 p. |
artikel |
384 |
Nice M. Temme, special functions: An introduction to the classical functions of mathematical physics (Wiley, Chichester 1996) 374 pages
|
|
|
1997 |
31-40 |
2 |
p. 195- 1 p. |
artikel |
385 |
Nominations for the George B. Dantzig prize
|
|
|
1987 |
31-40 |
2 |
p. 190- 1 p. |
artikel |
386 |
Note on a pursuit game played on graphs
|
Andreae, Thomas |
|
1984 |
31-40 |
2 |
p. 111-115 5 p. |
artikel |
387 |
Note on non-separating and removable cycles in highly connected graphs
|
Fujita, Shinya |
|
2009 |
31-40 |
2 |
p. 398-399 2 p. |
artikel |
388 |
Notes on de Bruijn sequences
|
Xie, Shenquan |
|
1987 |
31-40 |
2 |
p. 157-177 21 p. |
artikel |
389 |
NP-completeness of minimum spanner problems
|
Cai, Leizhen |
|
1994 |
31-40 |
2 |
p. 187-194 8 p. |
artikel |
390 |
NP-completeness of some problems of partitioning and covering in graphs
|
Péroche, B. |
|
1984 |
31-40 |
2 |
p. 195-208 14 p. |
artikel |
391 |
Observations on a class of nasty linear complementarity problems
|
Cottle, Richard W. |
|
1980 |
31-40 |
2 |
p. 89-111 23 p. |
artikel |
392 |
On a class of functions attaining their maximum at the vertices of a polyhedron
|
Tardella, Fabio |
|
1988 |
31-40 |
2 |
p. 191-195 5 p. |
artikel |
393 |
On a new code, [ 2 n − 1 , n , 2 n − 1 ]
|
Basu, M. |
|
2009 |
31-40 |
2 |
p. 402-405 4 p. |
artikel |
394 |
On an optimization problem occurring in FMSs: a hypergraph-theoretical formulation
|
de Werra, D. |
|
1994 |
31-40 |
2 |
p. 107-111 5 p. |
artikel |
395 |
On a partition into convex polygons
|
Urabe, Masatsugu |
|
1996 |
31-40 |
2 |
p. 179-191 13 p. |
artikel |
396 |
On bandwidth for the tensor product of paths and cycles
|
Yung-Ling, Lai |
|
1997 |
31-40 |
2 |
p. 133-141 9 p. |
artikel |
397 |
On cocolourings and cochromatic numbers of graphs
|
Gimbel, John |
|
1994 |
31-40 |
2 |
p. 111-127 17 p. |
artikel |
398 |
On common edges in optimal solutions to traveling salesman and other optimization problems
|
Chrobak, M. |
|
1988 |
31-40 |
2 |
p. 101-111 11 p. |
artikel |
399 |
On complexity of minimizing weighted number of late jobs in unit time open shops
|
Gladky, A.A. |
|
1997 |
31-40 |
2 |
p. 197-201 5 p. |
artikel |
400 |
On decomposing a hypergraph into k connected sub-hypergraphs
|
Frank, András |
|
2003 |
31-40 |
2 |
p. 373-383 11 p. |
artikel |
401 |
On edge-colored interior planar graphs on a circle and the expected number of RNA secondary structures
|
Orlitsky, Alon |
|
1996 |
31-40 |
2 |
p. 151-178 28 p. |
artikel |
402 |
On edge numberings of the n-cube graph
|
Bezrukov, Sergei |
|
1993 |
31-40 |
2 |
p. 99-116 18 p. |
artikel |
403 |
One-pass batching algorithms for the one-machine problem
|
Naddef, Denis |
|
1988 |
31-40 |
2 |
p. 133-145 13 p. |
artikel |
404 |
On equivalent sets of functions
|
Henno, Jaak |
|
1982 |
31-40 |
2 |
p. 153-156 4 p. |
artikel |
405 |
On erasing in EOL forms
|
Rozenberg, G. |
|
1985 |
31-40 |
2 |
p. 175-189 15 p. |
artikel |
406 |
One-story buildings as tensegrity frameworks III
|
Recski, András |
|
1992 |
31-40 |
2 |
p. 137-146 10 p. |
artikel |
407 |
On extendibility of unavoidable sets
|
Choffrut, Christian |
|
1984 |
31-40 |
2 |
p. 125-137 13 p. |
artikel |
408 |
On extremal unicyclic molecular graphs with maximal Hosoya index
|
Ou, Jianping |
|
2009 |
31-40 |
2 |
p. 391-397 7 p. |
artikel |
409 |
On finding most uniform spanning trees
|
Galil, Zvi |
|
1988 |
31-40 |
2 |
p. 173-175 3 p. |
artikel |
410 |
On forwarding indices of networks
|
Heydemann, M.C. |
|
1989 |
31-40 |
2 |
p. 103-123 21 p. |
artikel |
411 |
On generalized zeta functions of formal languages and series
|
Honkala, Juha |
|
1991 |
31-40 |
2 |
p. 141-153 13 p. |
artikel |
412 |
On good algorithms for determining unsatisfiability of propositional formulas
|
Franco, John |
|
2003 |
31-40 |
2 |
p. 129-138 10 p. |
artikel |
413 |
Online algorithms for a dual version of bin packing
|
Csirik, J. |
|
1988 |
31-40 |
2 |
p. 163-167 5 p. |
artikel |
414 |
On-line construction of compact directed acyclic word graphs
|
Inenaga, Shunsuke |
|
2005 |
31-40 |
2 |
p. 156-179 24 p. |
artikel |
415 |
Online variable-sized bin packing
|
Kinnerseley, Nancy G. |
|
1988 |
31-40 |
2 |
p. 143-148 6 p. |
artikel |
416 |
On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks
|
Jordán, Tibor |
|
2003 |
31-40 |
2 |
p. 421-432 12 p. |
artikel |
417 |
On monotone functions of tree structures
|
Prodinger, Helmut |
|
1983 |
31-40 |
2 |
p. 223-239 17 p. |
artikel |
418 |
On optimal strategies for a betting game
|
Yang, Zhuocheng |
|
1990 |
31-40 |
2 |
p. 157-169 13 p. |
artikel |
419 |
On paths with the shortest average arc length in weighted graphs
|
Wimer, Shmuel |
|
1993 |
31-40 |
2 |
p. 169-179 11 p. |
artikel |
420 |
On polynomial solvability of the high multiplicity total weighted tardiness problem
|
Granot, Frieda |
|
1993 |
31-40 |
2 |
p. 139-146 8 p. |
artikel |
421 |
On positive and negative atoms of Cayley digraphs
|
Zemor, Gilles |
|
1989 |
31-40 |
2 |
p. 193-195 3 p. |
artikel |
422 |
On powers and centers of chordal graphs
|
Laskar, Renu |
|
1983 |
31-40 |
2 |
p. 139-147 9 p. |
artikel |
423 |
On powers of m-trapezoid graphs
|
Flotow, Carsten |
|
1995 |
31-40 |
2 |
p. 187-192 6 p. |
artikel |
424 |
On qualitatively independent partitions and related problems
|
Poljak, Svatopluk |
|
1983 |
31-40 |
2 |
p. 193-205 13 p. |
artikel |
425 |
On signed digraphs with all cycles negative
|
Harary, Frank |
|
1985 |
31-40 |
2 |
p. 155-164 10 p. |
artikel |
426 |
On some conditioning results in the probabilistic analysis of algorithms
|
McDiarmid, Colin |
|
1985 |
31-40 |
2 |
p. 197-201 5 p. |
artikel |
427 |
On some optimization problems on k-trees and partial k-trees
|
Granot, Daniel |
|
1994 |
31-40 |
2 |
p. 129-145 17 p. |
artikel |
428 |
On strong unimodality of multivariate discrete distributions
|
Subasi, Ersoy |
|
2009 |
31-40 |
2 |
p. 234-246 13 p. |
artikel |
429 |
On subword complexity functions
|
Sajo, Anni |
|
1984 |
31-40 |
2 |
p. 209-212 4 p. |
artikel |
430 |
On the average shape of monotonically labelled tree structures
|
Kirschenhofer, Peter |
|
1984 |
31-40 |
2 |
p. 161-181 21 p. |
artikel |
431 |
On the bicycle problem
|
Chvátal, V. |
|
1983 |
31-40 |
2 |
p. 165-173 9 p. |
artikel |
432 |
On the chromatic number, colorings, and codes of the Johnson graph
|
Etzion, Tuvi |
|
1996 |
31-40 |
2 |
p. 163-175 13 p. |
artikel |
433 |
On the combinatorial structure of a class of [ m 2 , m − 1 2 , 3 ] shortened Hamming codes and their dual-codes
|
Esmaeili, M. |
|
2009 |
31-40 |
2 |
p. 356-363 8 p. |
artikel |
434 |
On the complexity of a special basis problem in LP
|
Murty, Katta G. |
|
1993 |
31-40 |
2 |
p. 181-185 5 p. |
artikel |
435 |
On the complexity of finding the convex hull of a set of points
|
Avis, Davis |
|
1982 |
31-40 |
2 |
p. 81-86 6 p. |
artikel |
436 |
On the complexity of inferring functional dependencies
|
Mannila, Heikki |
|
1992 |
31-40 |
2 |
p. 237-243 7 p. |
artikel |
437 |
On the complexity of partitioning graphs into connected subgraphs
|
Dyer, M.E. |
|
1985 |
31-40 |
2 |
p. 139-153 15 p. |
artikel |
438 |
On the complexity of some edge-partition problems for graphs
|
Lonc, Zbigniew |
|
1996 |
31-40 |
2 |
p. 177-183 7 p. |
artikel |
439 |
On the complexity of suboptimal decoding for list and decision feedback schemes
|
Freudenberger, J. |
|
2006 |
31-40 |
2 |
p. 294-304 11 p. |
artikel |
440 |
On the continuous working problem
|
Chang, R.S. |
|
1990 |
31-40 |
2 |
p. 93-109 17 p. |
artikel |
441 |
On the covering radius of cyclic linear codes and arithmetic codes
|
Helleseth, Tor |
|
1985 |
31-40 |
2 |
p. 157-173 17 p. |
artikel |
442 |
On the depth of combinatorial optimization problems
|
Kern, W. |
|
1993 |
31-40 |
2 |
p. 115-129 15 p. |
artikel |
443 |
On the deterministic complexity of searching local maxima
|
Althöfer, Ingo |
|
1993 |
31-40 |
2 |
p. 111-113 3 p. |
artikel |
444 |
On the equivalence of constrained and unconstrained flows
|
Gautier, Antoine |
|
1994 |
31-40 |
2 |
p. 113-132 20 p. |
artikel |
445 |
On the Euclidean two paths problem
|
Kellerer, Hans |
|
1993 |
31-40 |
2 |
p. 165-173 9 p. |
artikel |
446 |
On the global offensive alliance number of a graph
|
Sigarreta, J.M. |
|
2009 |
31-40 |
2 |
p. 219-226 8 p. |
artikel |
447 |
On the index of maximum density for irreducible Boolean matrices
|
Yu, Shao Jia |
|
1988 |
31-40 |
2 |
p. 147-156 10 p. |
artikel |
448 |
On the limit of branching rules for hard random unsatisfiable 3-SAT
|
Li, Chu-Min |
|
2003 |
31-40 |
2 |
p. 277-290 14 p. |
artikel |
449 |
On the minimal covering of infinite sets
|
Klimó, J. |
|
1993 |
31-40 |
2 |
p. 161-168 8 p. |
artikel |
450 |
On the monotonicity of games generated by symmetric submodular functions
|
Fomin, Fedor V. |
|
2003 |
31-40 |
2 |
p. 323-335 13 p. |
artikel |
451 |
On the number of transversals in Cayley tables of cyclic groups
|
Cavenagh, Nicholas J. |
|
2010 |
31-40 |
2 |
p. 136-146 11 p. |
artikel |
452 |
On the orientation of graphs and hypergraphs
|
Frank, András |
|
2003 |
31-40 |
2 |
p. 385-400 16 p. |
artikel |
453 |
On the poset of all posets on n elements
|
Brualdi, Richard A. |
|
1994 |
31-40 |
2 |
p. 111-123 13 p. |
artikel |
454 |
On the power of synchronization in parallel computations
|
Hromkovič, Juraj |
|
1991 |
31-40 |
2 |
p. 155-182 28 p. |
artikel |
455 |
On the problem of sorting burnt pancakes
|
Cohen, David S. |
|
1995 |
31-40 |
2 |
p. 105-120 16 p. |
artikel |
456 |
On the removal of forbidden graphs by edge-deletion or by edge-contraction
|
Watanabe, Toshimasa |
|
1981 |
31-40 |
2 |
p. 151-153 3 p. |
artikel |
457 |
On the security of p-party protocols
|
Pan, Luquan |
|
1988 |
31-40 |
2 |
p. 127-144 18 p. |
artikel |
458 |
On the structure of ( P 5 ,gem)-free graphs
|
Brandstädt, Andreas |
|
2005 |
31-40 |
2 |
p. 155-166 12 p. |
artikel |
459 |
On the structure of some classes of minimal unsatisfiable formulas
|
Kleine Büning, Hans |
|
2003 |
31-40 |
2 |
p. 185-207 23 p. |
artikel |
460 |
On the structure of trapezoid graphs
|
Cheah, F. |
|
1996 |
31-40 |
2 |
p. 109-133 25 p. |
artikel |
461 |
On the tree packing problem
|
Masuyama, Shigeru |
|
1992 |
31-40 |
2 |
p. 163-166 4 p. |
artikel |
462 |
On the weight and nonlinearity of homogeneous rotation symmetric Boolean functions of degree 2
|
Kim, Hyeonjin |
|
2009 |
31-40 |
2 |
p. 428-432 5 p. |
artikel |
463 |
On two intersecting set systems and k-continuous boolean functions
|
Tuza, Zsolt |
|
1987 |
31-40 |
2 |
p. 183-185 3 p. |
artikel |
464 |
Optimal constructions of reversible digraphs
|
Sysło, Maciej M. |
|
1984 |
31-40 |
2 |
p. 209-220 12 p. |
artikel |
465 |
Optimal detection of a counterfeit coin with multi-arms balances
|
De Bonis, Annalisa |
|
1995 |
31-40 |
2 |
p. 121-131 11 p. |
artikel |
466 |
Optimal linear labelings and eigenvalues of graphs
|
Juvan, Martin |
|
1992 |
31-40 |
2 |
p. 153-168 16 p. |
artikel |
467 |
Optimal mass production
|
Rosenthal, Arnon |
|
1980 |
31-40 |
2 |
p. 167-170 4 p. |
artikel |
468 |
Optimal normal bases in GF(pn)
|
Mullin, R.C. |
|
1988 |
31-40 |
2 |
p. 149-161 13 p. |
artikel |
469 |
Optimization Days 1983
|
|
|
1983 |
31-40 |
2 |
p. 250- 1 p. |
artikel |
470 |
Ordered stabbing of pairwise disjoint convex sets in linear time
|
Egyed, Peter |
|
1991 |
31-40 |
2 |
p. 133-140 8 p. |
artikel |
471 |
Order statistics and estimating cardinalities of massive data sets
|
Giroire, Frédéric |
|
2009 |
31-40 |
2 |
p. 406-427 22 p. |
artikel |
472 |
Packing directed cycles efficiently
|
Nutov, Zeev |
|
2007 |
31-40 |
2 |
p. 82-91 10 p. |
artikel |
473 |
Parallel Lempel Ziv coding
|
Klein, Shmuel Tomi |
|
2005 |
31-40 |
2 |
p. 180-191 12 p. |
artikel |
474 |
Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
|
Kahlbacher, H.G. |
|
1993 |
31-40 |
2 |
p. 139-164 26 p. |
artikel |
475 |
Parametric optimization: Singularities, pathfollowing and jumps
|
|
|
1992 |
31-40 |
2 |
p. 210- 1 p. |
artikel |
476 |
Parametrization of knowledge structures
|
Doignon, Jean-Paul |
|
1988 |
31-40 |
2 |
p. 87-100 14 p. |
artikel |
477 |
Paroid search: generic local combinatorial optimization
|
Rardin, Ronald L. |
|
1993 |
31-40 |
2 |
p. 155-174 20 p. |
artikel |
478 |
Parsimonious set representations of orders, a generalization of the interval order concept, and knowledge spaces
|
Suck, Reinhard |
|
2003 |
31-40 |
2 |
p. 373-386 14 p. |
artikel |
479 |
Partial dependencies in relational databases and their realization
|
Demetrovics, J. |
|
1992 |
31-40 |
2 |
p. 127-138 12 p. |
artikel |
480 |
Peakless functions on graphs
|
Chepoi, Victor |
|
1997 |
31-40 |
2 |
p. 175-189 15 p. |
artikel |
481 |
Penalty formulation for zero-one nonlinear programming
|
Kalantari, B |
|
1987 |
31-40 |
2 |
p. 179-182 4 p. |
artikel |
482 |
Perfect error-correcting databases
|
Füredi, Zoltán |
|
1990 |
31-40 |
2 |
p. 171-176 6 p. |
artikel |
483 |
Periodic gossiping in back-to-back trees
|
Labahn, Roger |
|
1997 |
31-40 |
2 |
p. 157-168 12 p. |
artikel |
484 |
Periodic schedules for linear precedence constraints
|
Hanen, Claire |
|
2009 |
31-40 |
2 |
p. 280-291 12 p. |
artikel |
485 |
Personal mathematics and computing: Tools for the liberal arts
|
|
|
1992 |
31-40 |
2 |
p. 209-210 2 p. |
artikel |
486 |
Perspectives of Monge properties in optimization
|
Burkard, Rainer E. |
|
1996 |
31-40 |
2 |
p. 95-161 67 p. |
artikel |
487 |
Peter Whittle, optimal control basics and beyond (Wiley, Chichester, 1996) 464 pages
|
|
|
1997 |
31-40 |
2 |
p. 195-196 2 p. |
artikel |
488 |
Pick-and-choose heuristics for partial set covering
|
Fishburn, P.C. |
|
1988 |
31-40 |
2 |
p. 119-132 14 p. |
artikel |
489 |
Points by degree and orbit size in chemical trees, II
|
Bailey, C.K. |
|
1983 |
31-40 |
2 |
p. 157-164 8 p. |
artikel |
490 |
Polyhedral proof methods in combinatorial optimization
|
Schrijver, A. |
|
1986 |
31-40 |
2 |
p. 111-133 23 p. |
artikel |
491 |
Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability
|
Kashiwabara, Kenji |
|
2003 |
31-40 |
2 |
p. 433-448 16 p. |
artikel |
492 |
Polynomial interpolation of cryptographic functions related to Diffie–Hellman and discrete logarithm problem
|
Kiltz, Eike |
|
2006 |
31-40 |
2 |
p. 326-336 11 p. |
artikel |
493 |
Polynomial testing of the query “IS ab ≥ cd?” with application to finding a minimal cost reliability ratio spanning tree
|
Chandrasekaran, R. |
|
1984 |
31-40 |
2 |
p. 117-123 7 p. |
artikel |
494 |
Polynomial time approximation schemes and parameterized complexity
|
Chen, Jianer |
|
2007 |
31-40 |
2 |
p. 180-193 14 p. |
artikel |
495 |
Power languages and density
|
Niemi, Valtteri |
|
1991 |
31-40 |
2 |
p. 183-193 11 p. |
artikel |
496 |
Preface
|
F. Janowitz, M. |
|
2003 |
31-40 |
2 |
p. 179-180 2 p. |
artikel |
497 |
Preface
|
van Maaren, Hans |
|
2003 |
31-40 |
2 |
p. 83-84 2 p. |
artikel |
498 |
Preface
|
Llewellyn, Donna Crystal |
|
1993 |
31-40 |
2 |
p. 109- 1 p. |
artikel |
499 |
Preface
|
Salomaa, Arto |
|
1991 |
31-40 |
2 |
p. 83- 1 p. |
artikel |
500 |
Preface
|
Demetrovics, J. |
|
1992 |
31-40 |
2 |
p. 105- 1 p. |
artikel |
501 |
Preface
|
Akgül, Mustafa |
|
1993 |
31-40 |
2 |
p. 85- 1 p. |
artikel |
502 |
Preface
|
Avis, David |
|
1991 |
31-40 |
2 |
p. 79- 1 p. |
artikel |
503 |
Preface
|
Gallo, G. |
|
1986 |
31-40 |
2 |
p. 109-110 2 p. |
artikel |
504 |
Preface
|
Campello, Ruy Eduardo |
|
1987 |
31-40 |
2 |
p. 105- 1 p. |
artikel |
505 |
Preface
|
Rinnooy Kan, A.H.G. |
|
1985 |
31-40 |
2 |
p. 115- 1 p. |
artikel |
506 |
Preface
|
Labahn, Roger |
|
2004 |
31-40 |
2 |
p. 125-126 2 p. |
artikel |
507 |
Primal-dual algrorithms for the assignment problem
|
Carpaneto, Giorgio |
|
1987 |
31-40 |
2 |
p. 137-153 17 p. |
artikel |
508 |
Probabilities of dominant candidates based on first-place votes
|
Fishburn, Peter C. |
|
1984 |
31-40 |
2 |
p. 131-140 10 p. |
artikel |
509 |
Probability of diameter two for Steinhaus graphs
|
Brand, Neal |
|
1993 |
31-40 |
2 |
p. 165-171 7 p. |
artikel |
510 |
Problems, problems, problems
|
Moser, William O.J. |
|
1991 |
31-40 |
2 |
p. 201-225 25 p. |
artikel |
511 |
Properties and constraints of cheating-immune secret sharing schemes
|
D’Arco, Paolo |
|
2006 |
31-40 |
2 |
p. 219-233 15 p. |
artikel |
512 |
Properties of total domination edge-critical graphs
|
Henning, Michael A. |
|
2010 |
31-40 |
2 |
p. 147-153 7 p. |
artikel |
513 |
Protein folding in the HP model on grid lattices with diagonals
|
Böckenhauer, Hans-Joachim |
|
2007 |
31-40 |
2 |
p. 230-256 27 p. |
artikel |
514 |
Provably secure non-interactive key distribution based on pairings
|
Dupont, Régis |
|
2006 |
31-40 |
2 |
p. 270-276 7 p. |
artikel |
515 |
PX: A computational logic
|
|
|
1990 |
31-40 |
2 |
p. 189-190 2 p. |
artikel |
516 |
Quasi M-convex and L-convex functions—quasiconvexity in discrete optimization
|
Murota, Kazuo |
|
2003 |
31-40 |
2 |
p. 467-494 28 p. |
artikel |
517 |
Quasi-median hulls in Hamming space are Steiner hulls
|
Bandelt, Hans-Jürgen |
|
2009 |
31-40 |
2 |
p. 227-233 7 p. |
artikel |
518 |
Randomized algorithms in combinatorial optimization: A survey
|
Maffioli, Francesco |
|
1986 |
31-40 |
2 |
p. 157-170 14 p. |
artikel |
519 |
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
|
Caragiannis, Ioannis |
|
2007 |
31-40 |
2 |
p. 119-136 18 p. |
artikel |
520 |
Random knapsacks with many constraints
|
Schilling, Kenneth |
|
1994 |
31-40 |
2 |
p. 163-174 12 p. |
artikel |
521 |
Rational and affine expressions for image description
|
Culik II, Karel |
|
1993 |
31-40 |
2 |
p. 85-120 36 p. |
artikel |
522 |
3rd Caribbean conference on combinatorics and computing
|
|
|
1980 |
31-40 |
2 |
p. 172- 1 p. |
artikel |
523 |
Recursive error correction for general Reed–Muller codes
|
Dumer, Ilya |
|
2006 |
31-40 |
2 |
p. 253-269 17 p. |
artikel |
524 |
Regular coronoid systems
|
Chen, Rong-si |
|
1997 |
31-40 |
2 |
p. 147-158 12 p. |
artikel |
525 |
Reliability evaluation of engineering systems: concepts and techniques
|
|
|
1984 |
31-40 |
2 |
p. 213-214 2 p. |
artikel |
526 |
Remarks on strategies in combinatorial games
|
Pultr, A. |
|
1985 |
31-40 |
2 |
p. 165-173 9 p. |
artikel |
527 |
Repeated-root cyclic and negacyclic codes over a finite chain ring
|
Sălăgean, Ana |
|
2006 |
31-40 |
2 |
p. 413-419 7 p. |
artikel |
528 |
Representability of functions
|
Jeroslow, R.G. |
|
1989 |
31-40 |
2 |
p. 125-137 13 p. |
artikel |
529 |
Representation of graphs by OBDDs
|
Nunkesser, Robin |
|
2009 |
31-40 |
2 |
p. 247-261 15 p. |
artikel |
530 |
Representing and reasoning with probabilistic knowledge: A logical approach to probabilities
|
|
|
1992 |
31-40 |
2 |
p. 210- 1 p. |
artikel |
531 |
Resolution and binary decision diagrams cannot simulate each other polynomially
|
Groote, J.F. |
|
2003 |
31-40 |
2 |
p. 157-171 15 p. |
artikel |
532 |
Resource allocation under limited sharing
|
Langston, Michael A. |
|
1990 |
31-40 |
2 |
p. 135-147 13 p. |
artikel |
533 |
Restricted t-matchings in bipartite graphs
|
Frank, András |
|
2003 |
31-40 |
2 |
p. 337-346 10 p. |
artikel |
534 |
Richard Isaac, the pleasures of probability (Springer, New York, 1995) 241 pages
|
|
|
1997 |
31-40 |
2 |
p. 192- 1 p. |
artikel |
535 |
Routings for involutions of a hypercube
|
Sprague, Alan P. |
|
1994 |
31-40 |
2 |
p. 175-186 12 p. |
artikel |
536 |
SAT problems with chains of dependent variables
|
Prestwich, Steven |
|
2003 |
31-40 |
2 |
p. 329-350 22 p. |
artikel |
537 |
Scheduling dyadic intervals
|
Driscoll, James R. |
|
1995 |
31-40 |
2 |
p. 101-116 16 p. |
artikel |
538 |
Scheduling two irregular polygons
|
Brucker, Peter |
|
1988 |
31-40 |
2 |
p. 91-100 10 p. |
artikel |
539 |
School on combinatorial optimization
|
|
|
1985 |
31-40 |
2 |
p. 207-208 2 p. |
artikel |
540 |
Search problems for two irregular coins with incomplete feedback: the underweight model
|
Gargano, L. |
|
1992 |
31-40 |
2 |
p. 191-197 7 p. |
artikel |
541 |
Second Siam Symposium on the Applications of Discrete Mathematics
|
|
|
1983 |
31-40 |
2 |
p. 251-252 2 p. |
artikel |
542 |
Secure multi-party computation made simple
|
Maurer, Ueli |
|
2006 |
31-40 |
2 |
p. 370-381 12 p. |
artikel |
543 |
Segmental solutions of Boolean equations
|
Brown, Frank Markham |
|
1982 |
31-40 |
2 |
p. 87-96 10 p. |
artikel |
544 |
Selective inheritance of attribute values in relational databases
|
Gottlob, G. |
|
1992 |
31-40 |
2 |
p. 187-216 30 p. |
artikel |
545 |
Self-reading sequences
|
Istrate, Gabriel |
|
1994 |
31-40 |
2 |
p. 201-203 3 p. |
artikel |
546 |
Sensitivity analysis of list scheduling heuristics
|
Kolen, A.W.J. |
|
1994 |
31-40 |
2 |
p. 145-162 18 p. |
artikel |
547 |
Sequencing with general precedence constraints
|
Monma, C.L. |
|
1981 |
31-40 |
2 |
p. 137-150 14 p. |
artikel |
548 |
Signed graphs
|
Zaslavsky, Thomas |
|
1983 |
31-40 |
2 |
p. 248- 1 p. |
artikel |
549 |
Solution of the knight's Hamiltonian path problem on chessboards
|
Conrad, Axel |
|
1994 |
31-40 |
2 |
p. 125-134 10 p. |
artikel |
550 |
Some basic exchange properties in combinatorial optimization and their application to constructing the K-best solutions
|
Dergis, Ulrich |
|
1985 |
31-40 |
2 |
p. 129-141 13 p. |
artikel |
551 |
Some concepts of stability analysis in combinatorial optimization
|
Sotskov, Yu.N. |
|
1995 |
31-40 |
2 |
p. 169-190 22 p. |
artikel |
552 |
Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes [Discrete Applied Mathematics 67 (1996) 51–66]
|
Browna, T.J.N. |
|
1997 |
31-40 |
2 |
p. 199-200 2 p. |
artikel |
553 |
Some parallel algorithms on interval graphs
|
Bertossi, Alan A |
|
1987 |
31-40 |
2 |
p. 101-111 11 p. |
artikel |
554 |
Some results on greedy algorithm conjectures
|
Cole, T. |
|
1994 |
31-40 |
2 |
p. 169-194 26 p. |
artikel |
555 |
Some subsets of points in the plane associated to truncated Reed–Muller codes with good parameters
|
Quarez, Ronan |
|
2006 |
31-40 |
2 |
p. 392-398 7 p. |
artikel |
556 |
Spanners and message distribution in networks
|
Farley, Arthur M. |
|
2004 |
31-40 |
2 |
p. 159-171 13 p. |
artikel |
557 |
Sparse broadcast graphs
|
Bermond, Jean-Claude |
|
1992 |
31-40 |
2 |
p. 97-130 34 p. |
artikel |
558 |
Sparse networks tolerating random faults
|
Yamada, T. |
|
2004 |
31-40 |
2 |
p. 223-235 13 p. |
artikel |
559 |
Special Issue on Coding and Cryptography
|
Charpin, Pascale |
|
2006 |
31-40 |
2 |
p. 173- 1 p. |
artikel |
560 |
Special issue on computational methods for graph coloring and its generalizations
|
Johnson, David S. |
|
2008 |
31-40 |
2 |
p. 145-146 2 p. |
artikel |
561 |
Stability number of bull- and chair-free graphs
|
De Simone, Caterina |
|
1993 |
31-40 |
2 |
p. 121-129 9 p. |
artikel |
562 |
Strict 2-threshold graphs
|
Mahadev, N.V.R. |
|
1988 |
31-40 |
2 |
p. 113-131 19 p. |
artikel |
563 |
Strong branchwidth and local transversals
|
Tuza, Zsolt |
|
2005 |
31-40 |
2 |
p. 291-296 6 p. |
artikel |
564 |
Strongly polynomial simplex algorithm for bipartite vertex packing
|
Armstrong, Ronald D. |
|
1996 |
31-40 |
2 |
p. 97-103 7 p. |
artikel |
565 |
Strongly prime PCP words
|
Lipponen, Marjo |
|
1995 |
31-40 |
2 |
p. 193-197 5 p. |
artikel |
566 |
Structural decompositions, width parameters, and graph labelings
|
Kratochvíl, Jan |
|
2005 |
31-40 |
2 |
p. 141-142 2 p. |
artikel |
567 |
Surmise relations between tests—mathematical considerations
|
Brandt, Silke |
|
2003 |
31-40 |
2 |
p. 221-239 19 p. |
artikel |
568 |
Symmetric matrices and codes correcting rank errors beyond the ⌊ ( d - 1 ) / 2 ⌋ bound
|
Gabidulin, Ernst M. |
|
2006 |
31-40 |
2 |
p. 305-312 8 p. |
artikel |
569 |
Systems of distant representatives
|
Fiala, Jiří |
|
2005 |
31-40 |
2 |
p. 306-316 11 p. |
artikel |
570 |
Tandem cyclic alignment
|
Benson, Gary |
|
2005 |
31-40 |
2 |
p. 124-133 10 p. |
artikel |
571 |
Test sets for morphisms with bounded delay
|
Choffrut, Christian |
|
1985 |
31-40 |
2 |
p. 93-101 9 p. |
artikel |
572 |
The characterization of branching dependencies
|
Demetrovics, János |
|
1992 |
31-40 |
2 |
p. 139-153 15 p. |
artikel |
573 |
The complexity of generalized clique covering
|
Corneil, D.G. |
|
1988 |
31-40 |
2 |
p. 109-118 10 p. |
artikel |
574 |
The complexity of lifted inequalities for the knapsack problem
|
Hartvigsen, David |
|
1992 |
31-40 |
2 |
p. 113-123 11 p. |
artikel |
575 |
The complexity of one-machine batching problems
|
Albers, Susanne |
|
1993 |
31-40 |
2 |
p. 87-107 21 p. |
artikel |
576 |
The complexity of point configurations
|
Goodman, Jacob E. |
|
1991 |
31-40 |
2 |
p. 167-180 14 p. |
artikel |
577 |
The complexity of some graph colouring problems
|
Edwards, Keith |
|
1992 |
31-40 |
2 |
p. 131-140 10 p. |
artikel |
578 |
The disjoint shortest paths problem
|
Eilam-Tzoreff, Tali |
|
1998 |
31-40 |
2 |
p. 113-138 26 p. |
artikel |
579 |
The edge-chromatic class of regular graphs of degree 4 and their complements
|
Chetwynd, A.G |
|
1987 |
31-40 |
2 |
p. 125-134 10 p. |
artikel |
580 |
The forbidden minor characterization of line-search antimatroids of rooted digraphs
|
Okamoto, Yoshio |
|
2003 |
31-40 |
2 |
p. 523-533 11 p. |
artikel |
581 |
The infinite families of optimal double loop networks
|
Li, Q. |
|
1993 |
31-40 |
2 |
p. 179-183 5 p. |
artikel |
582 |
The interval number of a complete multipartite graph
|
Hopkins, Laurie B. |
|
1984 |
31-40 |
2 |
p. 163-187 25 p. |
artikel |
583 |
The k-weak hierarchical representations: an extension of the indexed closed weak hierarchies
|
Bertrand, P. |
|
2003 |
31-40 |
2 |
p. 199-220 22 p. |
artikel |
584 |
The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey
|
Caspard, Nathalie |
|
2003 |
31-40 |
2 |
p. 241-269 29 p. |
artikel |
585 |
The mathematics networks
|
|
|
1984 |
31-40 |
2 |
p. 214- 1 p. |
artikel |
586 |
The median function on distributive semilattices
|
McMorris, F.R |
|
2003 |
31-40 |
2 |
p. 319-324 6 p. |
artikel |
587 |
The median procedure in the semilattice of orders
|
Leclerc, Bruno |
|
2003 |
31-40 |
2 |
p. 285-302 18 p. |
artikel |
588 |
The minimum weight of the Grassmann codes C(k,n),
|
Ryan, Charles T. |
|
1990 |
31-40 |
2 |
p. 149-156 8 p. |
artikel |
589 |
The mixed shop scheduling problem
|
Masuda, Teruo |
|
1985 |
31-40 |
2 |
p. 175-186 12 p. |
artikel |
590 |
The modified differencing method for the set partitioning problem with cardinality constraints
|
Tasi, Li-Hui |
|
1995 |
31-40 |
2 |
p. 175-180 6 p. |
artikel |
591 |
The number of additional variables required for the integer programming formulation
|
Ibaraki, Toshihide |
|
1980 |
31-40 |
2 |
p. 155-158 4 p. |
artikel |
592 |
The number of keys in relational and nested relational databases
|
Thalheim, B. |
|
1992 |
31-40 |
2 |
p. 265-282 18 p. |
artikel |
593 |
The number of rounds needed to exchange information within a graph
|
Assmann, Susan F. |
|
1983 |
31-40 |
2 |
p. 117-125 9 p. |
artikel |
594 |
The parallel complexity of single rule logic programs
|
Afrati, Foto |
|
1992 |
31-40 |
2 |
p. 107-126 20 p. |
artikel |
595 |
The period of the Fibonacci random number generator
|
Parker, J.D. |
|
1988 |
31-40 |
2 |
p. 145-164 20 p. |
artikel |
596 |
The rate of convergence to optimality of the LPT rule
|
Frenk, J.B.G. |
|
1986 |
31-40 |
2 |
p. 187-197 11 p. |
artikel |
597 |
The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function
|
Desai, M.P |
|
2003 |
31-40 |
2 |
p. 299-310 12 p. |
artikel |
598 |
The restrictive H-coloring problem
|
Díaz, Josep |
|
2005 |
31-40 |
2 |
p. 297-305 9 p. |
artikel |
599 |
The Shields-Harary number for wheel and broken wheel graphs
|
Wunsch, Jared |
|
1995 |
31-40 |
2 |
p. 193-199 7 p. |
artikel |
600 |
The solution of a nonlinear partial difference equation
|
Wang, Zhixiong |
|
1990 |
31-40 |
2 |
p. 177-181 5 p. |
artikel |
601 |
The telephonic switching centre network problem: formalization and computational experience
|
Luna, Henrique Pacca L. |
|
1987 |
31-40 |
2 |
p. 199-210 12 p. |
artikel |
602 |
The vertices of the knapsack polytope
|
Hayes, A.C. |
|
1983 |
31-40 |
2 |
p. 135-138 4 p. |
artikel |
603 |
The weighted perfect domination problem and its variants
|
Chain-Chin, Yen |
|
1996 |
31-40 |
2 |
p. 147-160 14 p. |
artikel |
604 |
The Wiener number of the hexagonal net
|
Shiu, W.C. |
|
1997 |
31-40 |
2 |
p. 101-111 11 p. |
artikel |
605 |
Third announcement for the international conference on ordinal and symbolic data analysis (OSDA98)
|
|
|
1998 |
31-40 |
2 |
p. 163-164 2 p. |
artikel |
606 |
Tight bounds for bandwidth allocation on two links
|
Epstein, Leah |
|
2005 |
31-40 |
2 |
p. 181-188 8 p. |
artikel |
607 |
Tolerance graphs
|
Golumbic, Martin Charles |
|
1984 |
31-40 |
2 |
p. 157-170 14 p. |
artikel |
608 |
To vote or not to vote: What is the quota?
|
Holzman, Ron |
|
1988 |
31-40 |
2 |
p. 133-141 9 p. |
artikel |
609 |
Toward optimal gossiping schemes with conference calls
|
Liestman, Arthur L. |
|
1984 |
31-40 |
2 |
p. 183-189 7 p. |
artikel |
610 |
Trace monoids with some invertible generators: two decision problems
|
Wrathall, C. |
|
1991 |
31-40 |
2 |
p. 211-222 12 p. |
artikel |
611 |
Transforming a graph into a 1-balanced graph
|
Kannan, Lavanya |
|
2009 |
31-40 |
2 |
p. 300-308 9 p. |
artikel |
612 |
Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix
|
Chen, Hong-Bin |
|
2009 |
31-40 |
2 |
p. 387-390 4 p. |
artikel |
613 |
Transitive reduction of a rectangular boolean matrix
|
Hashimoto, Hiroshi |
|
1984 |
31-40 |
2 |
p. 153-161 9 p. |
artikel |
614 |
Trapezoidal matrices and the bottleneck assignment problem
|
Cechlárová, Katarína |
|
1995 |
31-40 |
2 |
p. 111-116 6 p. |
artikel |
615 |
Tree-decompositions of small pathwidth
|
Telle, Jan Arne |
|
2005 |
31-40 |
2 |
p. 210-218 9 p. |
artikel |
616 |
Tree decompositions with small cost
|
Bodlaender, Hans L. |
|
2005 |
31-40 |
2 |
p. 143-154 12 p. |
artikel |
617 |
Two strongly polynomial cut cancelling algorithms for minimum cost network flow
|
Ervolina, Thomas R. |
|
1993 |
31-40 |
2 |
p. 133-165 33 p. |
artikel |
618 |
Two-φ-tolerance competition graphs
|
Brigham, R.C. |
|
1996 |
31-40 |
2 |
p. 101-108 8 p. |
artikel |
619 |
Unconditionally secure key assignment schemes
|
De Santis, Alfredo |
|
2006 |
31-40 |
2 |
p. 234-252 19 p. |
artikel |
620 |
Uniform tag systems for paperfolding sequences
|
Bercoff, Christiane |
|
1997 |
31-40 |
2 |
p. 119-138 20 p. |
artikel |
621 |
Uniquely solvable quadratic boolean equations
|
Hansen, Pierre |
|
1985 |
31-40 |
2 |
p. 147-154 8 p. |
artikel |
622 |
Uses of randomness in algorithms and protocols
|
|
|
1992 |
31-40 |
2 |
p. 193-194 2 p. |
artikel |
623 |
Utility representation via additive or multiplicative error functions
|
Aleskerov, Fuad |
|
2003 |
31-40 |
2 |
p. 181-197 17 p. |
artikel |
624 |
Valid inequalities for mixed 0–1 programs
|
Van Roy, Tony J. |
|
1986 |
31-40 |
2 |
p. 199-213 15 p. |
artikel |
625 |
Variation of the Wiener index under tree transformations
|
Rada, Juan |
|
2005 |
31-40 |
2 |
p. 135-146 12 p. |
artikel |
626 |
VC-dimensions of finite automata and commutative finite automata with k letters and n states
|
Ishigami, Yoshiyasu |
|
1997 |
31-40 |
2 |
p. 123-134 12 p. |
artikel |
627 |
Whist tournaments — three person property
|
Finizio, Norman J. |
|
1993 |
31-40 |
2 |
p. 125-137 13 p. |
artikel |
628 |
Worst-case study of local search for MAX-k-SAT
|
Hirsch, Edward A. |
|
2003 |
31-40 |
2 |
p. 173-184 12 p. |
artikel |
629 |
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
|
Gramm, Jens |
|
2003 |
31-40 |
2 |
p. 139-155 17 p. |
artikel |