nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1001 |
Self-spanner graphs
|
Cicerone, Serafino |
|
2005 |
1-10 |
1-3 |
p. 99-120 22 p. |
artikel |
1002 |
Semidefinite programming for discrete optimization and matrix completion problems
|
Wolkowicz, Henry |
|
2002 |
1-10 |
1-3 |
p. 513-577 65 p. |
artikel |
1003 |
Semigroup automaton structure by homomorphism and domain partition
|
Greenblatt, Bruce |
|
1991 |
1-10 |
1-3 |
p. 129-143 15 p. |
artikel |
1004 |
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
|
He, Yong |
|
2005 |
1-10 |
1-3 |
p. 140-159 20 p. |
artikel |
1005 |
Sensitivity analysis for knapsack problems: a negative result
|
Blair, Charles |
|
1998 |
1-10 |
1-3 |
p. 133-139 7 p. |
artikel |
1006 |
Separability generalizes Dirac's theorem
|
Berry, Anne |
|
1998 |
1-10 |
1-3 |
p. 43-53 11 p. |
artikel |
1007 |
Separable partitions
|
Alon, Noga |
|
1999 |
1-10 |
1-3 |
p. 39-51 13 p. |
artikel |
1008 |
Sequential colorings and perfect graphs
|
Maffray, Frédéric |
|
1999 |
1-10 |
1-3 |
p. 287-296 10 p. |
artikel |
1009 |
Sequential testing of complex systems: a review
|
Ünlüyurt, Tonguç |
|
2004 |
1-10 |
1-3 |
p. 189-205 17 p. |
artikel |
1010 |
Shattering a set of objects in 2D
|
Nandy, Subhas C. |
|
2002 |
1-10 |
1-3 |
p. 183-194 12 p. |
artikel |
1011 |
Shortest-path problems and molecular conformation
|
Dress, Andreas W.M. |
|
1988 |
1-10 |
1-3 |
p. 129-144 16 p. |
artikel |
1012 |
Shortest shortest path trees of a network
|
Hansen, Pierre |
|
1996 |
1-10 |
1-3 |
p. 275-284 10 p. |
artikel |
1013 |
Shuffling biological sequences
|
Kandel, D. |
|
1996 |
1-10 |
1-3 |
p. 171-185 15 p. |
artikel |
1014 |
Signed domatic number of a graph
|
Volkmann, Lutz |
|
2005 |
1-10 |
1-3 |
p. 261-267 7 p. |
artikel |
1015 |
Simple 8-(40,11,1440) designs
|
Betten, Anton |
|
1999 |
1-10 |
1-3 |
p. 109-114 6 p. |
artikel |
1016 |
Simple image set of (max,+) linear mappings
|
Butkovic, Peter |
|
2000 |
1-10 |
1-3 |
p. 73-86 14 p. |
artikel |
1017 |
Simple planar graph partition into three forests
|
Grossi, Roberto |
|
1998 |
1-10 |
1-3 |
p. 121-132 12 p. |
artikel |
1018 |
Simple splicing systems
|
Mateescu, A. |
|
1998 |
1-10 |
1-3 |
p. 145-163 19 p. |
artikel |
1019 |
Simultaneous fuzzy segmentation of multiple objects
|
Carvalho, Bruno M. |
|
2005 |
1-10 |
1-3 |
p. 55-77 23 p. |
artikel |
1020 |
Single bend wiring on surfaces
|
Garrido, M.A. |
|
2002 |
1-10 |
1-3 |
p. 27-40 14 p. |
artikel |
1021 |
Single machine scheduling with assignable due dates
|
Qi, Xiangtong |
|
2002 |
1-10 |
1-3 |
p. 211-233 23 p. |
artikel |
1022 |
Small cycles in Hamiltonian graphs
|
Schelten, Uwe |
|
1997 |
1-10 |
1-3 |
p. 201-211 11 p. |
artikel |
1023 |
Solving satisfiability problems using elliptic approximations – effective branching rules
|
Warners, Joost P. |
|
2000 |
1-10 |
1-3 |
p. 241-259 19 p. |
artikel |
1024 |
Solving the feedback vertex set problem on undirected graphs
|
Brunetta, Lorenzo |
|
2000 |
1-10 |
1-3 |
p. 37-51 15 p. |
artikel |
1025 |
Solving the max-cut problem using eigenvalues
|
Poljak, Svatopluk |
|
1995 |
1-10 |
1-3 |
p. 249-278 30 p. |
artikel |
1026 |
Solving the uncapacited plant location problem on trees
|
Billionnet, Alain |
|
1994 |
1-10 |
1-3 |
p. 51-59 9 p. |
artikel |
1027 |
Solving the weighted efficient edge domination problem on bipartite permutation graphs
|
Chin Lung Lu, |
|
1998 |
1-10 |
1-3 |
p. 203-211 9 p. |
artikel |
1028 |
Some analytic features of algebraic data
|
Ricci, Gabriele |
|
2002 |
1-10 |
1-3 |
p. 235-249 15 p. |
artikel |
1029 |
Some applications of algebra to combinatorics
|
Stanley, Richard P. |
|
1991 |
1-10 |
1-3 |
p. 241-277 37 p. |
artikel |
1030 |
Some applications of graph theory to the study of polymer configuration
|
Galina, Henryk |
|
1988 |
1-10 |
1-3 |
p. 167-176 10 p. |
artikel |
1031 |
Some approaches to a conjecture on short cycles in digraphs
|
Broersma, H.J. |
|
2002 |
1-10 |
1-3 |
p. 45-53 9 p. |
artikel |
1032 |
Some complexity results about threshold graphs
|
Margot, F. |
|
1994 |
1-10 |
1-3 |
p. 299-308 10 p. |
artikel |
1033 |
Some general aspects of the framing number of a digraph
|
Henning, Michael A. |
|
1998 |
1-10 |
1-3 |
p. 115-133 19 p. |
artikel |
1034 |
Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes
|
Brown, T.J.N. |
|
1996 |
1-10 |
1-3 |
p. 51-66 16 p. |
artikel |
1035 |
Some minimum broadcast graphs
|
Mahéo, M. |
|
1994 |
1-10 |
1-3 |
p. 275-285 11 p. |
artikel |
1036 |
Some new classes of facets for the equicut polytope
|
de Souza, C.C. |
|
1995 |
1-10 |
1-3 |
p. 167-191 25 p. |
artikel |
1037 |
Some new Z-cyclic whist tournaments
|
Finizio, Norman J. |
|
2000 |
1-10 |
1-3 |
p. 115-130 16 p. |
artikel |
1038 |
Some polynomially solvable subcases of the detailed routing problem in VLSI design
|
Recski, András |
|
2001 |
1-10 |
1-3 |
p. 199-208 10 p. |
artikel |
1039 |
Some properties of non-bicolorable hypergraphs and the four-color problem
|
Berge, Claude |
|
1996 |
1-10 |
1-3 |
p. 73-79 7 p. |
artikel |
1040 |
Some results on maximum stable sets in certain P 5-free graphs
|
Mosca, Raffaele |
|
2003 |
1-10 |
1-3 |
p. 175-183 9 p. |
artikel |
1041 |
Sorting by bounded block-moves
|
Heath, Lenwood S. |
|
1998 |
1-10 |
1-3 |
p. 181-206 26 p. |
artikel |
1042 |
Sorting with fixed-length reversals
|
Chen, Ting |
|
1996 |
1-10 |
1-3 |
p. 269-295 27 p. |
artikel |
1043 |
Space-time ‘bonds’, electromagnetism and graphs
|
Peusner, Leonardo |
|
1988 |
1-10 |
1-3 |
p. 305-315 11 p. |
artikel |
1044 |
Spanning local tournaments in locally semicomplete digraphs
|
Guo, Yubao |
|
1997 |
1-10 |
1-3 |
p. 119-125 7 p. |
artikel |
1045 |
Spanning subgraphs with applications to communication on a subclass of the Cayley-graph-based networks
|
Fragopoulou, Paraskevi |
|
1998 |
1-10 |
1-3 |
p. 79-96 18 p. |
artikel |
1046 |
Spanning trees with constraints on the leaf degree
|
Kaneko, Atsushi |
|
2001 |
1-10 |
1-3 |
p. 73-76 4 p. |
artikel |
1047 |
Sparse Hypercube 3-spanners
|
Duckworth, W. |
|
2000 |
1-10 |
1-3 |
p. 289-295 7 p. |
artikel |
1048 |
Sparse orthogonal matrices and the Haar wavelet
|
Cheon, Gi-Sang |
|
2000 |
1-10 |
1-3 |
p. 63-76 14 p. |
artikel |
1049 |
Spatial pattern discovery by learning a probabilistic parametric model from multiple attributed relational graphs
|
Hong, Pengyu |
|
2004 |
1-10 |
1-3 |
p. 113-135 23 p. |
artikel |
1050 |
Special issue on stability in graphs and related topics
|
Lozin, Vadim |
|
2003 |
1-10 |
1-3 |
p. 1-2 2 p. |
artikel |
1051 |
Special Issue on Typical Case Complexity and Phase Transitions
|
Kirousis, L.M. |
|
2005 |
1-10 |
1-3 |
p. 1- 1 p. |
artikel |
1052 |
Special section: Using discrete mathematics to model multileaf collimators in radiation therapy
|
Hamacher, Horst W. |
|
2005 |
1-10 |
1-3 |
p. 4-5 2 p. |
artikel |
1053 |
Spectral partitioning with multiple eigenvectors
|
Alpert, Charles J |
|
1999 |
1-10 |
1-3 |
p. 3-26 24 p. |
artikel |
1054 |
Spectral properties of some structurally related graphs
|
Gutman, Ivan |
|
1988 |
1-10 |
1-3 |
p. 195-203 9 p. |
artikel |
1055 |
Splicing representations of strictly locally testable languages
|
Head, Tom |
|
1998 |
1-10 |
1-3 |
p. 139-147 9 p. |
artikel |
1056 |
Stabbing information of a simple polygon
|
Everett, Hazel |
|
1999 |
1-10 |
1-3 |
p. 67-82 16 p. |
artikel |
1057 |
Stability aspects of the traveling salesman problem based on k-best solutions
|
Libura, Marek |
|
1998 |
1-10 |
1-3 |
p. 159-185 27 p. |
artikel |
1058 |
Stable sets in two subclasses of banner-free graphs
|
Gerber, Michael U. |
|
2003 |
1-10 |
1-3 |
p. 121-136 16 p. |
artikel |
1059 |
Stable skew partition problem
|
Dantas, Simone |
|
2004 |
1-10 |
1-3 |
p. 17-22 6 p. |
artikel |
1060 |
Statistical learning formulation of the DNA base-calling problem and its solution in a Bayesian EM framework
|
Pereira, Manuela S. |
|
2000 |
1-10 |
1-3 |
p. 229-258 30 p. |
artikel |
1061 |
Steiner intervals in graphs
|
Kubicka, Ewa |
|
1998 |
1-10 |
1-3 |
p. 181-190 10 p. |
artikel |
1062 |
Steiner trees and polyhedra
|
Didi Biha, M. |
|
2001 |
1-10 |
1-3 |
p. 101-120 20 p. |
artikel |
1063 |
Straight line embeddings of rooted star forests in the plane
|
Kaneko, Atsushi |
|
2000 |
1-10 |
1-3 |
p. 167-175 9 p. |
artikel |
1064 |
Strong lower bounds for the prize collecting Steiner problem in graphs
|
Lucena, Abilio |
|
2004 |
1-10 |
1-3 |
p. 277-294 18 p. |
artikel |
1065 |
Strongly orderable graphs A common generalization of strongly chordal and chordal bipartite graphs
|
Dragan, Feodor F. |
|
2000 |
1-10 |
1-3 |
p. 427-442 16 p. |
artikel |
1066 |
Struction revisited
|
Alexe, Gabriela |
|
2003 |
1-10 |
1-3 |
p. 27-46 20 p. |
artikel |
1067 |
Structural aspects of ordered polymatroids
|
Krüger, Ulrich |
|
2000 |
1-10 |
1-3 |
p. 125-148 24 p. |
artikel |
1068 |
Subdivisions of integral base polytopes
|
Kashiwabara, Kenji |
|
2001 |
1-10 |
1-3 |
p. 89-97 9 p. |
artikel |
1069 |
Subject index volumes 1–92
|
|
|
2000 |
1-10 |
1-3 |
p. 3-120 118 p. |
artikel |
1070 |
Suborthogonal double covers of the complete graph by stars
|
Schumacher, Ulrike |
|
1999 |
1-10 |
1-3 |
p. 439-444 6 p. |
artikel |
1071 |
Subtree and substar intersection numbers
|
Chang, Yi-Wu |
|
1993 |
1-10 |
1-3 |
p. 205-220 16 p. |
artikel |
1072 |
Subtrees of bipartite digraphs — the minimum degree condition
|
Zioł o, Irmina A. |
|
2000 |
1-10 |
1-3 |
p. 251-259 9 p. |
artikel |
1073 |
Supermodular functions and the complexity of MAX CSP
|
Cohen, David |
|
2005 |
1-10 |
1-3 |
p. 53-72 20 p. |
artikel |
1074 |
Switchdec polyhedra
|
Gaillard, A. |
|
1997 |
1-10 |
1-3 |
p. 141-163 23 p. |
artikel |
1075 |
Symmetric patterns in the cellular automaton that generates Pascal's triangle modulo 2
|
Barbé, André |
|
2000 |
1-10 |
1-3 |
p. 1-38 38 p. |
artikel |
1076 |
Symmetries and sense of direction in labeled graphs
|
Flocchini, Paola |
|
1998 |
1-10 |
1-3 |
p. 99-115 17 p. |
artikel |
1077 |
Symmetries of knotted hypothetical molecular graphs
|
Flapan, Erica |
|
1988 |
1-10 |
1-3 |
p. 157-166 10 p. |
artikel |
1078 |
Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
|
Glover, Fred |
|
1994 |
1-10 |
1-3 |
p. 231-255 25 p. |
artikel |
1079 |
T-choosability in graphs
|
Alon, Noga |
|
1998 |
1-10 |
1-3 |
p. 1-13 13 p. |
artikel |
1080 |
TC operations and Latin bricks
|
Hazan, Simone |
|
1989 |
1-10 |
1-3 |
p. 167-177 11 p. |
artikel |
1081 |
The achromatic number of the union of cycles
|
Lee, Jaeun |
|
2004 |
1-10 |
1-3 |
p. 330-335 6 p. |
artikel |
1082 |
The algorithmic use of hypertree structure and maximum neighbourhood orderings
|
Brandstädt, Andreas |
|
1998 |
1-10 |
1-3 |
p. 43-77 35 p. |
artikel |
1083 |
The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
|
Fiol, M.A. |
|
1998 |
1-10 |
1-3 |
p. 77-97 21 p. |
artikel |
1084 |
The asymmetric median tree — A new model for building consensus trees
|
Phillips, Cynthia |
|
1996 |
1-10 |
1-3 |
p. 311-335 25 p. |
artikel |
1085 |
The asymmetric travelling salesman problem: on generalizations of disaggregated Miller–Tucker–Zemlin constraints
|
Gouveia, Luis |
|
2001 |
1-10 |
1-3 |
p. 129-145 17 p. |
artikel |
1086 |
The average connectivity of a digraph
|
Henning, Michael A. |
|
2004 |
1-10 |
1-3 |
p. 143-153 11 p. |
artikel |
1087 |
The b-chromatic number of a graph
|
Irving, Robert W. |
|
1999 |
1-10 |
1-3 |
p. 127-141 15 p. |
artikel |
1088 |
The challenge of characterizing branching in molecular species
|
Rouvray, D.H. |
|
1988 |
1-10 |
1-3 |
p. 317-338 22 p. |
artikel |
1089 |
The characteristic polynomials of modified graphs
|
Rowlinson, Peter |
|
1996 |
1-10 |
1-3 |
p. 209-219 11 p. |
artikel |
1090 |
The combinatorial approach yields an NC algorithm for computing Pfaffians
|
Mahajan, Meena |
|
2004 |
1-10 |
1-3 |
p. 1-16 16 p. |
artikel |
1091 |
The complexity of arc-colorings for directed hypergraphs
|
Vietri, Andrea |
|
2004 |
1-10 |
1-3 |
p. 266-271 6 p. |
artikel |
1092 |
The complexity of broadcasting in planar and decomposable graphs
|
Jakoby, Andreas |
|
1998 |
1-10 |
1-3 |
p. 179-206 28 p. |
artikel |
1093 |
The complexity of colouring symmetric relational systems
|
Brewster, Richard |
|
1994 |
1-10 |
1-3 |
p. 95-105 11 p. |
artikel |
1094 |
The complexity of minimizing and learning OBDDs and FBDDs
|
Sieling, Detlef |
|
2002 |
1-10 |
1-3 |
p. 263-282 20 p. |
artikel |
1095 |
The complexity of modular decomposition of Boolean functions
|
Bioch, Jan C. |
|
2005 |
1-10 |
1-3 |
p. 1-13 13 p. |
artikel |
1096 |
The complexity of multidimensional periodic scheduling
|
Verhaegh, W.F.J. |
|
1998 |
1-10 |
1-3 |
p. 213-242 30 p. |
artikel |
1097 |
The complexity of recognizing tough cubic graphs
|
Bauer, D. |
|
1997 |
1-10 |
1-3 |
p. 35-44 10 p. |
artikel |
1098 |
The complexity of some problems related to Graph 3-colorability
|
Brandstädt, Andreas |
|
1998 |
1-10 |
1-3 |
p. 59-73 15 p. |
artikel |
1099 |
The cost of cutting out convex n-gons
|
Dumitrescu, Adrian |
|
2004 |
1-10 |
1-3 |
p. 353-358 6 p. |
artikel |
1100 |
The covering radius of doubled 2-designs in 2 O k
|
Solé, Patrick |
|
1991 |
1-10 |
1-3 |
p. 215-224 10 p. |
artikel |
1101 |
The cycle structure of regular multipartite tournaments
|
Guo, Yubao |
|
2002 |
1-10 |
1-3 |
p. 109-116 8 p. |
artikel |
1102 |
The cyclic cutwidth of trees
|
Chavez, J.D. |
|
1998 |
1-10 |
1-3 |
p. 25-32 8 p. |
artikel |
1103 |
The cyclic wirelength of trees
|
Bezrukov, S.L. |
|
1998 |
1-10 |
1-3 |
p. 275-277 3 p. |
artikel |
1104 |
The disjunctive procedure and blocker duality
|
Aguilera, Néstor E. |
|
2002 |
1-10 |
1-3 |
p. 1-13 13 p. |
artikel |
1105 |
The edge-disjoint paths problem is NP-complete for series–parallel graphs
|
Nishizeki, Takao |
|
2001 |
1-10 |
1-3 |
p. 177-186 10 p. |
artikel |
1106 |
The efficiency of AC graphs
|
Blair, Jean R.S. |
|
1993 |
1-10 |
1-3 |
p. 119-138 20 p. |
artikel |
1107 |
The Erdős-Ko-Rado bound for the function lattice
|
Bey, Christian |
|
1999 |
1-10 |
1-3 |
p. 115-125 11 p. |
artikel |
1108 |
The exchange-stable marriage problem
|
Cechlárová, Katarína |
|
2005 |
1-10 |
1-3 |
p. 109-122 14 p. |
artikel |
1109 |
The Gergonne p-pile problem and the dynamics of the function x |→ ⌊ (x + r) p ⌋
|
Harrison, John |
|
1998 |
1-10 |
1-3 |
p. 103-113 11 p. |
artikel |
1110 |
The graph sandwich problem for 1-join composition is NP-complete
|
de Figueiredo, Celina M.H. |
|
2002 |
1-10 |
1-3 |
p. 73-82 10 p. |
artikel |
1111 |
The Hall number, the Hall index, and the total Hall number of a graph
|
Hilton, A.J.W |
|
1999 |
1-10 |
1-3 |
p. 227-245 19 p. |
artikel |
1112 |
The incidentor coloring of multigraphs and its applications
|
Pyatkin, A.V. |
|
2002 |
1-10 |
1-3 |
p. 209-217 9 p. |
artikel |
1113 |
The influence of variables on pseudo-Boolean functions with applications to game theory and multicriteria decision making
|
Marichal, Jean-Luc |
|
2000 |
1-10 |
1-3 |
p. 139-164 26 p. |
artikel |
1114 |
The insulation sequence of a graph
|
Grigorescu, Elena |
|
2004 |
1-10 |
1-3 |
p. 77-90 14 p. |
artikel |
1115 |
The integrity of a cubic graph
|
Vince, A. |
|
2004 |
1-10 |
1-3 |
p. 223-239 17 p. |
artikel |
1116 |
The k-cardinality assignment problem
|
Dell'Amico, Mauro |
|
1997 |
1-10 |
1-3 |
p. 103-121 19 p. |
artikel |
1117 |
The many benefits of putting stack filters into disjunctive or conjunctive normal form
|
Wild, Marcel |
|
2005 |
1-10 |
1-3 |
p. 174-191 18 p. |
artikel |
1118 |
The Mapmaker's dilemma
|
Beigel, Richard |
|
1991 |
1-10 |
1-3 |
p. 37-48 12 p. |
artikel |
1119 |
The maximal clique and colourability of curve contact graphs
|
Hlineˇný, Petr |
|
1998 |
1-10 |
1-3 |
p. 59-68 10 p. |
artikel |
1120 |
The maximum deviation just-in-time scheduling problem
|
Brauner, N. |
|
2004 |
1-10 |
1-3 |
p. 25-50 26 p. |
artikel |
1121 |
The maximum number of winning 2-sets
|
West, Douglas B. |
|
1991 |
1-10 |
1-3 |
p. 279-284 6 p. |
artikel |
1122 |
The Maximum Travelling Salesman Problem on symmetric Demidenko matrices
|
Deı̆neko, Vladimir G. |
|
2000 |
1-10 |
1-3 |
p. 413-425 13 p. |
artikel |
1123 |
The median function on median graphs and semilattices
|
McMorris, F.R. |
|
2000 |
1-10 |
1-3 |
p. 221-230 10 p. |
artikel |
1124 |
The median procedure on median graphs
|
McMorris, F.R. |
|
1998 |
1-10 |
1-3 |
p. 165-181 17 p. |
artikel |
1125 |
The membership problem for unmixed polynomial ideals is solvable in single exponential time
|
Dickenstein, Alicia |
|
1991 |
1-10 |
1-3 |
p. 73-94 22 p. |
artikel |
1126 |
The Metropolis algorithm for graph bisection
|
Jerrum, Mark |
|
1998 |
1-10 |
1-3 |
p. 155-175 21 p. |
artikel |
1127 |
The m-step competition graph of a digraph
|
Cho, Han Hyuk |
|
2000 |
1-10 |
1-3 |
p. 115-127 13 p. |
artikel |
1128 |
The m -step, same-step, and any-step competition graphs
|
Ho, Wei |
|
2005 |
1-10 |
1-3 |
p. 159-175 17 p. |
artikel |
1129 |
The number of independent sets in unicyclic graphs
|
Pedersen, Anders Sune |
|
2005 |
1-10 |
1-3 |
p. 246-256 11 p. |
artikel |
1130 |
The parameters of subcodes of algebraic-geometric codes over prime subfields
|
Skorobogatov, Alexei N. |
|
1991 |
1-10 |
1-3 |
p. 205-214 10 p. |
artikel |
1131 |
The point-to-point connection problem — analysis and algorithms
|
Natu, Madan |
|
1997 |
1-10 |
1-3 |
p. 207-226 20 p. |
artikel |
1132 |
The principle of valency conservation I. The skeleton influence on pericyclic reactions
|
Hass, E.C. |
|
1988 |
1-10 |
1-3 |
p. 215-237 23 p. |
artikel |
1133 |
The proper linear spaces on 17 points
|
Betten, A |
|
1999 |
1-10 |
1-3 |
p. 83-108 26 p. |
artikel |
1134 |
The reconstruction of a subclass of domino tilings from two projections
|
Frosini, A. |
|
2005 |
1-10 |
1-3 |
p. 154-168 15 p. |
artikel |
1135 |
The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width
|
Klasing, Ralf |
|
1998 |
1-10 |
1-3 |
p. 229-246 18 p. |
artikel |
1136 |
The resolution complexity of random graph k-colorability
|
Beame, Paul |
|
2005 |
1-10 |
1-3 |
p. 25-47 23 p. |
artikel |
1137 |
The reversing number of a diagraph
|
Barthélemy, Jean-Pierre |
|
1995 |
1-10 |
1-3 |
p. 39-76 38 p. |
artikel |
1138 |
The Riordan group
|
Shapiro, Louis W. |
|
1991 |
1-10 |
1-3 |
p. 229-239 11 p. |
artikel |
1139 |
The scheduling of maintenance service
|
Anily, Shoshana |
|
1998 |
1-10 |
1-3 |
p. 27-42 16 p. |
artikel |
1140 |
The set of reversible 90 150 cellular automata is regular
|
Sarkar, Palash |
|
1998 |
1-10 |
1-3 |
p. 199-213 15 p. |
artikel |
1141 |
The setup polyhedron of series-parallel posets
|
Schrader, Rainer |
|
1997 |
1-10 |
1-3 |
p. 213-221 9 p. |
artikel |
1142 |
The Shapley value on convex geometries
|
Bilbao, J.M. |
|
2000 |
1-10 |
1-3 |
p. 33-40 8 p. |
artikel |
1143 |
The shifting algorithm technique for the partitioning of trees
|
Becker, Ronald I. |
|
1995 |
1-10 |
1-3 |
p. 15-34 20 p. |
artikel |
1144 |
The simulated trading heuristic for solving vehicle routing problems
|
Bachem, A. |
|
1996 |
1-10 |
1-3 |
p. 47-72 26 p. |
artikel |
1145 |
The single loop representations of regular languages
|
Shyr, H.J. |
|
1998 |
1-10 |
1-3 |
p. 219-229 11 p. |
artikel |
1146 |
The stable crews problem
|
Cechlárová, Katarı́na |
|
2004 |
1-10 |
1-3 |
p. 1-17 17 p. |
artikel |
1147 |
The Steiner ratio of L 2k d
|
Cieslik, Dietmar |
|
1999 |
1-10 |
1-3 |
p. 217-221 5 p. |
artikel |
1148 |
The structure of obstructions to treewidth and pathwidth
|
Chlebı́ková, Janka |
|
2002 |
1-10 |
1-3 |
p. 61-71 11 p. |
artikel |
1149 |
The structure of stable marriage with indifference
|
Manlove, David F. |
|
2002 |
1-10 |
1-3 |
p. 167-181 15 p. |
artikel |
1150 |
The time complexity of deterministic broadcast radio networks
|
Hwang, F.K. |
|
1995 |
1-10 |
1-3 |
p. 219-222 4 p. |
artikel |
1151 |
The train marshalling problem
|
Dahlhaus, Elias |
|
2000 |
1-10 |
1-3 |
p. 41-54 14 p. |
artikel |
1152 |
The weighted independent domination problem is NP-complete for chordal graphs
|
Chang, Gerard J. |
|
2004 |
1-10 |
1-3 |
p. 351-352 2 p. |
artikel |
1153 |
Three-dimensional axial assignment problems with decomposable cost coefficients
|
Burkard, Rainer E. |
|
1996 |
1-10 |
1-3 |
p. 123-139 17 p. |
artikel |
1154 |
Three-dimensional orthogonal graph drawing algorithms
|
Eades, Peter |
|
2000 |
1-10 |
1-3 |
p. 55-87 33 p. |
artikel |
1155 |
ø-threshold and ø-tolerance chain graphs
|
Jacobson, M.S. |
|
1993 |
1-10 |
1-3 |
p. 191-203 13 p. |
artikel |
1156 |
Threshold functions for local properties of graphs: triangles
|
Clark, L.H. |
|
1991 |
1-10 |
1-3 |
p. 83-105 23 p. |
artikel |
1157 |
Threshold phenomena in random structures
|
Cohen, Joel E. |
|
1988 |
1-10 |
1-3 |
p. 113-128 16 p. |
artikel |
1158 |
Threshold properties of random boolean constraint satisfaction problems
|
Istrate, Gabriel |
|
2005 |
1-10 |
1-3 |
p. 141-152 12 p. |
artikel |
1159 |
Tight approximations for resource constrained scheduling and bin packing
|
Srivastav, Anand |
|
1997 |
1-10 |
1-3 |
p. 223-245 23 p. |
artikel |
1160 |
Time-relaxed broadcasting in communication networks
|
Shastri, Aditya |
|
1998 |
1-10 |
1-3 |
p. 263-278 16 p. |
artikel |
1161 |
Time-tables, polyhedra and the greedy algorithm
|
Euler, R. |
|
1996 |
1-10 |
1-3 |
p. 207-221 15 p. |
artikel |
1162 |
Topological optimization with a network reliability constraint
|
Koide, T. |
|
2001 |
1-10 |
1-3 |
p. 135-149 15 p. |
artikel |
1163 |
Total domination number of grid graphs
|
Gravier, Sylvain |
|
2002 |
1-10 |
1-3 |
p. 119-128 10 p. |
artikel |
1164 |
Total interval numbers of complete r-partite graphs
|
Chen, Mingjang |
|
2002 |
1-10 |
1-3 |
p. 83-92 10 p. |
artikel |
1165 |
Total matchings and total coverings of threshold graphs
|
Peled, Uri |
|
1994 |
1-10 |
1-3 |
p. 325-330 6 p. |
artikel |
1166 |
Towards optimal locality in mesh-indexings
|
Niedermeier, Rolf |
|
2002 |
1-10 |
1-3 |
p. 211-237 27 p. |
artikel |
1167 |
Trading properties and Alexandrov kernels for Boolean functions
|
Taylor, Alan D. |
|
2000 |
1-10 |
1-3 |
p. 203-214 12 p. |
artikel |
1168 |
Traffic-light scheduling on the grid
|
Kortsarz, Guy |
|
1994 |
1-10 |
1-3 |
p. 211-234 24 p. |
artikel |
1169 |
Transistor chaining in static CMOS functional cells of arbitrary planar topology
|
Carlson, Bradley S |
|
1999 |
1-10 |
1-3 |
p. 89-114 26 p. |
artikel |
1170 |
Transmission schedules for hypercube interconnection in WDM optical passive star networks
|
Lee, Sang-Kyu |
|
2002 |
1-10 |
1-3 |
p. 133-148 16 p. |
artikel |
1171 |
Transversal partitioning in balanced hypergraphs
|
Dahlhaus, Elias |
|
1997 |
1-10 |
1-3 |
p. 75-89 15 p. |
artikel |
1172 |
Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP
|
Gutin, Gregory |
|
2002 |
1-10 |
1-3 |
p. 81-86 6 p. |
artikel |
1173 |
Tree- and forest-perfect graphs
|
Brandstädt, Andreas |
|
1999 |
1-10 |
1-3 |
p. 141-162 22 p. |
artikel |
1174 |
Tree enterprises and bankruptcy ventures A game theoretic similarity due to a graph theoretic proof
|
Driessen, Theo S.H. |
|
1997 |
1-10 |
1-3 |
p. 105-117 13 p. |
artikel |
1175 |
Tree partitioning under constraints — clustering for vehicle routing problems
|
Hamacher, Anja |
|
2000 |
1-10 |
1-3 |
p. 55-69 15 p. |
artikel |
1176 |
2-Tree probe interval graphs have a large obstruction set
|
Pržulj, Nataša |
|
2005 |
1-10 |
1-3 |
p. 216-231 16 p. |
artikel |
1177 |
Tree scheduling with communication delays
|
Chretienne, Philippe |
|
1994 |
1-10 |
1-3 |
p. 129-141 13 p. |
artikel |
1178 |
Trees with three leaves are (n+1)-unavoidable
|
Ceroi, S |
|
2004 |
1-10 |
1-3 |
p. 19-39 21 p. |
artikel |
1179 |
Treewidth for graphs with small chordality
|
Bodlaender, Hans L. |
|
1997 |
1-10 |
1-3 |
p. 45-61 17 p. |
artikel |
1180 |
Triangle-free graphs and forbidden subgraphs
|
Brandt, Stephan |
|
2002 |
1-10 |
1-3 |
p. 25-33 9 p. |
artikel |
1181 |
Triangulating graphs with few P 4's
|
Babel, Luitpold |
|
1998 |
1-10 |
1-3 |
p. 45-57 13 p. |
artikel |
1182 |
Triangulating multitolerance graphs
|
Parra, Andreas |
|
1998 |
1-10 |
1-3 |
p. 183-197 15 p. |
artikel |
1183 |
Triangulating the surface of a molecule
|
Akkiraju, Nataraj |
|
1996 |
1-10 |
1-3 |
p. 5-22 18 p. |
artikel |
1184 |
TSP ejection chains
|
Pesch, Erwin |
|
1997 |
1-10 |
1-3 |
p. 165-181 17 p. |
artikel |
1185 |
Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring
|
Sakata, Shojiro |
|
1991 |
1-10 |
1-3 |
p. 191-203 13 p. |
artikel |
1186 |
Two results on the bit extraction problem
|
Friedl, Katalin |
|
2000 |
1-10 |
1-3 |
p. 443-454 12 p. |
artikel |
1187 |
Two-segmented channel routing is strong NP-complete
|
Wing Ning Li, |
|
1997 |
1-10 |
1-3 |
p. 291-298 8 p. |
artikel |
1188 |
Two sensitivity theorems in fuzzy integer programming
|
Asratian, A.S. |
|
2004 |
1-10 |
1-3 |
p. 129-140 12 p. |
artikel |
1189 |
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
|
Franco, John |
|
2005 |
1-10 |
1-3 |
p. 89-123 35 p. |
artikel |
1190 |
Uncolorable mixed hypergraphs
|
Tuza, Zsolt |
|
2000 |
1-10 |
1-3 |
p. 209-227 19 p. |
artikel |
1191 |
Underdiagonal lattice paths with unrestricted steps
|
Merlini, Donatella |
|
1999 |
1-10 |
1-3 |
p. 197-213 17 p. |
artikel |
1192 |
Uniform homomorphisms of de Bruijn and Kautz networks
|
Tvrdik, Pavel |
|
1998 |
1-10 |
1-3 |
p. 279-301 23 p. |
artikel |
1193 |
Uniform machine scheduling of unit-time jobs subject to resource constraints
|
Kovalyov, Mikhail Y. |
|
1998 |
1-10 |
1-3 |
p. 253-257 5 p. |
artikel |
1194 |
Unique list-colourability and the fixing chromatic number of graphs
|
Daneshgar, Amir |
|
2005 |
1-10 |
1-3 |
p. 123-138 16 p. |
artikel |
1195 |
Unique satisfiability of Horn sets can be solved in nearly linear time
|
Berman, Kenneth A. |
|
1995 |
1-10 |
1-3 |
p. 77-91 15 p. |
artikel |
1196 |
Upper bounds for the complexity of sequences generated by symmetric Boolean functions
|
Merekin, Yu.V. |
|
2001 |
1-10 |
1-3 |
p. 227-231 5 p. |
artikel |
1197 |
Upper bounds to the clique width of graphs
|
Courcelle, Bruno |
|
2000 |
1-10 |
1-3 |
p. 77-114 38 p. |
artikel |
1198 |
Vertex characterization of partition polytopes of bipartitions and of planar point sets
|
Aviran, Sharon |
|
2002 |
1-10 |
1-3 |
p. 1-15 15 p. |
artikel |
1199 |
Vertex-distinguishing edge-colorings of 2-regular graphs
|
Wittmann, P. |
|
1997 |
1-10 |
1-3 |
p. 265-277 13 p. |
artikel |
1200 |
Vertex pancyclic graphs
|
Randerath, Bert |
|
2002 |
1-10 |
1-3 |
p. 219-237 19 p. |
artikel |
1201 |
Vertex-pancyclicity of edge-face-total graphs
|
Wang, Wei-Fan |
|
2004 |
1-10 |
1-3 |
p. 364-367 4 p. |
artikel |
1202 |
Vertex-splitting and chromatic index critical graphs
|
Hilton, A.J.W. |
|
1997 |
1-10 |
1-3 |
p. 205-211 7 p. |
artikel |
1203 |
Weakened Ramsey numbers
|
Harborth, Heiko |
|
1999 |
1-10 |
1-3 |
p. 279-284 6 p. |
artikel |
1204 |
Weighted connected domination and Steiner trees in distance-hereditary graphs
|
Hong-Gwa, Yeh |
|
1998 |
1-10 |
1-3 |
p. 245-253 9 p. |
artikel |
1205 |
Weighted efficient domination problem on some perfect graphs
|
Lu, Chin Lung |
|
2002 |
1-10 |
1-3 |
p. 163-182 20 p. |
artikel |
1206 |
Which claw-free graphs are perfectly orderable?
|
Chvátal, Vašek |
|
1993 |
1-10 |
1-3 |
p. 39-63 25 p. |
artikel |
1207 |
Wiener index versus maximum degree in trees
|
Fischermann, Miranca |
|
2002 |
1-10 |
1-3 |
p. 127-137 11 p. |
artikel |
1208 |
Work-preserving emulations of shuffle-exchange networks: An analysis of the complex plane diagram
|
Annexstein, Fred |
|
1995 |
1-10 |
1-3 |
p. 13-23 11 p. |
artikel |
1209 |
Worst-case analysis of a dynamic channel assignment strategy
|
Narayanan, Lata |
|
2004 |
1-10 |
1-3 |
p. 115-141 27 p. |
artikel |
1210 |
Z-transformation graphs of maximum matchings of plane bipartite graphs
|
Zhang, Heping |
|
2004 |
1-10 |
1-3 |
p. 339-350 12 p. |
artikel |