|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
849 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A 2-approximation algorithm for the minimum weight edge dominating set problem |
Fujito, Toshihiro |
2002 |
1-10 | 3 |
p. 199-207 9 p. |
artikel |
|
| 2 | A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times |
Nowicki, Eugeniusz |
1995 |
1-10 | 3 |
p. 237-256 20 p. |
artikel |
|
| 3 | A bijection for the total area of parallelogram polyominoes |
Del Lungo, Alberto |
2004 |
1-10 | 3 |
p. 291-302 12 p. |
artikel |
|
| 4 | A branch and bound algorithm for extreme point mathematical programming problems |
Sen, Suvrajeet |
1985 |
1-10 | 3 |
p. 265-280 16 p. |
artikel |
|
| 5 | Absolute retracts of bipartite graphs |
Bandelt, H.J |
1987 |
1-10 | 3 |
p. 191-215 25 p. |
artikel |
|
| 6 | Accretion centers: A generalization of branch weight centroids |
Slater, Peter J. |
1981 |
1-10 | 3 |
p. 187-192 6 p. |
artikel |
|
| 7 | A characterization of block graphs |
Behtoei, Ali |
2010 |
1-10 | 3 |
p. 219-221 3 p. |
artikel |
|
| 8 | A characterization of competition graphs |
Dutton, R.D. |
1983 |
1-10 | 3 |
p. 315-317 3 p. |
artikel |
|
| 9 | A characterization of competition graphs of arbitrary digraphs |
Roberts, Fred S. |
1983 |
1-10 | 3 |
p. 323-326 4 p. |
artikel |
|
| 10 | A characterization of graphs of competition number m |
Lundgren, J.Richard |
1983 |
1-10 | 3 |
p. 319-322 4 p. |
artikel |
|
| 11 | A characterization of overlap-free morphisms |
Berstel, J. |
1993 |
1-10 | 3 |
p. 275-281 7 p. |
artikel |
|
| 12 | A characterization of triangle-free tolerance graphs |
Busch, Arthur H. |
2006 |
1-10 | 3 |
p. 471-477 7 p. |
artikel |
|
| 13 | A ( 3 , 1 ) ∗ -choosable theorem on toroidal graphs |
Zhang, Li |
2012 |
1-10 | 3 |
p. 332-338 7 p. |
artikel |
|
| 14 | A class of web-based facets for the generalized vertex packing problem |
Sherali, Hanif D. |
2005 |
1-10 | 3 |
p. 273-286 14 p. |
artikel |
|
| 15 | A compact labeling scheme for series-parallel graphs |
Steiner, George |
1985 |
1-10 | 3 |
p. 281-297 17 p. |
artikel |
|
| 16 | A competitive algorithm to find all defective edges in a graph |
Hwang, Frank K. |
2005 |
1-10 | 3 |
p. 273-277 5 p. |
artikel |
|
| 17 | A complete adaptive algorithm for propositional satisfiability |
Bruni, Renato |
2003 |
1-10 | 3 |
p. 523-534 12 p. |
artikel |
|
| 18 | A condition for the strong regularity of matrices in the minimax algebra |
Butkovič, Peter |
1985 |
1-10 | 3 |
p. 209-222 14 p. |
artikel |
|
| 19 | A continuous approach for the concave cost supply problem via DC programming and DCA |
Le Thi, Hoai An |
2008 |
1-10 | 3 |
p. 325-338 14 p. |
artikel |
|
| 20 | A correct proof of the McMorris–Powers’ theorem on the consensus of phylogenies |
Thatte, Bhalchandra D. |
2007 |
1-10 | 3 |
p. 423-427 5 p. |
artikel |
|
| 21 | A correspondence between scene analysis and motions of frameworks |
Whiteley, Walter |
1984 |
1-10 | 3 |
p. 269-295 27 p. |
artikel |
|
| 22 | A cost-scaling algorithm for 0–1 submodular flows |
Shigeno, Maiko |
1997 |
1-10 | 3 |
p. 261-273 13 p. |
artikel |
|
| 23 | A cryptanalytic observation concerning systems based on language theory |
Kari, Jarkko |
1988 |
1-10 | 3 |
p. 265-268 4 p. |
artikel |
|
| 24 | Addendum |
Cheah, F. |
1991 |
1-10 | 3 |
p. 309- 1 p. |
artikel |
|
| 25 | A defect property of codes with unbounded delays |
Honkala, Juha |
1988 |
1-10 | 3 |
p. 261-264 4 p. |
artikel |
|
| 26 | A divisibility property for a subgroup of Riordan matrices |
Peart, Paul |
2000 |
1-10 | 3 |
p. 255-263 9 p. |
artikel |
|
| 27 | Adjacency of the best and second best valued solutions in combinatorial optimization problems |
Ikebe, Yoshiko |
1993 |
1-10 | 3 |
p. 227-232 6 p. |
artikel |
|
| 28 | A d-move local permutation routing for the d-cube |
Hwang, Frank K. |
1997 |
1-10 | 3 |
p. 199-207 9 p. |
artikel |
|
| 29 | A faster algorithm to recognize undirected path graphs |
Schäffer, Alejandro A. |
1993 |
1-10 | 3 |
p. 261-295 35 p. |
artikel |
|
| 30 | A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time |
Pisaruk, N.N. |
2003 |
1-10 | 3 |
p. 655-663 9 p. |
artikel |
|
| 31 | A further note on the stable matching problem |
Demange, Gabrielle |
1987 |
1-10 | 3 |
p. 217-222 6 p. |
artikel |
|
| 32 | A Generalization of maximal independent sets |
Jagota, Arun |
2001 |
1-10 | 3 |
p. 223-235 13 p. |
artikel |
|
| 33 | A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective |
Derigs, Ulrich |
1979 |
1-10 | 3 |
p. 167-180 14 p. |
artikel |
|
| 34 | A generalized preimage for the digital analytical hyperplane recognition |
Dexet, M. |
2009 |
1-10 | 3 |
p. 476-489 14 p. |
artikel |
|
| 35 | A graph theoretical approach to equivalence of multistage interconnection networks |
Bermond, Jean Claude |
1988 |
1-10 | 3 |
p. 201-214 14 p. |
artikel |
|
| 36 | A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing |
Hertz, Alain |
1994 |
1-10 | 3 |
p. 255-265 11 p. |
artikel |
|
| 37 | A heuristic for the p-center problems in graphs |
Plesník, J. |
1987 |
1-10 | 3 |
p. 263-268 6 p. |
artikel |
|
| 38 | Algorithmic aspects of clique-transversal and clique-independent sets |
Guruswami, Venkatesan |
2000 |
1-10 | 3 |
p. 183-202 20 p. |
artikel |
|
| 39 | Algorithmic aspects of the generalized clique-transversal problem on chordal graphs |
Maw-Shang, Chang |
1996 |
1-10 | 3 |
p. 189-203 15 p. |
artikel |
|
| 40 | Algorithmic complexity of list colorings |
Kratochvíl, Jan |
1994 |
1-10 | 3 |
p. 297-302 6 p. |
artikel |
|
| 41 | Algorithms for finding a Kth best valued assignment |
Matsui, Tomomi |
1994 |
1-10 | 3 |
p. 283-296 14 p. |
artikel |
|
| 42 | Algorithms for routing around a rectangle |
Frank, András |
1992 |
1-10 | 3 |
p. 363-378 16 p. |
artikel |
|
| 43 | A linear algorithm for the domination number of a series-parallel graph |
Kikuno, Tohru |
1983 |
1-10 | 3 |
p. 299-311 13 p. |
artikel |
|
| 44 | A linear-time algorithm for the longest path problem in rectangular grid graphs |
Keshavarz-Kohjerdi, Fatemeh |
2012 |
1-10 | 3 |
p. 210-217 8 p. |
artikel |
|
| 45 | A lower bound on the eccentric connectivity index of a graph |
Morgan, M.J. |
2012 |
1-10 | 3 |
p. 248-258 11 p. |
artikel |
|
| 46 | Alternating Hamiltonian circuits in edge-coloured bipartite graphs |
Hilton, A.J.W. |
1992 |
1-10 | 3 |
p. 271-273 3 p. |
artikel |
|
| 47 | A matching algorithm for regular bipartite graphs |
Csima, J. |
1992 |
1-10 | 3 |
p. 197-203 7 p. |
artikel |
|
| 48 | A modification of the Zinoviev lower bound for constant weight codes |
Honkala, Iiro |
1985 |
1-10 | 3 |
p. 307-310 4 p. |
artikel |
|
| 49 | A modular approach to Sprouts |
Focardi, Riccardo |
2004 |
1-10 | 3 |
p. 303-319 17 p. |
artikel |
|
| 50 | A multiversion cautious scheduler with dynamic serialization constraints for database concurrency control |
Katoh, Naoki |
1992 |
1-10 | 3 |
p. 379-395 17 p. |
artikel |
|
| 51 | An algebraic analysis of the connectivity of DeBruijn and shuffle-exchange digraphs |
Baumslag, Marc |
1995 |
1-10 | 3 |
p. 213-227 15 p. |
artikel |
|
| 52 | An algorithm for a merge recognition problem |
Mansfield, Anthony |
1982 |
1-10 | 3 |
p. 193-197 5 p. |
artikel |
|
| 53 | An algorithm for an Eulerian trail traversing specified edges in given order |
Cai, Mao-Cheng |
1994 |
1-10 | 3 |
p. 233-239 7 p. |
artikel |
|
| 54 | An algorithm for finding homogeneous pairs |
Everett, Hazel |
1997 |
1-10 | 3 |
p. 209-218 10 p. |
artikel |
|
| 55 | An algorithmic characterization of antimatroids |
Boyd, E.Andrew |
1990 |
1-10 | 3 |
p. 197-205 9 p. |
artikel |
|
| 56 | An alternate formulation of the symmetric traveling salesman problem and its properties |
Arthanari, T.S |
2000 |
1-10 | 3 |
p. 173-190 18 p. |
artikel |
|
| 57 | Analysis of scheduling problems with typed task systems |
Jansen, Klaus |
1994 |
1-10 | 3 |
p. 223-232 10 p. |
artikel |
|
| 58 | An approximation algorithm for scheduling dependent tasks on m processors with small communication delays |
Hanen, C |
2001 |
1-10 | 3 |
p. 239-257 19 p. |
artikel |
|
| 59 | An approximation algorithm for scheduling two parallel machines with capacity constraints |
Yang, Heng |
2003 |
1-10 | 3 |
p. 449-467 19 p. |
artikel |
|
| 60 | An asymmetric analogue of van der Veen conditions and the traveling salesman problem |
Oda, Yoshiaki |
2001 |
1-10 | 3 |
p. 279-292 14 p. |
artikel |
|
| 61 | An asymptotically exact polynomial algorithm for equipartition problems |
Simeone, Bruno |
1986 |
1-10 | 3 |
p. 283-293 11 p. |
artikel |
|
| 62 | An augmenting graph approach to the stable set problem in P 5-free graphs |
Boliac, Rodica |
2003 |
1-10 | 3 |
p. 567-575 9 p. |
artikel |
|
| 63 | An efficient algorithm for the Knight's tour problem |
Parberry, Ian |
1997 |
1-10 | 3 |
p. 251-260 10 p. |
artikel |
|
| 64 | An efficient algorithm for the parametric resource allocation problem |
Katoh, Naoki |
1985 |
1-10 | 3 |
p. 261-274 14 p. |
artikel |
|
| 65 | A network theory approach to the rigidity of skeletal structures Part I. Modelling and interconnection |
Recski, András |
1984 |
1-10 | 3 |
p. 313-324 12 p. |
artikel |
|
| 66 | A new class of nonbinary codes meeting the Griesmer bound |
Hamada, Noboru |
1993 |
1-10 | 3 |
p. 219-226 8 p. |
artikel |
|
| 67 | A new construction for Z-cyclic whist tournaments |
Ge, Gennian |
2003 |
1-10 | 3 |
p. 643-650 8 p. |
artikel |
|
| 68 | A new distance metric on strings computable in linear time |
Ehrenfeucht, A. |
1988 |
1-10 | 3 |
p. 191-203 13 p. |
artikel |
|
| 69 | A new exact algorithm for the solution of quadratic assignment problems |
Mautor, Thierry |
1994 |
1-10 | 3 |
p. 281-293 13 p. |
artikel |
|
| 70 | A new proof of Wojcicka's conjecture |
Chen, Yaojun |
2003 |
1-10 | 3 |
p. 545-554 10 p. |
artikel |
|
| 71 | A new version of on-line variable-sized bin packing |
Zhang, Guochuan |
1997 |
1-10 | 3 |
p. 193-197 5 p. |
artikel |
|
| 72 | An extended abstract of an indepth algorithmic and computational study for maximum flow problems |
Glover, Fred |
1980 |
1-10 | 3 |
p. 251-254 4 p. |
artikel |
|
| 73 | An extended result of Kleitman and Saks concerning binary trees |
Chu Yung-ching, |
1985 |
1-10 | 3 |
p. 255-259 5 p. |
artikel |
|
| 74 | An extension of elementary bipartite graphs to matroid pairs and its characterization |
Nakamura, Masataka |
1994 |
1-10 | 3 |
p. 285-288 4 p. |
artikel |
|
| 75 | An improved algorithm for quantitative group testing |
Gargano, L. |
1992 |
1-10 | 3 |
p. 299-306 8 p. |
artikel |
|
| 76 | An improved ant colony optimisation heuristic for graph colouring |
Dowsland, Kathryn A. |
2008 |
1-10 | 3 |
p. 313-324 12 p. |
artikel |
|
| 77 | An infinite family of Goethals–Seidel arrays |
Xia, Mingyuan |
2005 |
1-10 | 3 |
p. 498-504 7 p. |
artikel |
|
| 78 | An intersection problem for finite automata |
Saks, Michael |
1988 |
1-10 | 3 |
p. 245-255 11 p. |
artikel |
|
| 79 | Announcement |
1990 |
1-10 | 3 |
p. 317- 1 p. |
artikel |
||
| 80 | Announcement |
1990 |
1-10 | 3 |
p. 297- 1 p. |
artikel |
||
| 81 | Anomalous behavior in bin packing algorithms |
Murgolo, Frank D. |
1988 |
1-10 | 3 |
p. 229-243 15 p. |
artikel |
|
| 82 | An O(n 2) algorithm for maximum cycle mean of Monge matrices in max-algebra |
Gavalec, Martin |
2003 |
1-10 | 3 |
p. 651-656 6 p. |
artikel |
|
| 83 | An O(n 1.5) algorithm to color proper circular arcs |
Shih, Wei-Kuan |
1989 |
1-10 | 3 |
p. 321-323 3 p. |
artikel |
|
| 84 | A nonfactorial algorithm for testing isomorphism of two graphs |
Goldberg, Mark.K. |
1983 |
1-10 | 3 |
p. 229-236 8 p. |
artikel |
|
| 85 | An on-line bin-batching problem |
Zhang, Guochuan |
2001 |
1-10 | 3 |
p. 329-333 5 p. |
artikel |
|
| 86 | An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs |
Chao, H.S. |
2000 |
1-10 | 3 |
p. 159-173 15 p. |
artikel |
|
| 87 | A note on cake cutting |
Even, S. |
1984 |
1-10 | 3 |
p. 285-296 12 p. |
artikel |
|
| 88 | A note on gray code and odd-even merge |
Larcher, Gerhard |
1987 |
1-10 | 3 |
p. 309-313 5 p. |
artikel |
|
| 89 | A note on line broadcast in digraphs under the edge-disjoint paths mode |
Fraigniaud, Pierre |
2004 |
1-10 | 3 |
p. 320-323 4 p. |
artikel |
|
| 90 | A note on minimal triangulations of an n-cube |
Sallee, John F. |
1982 |
1-10 | 3 |
p. 211-215 5 p. |
artikel |
|
| 91 | A note on orientations of mixed graphs |
Arkin, Esther M. |
2002 |
1-10 | 3 |
p. 271-278 8 p. |
artikel |
|
| 92 | A note on perfect Lee-codes |
Riihonen, A.I. |
1980 |
1-10 | 3 |
p. 259-260 2 p. |
artikel |
|
| 93 | A note on perfect Lee-codes over small alphabets |
Astola, Jaakko |
1982 |
1-10 | 3 |
p. 227-228 2 p. |
artikel |
|
| 94 | A note on rectilinear and polar visibility graphs |
Hutchinson, Joan P. |
2005 |
1-10 | 3 |
p. 263-272 10 p. |
artikel |
|
| 95 | A note on α-redundant vertices in graphs |
Brandstädt, Andreas |
2001 |
1-10 | 3 |
p. 301-308 8 p. |
artikel |
|
| 96 | A note on regular classes in special Thue systems |
Bucher, W. |
1988 |
1-10 | 3 |
p. 199-205 7 p. |
artikel |
|
| 97 | A note on the computational complexity of graph vertex partition |
Huang, Yuanqiu |
2007 |
1-10 | 3 |
p. 405-409 5 p. |
artikel |
|
| 98 | A note on the depth function of combinatorial optimization problems |
Woeginger, Gerhard J. |
2001 |
1-10 | 3 |
p. 325-328 4 p. |
artikel |
|
| 99 | A note on the number of matchings and independent sets in trees |
Fischermann, Miranca |
2005 |
1-10 | 3 |
p. 483-489 7 p. |
artikel |
|
| 100 | A note on the number of perfect matchings of bipartite graphs |
Fuji, Zhang |
1997 |
1-10 | 3 |
p. 275-282 8 p. |
artikel |
|
| 101 | A note on the precedence-constrained class sequencing problem |
Correa, José R. |
2007 |
1-10 | 3 |
p. 257-259 3 p. |
artikel |
|
| 102 | A note on the similarity depth |
Rozenberg, G. |
1982 |
1-10 | 3 |
p. 237-241 5 p. |
artikel |
|
| 103 | A note on worst-case performance of heuristics for maintenance scheduling problems |
Qi, Xiangtong |
2007 |
1-10 | 3 |
p. 416-422 7 p. |
artikel |
|
| 104 | A parallel tabu search algorithm for large traveling salesman problems |
Fiechter, C.-N. |
1994 |
1-10 | 3 |
p. 243-267 25 p. |
artikel |
|
| 105 | A perfect matching algorithm for sparse bipartite graphs |
Toczyłowski, Eugeniusz |
1984 |
1-10 | 3 |
p. 263-268 6 p. |
artikel |
|
| 106 | A polynomial feasibility test for preemptive periodic scheduling of unrelated processors |
Bertossi, Alan A. |
1985 |
1-10 | 3 |
p. 195-201 7 p. |
artikel |
|
| 107 | Application of the theory of boundary value problems in the analysis of a Queueing model with paired services |
1983 |
1-10 | 3 |
p. 328- 1 p. |
artikel |
||
| 108 | Applications of Ramsey theory |
Roberts, Fred S. |
1984 |
1-10 | 3 |
p. 251-261 11 p. |
artikel |
|
| 109 | Approximating reversal distance for strings with bounded number of duplicates |
Kolman, Petr |
2007 |
1-10 | 3 |
p. 327-336 10 p. |
artikel |
|
| 110 | Approximation algorithms for some optimum communication spanning tree problems |
Wu, Bang Ye |
2000 |
1-10 | 3 |
p. 245-266 22 p. |
artikel |
|
| 111 | Approximation algorithms for the geometric covering salesman problem |
Arkin, Esther M. |
1994 |
1-10 | 3 |
p. 197-218 22 p. |
artikel |
|
| 112 | Approximation results for a min–max location-routing problem |
Xu, Zhou |
2012 |
1-10 | 3 |
p. 306-320 15 p. |
artikel |
|
| 113 | Approximations to clustering and subgraph problems on trees |
Schrader, Rainer |
1983 |
1-10 | 3 |
p. 301-309 9 p. |
artikel |
|
| 114 | A primal dual integer programming algorithm |
Llewellyn, Donna C. |
|
1-10 | 3 |
p. 261-275 |
artikel |
|
| 115 | A proof of Jean de Rumeur's conjecture |
Perennes, Stéphane |
1997 |
1-10 | 3 |
p. 295-299 5 p. |
artikel |
|
| 116 | A propos d'une conjecture de F. Dejean sur les répétitions dans les mots |
Pansiot, Jean-Jacques |
1984 |
1-10 | 3 |
p. 297-311 15 p. |
artikel |
|
| 117 | Arborescence polytopes for series-parallel graphs |
Goemans, Michel X. |
1994 |
1-10 | 3 |
p. 277-289 13 p. |
artikel |
|
| 118 | A result concerning the trios generated by commutative slip-languages |
Kortelainen, Juha |
1982 |
1-10 | 3 |
p. 233-236 4 p. |
artikel |
|
| 119 | A result of Vapnik with applications |
Anthony, Martin |
1993 |
1-10 | 3 |
p. 207-217 11 p. |
artikel |
|
| 120 | A rounding algorithm for integer programs |
Lakshminarayanan, Sambhavi |
1994 |
1-10 | 3 |
p. 267-282 16 p. |
artikel |
|
| 121 | Arrow's Theorem for closed weak hierarchies |
Powers, R.C. |
1996 |
1-10 | 3 |
p. 271-278 8 p. |
artikel |
|
| 122 | A set covering reformulation of the pure fixed charge transportation problem |
Göthe-Lundgren, Maud |
1994 |
1-10 | 3 |
p. 245-259 15 p. |
artikel |
|
| 123 | A short constructive proof of A.R. Rao’s characterization of potentially K r + 1 -graphic sequences |
Yin, Jian-Hua |
2012 |
1-10 | 3 |
p. 352-354 3 p. |
artikel |
|
| 124 | A simple proof of the multiplicativity of directed cycles of prime power length |
Zhu, Xuding |
1992 |
1-10 | 3 |
p. 313-316 4 p. |
artikel |
|
| 125 | A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs |
Corneil, Derek G. |
2004 |
1-10 | 3 |
p. 371-379 9 p. |
artikel |
|
| 126 | A solvable case of image reconstruction in discrete tomography |
Costa, M.C. |
2005 |
1-10 | 3 |
p. 240-245 6 p. |
artikel |
|
| 127 | A solvable class of quadratic 0–1 programming |
Chakradhar, Srimat T. |
1992 |
1-10 | 3 |
p. 233-251 19 p. |
artikel |
|
| 128 | A special planar satisfiability problem and a consequence of its NP-completeness |
Kratochvíl, Jan |
1994 |
1-10 | 3 |
p. 233-252 20 p. |
artikel |
|
| 129 | Asteroidal triples of moplexes |
Berry, Anne |
2001 |
1-10 | 3 |
p. 219-229 11 p. |
artikel |
|
| 130 | A strongly polynomial algorithm for solving two-sided linear systems in max-algebra |
Butkovič, Peter |
2006 |
1-10 | 3 |
p. 437-446 10 p. |
artikel |
|
| 131 | A theorem on the principal structure for independent matchings |
Iwata, Satoru |
1995 |
1-10 | 3 |
p. 229-244 16 p. |
artikel |
|
| 132 | A tight bound for 3-partitioning |
Kellerer, Hans |
|
1-10 | 3 |
p. 249-259 |
artikel |
|
| 133 | A topological sampling theorem for Robust boundary reconstruction and image segmentation |
Meine, Hans |
2009 |
1-10 | 3 |
p. 524-541 18 p. |
artikel |
|
| 134 | A unified approach for price directive decomposition procedures in integer programming |
Holm, Søren |
1988 |
1-10 | 3 |
p. 205-219 15 p. |
artikel |
|
| 135 | A unified approach to polynomially solvable cases of integer “non-separable” quadratic optimization |
Baldick, Ross |
1995 |
1-10 | 3 |
p. 195-212 18 p. |
artikel |
|
| 136 | A unified approach to the first derivatives of graph polynomials |
Li, Xueliang |
1995 |
1-10 | 3 |
p. 293-297 5 p. |
artikel |
|
| 137 | A unifying approach to descriptive geometry and mechanisms |
Sugihara, Kōkichi |
1983 |
1-10 | 3 |
p. 313-328 16 p. |
artikel |
|
| 138 | A unifying location model on tree graphs based on submodularity properties |
Tamir, Arie |
1993 |
1-10 | 3 |
p. 275-283 9 p. |
artikel |
|
| 139 | Author index |
1995 |
1-10 | 3 |
p. 283-284 2 p. |
artikel |
||
| 140 | Author index |
1995 |
1-10 | 3 |
p. 285- 1 p. |
artikel |
||
| 141 | Author index |
1994 |
1-10 | 3 |
p. 305-306 2 p. |
artikel |
||
| 142 | Author index |
1992 |
1-10 | 3 |
p. 321- 1 p. |
artikel |
||
| 143 | Author index |
1993 |
1-10 | 3 |
p. 279-280 2 p. |
artikel |
||
| 144 | Author index |
1994 |
1-10 | 3 |
p. 307-308 2 p. |
artikel |
||
| 145 | Author index |
1993 |
1-10 | 3 |
p. 301-302 2 p. |
artikel |
||
| 146 | Author index |
1993 |
1-10 | 3 |
p. 301-302 2 p. |
artikel |
||
| 147 | Author index |
1993 |
1-10 | 3 |
p. 289-290 2 p. |
artikel |
||
| 148 | Author index |
1992 |
1-10 | 3 |
p. 459-460 2 p. |
artikel |
||
| 149 | Author index |
1994 |
1-10 | 3 |
p. 313-314 2 p. |
artikel |
||
| 150 | Author index |
1995 |
1-10 | 3 |
p. 299-300 2 p. |
artikel |
||
| 151 | Author index |
1995 |
1-10 | 3 |
p. 299-300 2 p. |
artikel |
||
| 152 | Author Index |
2001 |
1-10 | 3 |
p. 335-336 2 p. |
artikel |
||
| 153 | Author index |
1994 |
1-10 | 3 |
p. 333-334 2 p. |
artikel |
||
| 154 | Author index |
1997 |
1-10 | 3 |
p. 305-306 2 p. |
artikel |
||
| 155 | Author index |
1997 |
1-10 | 3 |
p. 303-304 2 p. |
artikel |
||
| 156 | Author index |
1996 |
1-10 | 3 |
p. 305-306 2 p. |
artikel |
||
| 157 | Author index |
1996 |
1-10 | 3 |
p. 293-294 2 p. |
artikel |
||
| 158 | Author index |
1996 |
1-10 | 3 |
p. 279-280 2 p. |
artikel |
||
| 159 | Author index |
1996 |
1-10 | 3 |
p. 285- 1 p. |
artikel |
||
| 160 | Author index |
1991 |
1-10 | 3 |
p. 307-308 2 p. |
artikel |
||
| 161 | Author index |
1991 |
1-10 | 3 |
p. 315-316 2 p. |
artikel |
||
| 162 | Author index |
1992 |
1-10 | 3 |
p. 325- 1 p. |
artikel |
||
| 163 | Author index |
1990 |
1-10 | 3 |
p. 319-320 2 p. |
artikel |
||
| 164 | Author index |
1988 |
1-10 | 3 |
p. 299-300 2 p. |
artikel |
||
| 165 | Author index |
1987 |
1-10 | 3 |
p. 323-324 2 p. |
artikel |
||
| 166 | Author index |
1988 |
1-10 | 3 |
p. 269-270 2 p. |
artikel |
||
| 167 | Author index |
1984 |
1-10 | 3 |
p. 323-324 2 p. |
artikel |
||
| 168 | Author index |
1990 |
1-10 | 3 |
p. 299-300 2 p. |
artikel |
||
| 169 | Author index |
1984 |
1-10 | 3 |
p. 307-308 2 p. |
artikel |
||
| 170 | Author index |
1983 |
1-10 | 3 |
p. 331-332 2 p. |
artikel |
||
| 171 | Author index |
1985 |
1-10 | 3 |
p. 319-320 2 p. |
artikel |
||
| 172 | Author index |
1987 |
1-10 | 3 |
p. 311- 1 p. |
artikel |
||
| 173 | Author index |
1984 |
1-10 | 3 |
p. 337-338 2 p. |
artikel |
||
| 174 | Author index |
1985 |
1-10 | 3 |
p. 323-324 2 p. |
artikel |
||
| 175 | Author index |
1988 |
1-10 | 3 |
p. 269- 1 p. |
artikel |
||
| 176 | Author index |
1986 |
1-10 | 3 |
p. 311- 1 p. |
artikel |
||
| 177 | Author index |
1987 |
1-10 | 3 |
p. 287-288 2 p. |
artikel |
||
| 178 | Author index |
1989 |
1-10 | 3 |
p. 329- 1 p. |
artikel |
||
| 179 | Author index |
|
1-10 | 3 |
p. 313-314 |
artikel |
||
| 180 | Author index (last vol./issue) |
2003 |
1-10 | 3 |
p. 691-693 3 p. |
artikel |
||
| 181 | Author index Math. Soc. |
1996 |
1-10 | 3 |
p. 291-292 2 p. |
artikel |
||
| 182 | Author index to volume |
2003 |
1-10 | 3 |
p. 691-693 3 p. |
artikel |
||
| 183 | Author index to volume 130 |
2003 |
1-10 | 3 |
p. 577-579 3 p. |
artikel |
||
| 184 | Author Index to Volume 119 |
2002 |
1-10 | 3 |
p. 305-306 2 p. |
artikel |
||
| 185 | Author Index to Volume 118 (2002) |
2002 |
1-10 | 3 |
p. 323-324 2 p. |
artikel |
||
| 186 | Author Index to Volume 116 (2002) |
2002 |
1-10 | 3 |
p. 307-308 2 p. |
artikel |
||
| 187 | Author Index to Volume 111 (2001) |
2001 |
1-10 | 3 |
p. 313-314 2 p. |
artikel |
||
| 188 | Author index to volume |
2004 |
1-10 | 3 |
p. 381-382 2 p. |
artikel |
||
| 189 | Author index to volume |
2004 |
1-10 | 3 |
p. 373-374 2 p. |
artikel |
||
| 190 | Author index to volume |
2004 |
1-10 | 3 |
p. 381-382 2 p. |
artikel |
||
| 191 | Author index to volume 148 |
2005 |
1-10 | 3 |
p. 278-279 2 p. |
artikel |
||
| 192 | Author index to volume |
2005 |
1-10 | 3 |
p. 510-512 3 p. |
artikel |
||
| 193 | Author index to volume |
2005 |
1-10 | 3 |
p. 365-366 2 p. |
artikel |
||
| 194 | Author index volume 55 (1994) |
1994 |
1-10 | 3 |
p. 303-304 2 p. |
artikel |
||
| 195 | Author index volume 85 (1998) |
1998 |
1-10 | 3 |
p. 255- 1 p. |
artikel |
||
| 196 | Author index volume 74 (1997) |
1997 |
1-10 | 3 |
p. 301-302 2 p. |
artikel |
||
| 197 | Author index volume 23 (1989) |
1989 |
1-10 | 3 |
p. 297-298 2 p. |
artikel |
||
| 198 | Author index volume 11 (1985) |
1985 |
1-10 | 3 |
p. 317- 1 p. |
artikel |
||
| 199 | Author index volume 77 (1997)ameter in multiple-loop networks |
1997 |
1-10 | 3 |
p. 307-308 2 p. |
artikel |
||
| 200 | Author index volume 75eration and reliability problems |
1997 |
1-10 | 3 |
p. 297-298 2 p. |
artikel |
||
| 201 | Balanced block spacing for VLSI layout |
Cederbaum, Israel |
1992 |
1-10 | 3 |
p. 303-318 16 p. |
artikel |
|
| 202 | Balance, uncorrelatedness and the strict avalanche criterion |
Lloyd, Sheelagh |
1993 |
1-10 | 3 |
p. 223-233 11 p. |
artikel |
|
| 203 | Ballot matrix as Catalan matrix power and related identities |
Stanimirović, Stefan |
2012 |
1-10 | 3 |
p. 344-351 8 p. |
artikel |
|
| 204 | Batch scheduling and common due-date assignment on a single machine |
Cheng, T.C.Edwin |
1996 |
1-10 | 3 |
p. 231-245 15 p. |
artikel |
|
| 205 | Batch scheduling in a two-machine flow shop with limited buffer |
Agnetis, A. |
1997 |
1-10 | 3 |
p. 243-260 18 p. |
artikel |
|
| 206 | Bernoulli numbers and the probability of a birthday surprise |
Tsaban, Boaz |
2003 |
1-10 | 3 |
p. 657-663 7 p. |
artikel |
|
| 207 | Best reduction of the quadratic semi-assignment problem |
Billionnet, Alain |
2001 |
1-10 | 3 |
p. 197-213 17 p. |
artikel |
|
| 208 | Better understanding of batcher's merging networks |
Perl, Yehoshua |
1989 |
1-10 | 3 |
p. 257-271 15 p. |
artikel |
|
| 209 | Binary trees with the largest number of subtrees |
Székely, L.A. |
2007 |
1-10 | 3 |
p. 374-385 12 p. |
artikel |
|
| 210 | Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones |
Hwang, F.K. |
1993 |
1-10 | 3 |
p. 283- 1 p. |
artikel |
|
| 211 | Bipartite graphs and digraphs with maximum connectivity |
Fàbrega, J. |
1996 |
1-10 | 3 |
p. 271-279 9 p. |
artikel |
|
| 212 | Bipartite-perfect graphs |
Bang Le, Van |
2003 |
1-10 | 3 |
p. 581-599 19 p. |
artikel |
|
| 213 | Bipartite permutation graphs |
Spinrad, Jeremy |
1987 |
1-10 | 3 |
p. 279-292 14 p. |
artikel |
|
| 214 | Birthday paradox, coupon collectors, caching algorithms and self-organizing search |
Flajolet, Philippe |
1992 |
1-10 | 3 |
p. 207-229 23 p. |
artikel |
|
| 215 | Bond graphs I: Acausal equivalence |
Lamb, J.D. |
1997 |
1-10 | 3 |
p. 261-293 33 p. |
artikel |
|
| 216 | Bond graphs III: Bond graphs and electrical networks |
Lamb, J.D. |
1997 |
1-10 | 3 |
p. 211-250 40 p. |
artikel |
|
| 217 | Book announcement |
1997 |
1-10 | 3 |
p. 297-304 8 p. |
artikel |
||
| 218 | Book announcement |
1996 |
1-10 | 3 |
p. 304- 1 p. |
artikel |
||
| 219 | Book announcement |
1989 |
1-10 | 3 |
p. 325-327 3 p. |
artikel |
||
| 220 | Book announcement |
1979 |
1-10 | 3 |
p. 227-228 2 p. |
artikel |
||
| 221 | Book announcement |
2005 |
1-10 | 3 |
p. 505-509 5 p. |
artikel |
||
| 222 | Book announcements |
2003 |
1-10 | 3 |
p. 567-575 9 p. |
artikel |
||
| 223 | Book announcements |
1993 |
1-10 | 3 |
p. 285-288 4 p. |
artikel |
||
| 224 | Book announcements |
1993 |
1-10 | 3 |
p. 297-299 3 p. |
artikel |
||
| 225 | Book announcements |
1991 |
1-10 | 3 |
p. 311-314 4 p. |
artikel |
||
| 226 | Book announcements |
1995 |
1-10 | 3 |
p. 281-282 2 p. |
artikel |
||
| 227 | Book announcements |
1994 |
1-10 | 3 |
p. 303-305 3 p. |
artikel |
||
| 228 | Book announcements |
1996 |
1-10 | 3 |
p. 289-291 3 p. |
artikel |
||
| 229 | Book announcements |
1991 |
1-10 | 3 |
p. 303-306 4 p. |
artikel |
||
| 230 | Book announcements |
1993 |
1-10 | 3 |
p. 275-278 4 p. |
artikel |
||
| 231 | Book announcements |
1993 |
1-10 | 3 |
p. 297-300 4 p. |
artikel |
||
| 232 | Book announcements |
1994 |
1-10 | 3 |
p. 329-331 3 p. |
artikel |
||
| 233 | Book announcements |
1992 |
1-10 | 3 |
p. 317-320 4 p. |
artikel |
||
| 234 | Book announcements |
1990 |
1-10 | 3 |
p. 313-316 4 p. |
artikel |
||
| 235 | Book announcements |
1989 |
1-10 | 3 |
p. 293-295 3 p. |
artikel |
||
| 236 | Book announcements |
1990 |
1-10 | 3 |
p. 293-296 4 p. |
artikel |
||
| 237 | Book announcements |
1988 |
1-10 | 3 |
p. 295-296 2 p. |
artikel |
||
| 238 | Book announcements |
1982 |
1-10 | 3 |
p. 243-246 4 p. |
artikel |
||
| 239 | Book announcements |
1983 |
1-10 | 3 |
p. 329-332 4 p. |
artikel |
||
| 240 | Boundary uniqueness of fusenes |
Guo, Xiaofeng |
2002 |
1-10 | 3 |
p. 209-222 14 p. |
artikel |
|
| 241 | Bounded depth broadcasting |
Peters, David B. |
1996 |
1-10 | 3 |
p. 255-270 16 p. |
artikel |
|
| 242 | Bounding the probability of the union of events by aggregation and disaggregation in linear programs |
Prékopa, András |
2005 |
1-10 | 3 |
p. 444-454 11 p. |
artikel |
|
| 243 | Bounds for parametric sequence comparison |
Fernández-Baca, David |
2002 |
1-10 | 3 |
p. 181-198 18 p. |
artikel |
|
| 244 | Bounds for the solution set of linear complementarity problems |
Pardalos, Panos M. |
1987 |
1-10 | 3 |
p. 255-261 7 p. |
artikel |
|
| 245 | Bounds on the size of merging networks |
Aigner, Martin |
1995 |
1-10 | 3 |
p. 187-194 8 p. |
artikel |
|
| 246 | Branch and bound procedures for solving the Assembly Line Worker Assignment and Balancing Problem: Application to Sheltered Work centres for Disabled |
Miralles, Cristóbal |
2008 |
1-10 | 3 |
p. 352-367 16 p. |
artikel |
|
| 247 | CAAP 83, 8th colloquium on trees in algebra and programming |
1983 |
1-10 | 3 |
p. 333- 1 p. |
artikel |
||
| 248 | Canonical equation sets for classes of concordant polytopes |
Lee, Jon |
1990 |
1-10 | 3 |
p. 207-221 15 p. |
artikel |
|
| 249 | Can the catenation of two weakly sparse languages be dense? |
Yu, Sheng |
1988 |
1-10 | 3 |
p. 265-267 3 p. |
artikel |
|
| 250 | Capacitated two-parallel machines scheduling to minimize sum of job completion times |
Lee, Chung-Yee |
1993 |
1-10 | 3 |
p. 211-222 12 p. |
artikel |
|
| 251 | Cardinality constrained minimum cut problems: complexity and algorithms |
Bruglieri, Maurizio |
2004 |
1-10 | 3 |
p. 311-341 31 p. |
artikel |
|
| 252 | Cell rotation graphs of strongly connected orientations of plane graphs with an application |
Zhang, Heping |
2003 |
1-10 | 3 |
p. 469-485 17 p. |
artikel |
|
| 253 | Chain homotopies for object topological representations |
González-Díaz, R. |
2009 |
1-10 | 3 |
p. 490-499 10 p. |
artikel |
|
| 254 | Characterization and algorithms of curve map graphs |
Gavril, Fǎnicǎ |
1982 |
1-10 | 3 |
p. 181-191 11 p. |
artikel |
|
| 255 | Characterizations of max-balanced flows |
Rothblum, Uriel G. |
1992 |
1-10 | 3 |
p. 241-261 21 p. |
artikel |
|
| 256 | Chordally signed graphs |
McKee, Terry A. |
2002 |
1-10 | 3 |
p. 273-280 8 p. |
artikel |
|
| 257 | Circular permutation graph family with applications |
Lou, R.D. |
1992 |
1-10 | 3 |
p. 433-457 25 p. |
artikel |
|
| 258 | Classes of cycle bases |
Liebchen, Christian |
2007 |
1-10 | 3 |
p. 337-355 19 p. |
artikel |
|
| 259 | Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance |
Cheston, Grant A. |
1994 |
1-10 | 3 |
p. 241-258 18 p. |
artikel |
|
| 260 | Classification of three-valued logical functions preserving 0 |
Miyakawa, Masahiro |
1990 |
1-10 | 3 |
p. 231-249 19 p. |
artikel |
|
| 261 | Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees |
Delorme, Charles |
2003 |
1-10 | 3 |
p. 503-512 10 p. |
artikel |
|
| 262 | Colloquium on algebra, combinatorics and logic in computer science |
1983 |
1-10 | 3 |
p. 334- 1 p. |
artikel |
||
| 263 | Combinatorial aspects of construction of competition Dutch Professional Football Leagues |
Schreuder, Jan A.M. |
1992 |
1-10 | 3 |
p. 301-312 12 p. |
artikel |
|
| 264 | Combinatorial dynamical system theory: General framework and controllability criteria |
Murota, Kazuo |
1988 |
1-10 | 3 |
p. 241-265 25 p. |
artikel |
|
| 265 | Comment on “A note on perfect lee-codes” |
Holdridge, D.B. |
1981 |
1-10 | 3 |
p. 221- 1 p. |
artikel |
|
| 266 | Communication in m-connected graphs |
Idzik, Adam |
1990 |
1-10 | 3 |
p. 297-301 5 p. |
artikel |
|
| 267 | Comparison of mean distance in superposed networks |
Paoli, M. |
1984 |
1-10 | 3 |
p. 279-287 9 p. |
artikel |
|
| 268 | Compatible 2-factors |
Kratochvil, Jan |
1992 |
1-10 | 3 |
p. 253-266 14 p. |
artikel |
|
| 269 | Competitive group testing |
Du, D.Z. |
|
1-10 | 3 |
p. 221-232 |
artikel |
|
| 270 | Complement reducible graphs |
Corneil, D.G. |
1981 |
1-10 | 3 |
p. 163-174 12 p. |
artikel |
|
| 271 | Complexity of robust single facility location problems on networks with uncertain edge lengths |
Averbakh, Igor |
2003 |
1-10 | 3 |
p. 505-522 18 p. |
artikel |
|
| 272 | Complexity of scheduling multiprocessor tasks with prespecified processor allocations |
Hoogeveen, J.A. |
1994 |
1-10 | 3 |
p. 259-272 14 p. |
artikel |
|
| 273 | Computation of the center and diameter of outerplanar graphs |
Farley, Arthur M. |
1980 |
1-10 | 3 |
p. 185-191 7 p. |
artikel |
|
| 274 | Computation on binary tree-networks |
Tchuente, Maurice |
1986 |
1-10 | 3 |
p. 295-310 16 p. |
artikel |
|
| 275 | Computerised decision aid for timetabling — a case analysis |
Tripathy, Arabinda |
1992 |
1-10 | 3 |
p. 313-323 11 p. |
artikel |
|
| 276 | Computing finest mincut partitions of a graph and application to routing problems |
Reinelt, Gerhard |
2008 |
1-10 | 3 |
p. 385-396 12 p. |
artikel |
|
| 277 | Computing optimal assignments for residual network reliability |
Stivaros, C. |
1997 |
1-10 | 3 |
p. 285-295 11 p. |
artikel |
|
| 278 | Computing Prüfer codes efficiently in parallel |
Greenlaw, Raymond |
2000 |
1-10 | 3 |
p. 205-222 18 p. |
artikel |
|
| 279 | Computing the binding number of a graph |
Cunningham, William H. |
1990 |
1-10 | 3 |
p. 283-285 3 p. |
artikel |
|
| 280 | Computing the boxicity of a graph by covering its complement by cointerval graphs |
Cozzens, Margaret B. |
1983 |
1-10 | 3 |
p. 217-228 12 p. |
artikel |
|
| 281 | Concerning the complexity of deciding isomorphism of block designs |
Colbourn, Marlene J. |
1981 |
1-10 | 3 |
p. 155-162 8 p. |
artikel |
|
| 282 | Connected triangle-free m -step competition graphs |
Helleloid, Geir T. |
2005 |
1-10 | 3 |
p. 376-383 8 p. |
artikel |
|
| 283 | Connecting colored point sets |
Aichholzer, Oswin |
2007 |
1-10 | 3 |
p. 271-278 8 p. |
artikel |
|
| 284 | Connection-graph and iteration-graph of monotone boolean functions |
Robert, Y. |
1985 |
1-10 | 3 |
p. 245-253 9 p. |
artikel |
|
| 285 | Connectivity of vertex and edge transitive graphs |
Meng, Jixiang |
2003 |
1-10 | 3 |
p. 601-613 13 p. |
artikel |
|
| 286 | Consistent formulas for estimating the total lengths of trees |
Willson, Stephen J. |
2005 |
1-10 | 3 |
p. 214-239 26 p. |
artikel |
|
| 287 | Constrained matroidal bottleneck problems |
Averbakh, Igor |
1995 |
1-10 | 3 |
p. 201-214 14 p. |
artikel |
|
| 288 | Construction of infinite de Bruijn arrays |
Iványi, Antal |
1988 |
1-10 | 3 |
p. 289-293 5 p. |
artikel |
|
| 289 | Construction of university faculty timetables using logic programming techniques |
Fahrion, R. |
1992 |
1-10 | 3 |
p. 221-236 16 p. |
artikel |
|
| 290 | Constructive characterizations of the value-function of a mixed-integer program I |
Blair, C.E. |
1984 |
1-10 | 3 |
p. 217-233 17 p. |
artikel |
|
| 291 | Constructive characterizations of the value function of a mixed-integer program II |
Blair, C.E. |
1985 |
1-10 | 3 |
p. 227-240 14 p. |
artikel |
|
| 292 | Contact information for Guest Editors for the special issue of Discrete Applied Mathematics for CO2004: |
2008 |
1-10 | 3 |
p. 291- 1 p. |
artikel |
||
| 293 | Containment properties of product and power graphs |
Fernández, Antonio |
2007 |
1-10 | 3 |
p. 300-311 12 p. |
artikel |
|
| 294 | Contents |
2009 |
1-10 | 3 |
p. v-vi nvt p. |
artikel |
||
| 295 | Contents |
2010 |
1-10 | 3 |
p. vii- 1 p. |
artikel |
||
| 296 | Contents |
2003 |
1-10 | 3 |
p. viii-ix nvt p. |
artikel |
||
| 297 | Contents |
2003 |
1-10 | 3 |
p. ix-x nvt p. |
artikel |
||
| 298 | Contents |
2004 |
1-10 | 3 |
p. viii- 1 p. |
artikel |
||
| 299 | Contents |
2012 |
1-10 | 3 |
p. v-vi nvt p. |
artikel |
||
| 300 | Contents |
2004 |
1-10 | 3 |
p. ix- 1 p. |
artikel |
||
| 301 | Contents |
2004 |
1-10 | 3 |
p. vii-viii nvt p. |
artikel |
||
| 302 | Contents |
2005 |
1-10 | 3 |
p. ix- 1 p. |
artikel |
||
| 303 | Contents |
2006 |
1-10 | 3 |
p. vii-viii nvt p. |
artikel |
||
| 304 | Contents |
2005 |
1-10 | 3 |
p. ix- 1 p. |
artikel |
||
| 305 | Contents |
2005 |
1-10 | 3 |
p. vii-viii nvt p. |
artikel |
||
| 306 | Contents |
2007 |
1-10 | 3 |
p. vii-viii nvt p. |
artikel |
||
| 307 | Contents |
2008 |
1-10 | 3 |
p. v- 1 p. |
artikel |
||
| 308 | Contents all nrs. if necessary |
2003 |
1-10 | 3 |
p. iv-v nvt p. |
artikel |
||
| 309 | Cooperative phenomena in crystals and the probability of tied Borda count elections |
Marchant, Thierry |
2002 |
1-10 | 3 |
p. 265-271 7 p. |
artikel |
|
| 310 | Coordination without communication: the case of the flocking problem |
Gervasi, Vincenzo |
2004 |
1-10 | 3 |
p. 324-344 21 p. |
artikel |
|
| 311 | Cops and robbers in graphs with large girth and Cayley graphs |
Frankl, Peter |
1987 |
1-10 | 3 |
p. 301-305 5 p. |
artikel |
|
| 312 | Correction to probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem |
Franco, John |
1987 |
1-10 | 3 |
p. 295-299 5 p. |
artikel |
|
| 313 | Coset correlation of LR m-arrays |
Liu, Mulan |
1993 |
1-10 | 3 |
p. 263-273 11 p. |
artikel |
|
| 314 | Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs |
Shim, Sangho |
2002 |
1-10 | 3 |
p. 281-286 6 p. |
artikel |
|
| 315 | C-programming problems: a class of non-linear optimization problems |
Sniedovich, Moshe |
1984 |
1-10 | 3 |
p. 301-305 5 p. |
artikel |
|
| 316 | Crossing minimization in extended level drawings of graphs |
Bachmaier, Christian |
2010 |
1-10 | 3 |
p. 159-179 21 p. |
artikel |
|
| 317 | Crown reductions for the Minimum Weighted Vertex Cover problem |
Chlebík, Miroslav |
2008 |
1-10 | 3 |
p. 292-312 21 p. |
artikel |
|
| 318 | Cycle structure in discrete-density models |
Rogers, Thomas D. |
1982 |
1-10 | 3 |
p. 199-210 12 p. |
artikel |
|
| 319 | Cyclic matrices of weighted digraphs |
Riaza, Ricardo |
2012 |
1-10 | 3 |
p. 280-290 11 p. |
artikel |
|
| 320 | Data-independent neighborhood functions and strict local optima |
Armstrong, Derek E. |
2005 |
1-10 | 3 |
p. 233-243 11 p. |
artikel |
|
| 321 | Dating to marriage |
Csima, J. |
1993 |
1-10 | 3 |
p. 269-270 2 p. |
artikel |
|
| 322 | Decidability of the binary infinite Post Correspondence Problem |
Halava, Vesa |
2003 |
1-10 | 3 |
p. 521-526 6 p. |
artikel |
|
| 323 | Decision theory and discrete mathematics |
Fishburn, Peter C. |
1996 |
1-10 | 3 |
p. 209-221 13 p. |
artikel |
|
| 324 | Decomposable trees: a polynomial algorithm for tripodes |
Barth, D. |
2002 |
1-10 | 3 |
p. 205-216 12 p. |
artikel |
|
| 325 | Decomposing weighted digraphs into sums of chains |
Fishburn, P.C |
1987 |
1-10 | 3 |
p. 223-238 16 p. |
artikel |
|
| 326 | Decomposition of a bidirected graph into strongly connected components and its signed poset structure |
Ando, Kazutoshi |
1996 |
1-10 | 3 |
p. 237-248 12 p. |
artikel |
|
| 327 | Decomposition of bipartite graphs into special subgraphs |
Chen, Guantao |
2007 |
1-10 | 3 |
p. 400-404 5 p. |
artikel |
|
| 328 | Decompositions of graphs of functions and fast iterations of lookup tables |
Tsaban, Boaz |
2007 |
1-10 | 3 |
p. 386-393 8 p. |
artikel |
|
| 329 | Decreasing energy functions as a tool for studying threshold networks |
Goles-Chacc, Eric |
1985 |
1-10 | 3 |
p. 261-277 17 p. |
artikel |
|
| 330 | Description-meet compatible multiway dissimilarities |
Diatta, Jean |
2006 |
1-10 | 3 |
p. 493-507 15 p. |
artikel |
|
| 331 | Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter |
Soneoka, Terunao |
1990 |
1-10 | 3 |
p. 255-265 11 p. |
artikel |
|
| 332 | Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter: II |
Soneoka, Terunao |
1996 |
1-10 | 3 |
p. 267-279 13 p. |
artikel |
|
| 333 | Detection of structural inconsistency in systems of equations with degrees of freedom and its applications |
Sugihara, Ko¯kichi |
1985 |
1-10 | 3 |
p. 297-312 16 p. |
artikel |
|
| 334 | Deterministic and stochastic scheduling |
1981 |
1-10 | 3 |
p. 223- 1 p. |
artikel |
||
| 335 | Deterministic communication complexity of set intersection |
Tamm, Ulrich |
1995 |
1-10 | 3 |
p. 271-283 13 p. |
artikel |
|
| 336 | Diameter vulnerability of GC graphs |
Gómez, J. |
2003 |
1-10 | 3 |
p. 395-416 22 p. |
artikel |
|
| 337 | Diameter vulnerability of graphs |
Peyrat, C. |
1984 |
1-10 | 3 |
p. 245-250 6 p. |
artikel |
|
| 338 | Diameter-vulnerability of large bipartite digraphs |
Padró, C. |
1996 |
1-10 | 3 |
p. 239-248 10 p. |
artikel |
|
| 339 | Digital systems and algorithm implementation |
1983 |
1-10 | 3 |
p. 327- 1 p. |
artikel |
||
| 340 | Directed tree structure of the set of Kekulé patterns of generalized polyhex graphs |
Fuji, Zhang |
1991 |
1-10 | 3 |
p. 295-302 8 p. |
artikel |
|
| 341 | Discrete convexity: convexity for functions defined on discrete spaces |
Yüceer, Ümit |
2002 |
1-10 | 3 |
p. 297-304 8 p. |
artikel |
|
| 342 | Discrete-Euclidean operations |
Largeteau-Skapin, Gaëlle |
2009 |
1-10 | 3 |
p. 510-523 14 p. |
artikel |
|
| 343 | Distance-hereditary graphs are clique-perfect |
Lee, Chuan-Min |
2006 |
1-10 | 3 |
p. 525-536 12 p. |
artikel |
|
| 344 | Distance labeling schemes for well-separated graph classes |
Katz, Michal |
2005 |
1-10 | 3 |
p. 384-402 19 p. |
artikel |
|
| 345 | Distances between traveling salesman tours |
Mak, King-Tim |
1995 |
1-10 | 3 |
p. 281-291 11 p. |
artikel |
|
| 346 | Distributions on bicoloured binary trees arising from the principle of parsimony |
Steel, M.A. |
1993 |
1-10 | 3 |
p. 245-261 17 p. |
artikel |
|
| 347 | Dominating sets and domatic number of circular arc graphs |
Bonuccelli, Maurizio A. |
1985 |
1-10 | 3 |
p. 203-213 11 p. |
artikel |
|
| 348 | Dynamic storage allocation with known durations |
Naor, Joseph (Seffi) |
2000 |
1-10 | 3 |
p. 203-213 11 p. |
artikel |
|
| 349 | Dynamic storage allocation with limited compaction - complexity and some practical implications |
Błażewicz, J. |
1985 |
1-10 | 3 |
p. 241-253 13 p. |
artikel |
|
| 350 | Easy and hard bottleneck location problems |
Hsu, Wen-Lian |
1979 |
1-10 | 3 |
p. 209-215 7 p. |
artikel |
|
| 351 | Edge-pancyclicity of coupled graphs |
Lih, Ko-Wei |
2002 |
1-10 | 3 |
p. 259-264 6 p. |
artikel |
|
| 352 | Editorial Board |
2010 |
1-10 | 3 |
p. v-vi nvt p. |
artikel |
||
| 353 | Editorial Board |
2003 |
1-10 | 3 |
p. v-vii nvt p. |
artikel |
||
| 354 | Editorial Board |
2003 |
1-10 | 3 |
p. v-vii nvt p. |
artikel |
||
| 355 | Editorial Board |
2004 |
1-10 | 3 |
p. v-vii nvt p. |
artikel |
||
| 356 | Editorial Board |
2004 |
1-10 | 3 |
p. v-vii nvt p. |
artikel |
||
| 357 | Editorial Board |
2004 |
1-10 | 3 |
p. v-vi nvt p. |
artikel |
||
| 358 | Editorial Board |
2006 |
1-10 | 3 |
p. v-vi nvt p. |
artikel |
||
| 359 | Editorial Board |
2005 |
1-10 | 3 |
p. v-vii nvt p. |
artikel |
||
| 360 | Editorial Board |
2005 |
1-10 | 3 |
p. v-vii nvt p. |
artikel |
||
| 361 | Editorial Board |
2005 |
1-10 | 3 |
p. v-vi nvt p. |
artikel |
||
| 362 | Editorial Board |
2007 |
1-10 | 3 |
p. v-vi nvt p. |
artikel |
||
| 363 | Editorial Note |
2003 |
1-10 | 3 |
p. viii- 1 p. |
artikel |
||
| 364 | Effectifs des diverses sequences de polyedres 3-valents convexes ayant moins de 11 faces et de polyedres sans face triangulaire ayant de 11 a 14 faces |
Hucher, Monique |
1980 |
1-10 | 3 |
p. 255-257 3 p. |
artikel |
|
| 365 | Efficient algorithms for path partitions |
Williams, Craig |
1990 |
1-10 | 3 |
p. 267-276 10 p. |
artikel |
|
| 366 | Efficient bounds for the stable set, vertex cover and set packing problems |
Hochbaum, Dorit S. |
1983 |
1-10 | 3 |
p. 243-254 12 p. |
artikel |
|
| 367 | Efficient optimal equation formulation in lumped power-conserving systems |
Lamb, J.D. |
1998 |
1-10 | 3 |
p. 239-249 11 p. |
artikel |
|
| 368 | Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1 |
Opatrny, J |
2000 |
1-10 | 3 |
p. 237-254 18 p. |
artikel |
|
| 369 | End vertices in interval graphs |
Gimbel, John |
1988 |
1-10 | 3 |
p. 257-259 3 p. |
artikel |
|
| 370 | Energy ordering of catacondensed hexagonal systems |
Rada, Juan |
2005 |
1-10 | 3 |
p. 437-443 7 p. |
artikel |
|
| 371 | Enumeration of coloured plane trees with a given type partition |
Gordon, M. |
1980 |
1-10 | 3 |
p. 207-223 17 p. |
artikel |
|
| 372 | Enumeration of irreducible binary words |
Kobayashi, Yuji |
1988 |
1-10 | 3 |
p. 221-232 12 p. |
artikel |
|
| 373 | Equi-assignments and explicit solutions of a particular discrete optimization problem |
Volpentesta, A. |
1980 |
1-10 | 3 |
p. 261-265 5 p. |
artikel |
|
| 374 | Equitable colorings of Cartesian products of graphs |
Lin, Wu-Hsiung |
2012 |
1-10 | 3 |
p. 239-247 9 p. |
artikel |
|
| 375 | Equivalence classes of matchings and lattice-square designs |
Chen, William Y.-C. |
2005 |
1-10 | 3 |
p. 349-357 9 p. |
artikel |
|
| 376 | Erratum |
1996 |
1-10 | 3 |
p. 303- 1 p. |
artikel |
||
| 377 | Erratum to “Comparison of column generation models for channel assignment in cellular networks” |
Jaumard, Brigitte |
2002 |
1-10 | 3 |
p. 299-322 24 p. |
artikel |
|
| 378 | Erratum to “Intersecting codes and separating codes” |
Cohen, G. |
2003 |
1-10 | 3 |
p. 689-690 2 p. |
artikel |
|
| 379 | Erratum to: The lattice of closure systems, closure operators and implicational systems on a finite set: a survey |
Caspard, N. |
2005 |
1-10 | 3 |
p. 333- 1 p. |
artikel |
|
| 380 | Eulerian subgraphs and Hamilton-connected line graphs |
Li, Dengxin |
2005 |
1-10 | 3 |
p. 422-428 7 p. |
artikel |
|
| 381 | EURO V — TIMS XXV |
1981 |
1-10 | 3 |
p. 225-226 2 p. |
artikel |
||
| 382 | Evaluating mathematical programming |
1983 |
1-10 | 3 |
p. 329-330 2 p. |
artikel |
||
| 383 | Exact bounds on the order of the maximum clique of a graph |
Budinich, Marco |
2003 |
1-10 | 3 |
p. 535-543 9 p. |
artikel |
|
| 384 | Exact enumeration of acyclic deterministic automata |
Liskovets, Valery A. |
2006 |
1-10 | 3 |
p. 537-551 15 p. |
artikel |
|
| 385 | Exchanges procedures for timetabling problems |
Ferland, Jacques A. |
1992 |
1-10 | 3 |
p. 237-253 17 p. |
artikel |
|
| 386 | Expansion of layouts of complete binary trees into grids |
Lin, Y.-B. |
2003 |
1-10 | 3 |
p. 611-642 32 p. |
artikel |
|
| 387 | Extended finite automata over groups |
Mitrana, Victor |
2001 |
1-10 | 3 |
p. 287-300 14 p. |
artikel |
|
| 388 | Extracting pure network submatrices in linear programs using signed graphs |
Gülpinar, N |
2004 |
1-10 | 3 |
p. 359-372 14 p. |
artikel |
|
| 389 | Extremal length of an infinite network related to an accessible boundary point |
Kayano, Takashi |
1985 |
1-10 | 3 |
p. 275-285 11 p. |
artikel |
|
| 390 | Facets of linear signed order polytopes |
Fiorini, Samuel |
2003 |
1-10 | 3 |
p. 597-610 14 p. |
artikel |
|
| 391 | Facets of the three-index assignment polytope |
Balas, Egon |
1989 |
1-10 | 3 |
p. 201-229 29 p. |
artikel |
|
| 392 | Facial disjunctive programs and sequence of cutting-planes |
Blair, Charles E. |
1980 |
1-10 | 3 |
p. 173-179 7 p. |
artikel |
|
| 393 | Factorization of symmetric circulant matrices in finite fields |
Weinberger, Marcelo J. |
1990 |
1-10 | 3 |
p. 271-285 15 p. |
artikel |
|
| 394 | Faà di Bruno's formula, lattices, and partitions |
Encinas, L. Hernández |
2005 |
1-10 | 3 |
p. 246-255 10 p. |
artikel |
|
| 395 | Feature controlled adaptive difference operators |
Veelaert, Peter |
2009 |
1-10 | 3 |
p. 571-582 12 p. |
artikel |
|
| 396 | Finding a feasible course schedule using Tabu search |
Hertz, Alain |
1992 |
1-10 | 3 |
p. 255-270 16 p. |
artikel |
|
| 397 | Finding all essential terms of a characteristic maxpolynomial |
Burkard, Rainer E. |
2003 |
1-10 | 3 |
p. 367-380 14 p. |
artikel |
|
| 398 | Finding all the negative cycles in a directed graph |
Yamada, Takeo |
2002 |
1-10 | 3 |
p. 279-291 13 p. |
artikel |
|
| 399 | Finding a minimum independent dominating set in a permutation graph |
Atallah, Mikhail J. |
1988 |
1-10 | 3 |
p. 177-183 7 p. |
artikel |
|
| 400 | Finding complementary cycles in locally semicomplete digraphs |
Bang-Jensen, Jørgen |
2005 |
1-10 | 3 |
p. 245-256 12 p. |
artikel |
|
| 401 | Finding Hamiltonian cycles in Delaunay triangulations is NP-complete |
Dillencourt, Michael B. |
1996 |
1-10 | 3 |
p. 207-217 11 p. |
artikel |
|
| 402 | Finding regular subgraphs in both arbitrary and planar graphs |
Stewart, Iain A. |
1996 |
1-10 | 3 |
p. 223-235 13 p. |
artikel |
|
| 403 | Finding sharper distinctions for conditions of transitivity of the majority method |
Durand, Sylvain |
2003 |
1-10 | 3 |
p. 577-595 19 p. |
artikel |
|
| 404 | Finite isomorphically complete systems |
Gécseg, F. |
1992 |
1-10 | 3 |
p. 307-311 5 p. |
artikel |
|
| 405 | Fixed points and maximal independent sets in AND–OR networks |
Aracena, Julio |
2004 |
1-10 | 3 |
p. 277-288 12 p. |
artikel |
|
| 406 | Foreword |
de Werra, D. |
1992 |
1-10 | 3 |
p. 175-176 2 p. |
artikel |
|
| 407 | Formulas for cube roots in F 3 m |
Ahmadi, Omran |
2007 |
1-10 | 3 |
p. 260-270 11 p. |
artikel |
|
| 408 | Formulas for the number of ( n − 2 ) -gaps of binary objects in arbitrary dimension |
Brimkov, Valentin E. |
2009 |
1-10 | 3 |
p. 452-463 12 p. |
artikel |
|
| 409 | Forwarding indices of folded n -cubes |
Hou, Xinmin |
2005 |
1-10 | 3 |
p. 490-492 3 p. |
artikel |
|
| 410 | Fractional arboricity, strength, and principal partitions in graphs and matroids |
Catlin, Paul A. |
1992 |
1-10 | 3 |
p. 285-302 18 p. |
artikel |
|
| 411 | Fractional total colouring |
Ryan, Jennifer |
1990 |
1-10 | 3 |
p. 287-292 6 p. |
artikel |
|
| 412 | Functions that are read-once on a subset of their inputs |
Hellerstein, Lisa |
1993 |
1-10 | 3 |
p. 235-251 17 p. |
artikel |
|
| 413 | Fun-Sort—or the chaos of unordered binary search |
Biedl, Therese |
2004 |
1-10 | 3 |
p. 231-236 6 p. |
artikel |
|
| 414 | Fun with algorithms |
Lodi, Elena |
2004 |
1-10 | 3 |
p. 229-230 2 p. |
artikel |
|
| 415 | Generalized exponents of primitive symmetric digraphs |
Brualdi, Richard A. |
1997 |
1-10 | 3 |
p. 275-293 19 p. |
artikel |
|
| 416 | Generic iterative subset algorithms for discrete tomography |
Batenburg, K.J. |
2009 |
1-10 | 3 |
p. 438-451 14 p. |
artikel |
|
| 417 | Genetic local search in combinatorial optimization |
Kolen, Antoon |
1994 |
1-10 | 3 |
p. 273-284 12 p. |
artikel |
|
| 418 | Grammars with valuations — a discrete model for self-organization of biopolymers |
Dassow, Jürgen |
1982 |
1-10 | 3 |
p. 161-174 14 p. |
artikel |
|
| 419 | Graph domination, tabu search and the football pool problem |
Davies, Rowan |
1997 |
1-10 | 3 |
p. 217-228 12 p. |
artikel |
|
| 420 | Graphical partially ordered sets |
Borzacchini, L. |
1987 |
1-10 | 3 |
p. 247-262 16 p. |
artikel |
|
| 421 | Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs |
Uehara, Ryuhei |
2005 |
1-10 | 3 |
p. 479-482 4 p. |
artikel |
|
| 422 | Graph representations of a bicircular matroid |
Neudauer, Nancy Ann |
2002 |
1-10 | 3 |
p. 249-262 14 p. |
artikel |
|
| 423 | Graphs, networks, and linear unbiased estimates |
Constantine, Gregory M. |
2003 |
1-10 | 3 |
p. 381-393 13 p. |
artikel |
|
| 424 | Group testing and fault detection for replicated files |
Hwang, F.K. |
2002 |
1-10 | 3 |
p. 231-242 12 p. |
artikel |
|
| 425 | Group-theoretical algorithms and graph isomorphism |
1983 |
1-10 | 3 |
p. 327-328 2 p. |
artikel |
||
| 426 | Guide for authors |
2003 |
1-10 | 3 |
p. 694-697 4 p. |
artikel |
||
| 427 | Guide for authors |
2003 |
1-10 | 3 |
p. I-IV nvt p. |
artikel |
||
| 428 | Guide for authors |
2004 |
1-10 | 3 |
p. I-IV nvt p. |
artikel |
||
| 429 | Guide for authors |
2004 |
1-10 | 3 |
p. I-IV nvt p. |
artikel |
||
| 430 | Guide for authors |
2004 |
1-10 | 3 |
p. I-IV nvt p. |
artikel |
||
| 431 | Guide for authors |
2006 |
1-10 | 3 |
p. I-IV nvt p. |
artikel |
||
| 432 | Guide for authors |
2005 |
1-10 | 3 |
p. I-IV nvt p. |
artikel |
||
| 433 | Guide for authors |
2005 |
1-10 | 3 |
p. I-IV nvt p. |
artikel |
||
| 434 | Guide for authors |
2005 |
1-10 | 3 |
p. I-IV nvt p. |
artikel |
||
| 435 | Half-integral five-terminus flows |
Karzanov, A.V. |
1987 |
1-10 | 3 |
p. 263-278 16 p. |
artikel |
|
| 436 | Hamiltonian colorings of graphs |
Chartrand, Gary |
2005 |
1-10 | 3 |
p. 257-272 16 p. |
artikel |
|
| 437 | Hardness of approximation for non-overlapping local alignments |
Nagashima, Hiroyuki |
2004 |
1-10 | 3 |
p. 293-309 17 p. |
artikel |
|
| 438 | h -Assignments of simplicial complexes and reverse search |
Moriyama, Sonoko |
2006 |
1-10 | 3 |
p. 594-597 4 p. |
artikel |
|
| 439 | Heights of representative systems |
Fishburn, Peter C. |
1979 |
1-10 | 3 |
p. 181-199 19 p. |
artikel |
|
| 440 | Heredity of the index of convergence of the line digraph |
Yan, Weigen |
2003 |
1-10 | 3 |
p. 681-688 8 p. |
artikel |
|
| 441 | Heuristics and meta-heuristics for 2-layer straight line crossing minimization |
Martı́, Rafael |
2003 |
1-10 | 3 |
p. 665-678 14 p. |
artikel |
|
| 442 | Heuristics for the minimum rectilinear Steiner tree problem: new algorithms and a computational study |
De Souza, Cid Carvalho |
|
1-10 | 3 |
p. 205-220 |
artikel |
|
| 443 | Hexagonal systems with fixed bonds |
Zhang, Fuji |
1993 |
1-10 | 3 |
p. 285-296 12 p. |
artikel |
|
| 444 | Hexagonal systems with forcing single edges |
Li, Xueliang |
1997 |
1-10 | 3 |
p. 295-301 7 p. |
artikel |
|
| 445 | Higher dimensional restricted lattice paths with diagonal steps |
Kaparthi, Shashidhar |
1991 |
1-10 | 3 |
p. 279-289 11 p. |
artikel |
|
| 446 | Higher order connectivity index of starlike trees |
Rada, Juan |
2002 |
1-10 | 3 |
p. 287-295 9 p. |
artikel |
|
| 447 | History of mathematical programming, a collection of personal reminiscences |
1992 |
1-10 | 3 |
p. 298- 1 p. |
artikel |
||
| 448 | How do I marry thee? Let me count the ways |
Benjamin, Arthur T. |
1995 |
1-10 | 3 |
p. 285-292 8 p. |
artikel |
|
| 449 | IFC (non-1st issue/vol) |
2003 |
1-10 | 3 |
p. IFC- 1 p. |
artikel |
||
| 450 | (i, j) competition graphs |
Hefner, Kim A.S. |
1991 |
1-10 | 3 |
p. 241-262 22 p. |
artikel |
|
| 451 | Improved algorithms for several network location problems with equality measures |
Mesa, Juan A. |
2003 |
1-10 | 3 |
p. 437-448 12 p. |
artikel |
|
| 452 | Incidence graphs of biacyclic hypergraphs |
Dragan, Feodor F. |
1996 |
1-10 | 3 |
p. 259-266 8 p. |
artikel |
|
| 453 | Index |
2000 |
1-10 | 3 |
p. 275-276 2 p. |
artikel |
||
| 454 | Index |
2000 |
1-10 | 3 |
p. 237-238 2 p. |
artikel |
||
| 455 | Index |
2000 |
1-10 | 3 |
p. 267- 1 p. |
artikel |
||
| 456 | Integral polyhedra related to integer multicommodity flows on a cycle |
Lee, Kyungsik |
2010 |
1-10 | 3 |
p. 235-238 4 p. |
artikel |
|
| 457 | Interference patterns in bijective colorings of 2-regular graphs |
Fishburn, Peter |
2000 |
1-10 | 3 |
p. 189-204 16 p. |
artikel |
|
| 458 | Interior and exterior functions of Boolean functions |
Makino, Kazuhisa |
1996 |
1-10 | 3 |
p. 209-231 23 p. |
artikel |
|
| 459 | Interior and exterior functions of positive Boolean functions |
Makino, Kazuhisa |
2003 |
1-10 | 3 |
p. 417-436 20 p. |
artikel |
|
| 460 | Intersection-union systems |
Markowsky, George |
1983 |
1-10 | 3 |
p. 255-262 8 p. |
artikel |
|
| 461 | Interval data minmax regret network optimization problems |
Averbakh, Igor |
2004 |
1-10 | 3 |
p. 289-301 13 p. |
artikel |
|
| 462 | Inverting graphs of rectangular matrices |
Greenberg, Harvey J. |
1984 |
1-10 | 3 |
p. 255-265 11 p. |
artikel |
|
| 463 | Iterative behaviour of one-dimensional threshold automata |
Goles, E. |
1984 |
1-10 | 3 |
p. 319-322 4 p. |
artikel |
|
| 464 | Jump number of dags having Dilworth number 2 |
Chein, M. |
1984 |
1-10 | 3 |
p. 243-250 8 p. |
artikel |
|
| 465 | k-connectivity and decomposition of graphs into forests |
Nishizeki, Takao |
1994 |
1-10 | 3 |
p. 295-301 7 p. |
artikel |
|
| 466 | Key storage in secure networks |
Mitchell, Chris J. |
1988 |
1-10 | 3 |
p. 215-228 14 p. |
artikel |
|
| 467 | Knots in random walks |
Pippenger, Nicholas |
1989 |
1-10 | 3 |
p. 273-278 6 p. |
artikel |
|
| 468 | k-p-Infix codes and semaphore codes |
Long, Dongyang |
2001 |
1-10 | 3 |
p. 237-252 16 p. |
artikel |
|
| 469 | Labeled versus unlabeled distributed Cayley networks |
Kranakis, Evangelos |
1995 |
1-10 | 3 |
p. 223-236 14 p. |
artikel |
|
| 470 | Landmarks in graphs |
Khuller, Samir |
1996 |
1-10 | 3 |
p. 217-229 13 p. |
artikel |
|
| 471 | Largest polygons with vertices in a given finite set |
Cordes, Craig |
1986 |
1-10 | 3 |
p. 255-262 8 p. |
artikel |
|
| 472 | Lattice hypercube designs |
Fu, Tung-Shan |
2003 |
1-10 | 3 |
p. 673-680 8 p. |
artikel |
|
| 473 | Least-cost partition algorithms |
Marlowe Jr., Thomas J. |
1988 |
1-10 | 3 |
p. 215-239 25 p. |
artikel |
|
| 474 | Letter to the editor |
Fishburn, Peter C. |
1987 |
1-10 | 3 |
p. 321- 1 p. |
artikel |
|
| 475 | LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem |
Dragan, Feodor F |
2000 |
1-10 | 3 |
p. 191-207 17 p. |
artikel |
|
| 476 | Lifting cover inequalities for the precedence-constrained knapsack problem |
Park, Kyungchul |
1997 |
1-10 | 3 |
p. 219-241 23 p. |
artikel |
|
| 477 | Linear orders and semiorders close to an interval order |
Roubens, Marc |
1983 |
1-10 | 3 |
p. 311-314 4 p. |
artikel |
|
| 478 | Linear recognition of pseudo-split graphs |
Maffray, Frédéric |
1994 |
1-10 | 3 |
p. 307-312 6 p. |
artikel |
|
| 479 | Linear recursion properties of uncorrelated binary sequences |
Bromfield, A.J. |
1990 |
1-10 | 3 |
p. 187-193 7 p. |
artikel |
|
| 480 | Linear splicing and syntactic monoid |
Bonizzoni, P. |
2006 |
1-10 | 3 |
p. 452-470 19 p. |
artikel |
|
| 481 | Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under l ∞-distance |
Ko, M.T. |
1992 |
1-10 | 3 |
p. 397-410 14 p. |
artikel |
|
| 482 | Linear trees and RNA secondary structure |
Schmitt, William R. |
1994 |
1-10 | 3 |
p. 317-323 7 p. |
artikel |
|
| 483 | List of referees |
2003 |
1-10 | 3 |
p. 539-566 28 p. |
artikel |
||
| 484 | List T-colorings of graphs |
Tesman, Barry A. |
|
1-10 | 3 |
p. 277-289 |
artikel |
|
| 485 | Local medians in chordal graphs |
Wittenberg, Heiko |
1990 |
1-10 | 3 |
p. 287-296 10 p. |
artikel |
|
| 486 | Locating service centers with precedence constraints |
Kaufman, Y. |
1993 |
1-10 | 3 |
p. 251-261 11 p. |
artikel |
|
| 487 | Low complexity normal bases |
Ash, David W. |
1989 |
1-10 | 3 |
p. 191-210 20 p. |
artikel |
|
| 488 | Low complexity normal bases for F 2 mn |
Séguin, Gérald E. |
1990 |
1-10 | 3 |
p. 309-312 4 p. |
artikel |
|
| 489 | Lower bounds and algorithms for the 2-dimensional vector packing problem |
Caprara, Alberto |
2001 |
1-10 | 3 |
p. 231-262 32 p. |
artikel |
|
| 490 | Lower bounds on two-terminal network reliability |
Brecht, Timothy B. |
1988 |
1-10 | 3 |
p. 185-198 14 p. |
artikel |
|
| 491 | Lower probabilities and function representation |
Kämpke, Thomas |
1996 |
1-10 | 3 |
p. 227-243 17 p. |
artikel |
|
| 492 | Making the components of a graph k -connected |
Nikiforov, V. |
2007 |
1-10 | 3 |
p. 410-415 6 p. |
artikel |
|
| 493 | Master index to volumes 121-130 |
2003 |
1-10 | 3 |
p. 581-594 14 p. |
artikel |
||
| 494 | Matching parentheses in parallel |
Levcopoulos, Christos |
1992 |
1-10 | 3 |
p. 423-431 9 p. |
artikel |
|
| 495 | Matching polynomials of two classes of graphs |
Zhang, Fu-ji |
1988 |
1-10 | 3 |
p. 253-260 8 p. |
artikel |
|
| 496 | Maximal chordal subgraphs |
Dearing, P.M. |
1988 |
1-10 | 3 |
p. 181-190 10 p. |
artikel |
|
| 497 | Maximal independent sets in caterpillar graphs |
Ortiz, Carmen |
2012 |
1-10 | 3 |
p. 259-266 8 p. |
artikel |
|
| 498 | Maximal irredundant functions |
Fricke, G.H. |
1996 |
1-10 | 3 |
p. 267-277 11 p. |
artikel |
|
| 499 | Maximal value of the zeroth-order Randić index |
Pavlović, Ljiljana |
2003 |
1-10 | 3 |
p. 615-626 12 p. |
artikel |
|
| 500 | Maximizing a lower bound on the computational complexity |
Gati, Georg |
1982 |
1-10 | 3 |
p. 175-180 6 p. |
artikel |
|
| 501 | Maximum-entropy remote sampling |
Anstreicher, Kurt M. |
2001 |
1-10 | 3 |
p. 211-226 16 p. |
artikel |
|
| 502 | Maximum induced matching problem on hhd-free graphs |
Krishnamurthy, Chandra Mohan |
2012 |
1-10 | 3 |
p. 224-230 7 p. |
artikel |
|
| 503 | Maximum path digraphs |
Delivorias, Panayotis N. |
1994 |
1-10 | 3 |
p. 221-237 17 p. |
artikel |
|
| 504 | Measuring the vulnerability for classes of intersection graphs |
Kratsch, Dieter |
1997 |
1-10 | 3 |
p. 259-270 12 p. |
artikel |
|
| 505 | Meyniel weakly triangulated graphs — I: Co-perfect orderability |
Hayward, Ryan B. |
1997 |
1-10 | 3 |
p. 199-210 12 p. |
artikel |
|
| 506 | Minimal arithmetic thickness connecting discrete planes |
Jamet, Damien |
2009 |
1-10 | 3 |
p. 500-509 10 p. |
artikel |
|
| 507 | Minimization of maximum absolute deviation in integers |
Zeitlin, Zeev |
1981 |
1-10 | 3 |
p. 203-220 18 p. |
artikel |
|
| 508 | Minimization of ordered, symmetric half-products |
Kubiak, Wieslaw |
2005 |
1-10 | 3 |
p. 287-300 14 p. |
artikel |
|
| 509 | Minimizing irregularities in sports schedules using graph theory |
de Werra, D. |
1982 |
1-10 | 3 |
p. 217-226 10 p. |
artikel |
|
| 510 | Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem |
Kravchenko, Svetlana A. |
2000 |
1-10 | 3 |
p. 209-217 9 p. |
artikel |
|
| 511 | Minimizing the weighted number of tardy task units |
Leung, Joseph Y.-T. |
1994 |
1-10 | 3 |
p. 307-316 10 p. |
artikel |
|
| 512 | Minimum-cost line broadcast in paths |
Fujita, Satoshi |
1997 |
1-10 | 3 |
p. 255-268 14 p. |
artikel |
|
| 513 | Minimum decomposition of a digital surface into digital plane segments is NP-hard |
Sivignon, Isabelle |
2009 |
1-10 | 3 |
p. 558-570 13 p. |
artikel |
|
| 514 | Minimum restricted diameter spanning trees |
Hassin, Refael |
2004 |
1-10 | 3 |
p. 343-357 15 p. |
artikel |
|
| 515 | Model building in mathematical programming |
1992 |
1-10 | 3 |
p. 298-299 2 p. |
artikel |
||
| 516 | Modelling and solving an acyclic multi-period timetabling problem |
Čangalović, Mirjana |
1992 |
1-10 | 3 |
p. 177-195 19 p. |
artikel |
|
| 517 | Monotonicity and efficient computation of optimal dichotomous search |
Hassin, R. |
1993 |
1-10 | 3 |
p. 221-234 14 p. |
artikel |
|
| 518 | More ZCPS-Wh(v) and several new infinite classes of Z-cyclic whist tournaments |
Finizio, Norman J. |
1998 |
1-10 | 3 |
p. 193-202 10 p. |
artikel |
|
| 519 | m-Recognizability of sets closed under certain affine functions |
Klarner, David A. |
1988 |
1-10 | 3 |
p. 207-214 8 p. |
artikel |
|
| 520 | Multicolor routing in the undirected hypercube |
Gu, Qian-Ping |
2000 |
1-10 | 3 |
p. 169-181 13 p. |
artikel |
|
| 521 | Multiplicative circulant networks topological properties and communication algorithms |
Stojmenović, Ivan |
1997 |
1-10 | 3 |
p. 281-305 25 p. |
artikel |
|
| 522 | Multiprocessor scheduling: combining LPT and MULTIFIT |
Lee, Chung-Yee |
1988 |
1-10 | 3 |
p. 233-242 10 p. |
artikel |
|
| 523 | Neighbour-connectivity in regular graphs |
Gunther, G. |
1985 |
1-10 | 3 |
p. 233-243 11 p. |
artikel |
|
| 524 | Neither reading few bits twice nor reading illegally helps much |
Jukna, S. |
1998 |
1-10 | 3 |
p. 223-238 16 p. |
artikel |
|
| 525 | Nested chain partitions of LYM posets |
Wang, Yi |
2005 |
1-10 | 3 |
p. 493-497 5 p. |
artikel |
|
| 526 | N-free posets as generalizations of series-parallel posets |
Habib, M. |
1985 |
1-10 | 3 |
p. 279-291 13 p. |
artikel |
|
| 527 | Niche graphs |
Cable, Charles |
1989 |
1-10 | 3 |
p. 231-241 11 p. |
artikel |
|
| 528 | No-hole L(2,1)-colorings |
Fishburn, Peter C. |
2003 |
1-10 | 3 |
p. 513-519 7 p. |
artikel |
|
| 529 | Note on complexity of computing the domination of binary systems |
Chernyak, A.A. |
1997 |
1-10 | 3 |
p. 289-295 7 p. |
artikel |
|
| 530 | NP-hardness of shop-scheduling problems with three jobs |
Sotskov, Yu.N. |
1995 |
1-10 | 3 |
p. 237-266 30 p. |
artikel |
|
| 531 | Object recognition by computer: the role of geometric constraints |
1992 |
1-10 | 3 |
p. 299-300 2 p. |
artikel |
||
| 532 | Occupation times for two-state Markov chains |
Bhattacharya, Samir K. |
1980 |
1-10 | 3 |
p. 249-250 2 p. |
artikel |
|
| 533 | On a class of completable partial edge-colourings |
Rosa, Alexander |
1992 |
1-10 | 3 |
p. 293-299 7 p. |
artikel |
|
| 534 | On a conjecture of Foulds and Robinson about deltahedra |
Ning, Qi |
1987 |
1-10 | 3 |
p. 305-308 4 p. |
artikel |
|
| 535 | On acyclic systems with minimal Hosoya index |
Hou, Yaoping |
2002 |
1-10 | 3 |
p. 251-257 7 p. |
artikel |
|
| 536 | On a game of policemen and robber |
Maamoun, M. |
1987 |
1-10 | 3 |
p. 307-309 3 p. |
artikel |
|
| 537 | On a universal chain problem |
Dyer, Martin |
1994 |
1-10 | 3 |
p. 219-229 11 p. |
artikel |
|
| 538 | On broadcasting multiple messages in a d-dimensional grid |
Roditty, Y. |
1997 |
1-10 | 3 |
p. 277-284 8 p. |
artikel |
|
| 539 | On certain classes of fractional matchings |
Mühlbacher, J.R. |
1984 |
1-10 | 3 |
p. 235-244 10 p. |
artikel |
|
| 540 | On certain Hamiltonian inner triangulations |
Cimikowski, Robert J. |
1993 |
1-10 | 3 |
p. 185-195 11 p. |
artikel |
|
| 541 | On constant discrete programming problems |
Gabovich, E.Ya. |
1980 |
1-10 | 3 |
p. 193-205 13 p. |
artikel |
|
| 542 | On cube-free ω-words generated by binary morphisms |
Karhumäki, Juhani |
1983 |
1-10 | 3 |
p. 279-297 19 p. |
artikel |
|
| 543 | On cutting a few vertices from a graph |
Feige, Uriel |
2003 |
1-10 | 3 |
p. 643-649 7 p. |
artikel |
|
| 544 | On deciding switching equivalence of graphs |
Colbourn, Charles J. |
1980 |
1-10 | 3 |
p. 181-184 4 p. |
artikel |
|
| 545 | On degeneracy in linear complementarity problems |
Saviozzi, G. |
1985 |
1-10 | 3 |
p. 311-314 4 p. |
artikel |
|
| 546 | On equivalent knapsack problems |
Greenberg, H. |
1986 |
1-10 | 3 |
p. 263-268 6 p. |
artikel |
|
| 547 | On hyperedge replacement and BNLC graph grammars |
Vogler, Walter |
1993 |
1-10 | 3 |
p. 253-273 21 p. |
artikel |
|
| 548 | On infinite words generated by polynomial D0L systems |
Honkala, Juha |
2002 |
1-10 | 3 |
p. 297-305 9 p. |
artikel |
|
| 549 | On k-repetition freeness of length uniform morphisms over a binary alphabet |
Keränen, Veikko |
1984 |
1-10 | 3 |
p. 297-300 4 p. |
artikel |
|
| 550 | On-line algorithms for the channel assignment problem in cellular networks |
Crescenzi, Pilu |
2004 |
1-10 | 3 |
p. 237-266 30 p. |
artikel |
|
| 551 | Online scheduling on three uniform machines |
Cai, Sheng-Yi |
2012 |
1-10 | 3 |
p. 291-302 12 p. |
artikel |
|
| 552 | On minimizing width in linear layouts |
Makedon, Fillia |
1989 |
1-10 | 3 |
p. 243-265 23 p. |
artikel |
|
| 553 | On permutations of wires and states |
Brown, Frank M. |
1984 |
1-10 | 3 |
p. 231-241 11 p. |
artikel |
|
| 554 | On powers of circular arc graphs and proper circular arc graphs |
Flotow, Carsten |
1996 |
1-10 | 3 |
p. 199-207 9 p. |
artikel |
|
| 555 | On ϵ productions for terminals in E0L forms |
Ainhirn, W. |
1979 |
1-10 | 3 |
p. 155-166 12 p. |
artikel |
|
| 556 | On (q, 1)-subnormal q-ary covering codes |
Honkala, Iiro |
1994 |
1-10 | 3 |
p. 213-221 9 p. |
artikel |
|
| 557 | On reformulated Zagreb indices |
Ilić, Aleksandar |
2012 |
1-10 | 3 |
p. 204-209 6 p. |
artikel |
|
| 558 | On regularity of languages generated by copying systems |
Ehrenfeucht, A. |
1984 |
1-10 | 3 |
p. 313-317 5 p. |
artikel |
|
| 559 | On searching strategies, parallel questions, and delayed answers |
Cicalese, Ferdinando |
2004 |
1-10 | 3 |
p. 247-262 16 p. |
artikel |
|
| 560 | On sequential diagnosis of multiprocessor systems |
Yamada, T. |
2005 |
1-10 | 3 |
p. 311-342 32 p. |
artikel |
|
| 561 | On sheffer symmetric functions in three-valued logic |
Stojmenović, Ivan |
1988 |
1-10 | 3 |
p. 267-274 8 p. |
artikel |
|
| 562 | On some structural properties of a subclass of ∞-regular languages |
Mezník, Ivan |
1987 |
1-10 | 3 |
p. 315-319 5 p. |
artikel |
|
| 563 | On some topological indices of the tensor products of graphs |
Pattabiraman, K. |
2012 |
1-10 | 3 |
p. 267-279 13 p. |
artikel |
|
| 564 | On spaced seeds for similarity search |
Keich, Uri |
2004 |
1-10 | 3 |
p. 253-263 11 p. |
artikel |
|
| 565 | On spanning subgraphs of 4-connected planar graphs |
Rosenfeld, Moshe |
1989 |
1-10 | 3 |
p. 279-287 9 p. |
artikel |
|
| 566 | On spanning 2-trees in a graph |
Cai, Leizhen |
1997 |
1-10 | 3 |
p. 203-216 14 p. |
artikel |
|
| 567 | On sparse languages L such that LL = Σ |
Enflo, Per |
1994 |
1-10 | 3 |
p. 275-285 11 p. |
artikel |
|
| 568 | On strongly connected digraphs with bounded cycle length |
Khuller, Samir |
1996 |
1-10 | 3 |
p. 281-289 9 p. |
artikel |
|
| 569 | On subwords of infinite words |
Ilie, Lucian |
1995 |
1-10 | 3 |
p. 277-279 3 p. |
artikel |
|
| 570 | On sum coloring of graphs |
Salavatipour, Mohammad R |
2003 |
1-10 | 3 |
p. 477-488 12 p. |
artikel |
|
| 571 | On the b-chromatic number of Kneser graphs |
Hajiabolhassan, Hossein |
2010 |
1-10 | 3 |
p. 232-234 3 p. |
artikel |
|
| 572 | On the combinatorics of leftist trees |
Nogueira, P. |
2001 |
1-10 | 3 |
p. 253-278 26 p. |
artikel |
|
| 573 | On the complexity of a family of generalized matching problems |
Lai, Ten-Hwang |
1985 |
1-10 | 3 |
p. 303-318 16 p. |
artikel |
|
| 574 | On the complexity of exchange-stable roommates |
Cechlárová, Katarı́na |
2002 |
1-10 | 3 |
p. 279-287 9 p. |
artikel |
|
| 575 | On the complexity of recognizing a class of perfectly orderable graphs |
Hoàng, Chính T. |
1996 |
1-10 | 3 |
p. 219-226 8 p. |
artikel |
|
| 576 | On the computational complexity of strong edge coloring |
Mahdian, Mohammad |
2002 |
1-10 | 3 |
p. 239-248 10 p. |
artikel |
|
| 577 | On the computational complexity of upper fractional domination |
Cheston, Grant A. |
1990 |
1-10 | 3 |
p. 195-207 13 p. |
artikel |
|
| 578 | On the computation of pfaffians |
Galbiati, G. |
1994 |
1-10 | 3 |
p. 269-275 7 p. |
artikel |
|
| 579 | On the context-free production complexity of finite languages |
Tuza, Zsolt |
1987 |
1-10 | 3 |
p. 293-304 12 p. |
artikel |
|
| 580 | On the domination search number |
Fomin, Fedor V |
2003 |
1-10 | 3 |
p. 565-580 16 p. |
artikel |
|
| 581 | On the general routing polytope |
Reinelt, Gerhard |
2008 |
1-10 | 3 |
p. 368-384 17 p. |
artikel |
|
| 582 | On the geometric separability of Boolean functions |
Hegedüs, Tibor |
1996 |
1-10 | 3 |
p. 205-218 14 p. |
artikel |
|
| 583 | On the growth of components with non-fixed excesses |
Baert, Anne-Elisabeth |
2003 |
1-10 | 3 |
p. 487-493 7 p. |
artikel |
|
| 584 | On the growth of random knapsacks |
Mamer, John W. |
1990 |
1-10 | 3 |
p. 223-230 8 p. |
artikel |
|
| 585 | On the joint distribution of the insertion path length and the number of comparisons in search trees |
Mahmoud, Hosam M. |
1988 |
1-10 | 3 |
p. 243-251 9 p. |
artikel |
|
| 586 | On the k-coloring of intervals |
Carlisle, Martin C. |
1995 |
1-10 | 3 |
p. 225-235 11 p. |
artikel |
|
| 587 | On the maximum empty rectangle problem |
Naamad, A |
1984 |
1-10 | 3 |
p. 267-277 11 p. |
artikel |
|
| 588 | On the mean radius of permutation polytopes |
Robb, Raymond |
2005 |
1-10 | 3 |
p. 358-367 10 p. |
artikel |
|
| 589 | On the minimum average distance of binary codes: linear programming approach |
Fu, Fang-Wei |
2001 |
1-10 | 3 |
p. 263-281 19 p. |
artikel |
|
| 590 | On the number of cycles possible in digraphs with large girth |
Allender, Eric W. |
1985 |
1-10 | 3 |
p. 211-225 15 p. |
artikel |
|
| 591 | On the number of generators for transeunt triangles |
Butler, J.T. |
2001 |
1-10 | 3 |
p. 309-316 8 p. |
artikel |
|
| 592 | On the number of range queries in k-space |
Saxe, James B. |
1979 |
1-10 | 3 |
p. 217-225 9 p. |
artikel |
|
| 593 | On the occurrence of null clauses in random instances of satisfiability |
Franco, John |
1993 |
1-10 | 3 |
p. 203-209 7 p. |
artikel |
|
| 594 | On the orderability problem for PLA folding |
Ravi, S.S. |
1989 |
1-10 | 3 |
p. 317-320 4 p. |
artikel |
|
| 595 | On the pathwidth of chordal graphs |
Gustedt, Jens |
|
1-10 | 3 |
p. 233-248 |
artikel |
|
| 596 | On the P 4-components of graphs |
Raschle, Thomas |
2000 |
1-10 | 3 |
p. 215-235 21 p. |
artikel |
|
| 597 | On the perfect matching of disjoint compact sets by noncrossing line segments in R n |
Hosono, Kiyoshi |
2002 |
1-10 | 3 |
p. 223-238 16 p. |
artikel |
|
| 598 | On the probabilistic minimum coloring and minimum k -coloring |
Murat, Cécile |
2006 |
1-10 | 3 |
p. 564-586 23 p. |
artikel |
|
| 599 | On the ranks of O’N and Ly |
Ali, Faryad |
2007 |
1-10 | 3 |
p. 394-399 6 p. |
artikel |
|
| 600 | On the reduction method for integer linear programs, II |
Elimam, A.A. |
1985 |
1-10 | 3 |
p. 241-260 20 p. |
artikel |
|
| 601 | On the relative distances of nine or ten points in the boundary of a plane convex body |
Su, Zhanjun |
2012 |
1-10 | 3 |
p. 303-305 3 p. |
artikel |
|
| 602 | On the Steiner median of a tree |
Beineke, Lowell W. |
1996 |
1-10 | 3 |
p. 249-258 10 p. |
artikel |
|
| 603 | On the subword equivalence problem for morphic words |
Fagnot, Isabelle |
1997 |
1-10 | 3 |
p. 231-253 23 p. |
artikel |
|
| 604 | On the succinct representation of graphs |
Turán, György |
1984 |
1-10 | 3 |
p. 289-294 6 p. |
artikel |
|
| 605 | On the tiling by translation problem |
Brlek, S. |
2009 |
1-10 | 3 |
p. 464-475 12 p. |
artikel |
|
| 606 | On the variance of average distance of subsets in the Hamming space |
Fu, Fang-Wei |
2005 |
1-10 | 3 |
p. 465-478 14 p. |
artikel |
|
| 607 | On the X-join decomposition for undirected graphs |
Habib, M. |
1979 |
1-10 | 3 |
p. 201-207 7 p. |
artikel |
|
| 608 | Open problems around exact algorithms |
Woeginger, Gerhard J. |
2008 |
1-10 | 3 |
p. 397-405 9 p. |
artikel |
|
| 609 | Openshop scheduling with machine dependent processing times |
Dror, Moshe |
1992 |
1-10 | 3 |
p. 197-205 9 p. |
artikel |
|
| 610 | Optimal algorithms for constructing knight's tours on arbitrary n × m chessboards |
Lin, Shun-Shii |
2005 |
1-10 | 3 |
p. 219-232 14 p. |
artikel |
|
| 611 | Optimal alphabetic binary tree for a nonregular cost function |
Cun-Quan, Zhang |
1984 |
1-10 | 3 |
p. 307-312 6 p. |
artikel |
|
| 612 | Optimal and near-optimal broadcast in random graphs |
Scheinerman, Edward R. |
1989 |
1-10 | 3 |
p. 289-297 9 p. |
artikel |
|
| 613 | Optimal computation of census functions in the postal model |
Bar-Noy, Amotz |
1995 |
1-10 | 3 |
p. 213-222 10 p. |
artikel |
|
| 614 | Optimal covering designs: complexity results and new bounds |
Crescenzi, Pilu |
2004 |
1-10 | 3 |
p. 281-290 10 p. |
artikel |
|
| 615 | Optimal detection of two counterfeit coins with two-arms balance |
Wen-An, Liu |
2004 |
1-10 | 3 |
p. 267-291 25 p. |
artikel |
|
| 616 | Optimal K-secure graphs |
Gunther, G. |
1980 |
1-10 | 3 |
p. 225-231 7 p. |
artikel |
|
| 617 | Optimal multiple interval assignments in frequency assignment and traffic phasing |
Raychaudhuri, Arundhati |
1992 |
1-10 | 3 |
p. 319-332 14 p. |
artikel |
|
| 618 | Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM |
Sajith, G. |
1996 |
1-10 | 3 |
p. 249-265 17 p. |
artikel |
|
| 619 | Optimal separable partitioning in the plane |
Benelli, Michal |
1995 |
1-10 | 3 |
p. 215-224 10 p. |
artikel |
|
| 620 | Optimal stopping in a search for a vertex with full degree in a random graph |
Przykucki, Michał |
2012 |
1-10 | 3 |
p. 339-343 5 p. |
artikel |
|
| 621 | Optimal strategies for some team games |
Katoh, Naoki |
1992 |
1-10 | 3 |
p. 275-291 17 p. |
artikel |
|
| 622 | O ( 1 ) query time algorithm for all pairs shortest distances on permutation graphs |
Sprague, Alan P. |
2007 |
1-10 | 3 |
p. 365-373 9 p. |
artikel |
|
| 623 | Orbits of Boolean functions |
Gorodkin, J. |
1997 |
1-10 | 3 |
p. 269-275 7 p. |
artikel |
|
| 624 | Orientable convexity, geodetic and hull numbers in graphs |
Farrugia, Alastair |
2005 |
1-10 | 3 |
p. 256-262 7 p. |
artikel |
|
| 625 | Orientations with single source and sink |
Szwarcfiter, Jayme L. |
1985 |
1-10 | 3 |
p. 313-321 9 p. |
artikel |
|
| 626 | Orthogonal weighted linear L 1 and L ∞ approximation and applications |
Houle, Michael E. |
1993 |
1-10 | 3 |
p. 217-232 16 p. |
artikel |
|
| 627 | Oscillations spatio-temporelles engendrees par un automate cellulaire |
Allouche, Jean-Paul |
1984 |
1-10 | 3 |
p. 215-254 40 p. |
artikel |
|
| 628 | Overlaps help: Improved bounds for group testing with interval queries |
Cicalese, Ferdinando |
2007 |
1-10 | 3 |
p. 288-299 12 p. |
artikel |
|
| 629 | Packing problems in edge-colored graphs |
Hell, P. |
1994 |
1-10 | 3 |
p. 295-306 12 p. |
artikel |
|
| 630 | Pancyclicity and NP-completeness in planar graphs |
Li, Ming-Chu |
2000 |
1-10 | 3 |
p. 219-225 7 p. |
artikel |
|
| 631 | Pancyclicity of k -ary n -cube networks with faulty vertices and edges |
Li, Jing |
2012 |
1-10 | 3 |
p. 231-238 8 p. |
artikel |
|
| 632 | Parallel algorithms for separable permutations |
Yugandhar, V. |
2005 |
1-10 | 3 |
p. 343-364 22 p. |
artikel |
|
| 633 | Parallel algorithms for the domination problems in trapezoid graphs |
Liang, Y.Daniel |
1997 |
1-10 | 3 |
p. 241-249 9 p. |
artikel |
|
| 634 | Parallel machine scheduling with a common server |
Hall, Nicholas G. |
2000 |
1-10 | 3 |
p. 223-243 21 p. |
artikel |
|
| 635 | Parameterized complexity of vertex colouring |
Cai, Leizhen |
2003 |
1-10 | 3 |
p. 415-429 15 p. |
artikel |
|
| 636 | Parametric min-cuts analysis in a network |
Aneja, Y.P |
2003 |
1-10 | 3 |
p. 679-689 11 p. |
artikel |
|
| 637 | Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnes |
Bordat, J.P. |
1985 |
1-10 | 3 |
p. 215-231 17 p. |
artikel |
|
| 638 | Partial information in public key cryptography |
Vyskoč, Josef |
1988 |
1-10 | 3 |
p. 261-263 3 p. |
artikel |
|
| 639 | Partitioning a matrix with non-guillotine cuts to minimize the maximum cost |
Mingozzi, Aristide |
2002 |
1-10 | 3 |
p. 243-260 18 p. |
artikel |
|
| 640 | Partitioning problems in dense hypergraphs |
Czygrinow, A. |
2002 |
1-10 | 3 |
p. 179-191 13 p. |
artikel |
|
| 641 | Path partition for graphs with special blocks |
Pan, Jun-Jie |
2005 |
1-10 | 3 |
p. 429-436 8 p. |
artikel |
|
| 642 | Patterns in trees |
Dershowitz, Nachum |
1989 |
1-10 | 3 |
p. 241-255 15 p. |
artikel |
|
| 643 | Patterns in words and languages |
Castiglione, G. |
2004 |
1-10 | 3 |
p. 237-246 10 p. |
artikel |
|
| 644 | Perfect 7-cycle systems |
Li Marzi, Enzo Maria |
2003 |
1-10 | 3 |
p. 535-538 4 p. |
artikel |
|
| 645 | Perfect edge domination and efficient edge domination in graphs |
Lu, Chin Lung |
2002 |
1-10 | 3 |
p. 227-250 24 p. |
artikel |
|
| 646 | Performance evaluation of demodulation with diversity—a combinatorial approach II: bijective methods |
Krob, D. |
2005 |
1-10 | 3 |
p. 403-421 19 p. |
artikel |
|
| 647 | Periodic assignment and graph colouring |
Korst, Jan |
1994 |
1-10 | 3 |
p. 291-305 15 p. |
artikel |
|
| 648 | Polyhedral methods for piecewise-linear functions I: the lambda method |
Lee, Jon |
2001 |
1-10 | 3 |
p. 269-285 17 p. |
artikel |
|
| 649 | Polyhedral results for the precedence-constrained knapsack problem |
Boyd, E.Andrew |
1993 |
1-10 | 3 |
p. 185-201 17 p. |
artikel |
|
| 650 | Polynomial algorithms for (integral) maximum two-flows in vertex edge-capacitated planar graphs |
Granot, Frieda |
1996 |
1-10 | 3 |
p. 267-283 17 p. |
artikel |
|
| 651 | Positive and Horn decomposability of partially defined Boolean functions |
Makino, Kazuhisa |
1997 |
1-10 | 3 |
p. 251-274 24 p. |
artikel |
|
| 652 | Positivity of second order linear recurrent sequences |
Halava, Vesa |
2006 |
1-10 | 3 |
p. 447-451 5 p. |
artikel |
|
| 653 | Postdoctoral fellowship in discrete applied mathematics at RUTCOR |
1985 |
1-10 | 3 |
p. 315- 1 p. |
artikel |
||
| 654 | Postdoctoral fellowship in discrete applied mathematics at RUTCOR |
1988 |
1-10 | 3 |
p. 297- 1 p. |
artikel |
||
| 655 | (p − 1) (p + 1) -approximate algorithms for p-traveling salesmen problems on a tree with minmax objective |
Averbakh, Igor |
1997 |
1-10 | 3 |
p. 201-216 16 p. |
artikel |
|
| 656 | Preemptive scheduling with variable profile, precedence constraints and due dates |
Liu, Zhen |
1995 |
1-10 | 3 |
p. 253-280 28 p. |
artikel |
|
| 657 | Preface |
Nyúl, László G. |
2009 |
1-10 | 3 |
p. 437- 1 p. |
artikel |
|
| 658 | Preface |
Imai, Hiroshi |
1992 |
1-10 | 3 |
p. 361- 1 p. |
artikel |
|
| 659 | Preface |
Dyer, Martin |
1994 |
1-10 | 3 |
p. 199- 1 p. |
artikel |
|
| 660 | Preface |
Cozzens, MargaretB. |
1992 |
1-10 | 3 |
p. 283- 1 p. |
artikel |
|
| 661 | Preface |
Clark, Dr. Alistair |
2008 |
1-10 | 3 |
p. 289-290 2 p. |
artikel |
|
| 662 | Preface |
|
1-10 | 3 |
p. 181 |
artikel |
||
| 663 | Primitive partial words |
Blanchet-Sadri, F. |
2005 |
1-10 | 3 |
p. 195-213 19 p. |
artikel |
|
| 664 | Principal structure of layered mixed matrices |
Murota, Kazuo |
1990 |
1-10 | 3 |
p. 221-234 14 p. |
artikel |
|
| 665 | Problem identification using program checking |
Collberg, Christian S. |
2004 |
1-10 | 3 |
p. 270-280 11 p. |
artikel |
|
| 666 | Processor interconnection networks from Cayley graphs |
Schibell, Stephen T. |
1992 |
1-10 | 3 |
p. 333-357 25 p. |
artikel |
|
| 667 | Pseudo-Hamiltonian-connected graphs |
Chang, Gerard J. |
2000 |
1-10 | 3 |
p. 145-153 9 p. |
artikel |
|
| 668 | P 4-trees and substitution decomposition |
Spinrad, Jeremy |
1992 |
1-10 | 3 |
p. 263-291 29 p. |
artikel |
|
| 669 | Quasi-threshold graphs |
Jing-Ho, Yan |
1996 |
1-10 | 3 |
p. 247-255 9 p. |
artikel |
|
| 670 | Randomized vs. deterministic distance query strategies for point location on the line |
Damaschke, Peter |
2006 |
1-10 | 3 |
p. 478-484 7 p. |
artikel |
|
| 671 | Ranking the vertices of an r-partite paired comparison digraph |
Kano, Mikio |
1987 |
1-10 | 3 |
p. 245-253 9 p. |
artikel |
|
| 672 | Ray shooting from convex ranges |
Kranakis, Evangelos |
2001 |
1-10 | 3 |
p. 259-267 9 p. |
artikel |
|
| 673 | Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs |
Meister, Daniel |
2005 |
1-10 | 3 |
p. 193-218 26 p. |
artikel |
|
| 674 | Recognition of Gilmore-Gomory traveling salesman problem |
Chandrasekaran, R. |
1986 |
1-10 | 3 |
p. 231-238 8 p. |
artikel |
|
| 675 | Recognizing a class of bicircular matroids |
Coullard, Collette R. |
1993 |
1-10 | 3 |
p. 197-215 19 p. |
artikel |
|
| 676 | Recognizing graphs with fixed interval number is NP-complete |
West, Douglas B. |
1984 |
1-10 | 3 |
p. 295-305 11 p. |
artikel |
|
| 677 | Recognizing pseudo-median graphs |
Vesel, Aleksander |
2002 |
1-10 | 3 |
p. 261-269 9 p. |
artikel |
|
| 678 | Recognizing sign solvable graphs |
Hansen, Pierre |
1983 |
1-10 | 3 |
p. 237-241 5 p. |
artikel |
|
| 679 | Recognizing tough graphs is NP-hard |
Bauer, D. |
1990 |
1-10 | 3 |
p. 191-195 5 p. |
artikel |
|
| 680 | Reconstructing minimal rooted trees |
Semple, Charles |
2003 |
1-10 | 3 |
p. 489-503 15 p. |
artikel |
|
| 681 | Rectilinear paths among rectilinear obstacles |
Lee, D.T. |
1996 |
1-10 | 3 |
p. 185-215 31 p. |
artikel |
|
| 682 | Recursive bounds for perfect hashing |
Fachini, Emanuela |
2001 |
1-10 | 3 |
p. 307-311 5 p. |
artikel |
|
| 683 | Reliability evaluation of engineering systems: Concepts and techniques |
1983 |
1-10 | 3 |
p. 328-329 2 p. |
artikel |
||
| 684 | Representability in mixed integer programmiing, I: Characterization results |
Jeroslow, Robert G. |
1987 |
1-10 | 3 |
p. 223-243 21 p. |
artikel |
|
| 685 | Representations of bicircular matroids |
Coullard, Collette R. |
1991 |
1-10 | 3 |
p. 223-240 18 p. |
artikel |
|
| 686 | Research problems |
2006 |
1-10 | 3 |
p. 604-607 4 p. |
artikel |
||
| 687 | RETRACTED: Pancyclic graphs and degree sum and neighborhood union involving distance two |
Zhao, Kewen |
2012 |
1-10 | 3 |
p. 218-223 6 p. |
artikel |
|
| 688 | Robotic cell scheduling with operational flexibility |
Akturk, M.Selim |
2005 |
1-10 | 3 |
p. 334-348 15 p. |
artikel |
|
| 689 | Room allocation: a polynomial subcase of the quadratic assignment problem |
Ciriani, Valentina |
2004 |
1-10 | 3 |
p. 263-269 7 p. |
artikel |
|
| 690 | Rotator design |
Davio, M. |
1983 |
1-10 | 3 |
p. 253-277 25 p. |
artikel |
|
| 691 | Routeing winter gritting vehicles |
Eglese, R.W. |
1994 |
1-10 | 3 |
p. 231-244 14 p. |
artikel |
|
| 692 | Rutcor's inaugural conference |
1984 |
1-10 | 3 |
p. 333-334 2 p. |
artikel |
||
| 693 | Scheduling identical parallel machines to minimize total weighted completion time |
Belouadah, H. |
1994 |
1-10 | 3 |
p. 201-218 18 p. |
artikel |
|
| 694 | Scheduling of conditional executed jobs on unrelated processors |
Jansen, Klaus |
1995 |
1-10 | 3 |
p. 245-255 11 p. |
artikel |
|
| 695 | Scheduling periodic events |
Vince, A. |
1989 |
1-10 | 3 |
p. 299-310 12 p. |
artikel |
|
| 696 | Scheduling unitary task systems with zero–one communication delays for quasi-interval orders |
Moukrim, Aziz |
2003 |
1-10 | 3 |
p. 461-476 16 p. |
artikel |
|
| 697 | Scheduling with incompatible jobs |
Bodlaender, Hans L. |
1994 |
1-10 | 3 |
p. 219-232 14 p. |
artikel |
|
| 698 | Scheduling with release dates on a single machine to minimize total weighted completion time |
Belouadah, H. |
1992 |
1-10 | 3 |
p. 213-231 19 p. |
artikel |
|
| 699 | Search problems on graphs |
Aigner, M. |
1986 |
1-10 | 3 |
p. 215-230 16 p. |
artikel |
|
| 700 | Secret sharing schemes on access structures with intersection number equal to one |
Martí-Farré, Jaume |
2006 |
1-10 | 3 |
p. 552-563 12 p. |
artikel |
|
| 701 | Selecting jobs for scheduling on a machine subject to failure |
Stadje, Wolfgang |
1995 |
1-10 | 3 |
p. 257-265 9 p. |
artikel |
|
| 702 | Semi-independence number of a graph and the existence of Hamiltonian circuits |
Ainouche, Ahmed |
1987 |
1-10 | 3 |
p. 213-221 9 p. |
artikel |
|
| 703 | Sensitivity analysis in isotonic regression |
Chakravarti, Nilotpal |
|
1-10 | 3 |
p. 183-196 |
artikel |
|
| 704 | Sensitivity analysis of the economic lot-sizing problem |
Van Hoesel, Stan |
|
1-10 | 3 |
p. 291-312 |
artikel |
|
| 705 | Separation of convex sets |
Czyzowicz, Jurek |
1994 |
1-10 | 3 |
p. 325-328 4 p. |
artikel |
|
| 706 | Sequences generated by infinitely iterated morphisms |
Séébold, Patrice |
1985 |
1-10 | 3 |
p. 255-264 10 p. |
artikel |
|
| 707 | Sequential and simultaneous aggregation of diophantine equations |
Babayev, Djangir A. |
1994 |
1-10 | 3 |
p. 209-220 12 p. |
artikel |
|
| 708 | Series–parallel chromatic hypergraphs |
Tomescu, Ioan |
2010 |
1-10 | 3 |
p. 198-203 6 p. |
artikel |
|
| 709 | Set to set broadcasting in communication networks |
Lee, Hsun-Ming |
1992 |
1-10 | 3 |
p. 411-421 11 p. |
artikel |
|
| 710 | Short disjoint cycles in graphs with degree constraints |
Brandstädt, Andreas |
1996 |
1-10 | 3 |
p. 197-205 9 p. |
artikel |
|
| 711 | Short encodings of planar graphs and maps |
Keeler, Kenneth |
1995 |
1-10 | 3 |
p. 239-252 14 p. |
artikel |
|
| 712 | Short proof of a discrete gronwall inequality |
Clark, Dean S |
1987 |
1-10 | 3 |
p. 279-281 3 p. |
artikel |
|
| 713 | Signed star domatic number of a graph |
Atapour, M. |
2010 |
1-10 | 3 |
p. 213-218 6 p. |
artikel |
|
| 714 | Simple but efficient approaches for the collapsing knapsack problem |
Pferschy, Ulrich |
1997 |
1-10 | 3 |
p. 271-280 10 p. |
artikel |
|
| 715 | Simple reductions between D0L language and sequence equivalence problems |
Salomaa, Arto |
1993 |
1-10 | 3 |
p. 271-274 4 p. |
artikel |
|
| 716 | Simploidals sets: Definitions, operations and comparison with simplicial sets |
Peltier, Samuel |
2009 |
1-10 | 3 |
p. 542-557 16 p. |
artikel |
|
| 717 | Single machine scheduling subject to precedence delays |
Finta, Lucian |
1996 |
1-10 | 3 |
p. 247-266 20 p. |
artikel |
|
| 718 | Solution techniques for the Large Set Covering Problem |
Galinier, Philippe |
2007 |
1-10 | 3 |
p. 312-326 15 p. |
artikel |
|
| 719 | Solving satisfiability in less than 2 n steps |
Monien, B. |
1985 |
1-10 | 3 |
p. 287-295 9 p. |
artikel |
|
| 720 | Solving symmetric mixed-model multi-level just-in-time scheduling problems |
Fliedner, Malte |
2010 |
1-10 | 3 |
p. 222-231 10 p. |
artikel |
|
| 721 | Some aspects of perfect elimination orderings in chordal graphs |
Shier, D.R. |
1984 |
1-10 | 3 |
p. 325-331 7 p. |
artikel |
|
| 722 | Some aspects of the semi-perfect elimination |
Olariu, S. |
1991 |
1-10 | 3 |
p. 291-298 8 p. |
artikel |
|
| 723 | Some combinatorial identities via Fibonacci numbers |
Lee, Gwang-Yeon |
2003 |
1-10 | 3 |
p. 527-534 8 p. |
artikel |
|
| 724 | Some democratic secret sharing schemes |
Carpentieri, Marco |
1995 |
1-10 | 3 |
p. 293-298 6 p. |
artikel |
|
| 725 | Some NP-complete problems for hypergraph degree sequences |
Colbourn, Charles J. |
1986 |
1-10 | 3 |
p. 239-254 16 p. |
artikel |
|
| 726 | Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource |
de Werra, D. |
1992 |
1-10 | 3 |
p. 205-219 15 p. |
artikel |
|
| 727 | Some remarks on the stable matching problem |
Gale, David |
1985 |
1-10 | 3 |
p. 223-232 10 p. |
artikel |
|
| 728 | Source sink flows with capacity installation in batches |
Chopra, Sunil |
1998 |
1-10 | 3 |
p. 165-192 28 p. |
artikel |
|
| 729 | Sparse Hypercube—a minimal k-line broadcast graph |
Fujita, Satoshi |
2003 |
1-10 | 3 |
p. 431-446 16 p. |
artikel |
|
| 730 | Sphere of influence graphs and the L ∞-metric |
Michael, T.S |
2003 |
1-10 | 3 |
p. 447-460 14 p. |
artikel |
|
| 731 | Splicing semigroups of dominoes and DNA |
Culik II, Karel |
1991 |
1-10 | 3 |
p. 261-277 17 p. |
artikel |
|
| 732 | Stable marriage and indifference |
Irving, Robert W. |
1994 |
1-10 | 3 |
p. 261-272 12 p. |
artikel |
|
| 733 | Stable partitions with W -preferences |
Cechlárová, Katarína |
2004 |
1-10 | 3 |
p. 333-347 15 p. |
artikel |
|
| 734 | Steiner problem in Halin networks |
Winter, Pawel |
1987 |
1-10 | 3 |
p. 281-294 14 p. |
artikel |
|
| 735 | Strong and weak edges of a graph and linkages with the vertex cover problem |
Han, Qiaoming |
2012 |
1-10 | 3 |
p. 197-203 7 p. |
artikel |
|
| 736 | Strong elimination ordering of the total graph of a tree |
Aleš, J. |
1992 |
1-10 | 3 |
p. 293-295 3 p. |
artikel |
|
| 737 | Strong tree-cographs are birkhoff graphs |
Tinhofer, G. |
1988 |
1-10 | 3 |
p. 275-288 14 p. |
artikel |
|
| 738 | Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem |
Conforti, Michele |
1984 |
1-10 | 3 |
p. 251-274 24 p. |
artikel |
|
| 739 | Subset-sum problems with different summands: computation |
Chaimovich, Mark |
1990 |
1-10 | 3 |
p. 277-282 6 p. |
artikel |
|
| 740 | Substitutes and complements in network flow problems |
Gale, David |
1981 |
1-10 | 3 |
p. 175-186 12 p. |
artikel |
|
| 741 | Succinct representation of general unlabeled graphs |
Naor, Moni |
1990 |
1-10 | 3 |
p. 303-307 5 p. |
artikel |
|
| 742 | Superfluous edges and exponential expansions of De Bruijn and Kautz graphs |
Canale, Eduardo A. |
2004 |
1-10 | 3 |
p. 303-331 29 p. |
artikel |
|
| 743 | Synchronized and desynchronized E0L forms |
Rozenberg, G. |
1980 |
1-10 | 3 |
p. 233-247 15 p. |
artikel |
|
| 744 | Synthetic description of a semiorder |
Pirlot, Marc |
1991 |
1-10 | 3 |
p. 299-308 10 p. |
artikel |
|
| 745 | TantrixTM rotation puzzles are intractable |
Holzer, Markus |
2004 |
1-10 | 3 |
p. 345-358 14 p. |
artikel |
|
| 746 | Testing primitivity on partial words |
Blanchet-Sadri, F. |
2007 |
1-10 | 3 |
p. 279-287 9 p. |
artikel |
|
| 747 | 5th Bonn workshop on combinatorial optimization |
Faigle, U. |
1984 |
1-10 | 3 |
p. 335- 1 p. |
artikel |
|
| 748 | The absolute center of a unicyclic network |
Hämäläinen, Pentti |
1989 |
1-10 | 3 |
p. 311-315 5 p. |
artikel |
|
| 749 | The absolute centre of a graph |
Cuninghame-Green, R.A. |
1984 |
1-10 | 3 |
p. 275-283 9 p. |
artikel |
|
| 750 | The algebraic Monge property and path problems |
Bein, Wolfgang |
2005 |
1-10 | 3 |
p. 455-464 10 p. |
artikel |
|
| 751 | The arborescence-realization problem |
Swaminathan, R.P. |
1995 |
1-10 | 3 |
p. 267-283 17 p. |
artikel |
|
| 752 | The basic cyclic scheduling problem with linear precedence constraints |
Munier, A. |
1996 |
1-10 | 3 |
p. 219-238 20 p. |
artikel |
|
| 753 | The b-hull of an integer program |
Wolsey, L.A. |
1981 |
1-10 | 3 |
p. 193-201 9 p. |
artikel |
|
| 754 | The capacity of the subarray partial concentrators |
Hwang, F.K. |
1992 |
1-10 | 3 |
p. 231-240 10 p. |
artikel |
|
| 755 | The centdian subtree on tree networks |
Tamir, Arie |
2002 |
1-10 | 3 |
p. 263-278 16 p. |
artikel |
|
| 756 | The chromatic difference sequence of the Cartesian product of graphs: Part II |
Zhou, Huishan |
1993 |
1-10 | 3 |
p. 263-267 5 p. |
artikel |
|
| 757 | The clique operator on graphs with few P 4 's |
de Mello, C.P. |
2006 |
1-10 | 3 |
p. 485-492 8 p. |
artikel |
|
| 758 | The commutative closure of a binary slip-language is context-free: a new proof |
Rigo, Michel |
2003 |
1-10 | 3 |
p. 665-672 8 p. |
artikel |
|
| 759 | The competition-common enemy graph of a digraph |
Scott, Debra D. |
1987 |
1-10 | 3 |
p. 269-280 12 p. |
artikel |
|
| 760 | The complexity of generalized clique packing |
Corneil, D.G. |
1985 |
1-10 | 3 |
p. 233-239 7 p. |
artikel |
|
| 761 | The complexity of generalized graph colorings |
Brown, Jason I. |
1996 |
1-10 | 3 |
p. 257-270 14 p. |
artikel |
|
| 762 | The complexity of irredundant sets parameterized by size |
Downey, Rodney G. |
2000 |
1-10 | 3 |
p. 155-167 13 p. |
artikel |
|
| 763 | The Copeland measure of Condorcet choice functions |
Laffond, G. |
1994 |
1-10 | 3 |
p. 273-279 7 p. |
artikel |
|
| 764 | The core and the Weber set of games on augmenting systems |
Bilbao, J.M. |
2010 |
1-10 | 3 |
p. 180-188 9 p. |
artikel |
|
| 765 | The decomposition of a square into rectangles of minimal perimeter |
Kong, T.Y |
1987 |
1-10 | 3 |
p. 239-243 5 p. |
artikel |
|
| 766 | The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees |
Ng, Meei Pyng |
2000 |
1-10 | 3 |
p. 227-235 9 p. |
artikel |
|
| 767 | The diophantine problem of Frobenius: A close bound |
Krawczyk, Hugo |
1989 |
1-10 | 3 |
p. 289-291 3 p. |
artikel |
|
| 768 | The discrete moment problem and linear programming |
Prékopa, András |
1990 |
1-10 | 3 |
p. 235-254 20 p. |
artikel |
|
| 769 | The disjunctivities of ω-languages |
Yeh, Y.T |
2003 |
1-10 | 3 |
p. 627-641 15 p. |
artikel |
|
| 770 | The double competition number of some triangle-free graphs |
Seager, Suzanne M. |
1990 |
1-10 | 3 |
p. 265-269 5 p. |
artikel |
|
| 771 | The even adjacency split problem for graphs |
Cheston, Grant A. |
2000 |
1-10 | 3 |
p. 175-188 14 p. |
artikel |
|
| 772 | The exact bound of Lee's MLPT |
Guo-Hui, Lin |
1998 |
1-10 | 3 |
p. 251-254 4 p. |
artikel |
|
| 773 | The expected number of symmetries in locally restricted trees II |
McKeon, Kathleen A. |
1996 |
1-10 | 3 |
p. 245-253 9 p. |
artikel |
|
| 774 | The forbidden projections of unate functions |
Feigelson, Aaron |
1997 |
1-10 | 3 |
p. 221-236 16 p. |
artikel |
|
| 775 | The forwarding index of directed networks |
Manoussakis, Yannis |
1996 |
1-10 | 3 |
p. 279-291 13 p. |
artikel |
|
| 776 | The game of F -saturator |
Ferrara, Michael |
2010 |
1-10 | 3 |
p. 189-197 9 p. |
artikel |
|
| 777 | The geometry of carpentry and joinery |
Morin, Pat |
2004 |
1-10 | 3 |
p. 374-380 7 p. |
artikel |
|
| 778 | The goodness of {S,a}-EOL forms is decidable |
Rozenberg, G. |
1983 |
1-10 | 3 |
p. 263-299 37 p. |
artikel |
|
| 779 | The Hamiltonian problem on distance-hereditary graphs |
Hsieh, Sun-Yuan |
2006 |
1-10 | 3 |
p. 508-524 17 p. |
artikel |
|
| 780 | The k-centrum multi-facility location problem |
Tamir, Arie |
2001 |
1-10 | 3 |
p. 293-307 15 p. |
artikel |
|
| 781 | The L ( 2 , 1 ) -labelling of trees |
Wang, Wei-Fan |
2006 |
1-10 | 3 |
p. 598-603 6 p. |
artikel |
|
| 782 | The maximum edge biclique problem is NP-complete |
Peeters, René |
2003 |
1-10 | 3 |
p. 651-654 4 p. |
artikel |
|
| 783 | The maximum number of complementary facets of a simplicial polytope |
Morris Jr., Walter D. |
1992 |
1-10 | 3 |
p. 293-298 6 p. |
artikel |
|
| 784 | The new FIFA rules are hard: complexity aspects of sports competitions |
Kern, Walter |
2001 |
1-10 | 3 |
p. 317-323 7 p. |
artikel |
|
| 785 | The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs |
Døvling Andersen, Lars |
1995 |
1-10 | 3 |
p. 203-214 12 p. |
artikel |
|
| 786 | The number of clone orderings |
Newberg, Lee Aaron |
1996 |
1-10 | 3 |
p. 233-245 13 p. |
artikel |
|
| 787 | The number of convex polyominoes and the generating function of Jacobi polynomials |
Guo, Victor J.W. |
2006 |
1-10 | 3 |
p. 587-593 7 p. |
artikel |
|
| 788 | The optimal unicyclic graphs for pair-connected reliability |
Siegrist, Kyle T. |
1993 |
1-10 | 3 |
p. 235-243 9 p. |
artikel |
|
| 789 | The pagenumber of k-trees is O(k) |
L. Ganley, Joseph |
2001 |
1-10 | 3 |
p. 215-221 7 p. |
artikel |
|
| 790 | The parallel solution of domination problems on chordal and strongly chordal graphs |
Dahlhaus, Elias |
1994 |
1-10 | 3 |
p. 261-273 13 p. |
artikel |
|
| 791 | The parity path problem on some subclasses of perfect graphs |
Satyan, C.R. |
1996 |
1-10 | 3 |
p. 293-302 10 p. |
artikel |
|
| 792 | The planar multiterminal cut problem |
Hartvigsen, David |
1998 |
1-10 | 3 |
p. 203-222 20 p. |
artikel |
|
| 793 | The point-to-point delivery and connection problems: complexity and algorithms |
Li, Chung-Lun |
1992 |
1-10 | 3 |
p. 267-292 26 p. |
artikel |
|
| 794 | The power of small coalitions in graphs |
Bermond, J-C |
2003 |
1-10 | 3 |
p. 399-414 16 p. |
artikel |
|
| 795 | The QAP-polytope and the star transformation |
Jünger, Michael |
2001 |
1-10 | 3 |
p. 283-306 24 p. |
artikel |
|
| 796 | The single-item discrete lotsizing and scheduling problem: optimization by linear and dynamic programming |
Van Hoesel, Stan |
1994 |
1-10 | 3 |
p. 289-303 15 p. |
artikel |
|
| 797 | The steepest descent gravitational method for linear programming |
Chang, Soo Y. |
1989 |
1-10 | 3 |
p. 211-239 29 p. |
artikel |
|
| 798 | The strong metric dimension of graphs and digraphs |
Oellermann, Ortrud R. |
2007 |
1-10 | 3 |
p. 356-364 9 p. |
artikel |
|
| 799 | The structure of an integral monoid and integer programming feasibility |
Ryan, Jennifer |
1990 |
1-10 | 3 |
p. 251-263 13 p. |
artikel |
|
| 800 | The structure of bases in bicircular matroids |
Shull, Randy |
1989 |
1-10 | 3 |
p. 267-283 17 p. |
artikel |
|
| 801 | The underlying line digraph structure of some (0,1)-matrix equations |
Gimbert, Joan |
2002 |
1-10 | 3 |
p. 289-296 8 p. |
artikel |
|
| 802 | The VC-dimension of set systems defined by graphs |
Kranakis, Evangelos |
1997 |
1-10 | 3 |
p. 237-257 21 p. |
artikel |
|
| 803 | The vehicle routing problem with pickups and deliveries on some special graphs |
Eilam Tzoreff, Tali |
2002 |
1-10 | 3 |
p. 193-229 37 p. |
artikel |
|
| 804 | The worst case behavior of a greedy algorithm for a class of pseudo-Boolean functions |
Emamy-K., M.R. |
1989 |
1-10 | 3 |
p. 285-287 3 p. |
artikel |
|
| 805 | Thin and slender languages |
Pǎun, Gheorghe |
1995 |
1-10 | 3 |
p. 257-270 14 p. |
artikel |
|
| 806 | Tighter bound for MULTIFIT scheduling on uniform processors |
Chen, Bo |
1991 |
1-10 | 3 |
p. 227-260 34 p. |
artikel |
|
| 807 | Time offset optimization in digital broadcasting |
Mannino, Carlo |
2008 |
1-10 | 3 |
p. 339-351 13 p. |
artikel |
|
| 808 | Time-optimal tree computations on sparse meshes |
Bhagavathi, D. |
1997 |
1-10 | 3 |
p. 201-220 20 p. |
artikel |
|
| 809 | Total balancedness condition for Steiner tree games |
Fang, Qizhi |
2003 |
1-10 | 3 |
p. 555-563 9 p. |
artikel |
|
| 810 | Totally balanced and totally unimodular matrices defined by center location problems |
Tamir, Arie |
1987 |
1-10 | 3 |
p. 245-263 19 p. |
artikel |
|
| 811 | Trace-orthogonal normal bases |
Jungnickel, Dieter |
1993 |
1-10 | 3 |
p. 233-249 17 p. |
artikel |
|
| 812 | Traces, dependency graphs and DNLC grammars |
Aalbersberg, Ij.J. |
1985 |
1-10 | 3 |
p. 299-306 8 p. |
artikel |
|
| 813 | Transformation completeness properties of SVPC transformation sets |
Tai, S.C. |
1991 |
1-10 | 3 |
p. 263-273 11 p. |
artikel |
|
| 814 | Traveling salesman games with the Monge property |
Okamoto, Yoshio |
2004 |
1-10 | 3 |
p. 349-369 21 p. |
artikel |
|
| 815 | Trees and proximity representations |
1992 |
1-10 | 3 |
p. 297-298 2 p. |
artikel |
||
| 816 | Trees with the seven smallest and eight greatest Harary indices |
Xu, Kexiang |
2012 |
1-10 | 3 |
p. 321-331 11 p. |
artikel |
|
| 817 | Triangulating graphs without asteroidal triples |
Möhring, Rolf H. |
1996 |
1-10 | 3 |
p. 281-287 7 p. |
artikel |
|
| 818 | Tricyclic graphs with maximum Merrifield–Simmons index |
Zhu, Zhongxun |
2010 |
1-10 | 3 |
p. 204-212 9 p. |
artikel |
|
| 819 | Two-dimensional rectangle packing: on-line methods and results |
Csirik, J. |
|
1-10 | 3 |
p. 197-204 |
artikel |
|
| 820 | Two easy duality theorems for product partial orders |
Trotter Jr., L.E |
1987 |
1-10 | 3 |
p. 283-286 4 p. |
artikel |
|
| 821 | Two machine open shop scheduling problem with bi-criteria |
Masuda, Teruo |
1994 |
1-10 | 3 |
p. 253-259 7 p. |
artikel |
|
| 822 | Two machine openshop scheduling with machine-dependent processing times |
Vakharia, Asoo J. |
1997 |
1-10 | 3 |
p. 283-288 6 p. |
artikel |
|
| 823 | Two-page book embedding of trees under vertex-neighborhood constraints |
Moran, Shlomo |
1993 |
1-10 | 3 |
p. 233-241 9 p. |
artikel |
|
| 824 | Uncovering generalized-network structure in matrices |
Coullard, Collette R. |
1993 |
1-10 | 3 |
p. 191-220 30 p. |
artikel |
|
| 825 | Uniformly bounded duplication languages |
Leupold, Peter |
2005 |
1-10 | 3 |
p. 301-310 10 p. |
artikel |
|
| 826 | Unimodular functions |
Hansen, Pierre |
1986 |
1-10 | 3 |
p. 269-281 13 p. |
artikel |
|
| 827 | Uniquely 2-list colorable graphs |
Ganjali, Y.G. |
2002 |
1-10 | 3 |
p. 217-225 9 p. |
artikel |
|
| 828 | Unique representation in number systems and L codes |
Honkala, Juha |
1982 |
1-10 | 3 |
p. 229-232 4 p. |
artikel |
|
| 829 | Universal retrieval trees |
Krichevsky, R.E. |
1985 |
1-10 | 3 |
p. 293-302 10 p. |
artikel |
|
| 830 | Upper bounds for constant weight and Lee codes slightly outside the plotkin range |
Tarnanen, Hannu |
1987 |
1-10 | 3 |
p. 265-277 13 p. |
artikel |
|
| 831 | Valid inequalities and separation for capacitated fixed charge flow problems |
Stallaert, Jan |
2000 |
1-10 | 3 |
p. 265-274 10 p. |
artikel |
|
| 832 | Van Lier sequences |
Fishburn, Peter C. |
1990 |
1-10 | 3 |
p. 209-220 12 p. |
artikel |
|
| 833 | Variable and term removal from Boolean formulae |
Crama, Yves |
1997 |
1-10 | 3 |
p. 217-230 14 p. |
artikel |
|
| 834 | VC-dimensions of finite automata and commutative finite automata with k letters and n states |
Ishigami, Yoshiyasu |
1997 |
1-10 | 3 |
p. 229-240 12 p. |
artikel |
|
| 835 | Vehicle routing with split deliveries |
Dror, Moshe |
1994 |
1-10 | 3 |
p. 239-254 16 p. |
artikel |
|
| 836 | Verifiable broadcasting and gossiping in communication networks |
Berman, Kenneth A. |
2002 |
1-10 | 3 |
p. 293-298 6 p. |
artikel |
|
| 837 | Very fast parallel algorithms for approximate edge coloring |
Han, Yijie |
2001 |
1-10 | 3 |
p. 227-238 12 p. |
artikel |
|
| 838 | Virtual network embedding in the cycle |
Choplin, Sébastien |
2005 |
1-10 | 3 |
p. 368-375 8 p. |
artikel |
|
| 839 | Volume 5 (1983) |
1983 |
1-10 | 3 |
p. 335-336 2 p. |
artikel |
||
| 840 | Voronoi diagrams over dynamic scenes |
Roos, Thomas |
1993 |
1-10 | 3 |
p. 243-259 17 p. |
artikel |
|
| 841 | Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness |
Cheng, Eddie |
2002 |
1-10 | 3 |
p. 163-179 17 p. |
artikel |
|
| 842 | Waiting patterns for a printer |
Merlini, D. |
2004 |
1-10 | 3 |
p. 359-373 15 p. |
artikel |
|
| 843 | Weavings, sections and projections of spherical polyhedra |
Whiteley, Walter |
1991 |
1-10 | 3 |
p. 275-294 20 p. |
artikel |
|
| 844 | Weighted finite transducers in image processing |
Culik II, Karel |
1995 |
1-10 | 3 |
p. 223-237 15 p. |
artikel |
|
| 845 | Weighted independent perfect domination on cocomparability graphs |
Chang, Gerard J. |
1995 |
1-10 | 3 |
p. 215-222 8 p. |
artikel |
|
| 846 | Well irredundant graphs |
Topp, Jerzy |
1995 |
1-10 | 3 |
p. 267-276 10 p. |
artikel |
|
| 847 | Which matrices are immune against the transportation paradox? |
Deı̆neko, Vladimir G. |
2003 |
1-10 | 3 |
p. 495-501 7 p. |
artikel |
|
| 848 | Whist tournaments with the three person property |
Ge, Gennian |
2004 |
1-10 | 3 |
p. 265-276 12 p. |
artikel |
|
| 849 | Z-cyclic whist tournaments with a patterned starter initial round |
Finizio, Norman J. |
1994 |
1-10 | 3 |
p. 287-293 7 p. |
artikel |
849 gevonden resultaten