2003-06-25 Class Steiner Trees and VLSI-design. 173-194 1999 90 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00090-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam90.html#IhlerRW99 2004-03-17 Erratum: Local Optimization on Graphs. 93-94 1993 46 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam46.html#LlewellynTT93 2003-05-21 Routings for Involutions of a Hypercube. 175-186 1994 48 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#SpragueT94 http://dx.doi.org/10.1016/0166-218X(92)00126-7 2002-01-03 Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP. 95-113 2000 100 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam100.html#ResendePP00 2003-05-22 Which Claw-Free Graphs are Perfectly Orderable? 39-63 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#Chvatal93 http://dx.doi.org/10.1016/0166-218X(93)90221-9 2003-06-16 Resolution Search. 81-99 1997 73 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00003-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#Chvatal97 2003-06-27 An Applied Point Pattern Matching Problem: Comparing 2D Patterns of Protein Ppots. 75-88 1999 93 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam93.html#HoffmannKW99 http://dx.doi.org/10.1016/S0166-218X(99)00007-4 2003-06-30 Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping. 147-165 1998 88 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00070-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam88.html#GrebinskiK98 2002-01-03 Inverse inbreeding coefficient problems with an application to linkage analysis of recessive diseases in inbred populations. 3-44 2000 104 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam104.html#AgarwalaBS00 2003-04-02 Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem. 79-106 2002 119 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#AnjosW02 2003-05-21 on Some Geometric Methods in Scheduling Theory: A Survey. 59-82 1994 55 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)90036-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#Sevastjanov94 2002-01-03 General lower bounds on the query complexity within the exact learning model. 61-81 2000 107 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam107.html#KlasnerS00 2003-06-16 The Discrete Radon Transform and Its Approximate Inversion Via Linear Programming. 39-61 1997 75 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00083-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#FishburnSSV97 2003-05-27 The Covering Radius of Hadamard Codes in Odd Graphs. 501-510 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#SoleGS92 http://dx.doi.org/10.1016/0166-218X(92)90154-3 2003-06-16 Periodic Gossiping in Back-to-back Trees. 157-168 1997 75 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(96)00086-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#LabahnR97 2003-06-23 A Unified Approximation Algorithm for Node-deletion Problems. 213-231 1998 86 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(98)00035-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam86.html#Fujito98 2003-05-26 Lot-size Scheduling of Two Types of Jobs on Identical Machines. 409-419 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00044-R http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#PattlochS96 2002-01-03 On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. 23-52 2001 108 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#CourcelleMR01 2003-06-23 A Fast Algorithm for Strongly Correlated Knapsack Problems. 197-212 1998 89 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00127-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam89.html#Pisinger98 2002-01-03 Maximum path digraphs. 221-237 1994 50 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#DelivoriasR94 2003-05-27 Perfect Latin Squares. 281-286 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#HeinrichKK92 http://dx.doi.org/10.1016/0166-218X(92)90139-2 2003-06-30 Minimum Self-dual Decompositions of Positive Dual-minor Boolean Functions. 307-326 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00096-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#BiochIM99 2002-01-03 Preface. 1 2001 112 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam112.html#LabbeLM01 2004-07-14 Families of optimal codes for strong identification. 203-213 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#LaihonenR02 2005-05-09 The Parity Path Problem on Some Subclasses of Perfect Graphs. 293-302 1996 68 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00065-Y http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#SatyanR96 2003-06-25 A Fast and Simple Steiner Routing Heuristic. 51-67 1999 90 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00085-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam90.html#BorahOI99 2003-05-22 The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding Spanning Trees in Hypergraphs. 203-214 1995 59 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)80001-K http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#AndersenF95 2002-01-03 On approximation intractability of the path-distance-width problem. 317-325 2001 110 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#Yamazaki01 2003-05-13 PLA Folding in Special Graph Classes. 63-74 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90094-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#Damaschke94a 2004-11-17 Reconstructing Phylogenies From Nucleotide Pattern Probabilities: A Survey and some New Results. 367-396 1998 88 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00080-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam88.html#SteelHP98 2003-06-16 The Point-to-point Connection Problem - Analysis and Algorithms. 207-226 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00010-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#NatuF97 2003-05-22 Efficient Reformulation for 0-1 Programs - Methods and Computational Results. 147-175 1993 42 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#DietrichEC93 http://dx.doi.org/10.1016/0166-218X(93)90044-O 2003-05-21 A Polynomial Approximation Scheme for the Subset Sum Problem. 243-253 1995 57 Discrete Applied Mathematics 2-3 http://dx.doi.org/ http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam57.html#SomaZYH95 2003-04-02 Augmenting trees so that every three vertices lie on a cycle. 145-159 2002 116 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam116.html#DankelmannGOS02 2002-01-03 On the P4-components of graphs. 215-235 2000 100 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam100.html#RaschleS00 2003-07-04 The Lattices of Closure Systems, Closure Operators, and Implicational Systems on a Finite Set: A Survey. 241-269 2003 127 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00209-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#CaspardM03 2003-06-16 k-edge Subgraph Problems. 159-169 1997 74 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(96)00030-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#GoldschmidtH97 2003-05-21 Universal Covers of Graphs: Isomorphism to Depth N-1 Implies Isomorphism to All Depths. 61-74 1995 56 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0133-J http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#Norris95 2005-02-07 on Some Algorithmic Investigations of Star Partitions of Graphs. 119-130 1995 62 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00149-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam62.html#CvetkovicRS95 2003-04-02 Clique tree generalization and new subclasses of chordal graphs. 109-131 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#KumarM02 2003-06-23 Minimal Vertex Separators of Chordal Graphs. 155-168 1998 89 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00123-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam89.html#KumarM98 2002-01-03 SPLITTING NUMBER is NP-complete. 65-83 2001 108 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#FariaFN01 2003-06-30 The Complexity of the Falsifiability Problem for Pure Implicational Formulas. 127-138 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00036-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#Heusch99 2002-01-03 Unital designs in planes of order 16. 151-158 2000 102 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam102.html#StoichevT00 2002-01-03 Efficient embeddings of grids into grids. 143-173 2001 108 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#RottgerS01 2003-06-30 On the Deficiency of Bipartite Graphs. 193-203 1999 94 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00021-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam94.html#GiaroKM99 2003-05-27 A New Look at the de Bruijn Graph. 193-203 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#Fredricksen92 http://dx.doi.org/10.1016/0166-218X(92)90133-U 2003-06-23 Helicopter Search Problems, Bandwidth and Pathwidth. 59-70 1998 85 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(97)00131-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam85.html#Fomin98 2003-06-30 Note on a Helicopter Search Problem on Graphs. 241-249 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00078-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#Fomin99 2002-03-21 Some Results on Visibility Graphs. 5-17 1992 40 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#Andreae92 2003-06-23 Vapnik-Chervonenkis Dimension of Recurrent Neural Networks. 63-79 1998 86 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(98)00014-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam86.html#KoiranS98 2003-05-26 Triangulating Graphs Without Asteroidal Triples. 281-287 1996 64 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00095-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam64.html#Mohring96 2003-06-18 Cycles in the cube-connected cycles graph. 135-155 1998 83 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam83.html#GermaHS98 http://dx.doi.org/10.1016/S0166-218X(98)80001-2 2002-01-03 The edge versus path incidence matrix of series-parallel graphs and greedy packing. 275-284 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#HoffmanS01 2002-01-03 A multi-scale algorithm for drawing graphs nicely. 3-21 2001 113 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#HadanyH01 2006-01-25 Complexity of Langton's ant. 41-50 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#GajardoMC02 2003-06-30 On the Chvátal Rank of Polytopes in the 0/1 Cube. 21-27 1999 98 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(99)00156-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#BockmayrEHS99 2003-04-01 Graph-theoretical properties of parallelism in the digital plane. 135-160 2003 125 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam125.html#Veelaert03 2003-07-08 A Lower Bound on the Weight Hierarchies of Product Codes. 251-261 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00449-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#SchaathunW03 2003-06-18 A Strongly Polynomial Algorithm for the Uniform Balanced Network Flow Problem. 123-131 1998 81 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)88001-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam81.html#Scutella98 2003-04-01 A primal-dual approximation algorithm for the survivable network design problem in hypergraphs. 275-289 2003 126 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam126.html#ZhaoNI03 2003-06-30 A Technique to Find Multiple Motif Occurrences in a Biomolecular Sequence. 297-319 1999 94 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00027-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam94.html#Moeri99 2003-06-30 An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer. 169-180 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00073-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#CanfieldE99 2003-06-30 Acyclic Molecules with Greatest HOMO-LUMO Separation. 165-171 1999 98 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(99)00119-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#ZhangA99 2003-04-01 Ordering graphs with small index and its application. 295-306 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#ZhangC02 2002-01-03 Plane elementary bipartite graphs. 291-311 2000 105 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam105.html#ZhangZ00 2003-06-17 The Clar Covering Polynomial of Hexagonal Systems I. 147-167 1996 69 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00081-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam69.html#ZhangZ96 2003-06-16 A Note on the Number of Perfect Matchings of Bipartite Graphs. 275-282 1997 73 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00107-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#ZhangZ97 2003-06-27 Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems. 235-242 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00104-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#RighiniT99 2003-05-06 Some Preemptive open Shop Scheduling Problems with a Renewable or a Nonrenewable Resource. (Discrete Applied Mathematics 35 (1992) 205-219). 103-104 1993 43 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#WerraB93 http://dx.doi.org/10.1016/0166-218X(93)90172-K 2003-11-25 Chromatic Scheduling and Frequency Assignment. 165-174 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#WerraG94 2003-06-16 Preassignment Requirements in Chromatic Scheduling. 93-101 1997 76 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)82776-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam76.html#WerraM97 2003-05-21 Bounds on Certain Multiplications of Affine Combinations. 155-167 1994 52 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)90079-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#BoyarFL94 2003-07-08 Tight Bounds for Synchronous Communication of Information Using Bits, Silence. 195-209 2003 129 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00240-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#OReillyS03 2002-01-03 Recursive bounds for perfect hashing. 307-311 2001 111 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam111.html#FachiniN01 2003-07-04 Bernoulli Numbers and the Probability of a Birthday Surprise. 657-663 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00396-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#Tsaban03 2003-06-16 Efficient Computation of Implicit Representations of Sparse Graphs. 1-16 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00007-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#ArikatiMZ97 2003-04-01 Coloring permutation graphs in parallel. 165-195 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#Nikolopoulos02 2003-05-13 A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems. 243-267 1994 51 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(92)00033-I http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#Fiechter94 2003-04-01 On the bound for anonymous secret sharing schemes. 193-202 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#KishimotoOKO02 2003-06-16 Random Walks and Electrical Resistances in Products of Graphs. 69-79 1997 73 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00002-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#BollobasB97 2003-06-16 Matchings and Paths in the Cube. 1-8 1997 75 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00076-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#BollobasL97 2002-01-03 The pagenumber of k-trees is O(k). 215-221 2001 109 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam109.html#GanleyH01 2003-04-02 The edge-disjoint paths problem is NP-complete for series-parallel graphs. 177-186 2001 115 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam115.html#NishizekiVZ01 2003-06-27 A Map From the Lower-half of the n-cube Onto the (n-1)-cube Which Preserves Intersecting Antichains. 223-228 1999 92 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00054-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam92.html#MiyakawaNPR99 2003-06-27 ₆-free Graphs. 177-191 1999 92 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00046-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam92.html#Mosca99 2003-05-22 Preface. 1-3 1995 62 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)90003-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam62.html#LucertiniRSS95 2002-01-03 Maximum-entropy remote sampling. 211-226 2001 108 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#AnstreicherFLW01 2003-07-08 SONET/SDH Ring Assignment with Capacity Constraints. 99-128 2003 129 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00236-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#GoldschmidtLO03 2003-04-01 A non-ambiguous decomposition of regular languages and factorizing codes. 129-165 2003 126 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam126.html#Anselmo03 2003-07-08 Inverse Optimization in High-speed Networks. 83-98 2003 129 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00235-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#FaragoSS03 2003-04-01 Polyhedral graphs with extreme numbers of types of faces. 263-274 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#Walther02 2003-06-18 Polyhedral Graphs Without Hamiltonian Cycles. 257-263 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00047-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#Walther97 2003-06-30 Reactive Local Search Techniques for the Maximum k-conjunctive Constraint Satisfaction Problem (MAX-k-CCSP). 3-27 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00030-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#BattitiP99 2003-06-16 On the Subword Equivalence Problem for Morphic Words. 231-253 1997 75 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(97)89162-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#Fagnot97 2003-11-24 Parametric Min-cuts Analysis in a Network. 679-689 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00496-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#AnejaCN03 2005-01-25 Some Methods for Counting the Spanning Trees in Labelled Molecular Graphs, Examined in Relation to Certain Fullerenes. 199-200 1997 75 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(97)00004-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#BrownaMPR97 2003-05-22 Monge and Feasibility Sequences in General Flow Problems. 21-38 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#AdlerHS93 http://dx.doi.org/10.1016/0166-218X(93)90220-I 2003-07-08 Analysis of 3gpp-MAC and Two-key 3gpp-MAC. 181-191 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00444-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#KnudsenM03 2002-01-03 On the structure of Skipjack. 103-116 2001 111 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam111.html#KnudsenW01 2005-07-13 VC-dimensions of Finite Automata and Commutative Finite Automata with k Letters, n States. 123-134 1997 74 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(96)00025-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#IshigamiT97 2003-06-30 On Maximal Shadows of Members in Left-compressed Sets. 3-9 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00061-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#AhlswedeZ99 2002-01-03 A rounding algorithm for integer programs. 267-282 1994 50 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#LakshminarayananC94 2002-01-03 On factor graphs of DOL words. 121-130 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#Frid01a 2003-07-08 On Equidistant Constant Weight Codes. 157-164 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00442-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#FuKLW03 2003-05-22 Introduction. 1-3 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#GolumbicL93a 2003-05-06 Preface. 109 1993 43 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(93)90001-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#Llewellyn93 2002-01-03 Local symmetries in the period-doubling sequence. 115-121 2000 100 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam100.html#Damanik00 2003-06-17 Nonoverlapping Local Alignments (weighted Independent Sets of Axis-parallel Rectangles). 41-53 1996 71 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00063-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam71.html#BafnaNR96 2003-06-27 Underdiagonal Lattice Paths with Unrestricted Steps. 197-213 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00126-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#MerliniRSV99 2003-06-17 On the Computational Power of DNA. 79-94 1996 71 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00058-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam71.html#BonehDLS96 2003-06-30 Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine. 29-38 1999 98 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(98)00143-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#ChekuriM99 2003-05-22 on Some New Types of Greedy Chains and Greedy Linear Extensions of Partially ordered Sets. 349-358 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00065-L http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#Syslo95 2002-01-03 Interval arithmetic yields efficient dynamic filters for computational geometry. 25-47 2001 109 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam109.html#BronnimannBP01 2003-05-22 A Note on Subtrees Rooted Along the Primary Path of a Binary Tree. 87-93 1993 42 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#TroutmanK93 http://dx.doi.org/10.1016/0166-218X(93)90181-M 2004-05-12 The nucleolus of homogeneous games with steps. 53-76 1994 50 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#RosenmullerS94 2003-04-01 Triangle-free graphs and forbidden subgraphs. 25-33 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#Brandt02 2003-06-18 A Sufficient Condition for All Short Cycles. 63-66 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00032-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#Brandt97 2003-05-21 Computing Roots of Graphs Is Hard. 81-88 1994 54 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00023-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam54.html#MotwaniS94 2002-01-03 Bounded-call broadcasting. 37-53 1994 53 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam53.html#FarleyP94 2002-01-03 An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix. 13-22 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#Beresnev01 2003-06-16 Minimizing the Number of Tardy Jobs with Precedence Constraints and Agreeable Due Dates. 167-177 1997 72 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(96)00043-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam72.html#Steiner97 2003-05-13 A Lower Bound for the Shortness Coefficient of a Class of Graphs. 103-105 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90098-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#HarantW94 2003-07-04 On Cutting a Few Vertices from a Graph. 643-649 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00394-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#FeigeKN03 2002-01-03 The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints. 129-145 2001 112 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam112.html#GouveiaP01 2003-05-26 Well Irredundant Graphs. 267-276 1995 63 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00073-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#ToppV95 2003-05-21 Stable Matchings and Linear Inequalities. 1-27 1994 54 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)90130-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam54.html#AbeledoR94 2003-05-26 Paths to Marriage Stability. 1-12 1995 63 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00026-A http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#AbeledoR95 2003-06-30 Valid Inequalities and Separation for Capacitated Fixed Charge Flow Problems. 265-274 2000 98 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(99)00164-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#Stallaert00 2003-06-16 The Complementary Class of Generalized Flow Cover Inequalities. 73-80 1997 77 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(97)89210-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam77.html#Stallaert97 2004-09-28 Models, relaxations and exact approaches for the capacitated vehicle routing problem. 487-512 2002 123 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam123.html#TothV02 2003-04-02 Finding all the negative cycles in a directed graph. 279-291 2002 118 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#YamadaK02 2003-06-16 Uniform Tag Systems for Paperfolding Sequences. 119-138 1997 77 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(97)84103-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam77.html#Bercoff97 2003-06-17 On the Chromatic Number, Colorings, and Codes of the Johnson Graph. 163-175 1996 70 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(96)00104-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam70.html#EtzionB96 2003-04-01 Some approaches to a conjecture on short cycles in digraphs. 45-53 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#BroersmaL02 2003-05-13 Subgraphs, Closures and Hamiltonicity. 39-46 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90092-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#BroersmaS94 2003-04-01 A note on minimum degree conditions for supereulerian graphs. 35-43 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#BroersmaX02 2003-11-27 On "The Matching Polynomial of a Polygraph". 79-86 1993 46 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam46.html#BroersmaX93 http://dx.doi.org/10.1016/0166-218X(93)90159-L 2003-06-17 Periodic Network Optimization with Different Arc Frequencies. 1-17 1996 69 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00073-Z http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam69.html#Nachtigall96 2003-06-23 Perfect Broadcasting in Unlabeled Networks. 33-47 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00047-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#DiksKP98 2003-11-21 Parallel Machine Scheduling to Minimize Costs for Earliness and Number of Tardy Jobs. 139-164 1993 47 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#KahlbacherC93 http://dx.doi.org/10.1016/0166-218X(93)90088-6 2003-06-16 Preserving Approximation in the Min-Weighted Set Cover Problem. 13-22 1997 73 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00047-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#GambosiPT97 2002-01-03 Computing orbit period in max-min algebra. 49-65 2000 100 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam100.html#Gavalec00 2003-06-16 Computing Matrix Period in Max-min Algebra. 63-70 1997 75 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00079-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#Gavalec97 2003-04-02 Minimal elimination ordering for graphs of bounded degree. 127-143 2002 116 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam116.html#Dahlhaus02 2003-05-13 A Parallel Algorithm for Computing Steiner Trees in Strongly Chordal Graphs. 47-61 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90093-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#Dahlhaus94 2003-05-21 Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs. 29-44 1995 57 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0138-o http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam57.html#Dahlhaus95 2003-04-01 Superdominance order and distance of trees with bounded maximum degree. 225-233 2003 125 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam125.html#JelenT03 2003-06-30 Facets of the p-cycle polytope. 147-178 2001 112 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam112.html#HartmannO01 2005-02-09 Efficient line broadcasting in a d-dimensional grid. 129-141 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#AverbuchRS01 2003-06-23 Rigidity of Octahedral-tetrahedral Trusses. 249-262 1998 86 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(98)00030-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam86.html#PalmerRSW98 2003-04-02 Cooperative phenomena in crystals and the probability of tied Bord acount elections. 265-271 2002 119 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#Marchant02 2003-05-26 No-hole k-tuple (r+1)-distant Colorings. 67-85 1996 64 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00030-H http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam64.html#Troxell96 2003-07-02 Connected Domination and Dominating Clique in Trapezoid Graphs. 91-110 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00127-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#Kohler00 2003-05-21 Joint Performance of Greedy Heuristics for the Integer Knapsack Problem. 37-48 1995 56 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0132-I http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#KohliK95 2002-01-03 Coding, Cryptography, and Computer Security - Preface. 1 2000 102 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam102.html#ColbournK00 2002-03-21 A Manhattan Channel Router with Good Theoretical and Practical Performance. 83-104 1992 40 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#Wieners-Lummer92 2003-06-27 On the Nonexistence of Extremal Self-dual Codes. 277-286 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00131-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#Shengyuan99 2003-05-21 New Results in the Worst-Case Analysis for Flow-Shop Scheduling. 21-41 1993 46 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam46.html#NowickiS93 http://dx.doi.org/10.1016/0166-218X(93)90156-I 2003-05-21 An Approximation Algorithm for a Single-Machine Scheduling Problem with Release Times and Delivery Times. 69-79 1994 48 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#NowickiS94 http://dx.doi.org/10.1016/0166-218X(92)00110-8 2003-05-26 A Bicriterion Approach to Preemptive Scheduling of Parallel Machines with Controllable Job Processing Times. 237-256 1995 63 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00071-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#NowickiZ95 2003-06-23 EP Theorems and Linear Complementarity Problems. 107-119 1998 84 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00143-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam84.html#FukudaNT98 2002-01-03 Sparse Hypercube 3-spanners. 289-295 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#DuckworthZ00 2002-01-03 Tree Scheduling with Communication Delays. 129-141 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#Chretienne94 2003-06-30 List Schedules for Cyclic Scheduling. 141-159 1999 94 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00017-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam94.html#Chretienne99 2004-02-24 Explicit Construction of Graphs with an Arbitrary Large Girth and of Large Size. 275-284 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00058-L http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#LazebnikU95 2003-06-23 Minimization of an M-convex Function. 215-220 1998 84 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00140-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam84.html#Shioura98a 2003-04-01 k-Subdomination in graphs. 55-60 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#ChangLY02 2006-05-04 An Isomorphism Between the P-adic Integers and a Ring Associated with a Tiling of N-space By Permutohedra. 39-51 1994 52 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(92)00186-P http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#KittoVW94 2003-05-26 Weighted Independent Perfect Domination on Cocomparability Graphs. 215-222 1995 63 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00067-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#ChangRC95 2003-05-27 Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs. 1-12 1992 39 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#ChangTL92 http://dx.doi.org/10.1016/0166-218X(92)90111-M 2003-06-27 Induced Permutation Automata and Coverings of Strongly Connected Automata. 243-249 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00150-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#UemuraYS99 2003-05-21 Uncovering Generalized-Network Structure in Matrices. 191-220 1993 46 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam46.html#CoullardGW93 http://dx.doi.org/10.1016/0166-218X(93)90103-U 2003-06-27 A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks. 91-110 1999 92 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00048-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam92.html#BrandesSNWW99 2003-06-16 Scheduling with Batching: Two Job Types. 99-114 1997 72 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(96)00039-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam72.html#HochbaumL97 2002-01-03 Approximating a generalization of MAX 2SAT and MIN 2SAT. 41-59 2000 107 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam107.html#HochbaumP00 2003-06-18 The Relationship between the Gossip Complexity in Vertex-Disjoint Paths Mode and the Vertex Bisection Width. 229-246 1998 83 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam83.html#Klasing98 http://dx.doi.org/10.1016/S0166-218X(97)00112-1 2003-06-18 Uniform homomorphisms of de Bruijn and Kautz networks. 279-301 1998 83 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam83.html#TvrdikHH98 http://dx.doi.org/10.1016/S0166-218X(97)00115-7 2003-07-02 How to Survive While Visiting a Graph. 279-293 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00139-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#ArbibFN00 2003-04-01 Complexity of finding dense subgraphs. 15-26 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#AsahiroHI02 2003-05-22 Generalized Perfect Graphs: Characterizations and Inversion. 359-387 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00066-M http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#Trenk95 2003-06-27 A Three-dimensional Matching Model for Perishable Production Scheduling. 1-15 1999 92 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(98)00148-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam92.html#ArbibPS99 2003-06-23 A Graph-theoretic Generalization of the Sauer-Shelah Lemma. 27-35 1998 86 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(98)00012-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam86.html#Cesa-BianchiH98 2003-05-27 Communication Complexity of two Decision Problems. 161-163 1992 39 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#BjornerKL92 http://dx.doi.org/10.1016/0166-218X(92)90167-9 2003-05-21 Random Knapsacks with Many Constraints. 163-174 1994 48 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#Schilling94 http://dx.doi.org/10.1016/0166-218X(92)00125-6 2003-04-01 Classes of quadratic assignment problem instances: isomorphism and difficulty measure using a statistical approach. 103-116 2002 124 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam124.html#AbreuNQG02 2004-05-12 On Acyclic Conjugated Molecules with Minimal Energies. 71-84 1999 92 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(98)00152-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam92.html#FujiH99 2003-07-08 Competitive Video on Demand Schedulers for Popular Movies. 49-61 2003 129 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00233-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#BourasKPS03 2002-01-03 Representing graphs implicitly using almost optimal space. 193-210 2001 108 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#TalamoV01 2003-06-18 Matrix transpose on meshes with wormhole and XY routing. 41-59 1998 83 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam83.html#DingHT98 http://dx.doi.org/10.1016/S0166-218X(97)00103-0 2003-06-18 On the Double Competition Number. 251-255 1998 82 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00117-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam82.html#Furedi98 2002-01-03 Two classes of ternary codes and their weight distributions. 37-53 2001 111 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam111.html#DingKS01 2002-01-03 An approximation algorithm for the maximum cut problem and its experimental analysis. 3-12 2001 110 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#BertoniCG01 2003-05-21 The Copeland Measure of Condorcet Choice Functions. 273-279 1994 55 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)90013-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#LaffondLB94 2003-06-30 Mixed Logical-linear Programming. 395-442 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00100-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#HookerO99 2003-05-27 Negative Cycles in Complete Signed Graphs. 145-152 1996 68 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00010-O http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#PopescuT96 2003-05-13 Arborescence Polytopes for Series-parallel Graphs. 277-289 1994 51 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(92)00035-K http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#Goemans94 2003-05-22 An Approximation Algorithm for Scheduling on Three Dedicated Machines. 49-59 1995 61 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00160-F http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam61.html#Goemans95 2002-01-03 Upgrading bottleneck constrained forests. 129-142 2001 108 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#KrumkeMNRW01 2002-01-03 On the poset of all posets on n elements. 111-123 1994 50 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#BrualdiJT94 2003-05-27 Degree-constrained Spanners for Multidimensional Grids. 119-144 1996 68 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00050-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#LiestmanSS96 2003-05-27 Minimum Broadcast Digraphs. 401-419 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#LiestmanP92 http://dx.doi.org/10.1016/0166-218X(92)90148-4 2003-05-21 Scheduling with Incompatible Jobs. 219-232 1994 55 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)90009-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#BodlaenderJW94 2003-05-21 A Characterization of Overlap-Free Morphisms. 275-281 1993 46 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam46.html#BerstelS93 http://dx.doi.org/10.1016/0166-218X(93)90107-Y 2003-05-22 Search ans Sweep Numbers of Finite Directed Acyclic Graphs. 1-11 1993 41 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#Nowakowski93 http://dx.doi.org/10.1016/0166-218X(93)90242-G 2003-05-21 Maximal Outerplanar Graphs with Perfect Face-independent Vertex Covers. 267-280 1994 54 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)90027-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam54.html#WinterS94 2002-01-03 On connected list colorings of graphs. 295-300 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#Vizing01 2003-06-18 Cliques That Are Tolerance Digraphs. 119-134 1997 80 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(97)00019-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#ShullT97 2003-05-22 Graph Partitioning Applied to the Logic Testing of Combinational Circuits. 131-165 1995 62 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00150-C http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam62.html#Davis-MoradkhanR95 2003-07-08 Application of Cover-free Codes and Combinatorial Designs to Two-stage Testing. 11-26 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00433-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#BergerL03 2003-05-21 A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs. 77-83 1993 47 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#KorachP93 http://dx.doi.org/10.1016/0166-218X(93)90153-F 2003-05-06 Tree-Width, Path-Widt, and Cutwidth. 97-101 1993 43 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#KorachS93 http://dx.doi.org/10.1016/0166-218X(93)90171-J 2003-05-22 General Vertex Disjoint Paths in Series-Parallel Graphs. 147-164 1993 41 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#KorachT93 http://dx.doi.org/10.1016/0166-218X(93)90035-M 2004-09-17 On the classification of extremal even formally self-dual codes of lengths 20 and 22. 75-86 2001 111 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam111.html#FieldsGHP01 2003-06-16 Batch Scheduling in a Two-machine Flow Shop with Limited Buffer. 243-260 1997 72 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00114-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam72.html#AgnetisPR97 2002-01-03 Probe location in the presence of errors: a problem from DNA mapping. 187-201 2000 104 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam104.html#Mumey00 2003-05-27 New Methods for Using Cayley Graphs in Interconnection Networks. 95-118 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#CoopermanF92 http://dx.doi.org/10.1016/0166-218X(92)90127-V 2003-05-26 Lower Probabilities and Function Representation. 227-243 1996 66 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00163-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#Kampke96 2003-04-02 Spanning trees with constraints on the leaf degree. 73-76 2001 115 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam115.html#Kaneko01 2003-05-22 <i>g, f</i>)-Factors: A Greedy Algorithm. 247-260 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#Anstee93 http://dx.doi.org/10.1016/0166-218X(93)90235-G 2005-07-04 Finding the l-core of a tree. 25-42 2002 118 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#BeckerCLSS02 2003-04-01 The complexity of compressing subsegments of images described by finite automata. 235-254 2003 125 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam125.html#KarhumakiPR03 2003-06-17 Fast Multiple Alignment of Ungapped DNA Sequences Using Information Theory and a Relaxation Method. 259-268 1996 71 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00068-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam71.html#SchneiderM96 2002-01-03 Designing algorithms by sampling. 59-75 2001 110 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#GoldbergH01 2002-01-03 Very fast parallel algorithms for approximate edge coloring. 227-238 2001 108 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#HanLS01 2002-01-03 Complete weight enumerators of generalized Kerdock code and related linear codes over Galois ring. 117-137 2001 111 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam111.html#KuzminN01 2003-05-21 Genetic Local Search in Combinatorial Optimization. 273-284 1994 48 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#KolenP94 http://dx.doi.org/10.1016/0166-218X(92)00180-T 2003-05-21 On the Complexity of a Special Basis Problem in LP. 181-185 1993 47 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#Murty93 http://dx.doi.org/10.1016/0166-218X(93)90091-2 2006-02-21 Stability Aspects of the Traveling Salesman Problem Based on K-best Solutions. 159-185 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00055-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#LiburaPSV98 2004-11-22 Unified All-pairs Shortest Path Algorithms in the Chordal Hierarchy. 59-71 1997 77 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00103-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam77.html#HanSS97 2002-01-03 Edge-disjoint packings of graphs. 135-148 1994 50 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#CorneilMH94 2003-05-22 Fast Information Sharing in a Complete Network. 75-86 1993 42 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#SunderamW93 http://dx.doi.org/10.1016/0166-218X(93)90180-V 2002-01-03 Biconvex graphs: ordering and algorithms. 1-19 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#AbbasS00 2003-06-27 Clustering Bipartite, Chordal Graphs: Complexity, Sequential, Parallel Algorithms. 1-23 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00094-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#AbbasS99 2003-07-04 Total Balancedness Condition for Steiner Tree Games. 555-563 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00388-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#FangCD03 2004-12-14 A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms. 167-190 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00034-O http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#DaiIIKOY96 2003-05-26 on Preemptive Scheduling: A General Setting for the Two-phase Method. 157-166 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00033-N http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#CochandG96 2003-06-16 Variable and Term Removal From Boolean Formulae. 217-230 1997 75 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00028-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#CramaEH97 2003-04-01 Production planning problems in printed circuit board assembly. 339-361 2002 123 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam123.html#CramaKS02 2003-05-27 Some Large Trivalent Graphs Having Small Diameters. 353-357 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#Kantor92 http://dx.doi.org/10.1016/0166-218X(92)90145-Z 2003-05-21 Broadcasting Multiple Messages in Simultaneous Send/receive Systems. 95-105 1994 55 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)90001-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#Bar-NoyK94 2002-01-03 Optimal multiple message broadcasting in telephone-like communication systems. 1-15 2000 100 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam100.html#Bar-NoyS00 2003-04-02 Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella. 151-176 2001 115 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam115.html#MurotaS01 2003-07-08 Goppa-like Bounds for the Generalized Feng-Rao Distances. 145-156 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00441-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#FarranM03 2003-06-18 On the Covering Radius of an Unrestricted Code as a Function of the Rate, Dual Distance. 177-191 1998 82 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00134-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam82.html#LitsynSS98 2002-01-03 k-p-Infix codes and semaphore codes. 237-252 2001 109 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam109.html#LongJMZ01 2003-06-30 On the Linear Relaxation of the 2-node Connected Subgraph Polytope. 389-416 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00088-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#MahjoubN99 2003-06-30 On the PBD-closure of Sets Containing 3. 251-272 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00079-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#Gruttmuller99 2003-05-26 The Expected Number of Symmetries in Locally Restricted Trees II. 245-253 1996 66 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00164-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#McKeon96 2002-01-03 Trading properties and Alexandrov kernels for Boolean functions. 203-214 2000 107 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam107.html#TaylorZ00 2003-06-23 Properties of some ILP Formulations of a Class of Partitioning Problems. 11-23 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00046-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#Caprara98 2003-07-02 Not Every 2-tough Graph Is Hamiltonian. 317-321 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00141-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#BauerBV00 2003-05-22 Some New Classes of Facets for the Equicut Polytope. 167-191 1995 62 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00151-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam62.html#SouzaL95 2003-05-22 Heuristics for the Minimum Rectilinear Steiner Tree Problem: New Algorithms and a Computational Study. 205-220 1993 45 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam45.html#SouzaR93 http://dx.doi.org/10.1016/0166-218X(93)90010-L 2003-06-16 Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines. 169-188 1997 75 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(96)00087-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#MartelloST97 2003-07-08 A Griesmer Bound for Linear Codes Over Finite Quasi-Frobenius Rings. 263-274 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00450-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#ShiromotoS03 2003-05-22 On Pseudomodular Matroids and Adjoints. 3-11 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00039-G http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#AlfterH95 2006-05-29 Optimal Transmission Schedules in TWDM Optical Passive Star Networks. 81-91 1997 75 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00081-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#LeeOCC97 2003-05-27 Connections Between two Cycles - a New Design of Dense Processor Interconnection Networks. 29-43 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#Bar-YehudaE92 http://dx.doi.org/10.1016/0166-218X(92)90123-R 2002-01-03 Phylogeny numbers for graphs with two triangles. 191-207 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#RobertsS00 2003-06-23 Phylogeny Numbers. 213-228 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00058-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#RobertsS98 2003-07-04 Characterizations of Consistent Marked Graphs. 357-371 2003 127 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00254-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#RobertsX03 2002-01-03 On the Optimal Strongly Connected Orientations of City Street Graphs IV: Four East-West Avenues or North-South Streets. 331-356 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#RobertsX94 2003-05-22 A Polynomial Algorithm for an open Shop Problem with Unit Processing Times and Tree Constraints. 11-21 1995 59 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0156-S http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#BraselKW95 2002-01-03 Balancing Problems in Acyclic Networks. 77-93 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#BorosHHS94 2003-06-25 Optimal Cell Flipping to Minimize Channel Density in VLSI Design and Pseudo-Boolean Optimization. 69-88 1999 90 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00114-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam90.html#BorosHMR99 2003-06-27 Maximum Cut on Line and Total Graphs. 217-221 1999 92 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00056-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam92.html#Guruswami99 2003-04-02 Combinatorial problems related to origin-destination matrices. 15-36 2001 115 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam115.html#BorosHRS01 2003-05-27 Correlation in Partially Ordered Sets. 173-191 1992 39 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#Fishburn92 http://dx.doi.org/10.1016/0166-218X(92)90169-B 2003-05-27 Decision Theory and Discrete Mathematics. 209-221 1996 68 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00067-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#Fishburn96 2003-06-18 Steiner Intervals in Graphs. 181-190 1998 81 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00084-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam81.html#KubickaKO98 2003-04-01 Media theory. 103-118 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#FalmagneO02 2003-05-22 <i>k</i>-Trees. 109-117 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#TelleP93 http://dx.doi.org/10.1016/0166-218X(93)90226-E 2003-06-16 On Complexity of Minimizing Weighted Number of Late Jobs in Unit Time Open Shops. 197-201 1997 74 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(97)81448-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#Gladky97 2003-05-22 Coloring Drawings of Bipartite Graphs: A Problem in Automated Assembly. 55-68 1993 41 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#Sinden93 http://dx.doi.org/10.1016/0166-218X(93)90244-I 2002-01-03 Minimum k-broadcast graphs. 199-209 1994 53 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam53.html#KonigL94 2003-04-01 Non-standard approaches to integer programming. 5-74 2002 123 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam123.html#AardalWW02 2003-06-30 Elliptic Approximations of Propositional Formulae. 223-244 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00041-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#Maaren99 2003-07-02 Uncolorable Mixed Hypergraphs. 209-227 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00134-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#TuzaV00 2003-06-18 List Colorings and Reducibility. 247-256 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00046-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#TuzaV97 2003-04-02 Short trees in polygons. 55-72 2002 118 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#WinterZN02 2003-05-26 Two - ø - Tolerance Competition Graphs. 101-108 1996 66 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(96)80460-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#BrighamMV96 2004-02-25 Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem. 175-179 1993 47 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#MalucelliOP93 http://dx.doi.org/10.1016/0166-218X(93)90090-B 2003-04-02 Partitioning a matrix with non-guillotine cuts to minimize the maximum cos. 243-260 2002 116 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam116.html#MingozziM02 2004-12-21 A Potential Reduction Approach to the Frequency Assignment Problem. 251-282 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00139-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#WarnersTRJ97 2003-05-22 Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs. 103-117 1995 62 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00148-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam62.html#ConfortiCR95 2002-01-03 On minimal coverings of the Boolean cube by centered antichains. 147-153 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#Kasim-Zade01 2003-06-25 A Note on Formulations for the A-partition Problem on Hypergraphs. 115-133 1999 90 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00087-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam90.html#ChopraO99 2003-05-22 Facets of the K-partition Polytope. 27-48 1995 61 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0175-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam61.html#ChopraR95 2003-07-08 ₄of Oddly Even Length. 27-46 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00434-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#Blackford03 2003-05-27 An Algorithm to Find Two Distance Domination Parameters in a Graph. 85-91 1996 68 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00057-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#FrickeHOS96 2003-05-22 on the K-coloring of Intervals. 225-235 1995 59 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)80003-M http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#CarlisleL95 2002-01-03 On bisectors for different distance functions. 139-161 2001 109 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam109.html#IckingKMNW01 2003-06-27 Relocalization - Theory and Practice. 89-108 1999 93 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam93.html#KarchW99 http://dx.doi.org/10.1016/S0166-218X(99)00008-6 2003-05-27 Some Methods for Counting the Spanning Trees in Labelled Molecular Graphs, Examined in Relation to Certain Fullerenes. 51-66 1996 67 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(96)85158-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam67.html#BrownMPR96 2003-05-26 on the Recognition of Permuted Bottleneck Monge Matrices. 43-74 1995 63 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00019-A http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#KlinzRW95a 2003-05-27 Bus Interconnection Networks. 1-15 1996 68 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00046-T http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#BermondE96 2003-05-21 Functions that are Read-Once on a Subset of their Inputs. 235-251 1993 46 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam46.html#Hellerstein93 http://dx.doi.org/10.1016/0166-218X(93)90105-W 2003-05-21 A Combinatorial Approach to the Problem of Self-assembly. 45-65 1995 57 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0135-L http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam57.html#SmetanichKK95 2004-06-01 Almost resolvable perfect Mendelsohn designs with block size five. 1-15 2002 116 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam116.html#AbelBG02 2003-04-01 Recognizing clique graphs of directed edge path graphs. 297-304 2003 126 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam126.html#GutierrezM03 2003-05-22 Decision Problems and Regular Chain Code Picture Languages. 29-49 1993 45 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam45.html#DassowH93 http://dx.doi.org/10.1016/0166-218X(93)90138-E 2003-06-30 A Branch and Bound Algorithm for a Single-machine Scheduling Problem with Positive, Negative Time-lags. 77-99 1999 94 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00015-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam94.html#BruckerHH99 2003-04-02 Antidirected hamiltonian paths between specified vertices of a tournament. 87-98 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#HellR02 2003-06-27 On the Regularity of Languages Generated by Context-free Evolutionary Grammars. 205-209 1999 92 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00057-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam92.html#DassowP99 2003-05-26 Improving Local Search Heuristics for Some Scheduling Problems-I. 97-122 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00030-U http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#BruckerHW96 2003-06-16 Improving Local Search Heuristics for some Scheduling Problems. Part II. 47-69 1997 72 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(96)00036-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam72.html#BruckerHW97 2003-05-22 Scheduling Independent Tasks with Multiple Modes. 35-50 1995 62 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00003-A http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam62.html#BiancoDS95 2002-01-03 A Branch and Bound Algorithm for the Job-Shop Scheduling Problem. 107-127 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#BruckerJS94 2003-07-08 Column Scrambler for the GPT Cryptosystem. 207-221 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00446-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#OurivskiG03 2003-05-27 Nonblocking Self-Routing Switching Networks. 319-340 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#HollmannL92 http://dx.doi.org/10.1016/0166-218X(92)90142-W 2002-01-03 Lower bounds for the complexity of restrictions of Boolean functions. 61-93 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#Chashkin01a 2002-01-03 Complexity of finding a join of maximum weight. 3-7 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#Ageev01 2003-05-21 Maximum Number of Disjoint Paths Connecting Specified Terminals in a Graph. 183-195 1994 55 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)90007-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#Yinnone94 2003-06-16 On Paths Avoiding Forbidden Pairs of Vertices in a Graph. 85-92 1997 74 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00017-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#Yinnone97 2003-06-30 Reconstructing a History of Recombinations From a Set of Sequences. 239-260 1998 88 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00074-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam88.html#KececiogluG98 2003-04-01 Weighted digital distance transforms in four dimensions. 161-176 2003 125 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam125.html#Borgefors03 2003-06-30 Partitions and Network Reliability. 445-453 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00092-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#Tittmann99 2003-06-23 Hamiltonicity, Diameter, Domination, Packing, and Biclique Partitions of Mycielski's Graphs. 93-105 1998 84 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00126-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam84.html#FisherMB98 2003-06-16 Some Models for Scheduling Parallel Programs with Communication Delays. 5-24 1997 72 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(96)00034-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam72.html#BampisGT97 2003-06-17 Alignment Networks and Electrical Networks. 297-309 1996 71 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00070-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam71.html#VingronW96 2002-01-03 An Efficient Preprocessing Procedure for the Multidimensional 0- 1 Knapsack Problem. 189-212 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#FrevilleP94 2003-05-27 Graphs on Alphabets as Models for Large Interconnection Networks. 227-243 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#GomezFY92 http://dx.doi.org/10.1016/0166-218X(92)90135-W 2003-05-22 Large (d, D, D', s) - bipartite Digraphs. 103-114 1995 59 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(93)E0165-U http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#GomezMP95 2003-06-23 Large Generalized Cycles. 107-123 1998 89 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00120-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam89.html#GomezPP98 2003-05-22 NP-hardness of Shop-scheduling Problems with Three Jobs. 237-266 1995 59 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)80004-N http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#SotskovS95 2003-06-18 ^e-disjunct Matrices. 217-222 1997 80 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(97)80002-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#Macula97 2003-05-22 Polynomially Solvable Cases for the Maximum Stable Set Problem. 195-210 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00051-E http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#Hertz95 2003-06-16 On the Use of Boolean Methods for the Computation of the Stability Number. 183-203 1997 76 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00124-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam76.html#Hertz97 2003-06-23 On Perfect Switching Classes. 263-267 1998 89 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00134-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam89.html#Hertz98 2003-06-30 On Perfect Switching Classes. 3-7 1999 94 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00153-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam94.html#Hertz99 2003-06-16 Generalized Bicycles. 27-40 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00013-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#BermanL97 2003-04-02 Verifiable broadcasting and gossiping in communication networks. 293-298 2002 118 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#BermanP02 2002-01-03 Preface. 1 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#Borodin01 2002-03-21 Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids. 285-302 1992 40 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#CatlinGHL92 2003-05-22 Path Covering Problems and Testing of Printed Circuits. 5-13 1995 62 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00142-Z http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam62.html#AndreattaM95 2002-01-03 A-closed classes of idempotent functions of many-valued logic definable by binary relations. 203-225 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#Marchenkov01 2003-05-21 Sensitivity Analysis of List Scheduling Heuristics. 145-162 1994 55 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)90005-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#KolenKHW94 2003-06-27 Minimizing Broadcast Costs Under Edge Reductions in Tree Networks. 93-117 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00121-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#HambruschL99 2003-05-27 Diameters of Cubic Graphs. 347-351 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#Jorgensen92 http://dx.doi.org/10.1016/0166-218X(92)90144-Y 2003-05-21 Recognition of D-dimensional Monge Arrays. 71-82 1994 52 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(92)00189-S http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#Rudolf94 2002-01-03 Cyclic distance-preserving codes on a constant-weight basis. 289-294 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#Zanten01 2003-04-01 A simple algorithm to find the steps of double-loop networks. 61-72 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#ChanCH02 2003-05-22 Most Uniform Path Partitioning and its Use in Image Processing. 227-256 1993 42 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#LucertiniPS93 http://dx.doi.org/10.1016/0166-218X(93)90048-S 2003-05-21 Discrete Infinite Transportation Problems. 19-33 1995 58 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0139-P http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#KortanekY95 2003-06-18 Optimal communication algorithms for Manhattan Street networks. 303-326 1998 83 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam83.html#Varvarigos98 http://dx.doi.org/10.1016/S0166-218X(97)00116-9 2003-11-24 An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs. 159-173 2000 102 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam102.html#ChaoHL00 2003-06-23 The Cyclic Cutwidth of Trees. 25-32 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00098-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#ChavezT98 2003-05-21 Preface. 99-100 1995 56 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(95)90013-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#FukudaI95 2003-05-21 Finding All Common Bases in Two Matroids. 231-243 1995 56 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00088-U http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#FukudaN95 2003-06-16 On Minimum Intersection of Two Minimum Dominating Sets of Interval Graphs. 41-50 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00014-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#ChangH97 2003-06-27 The Worst-case Analysis of the MULTIFIT Algorithm for Scheduling Nonsimultaneous Parallel Machines. 135-147 1999 92 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00049-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam92.html#ChangH99 2002-01-03 Pseudo-Hamiltonian-connected graphs. 145-153 2000 100 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam100.html#ChangZ00 2003-06-18 The Majority Strategy on Graphs. 97-105 1997 80 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(97)00072-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#Mulder97 2003-06-25 A Graph Theoretical Approach for the Yield Enhancement of Reconfigurable VLSI/WSI Arrays. 195-221 1999 90 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00091-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam90.html#NarasimhanNR99 2003-05-26 on the Complexity of Recognizing a Class of Perfectly orderable Graphs. 219-226 1996 66 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00162-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#Hoang96a 2003-04-01 Vertex characterization of partition polytopes of bipartitions and of planar point sets. 1-15 2002 124 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam124.html#AviranLOR02 2006-04-21 Existence of resolvable optimal strong partially balanced designs. 930-941 2006 154 Discrete Applied Mathematics 6 http://dx.doi.org/10.1016/j.dam.2005.10.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Du06 2003-05-13 Remarks on Hamiltonian Properties of Powers of Digraphs. 181-186 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90107-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#Schaar94 2003-05-21 The Set of Super-stable Marriages Forms a Distributive Lattice. 79-84 1995 58 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00080-W http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#Spieker95 2003-04-01 On the number of vertices belonging to all maximum stable sets of a graph. 17-25 2002 124 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam124.html#BorosGL02 2003-05-21 Recognition of q-Horn Formulae in Linear Time. 1-13 1994 55 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)90033-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#BorosHS94 2002-01-03 A polyhedral approach to sequence alignment problems. 143-186 2000 104 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam104.html#KececiogluLMMRV00 2003-05-22 ₃<i>n, d</i>). 71-87 1993 45 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam45.html#VaessensAL93 http://dx.doi.org/10.1016/0166-218X(93)90141-A 2004-09-22 Cocyclic Hadamard matrices and difference sets. 47-61 2000 102 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam102.html#LauneyFH00 2003-05-22 Approximation Techniques for Hypergraph Partitioning Problems. 115-127 1995 59 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(93)E0166-V http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#Hadley95 2003-05-22 Independence and domination in Polygon Graphs. 65-77 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#ElmallahS93 http://dx.doi.org/10.1016/0166-218X(93)90222-A 2003-05-13 Linear Trees and RNA Secondary Structure. 317-323 1994 51 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(92)00038-N http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#SchmittW94 2003-05-22 Permuting Matrices to Avoid Forbidden Submatrices. 223-248 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00054-H http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#KlinzRW95 2003-05-27 Foreword. 1 1992 37/38 Discrete Applied Mathematics http://dx.doi.org/10.1016/0166-218X(92)90119-U http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#Bermond92 2003-07-04 Sphere of Influence Graphs and the L-metric. 447-460 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00246-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#MichaelQ03 2002-01-03 On the combinatorics of leftist trees. 253-278 2001 109 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam109.html#Nogueira01 2003-06-18 Exact Classification with Two-layer Neural Nets in N Dimensions. 19-39 1998 81 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00053-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam81.html#SweatmanGM98 2003-05-21 Minimum Spanning Hypertrees. 67-76 1994 54 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)90134-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam54.html#TomescuZ94 2003-07-02 The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices. 413-425 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00148-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#DeinekoW00 2003-06-16 Recognizing Interval Digraphs and Interval Bigraphs in Polynomial Time. 189-205 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00027-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#Muller97 2003-04-01 Point matching under non-uniform distortions. 5-21 2003 127 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#AkutsuKOF03 2004-05-12 Using transforming matrices to generate DNA clone grids. 421-431 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00595-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#HuangHM03 2004-05-12 Domination analysis of combinatorial optimization problems. 513-520 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00359-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#GutinVY03 2004-05-12 A simple minimum T-cut algorithm. 539-544 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00182-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#Rizzi03 2004-05-12 Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori. 409-419 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00579-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#HonkalaKL03 2004-05-12 Pairs of graphs with site and bond percolation critical probabilities in opposite orders. 545-548 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00183-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#Wierman03 2004-05-12 ₄-sparse graphs. 521-532 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00180-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#BrandstadtM03 2004-05-12 Excluded-minor characterizations of antimatroids arisen from posets and graph searches. 487-498 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00581-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#Nakamura03 2004-05-12 Upper bounds on ATSP neighborhood size. 533-538 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00181-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#GutinY03 2004-05-12 On linear and circular structure of (claw, net)-free graphs. 285-303 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00571-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#BrandstadtD03 2004-05-12 Classification of whist tournaments with up to 12 players. 399-407 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00578-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#HaanpaaO03 2004-06-02 Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems. 233-262 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00570-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#Benczur03 2004-05-12 The complexity of the T-coloring problem for graphs with small degree. 361-369 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00576-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#GiaroJM03 2004-05-12 Efficient dominating sets in Cayley graphs. 319-328 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00573-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#DejterS03 2005-06-16 Generating r-regular graphs. 329-343 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00593-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#DingC03 2004-05-12 Planar k-cycle resonant graphs with k=1, 2. 383-397 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00577-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#GuoZ03 2004-05-12 Bounds on the average connectivity of a graph. 305-318 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00572-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#DankelmannO03 2004-10-11 Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers. 449-460 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00597-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#KlazvarV03 2004-05-12 Symmetry properties of chordal rings of degree 3. 211-232 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00569-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#Barriere03 2004-05-12 On strong Menger-connectivity of star graphs. 499-511 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00600-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#OhC03 2004-05-12 Minimum 3-geodetically connected graphs. 263-283 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00591-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#Bosikova03 2004-05-12 2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. 433-447 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00596-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#KarunoN03 2004-05-12 Interval degree and bandwidth of a graph. 345-359 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00574-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#FominG03 2004-05-12 A polynomial algorithm for finding T-span of generalized cacti. 371-382 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00575-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#GiaroJM03a 2004-05-12 On the minimum local-vertex-connectivity augmentation in graphs. 475-486 2003 129 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00580-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#NagamochiI03 2004-05-12 Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees. 503-512 2003 130 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00328-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#DelormeFR03 2004-05-12 Preface. 83-84 2003 130 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00398-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#Maaren03 2004-05-12 Cell rotation graphs of strongly connected orientations of plane graphs with an application. 469-485 2003 130 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00184-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#ZhangLS03 2004-05-12 Diameter vulnerability of GC graphs. 395-416 2003 130 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00594-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#GomezPB03 2004-05-12 Some combinatorial identities via Fibonacci numbers. 527-534 2003 130 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00331-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#LeeKC03 2004-05-12 Perfect 7-cycle systems. 535-538 2003 130 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00332-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#Marzi03 2004-05-12 On the growth of components with non-fixed excesses. 487-493 2003 130 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00326-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#BaertRT03 2004-05-12 Decidability of the binary infinite Post Correspondence Problem. 521-526 2003 130 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00330-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#HalavaHK03 2004-05-12 Resolution and binary decision diagrams cannot simulate each other polynomially. 157-171 2003 130 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00403-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#GrooteZ03 2006-04-21 <i>m</i>-step, same-step, and any-step competition graphs. 159-175 2005 152 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.04.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam152.html#Ho05 2004-05-12 Homomorphisms of conjunctive normal forms. 351-365 2003 130 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00411-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#Szeider03a 2004-05-12 Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. 139-155 2003 130 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00402-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#GrammHNR03 2004-05-12 Random small Hamming weight products with applications to cryptography. 37-49 2003 130 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00588-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#HoffsteinS03 2004-05-12 Finding all essential terms of a characteristic maxpolynomial. 367-380 2003 130 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00223-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#BurkardB03 2004-05-12 No-hole L(2, 1)-colorings. 513-519 2003 130 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00329-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#FishburnR03 2004-05-12 _abcurves. 13-31 2003 130 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00586-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#Arita03 2004-05-12 Lean clause-sets: generalizations of minimally unsatisfiable clause-sets. 209-249 2003 130 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00406-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#Kullmann03 2004-05-12 On the limit of branching rules for hard random unsatisfiable 3-SAT. 277-290 2003 130 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00408-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#LiG03 2004-05-12 An approximation algorithm for scheduling two parallel machines with capacity constraints. 449-467 2003 130 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00601-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#YangYZ03 2004-05-24 Which matrices are immune against the transportation paradox? 495-501 2003 130 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00327-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#DelnekoKW03 2004-05-12 On the structure of some classes of minimal unsatisfiable formulas. 185-207 2003 130 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00405-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#BuningZ03 2004-05-12 Graphs, networks, and linear unbiased estimates. 381-393 2003 130 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00592-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#Constantine03 2004-05-12 Non-abelian key agreement protocols. 3-12 2003 130 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00585-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#AnshelAG03 2004-09-08 On good algorithms for determining unsatisfiability of propositional formulas. 129-138 2003 130 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00401-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#FrancoS03 2004-05-12 Improved algorithms for several network location problems with equality measures. 437-448 2003 130 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00599-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#MesaPT03 2004-05-12 A satisfiability procedure for quantified Boolean formulae. 291-328 2003 130 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00409-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#PlaistedBZ03 2004-05-12 Complexity of the generalized conjugacy problem. 33-36 2003 130 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00587-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#HahnLP03 2004-05-12 Computing zeta functions for ordinary formal groups over finite fields. 51-60 2003 130 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00589-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#SatohT03 2004-05-12 Computing discrete logarithms with the parallelized kangaroo method, . 61-82 2003 130 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00590-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#Teske03 2004-05-12 Interior and exterior functions of positive Boolean functions. 417-436 2003 130 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00602-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#MakinoOI03 2004-05-12 Worst-case study of local search for MAX-k-SAT. 173-184 2003 130 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00404-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#Hirsch03 2004-05-12 How to fake an RSA signature by encoding modular root finding as a SAT problem. 101-127 2003 130 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00400-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#FioriniMM03 2004-05-12 SAT problems with chains of dependent variables. 329-350 2003 130 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00410-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#Prestwich03 2004-05-12 Approximating minimal unsatisfiable subformulae by means of adaptive core search. 85-100 2003 130 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00399-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#Bruni03 2004-05-12 Graph coloring on coarse grained multicomputers. 179-198 2003 131 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00424-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#GebremedhinLGT03 2006-04-21 A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time. 655-663 2003 131 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00334-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#Pisaruk03 2004-05-12 A greedy algorithm for convex geometries. 449-465 2003 131 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00467-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#KashiwabaraO03 2004-05-12 ₅-free graphs. 567-575 2003 131 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00221-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#BoliacL03 2004-05-12 The complexity of the locally connected spanning tree problem. 63-75 2003 131 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00417-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#Cai03b 2004-05-12 Lattice hypercube designs. 673-680 2003 131 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00384-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#FuL03 2004-05-12 Stability number of bull- and chair-free graphs revisited. 39-50 2003 131 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00415-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#BrandstadtHL03 2004-05-12 Heredity of the index of convergence of the line digraph. 681-688 2003 131 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00336-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#YanZ03 2004-05-12 Quasi M-convex and L-convex functions--quasiconvexity in discrete optimization. 467-494 2003 131 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00468-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#MurotaS03 2004-05-12 An inequality for polymatroid functions and its applications. 255-281 2003 131 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00455-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#BorosEGK03 2004-05-12 Finding a central vertex in an HHD-free graph. 93-11 2003 131 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00419-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#ChepoiD03 2004-05-12 Finding sharper distinctions for conditions of transitivity of the majority method. 577-595 2003 131 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00243-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#Durand03 2004-05-12 A note on the minimization of symmetric and general submodular functions. 513-522 2003 131 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00470-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#Narayanan03 2004-05-12 The commutative closure of a binary slip-language is context-free: a new proof. 665-672 2003 131 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00335-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#Rigo03 2004-05-12 On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks. 421-432 2003 131 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00465-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#Jordan03 2004-05-12 The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function. 299-310 2003 131 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00457-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#DesaiNP03 2004-05-12 Maximum independent set and maximum clique algorithms for overlap graphs. 77-91 2003 131 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00418-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#CenekS03 2004-05-12 Fast recognition algorithms for classes of partial cubes. 51-61 2003 131 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00416-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#BresarIK03 2004-05-12 On the approximability of average completion time scheduling under precedence constraints. 237-252 2003 131 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00427-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#Woeginger03 2004-05-12 Restricted t-matchings in bipartite graphs. 337-346 2003 131 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00461-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#Frank03 2004-05-12 Approximating the treewidth of AT-free graphs. 11-37 2003 131 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00414-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#BouchitteT03 2004-05-12 Combined connectivity augmentation and orientation problems. 401-419 2003 131 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00460-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#FrankK03 2004-05-12 On decomposing a hypergraph into k connected sub-hypergraphs. 373-383 2003 131 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00463-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#FrankKK03 2004-05-12 Splitting a graph into disjoint induced paths or cycles. 199-212 2003 131 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00425-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#LeLM03 2004-05-12 A new construction for Z-cyclic whist tournaments. 643-650 2003 131 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00381-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#GeL03 2004-05-12 Improving graph partitions using submodular functions. 535-553 2003 131 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00472-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#PatkarN03 2005-06-21 Expansion of layouts of complete binary trees into grids. 611-642 2003 131 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00550-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#LinMPPS03 2004-05-12 Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs. 555-559 2003 131 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00582-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#Bang-JensenT03 2004-05-12 The complexity of minimizing certain cost metrics for k-source spanning trees. 113-127 2003 131 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00420-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#ConnamacherP03 2006-05-05 Gross substitution, discrete convexity, and submodularity. 283-298 2003 131 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00456-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#DanilovKL03 2004-05-12 Finding a bigtriangleup-regular supergraph of minimum order. 3-9 2003 131 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00413-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#BodlaenderTL03 2004-05-12 A push-relabel framework for submodular function minimization and applications to parametric optimization. 311-322 2003 131 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00458-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#FleischerI03 2004-05-12 MAD trees and distance-hereditary graphs. 151-167 2003 131 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00422-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#DahlhausDGS03 2004-10-14 Constructive characterizations for packing and covering with trees. 347-371 2003 131 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00464-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#FrankS03 2004-05-12 Query efficient implementation of graphs of bounded clique-width. 129-150 2003 131 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00421-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#CourcelleV03 2004-05-12 The forbidden minor characterization of line-search antimatroids of rooted digraphs. 523-533 2003 131 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00471-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#OkamotoN03 2004-05-12 Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability. 433-448 2003 131 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00466-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#KashiwabaraT03 2004-05-12 On the orientation of graphs and hypergraphs. 385-400 2003 131 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00462-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#FrankKK03a 2004-05-12 New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities. 495-512 2003 131 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00469-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#MurotaT03 2004-05-12 Characterization of optimal key set protocols. 213-236 2003 131 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00426-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#MizukiSN03 2004-05-12 The task allocation problem with constant communication. 169-177 2003 131 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00423-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#VegaL03 2004-05-12 The maximum edge biclique problem is NP-complete. 651-654 2003 131 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00333-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#Peeters03 2006-02-01 Facets of linear signed order polytopes. 597-610 2003 131 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00224-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#FioriniF03 2004-05-12 On the monotonicity of games generated by symmetric submodular functions. 323-335 2003 131 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00459-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam131.html#FominT03 2004-05-12 Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings. 163-174 2003 132 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00398-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam132.html#LevitM03 2006-02-01 On well-covered triangulations: Part I. 97-108 2003 132 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00393-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam132.html#FinbowHNP03 2004-05-12 On easy and hard hereditary classes of graphs with respect to the independent set problem. 17-26 2003 132 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00387-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam132.html#Alekseev03 2004-05-12 ₅- and co-chair-free graphs. 47-65 2003 132 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00389-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam132.html#BrandstadtM03a 2004-05-12 Independence and upper irredundance in claw-free graphs. 85-95 2003 132 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00392-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam132.html#Favaron03 2004-05-12 Minimum degree algorithms for stability number. 211-216 2003 132 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00402-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam132.html#Zverovich03a 2004-05-12 Clique family inequalities for the stable set polytope of quasi-line graphs. 185-201 2003 132 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00400-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam132.html#Oriolo03 2004-05-12 ₅-free augmenting graphs and the maximum stable set problem. 109-119 2003 132 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00394-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam132.html#GerberHS03 2004-05-12 Stable sets in two subclasses of banner-free graphs. 121-136 2003 132 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00395-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam132.html#GerberHL03 2004-05-12 On local and global independence numbers of a graph. 79-84 2003 132 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00391-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam132.html#FaudreeRS03 2004-05-12 Hereditary systems and greedy-type algorithms. 137-148 2003 132 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00396-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam132.html#Ilev03 2004-05-12 ₅-free graphs. 175-183 2003 132 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00399-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam132.html#Mosca03 2004-05-12 Equistable series-parallel graphs. 149-162 2003 132 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00397-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam132.html#KorachP03 2004-05-12 Induced matchings in asteroidal triple-free graphs. 67-78 2003 132 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00390-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam132.html#Chang03 2004-05-12 Equistable chordal graphs. 203-210 2003 132 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00401-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam132.html#PeledR03 2004-05-12 Struction revisited. 27-46 2003 132 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00388-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam132.html#AlexeHLW03 2004-05-12 Powers of geometric intersection graphs and dispersion algorithms. 3-16 2003 132 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00386-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam132.html#AgnarssonDH03 2004-05-12 Special issue on stability in graphs and related topics. 1-2 2003 132 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00385-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam132.html#LozinW03 2004-05-12 Complexity and approximation results for scheduling multiprocessor tasks on a ring. 29-44 2003 133 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00432-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam133.html#ConfessoreDG03 2004-05-12 Discrete facility location and routing of obnoxious activities. 3-28 2003 133 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00431-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam133.html#CappaneraGM03 2004-05-12 Bidirected and unidirected capacity installation in telecommunication networks. 103-121 2003 133 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00436-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam133.html#HoeselKLS03 2006-03-13 Scheduling problems for parallel dedicated machines under multiple resource constraints. 45-68 2003 133 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00433-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam133.html#KellererS03 2004-05-12 Preface: International Symposium on Combinatorial Optimisation. 1-2 2003 133 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00430-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam133.html#EgleseEPS03 2004-05-12 A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. 69-92 2003 133 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00434-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam133.html#PetchS03 2004-05-12 A greedy algorithm for some classes of integer programs. 93-101 2003 133 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00435-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam133.html#Shenmaier03 2004-05-12 Lift and project relaxations for the matching and related polytopes. 193-212 2004 134 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00337-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam134.html#AguileraBN04 2004-05-12 Two sensitivity theorems in fuzzy integer programming. 129-140 2004 134 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00338-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam134.html#AsratianK04 2004-05-12 Open shop scheduling problems with late work criteria. 1-24 2004 134 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00339-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam134.html#BlazewiczPSW04 2004-05-12 A characterization of Thompson digraphs. 317-337 2004 134 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00299-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam134.html#GiammarresiPWZ04 2004-05-12 Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. 303-316 2004 134 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00255-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam134.html#Shioura04 2004-05-12 Cartels via the modiclus. 263-302 2004 134 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00227-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam134.html#RosenmullerS04 2004-05-12 Non-approximability of precedence-constrained sequencing to minimize setups. 351-360 2004 134 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.08.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam134.html#Tovey04 2004-05-12 The insulation sequence of a graph. 77-90 2004 134 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00300-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam134.html#Grigorescu04 2004-05-12 Algorithms for graphs with small octopus. 105-128 2004 134 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00298-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam134.html#FominKM04 2004-05-12 Lattice-theoretic properties of MPR-posets in phylogeny. 169-192 2004 134 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00303-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam134.html#MiyakawaN04 2004-05-12 On the complexity of graph tree partition problems. 51-65 2004 134 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00340-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam134.html#CordoneM04 2004-05-12 Scheduling groups of tasks with precedence constraints on three dedicated processors. 141-168 2004 134 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00302-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam134.html#MansiniST04 2004-05-12 On polynomial complexity of a stochastic algorithm for mixed zero-one programs. 91-103 2004 134 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00301-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam134.html#Jagannathan04 2004-05-12 On the equivalence between some local and global Chinese postman and traveling salesman graphs. 67-76 2004 134 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00225-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam134.html#GranotH04 2004-05-12 Hereditary dominating pair graphs. 239-261 2004 134 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00304-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam134.html#PrzuljCK04 2005-02-08 The maximum deviation just-in-time scheduling problem. 25-50 2004 134 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00222-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam134.html#BraunerC04 2004-05-12 Z-transformation graphs of maximum matchings of plane bipartite graphs. 339-350 2004 134 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00305-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam134.html#ZhangZY04 2004-05-12 Polynomial-time approximation of largest simplices in V-polytopes. 213-237 2004 134 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00226-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam134.html#Packer04 2004-05-12 Residual reliability of P-threshold graphs. 83-95 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00296-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#Chernyak04 2004-05-12 Computation of Boolean functions by randomized programs. 65-82 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00295-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#Chashkin04a 2004-05-12 Finitely generated distribution algebras. 259-265 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00310-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#Salimov04 2004-05-12 Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases. 223-233 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00306-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#Orlov04 2004-05-12 On a lower bound on the number of perfect binary codes. 157-160 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00302-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#Malyugin04 2004-05-12 A greedy algorithm for maximizing a linear objective function. 267-279 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00311-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#Shenmaier04 2004-05-12 On cyclic <m,n>-enumerations. 235-243 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00307-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#Perezhogin04 2004-05-12 Criterion of generativeness of sets of rational probabilities by a class of Boolean functions. 125-142 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00300-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#Kolpakov04 2004-05-12 Preface: Russian Translations II. 1- 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.10.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#Borodin04 2005-04-06 Local transformations of graphs preserving independence number. 17-30 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00291-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#AlekseevL04 2004-05-12 Comparing the sizes of nondeterministic branching read-k-times programs. 205-222 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00305-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#Okolnishnikova04 2004-05-12 On finding a cyclic tour and a vehicle loading plan yielding maximum profit. 105-111 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00298-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#GimadiGS04 2004-05-12 Redundancy estimates for the Lempel-Ziv algorithm of data compression. 245-254 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00308-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#Potapov04 2004-05-12 On the structure of connected locally GQ(3, 9)-graphs. 143-156 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00301-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#MakhnevP04 2004-05-12 On complexity of minimization and compression problems for models of sequential choice. 281-300 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00312-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#Sholomov04 2004-05-12 Height of minor faces in plane normal maps. 31-39 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00292-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#BorodinL04 2004-05-12 Local spectra of perfect binary codes. 301-307 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00313-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#Vasileva04 2004-05-12 On nonsystematic perfect binary codes of length 15. 255-258 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00309-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#Romanov04 2004-05-12 Searching expenditure and interval graphs. 97-104 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00297-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#Fomin04 2004-05-12 On enumeration of the perfect binary codes of length 15. 161-181 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00303-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#Malyugin04a 2004-05-12 A-classification of idempotent functions of many-valued logic. 183-203 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00304-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#Marchenkov04 2005-04-06 Polynomial algorithm for finding the largest independent sets in graphs without forks. 3-16 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00290-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#Alekseev04 2004-05-12 Local complexity of Boolean functions. 55-64 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00294-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#Chashkin04 2004-05-12 On the search of optimal order of variables in the synthesis of switching circuits by cascade technique. 113-123 2004 135 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(02)00299-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam135.html#GrinchukK04 2004-05-12 A fully dynamic algorithm for modular decomposition and recognition of cographs. 329-340 2004 136 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00448-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#ShamirS04 2004-11-16 ₆-free graphs. 299-313 2004 136 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00446-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#RanderathS04 2004-05-12 A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. 197-215 2004 136 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00441-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#DettiM04 2004-05-12 On approximability of linear ordering and related NP-optimization problems on graphs. 249-269 2004 136 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00444-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#MishraS04 2004-05-12 On treewidth approximations. 183-196 2004 136 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00440-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#BouchitteKMT04 2004-05-12 A note on Nordhaus-Gaddum inequalities for domination. 83-85 2004 136 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00200-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#ShanDK04 2004-05-12 Divider-based algorithms for hierarchical tree partitioning. 227-247 2004 136 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00443-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#FinocchiP04 2004-05-12 Edge-oblique polyhedral graphs. 315-327 2004 136 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00447-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#SchreyerW04 2004-05-12 An algorithm for solving partial differential parametric systems. 105-116 2004 136 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00202-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#WangG04 2004-05-12 f-Factors in bipartite (mf)-graphs. 45-54 2004 136 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00197-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#LiuZ04 2004-05-12 Connectivity of k-extendable graphs with large k. 55-61 2004 136 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00198-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#LouY04 2004-05-12 Approximation algorithms for the watchman route and zookeeper's problems. 363-376 2004 136 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00451-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#Tan04 2004-05-12 On the computational complexity of upper total domination. 13-22 2004 136 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00195-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#Fang04 2004-05-12 Limits of theory sequences over algebraically closed fields and applications. 23-43 2004 136 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00196-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#LiM04 2004-05-12 Delay-related secondary objectives for rectilinear Steiner minimum trees. 271-298 2004 136 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00445-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#PeyerZJ04 2004-05-12 On the average similarity degree between solutions of random k-SAT and random CSPs. 125-149 2004 136 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00204-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#XuL04 2004-05-12 (2+f(n))-SAT and its properties. 3-11 2004 136 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00194-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#ZhaoDLZ04 2004-05-12 The obnoxious center problem on weighted cactus graphs. 377-386 2004 136 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00452-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#ZmazekZ04 2004-05-12 Preface: Discrete Mathematics and Theoretical Computer Science (DMTCS). 1 2004 136 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00193-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#ChenLCC04 2004-05-12 Solving problems for maximal reducible flowgraphs. 341-348 2004 136 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00449-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#VernetM04 2004-05-12 Complexity results on a paint shop problem. 217-226 2004 136 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00442-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#EppingHO04 2004-05-12 Expanding and forwarding parameters of product graphs. 63-82 2004 136 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00199-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#QianZ04 2004-05-12 Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. 159-160 2004 136 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00437-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#FaiglePBH04 2004-05-12 The effect of side-information on smooth entropy. 151-157 2004 136 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00205-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#YangZP04 2004-05-12 Sparsest cuts and concurrent flows in product graphs. 173-182 2004 136 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00439-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#Bonsma04 2004-05-12 Families of integral trees with diameters 4, 6, and 8. 349-362 2004 136 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00450-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#WangLZ04 2004-05-12 Making a tournament k-arc-strong by reversing or deorienting arcs. 161-171 2004 136 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(03)00438-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#Bang-JensenY04 2004-05-12 Completeness of temporal logics over infinite intervals. 87-103 2004 136 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00201-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#WangX04 2004-05-12 Searching with mobile agents in networks with liars. 69-85 2004 137 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00189-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#HanusseKK04 2004-05-12 Preface. 1-2 2004 137 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00185-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#CicaleseMV04 2004-05-12 Dynamic faults have small effect on broadcasting in hypercubes. 155-158 2004 137 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(03)00258-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#DobrevV04 2004-05-12 Trivial two-stage group testing for complexes using almost disjunct matrices. 97-107 2004 137 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00191-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#MaculaRY04 2004-05-12 Hiroyuki Nagashima and Koichi Yamazaki. 293-309 2004 137 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00344-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#NagashimaY04 2004-05-12 Minimum restricted diameter spanning trees. 343-357 2004 137 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00360-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#HassinL04 2004-05-12 Dynamic monopolies in tori. 197-212 2004 137 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(03)00261-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#FlocchiniLLPS04 2004-05-12 Strong qualitative independence. 87-95 2004 137 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00190-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#Katona04 2004-05-12 Algorithmic complexity of protein identification: combinatorics of weighted strings. 27-46 2004 137 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00187-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#CieliebakELSW04 2004-05-12 Gossiping and broadcasting versus computing functions in networks. 127-153 2004 137 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(03)00257-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#Dietzfelbinger04 2004-05-12 Cardinality constrained minimum cut problems: complexity and algorithms. 311-341 2004 137 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00358-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#BruglieriME04 2004-05-12 Multi-source spanning trees: algorithms for minimizing source eccentricities. 213-222 2004 137 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(03)00262-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#McMahanP04 2004-05-12 Preface. 125-126 2004 137 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(03)00256-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#LabahnLP04 2005-01-12 Extracting pure network submatrices in linear programs using signed graphs. 359-372 2004 137 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00361-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#GulpinarGMZ04 2004-05-12 On-line algorithms for the channel assignment problem in cellular networks. 237-266 2004 137 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00341-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#CrescenziGP04 2004-05-12 A survey on Knödel graphs. 173-195 2004 137 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(03)00260-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#FertinR04 2004-05-12 Optimal detection of two counterfeit coins with two-arms balance. 267-291 2004 137 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00343-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#Wen-AnN04 2004-05-12 Recognition problems and communication complexity. 109-123 2004 137 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00192-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#Wiener04 2004-05-12 Variants of the majority problem. 3-25 2004 137 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00186-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#Aigner04 2004-05-12 Sparse networks tolerating random faults. 223-235 2004 137 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(03)00263-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#YamadaNU04 2004-05-12 Approximate location of relevant variables under the crossover distribution. 47-67 2004 137 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00188-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#Damaschke04 2004-05-12 Spanners and message distribution in networks. 159-171 2004 137 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(03)00259-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam137.html#FarleyPZW04 2004-05-12 Nonlinear functions in abelian groups and relative difference sets. 177-193 2004 138 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(03)00293-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#Pott04 2004-05-12 Completing partial latin squares with prescribed diagonals. 89-97 2004 138 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(03)00272-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#Gruttmuller04 2004-05-12 Configurations between geometry and combinatorics. 79-88 2004 138 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(03)00271-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#Gropp04 2004-05-12 BDDs--design, analysis, complexity, and applications. 229-251 2004 138 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(03)00297-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#Wegener04 2004-05-12 _{n, n}by small graphs. 47-63 2004 138 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(03)00269-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#El-ShanawanyGG04 2004-05-12 A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs. 371-379 2004 138 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2003.07.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#Corneil04 2004-05-12 Traveling salesman games with the Monge property. 349-369 2004 138 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2003.08.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#Okamoto04 2004-05-12 Recognizing quasi-triangulated graphs. 203-213 2004 138 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(03)00295-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#Spinrad04 2004-05-12 Ladder orderings of pairs and RAID performance. 35-46 2004 138 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(03)00268-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#CohenC04 2004-05-12 Super-simple (v, 5, 2)-designs. 65-77 2004 138 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(03)00270-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#GronauKL04 2004-05-12 The bisection width and the isoperimetric number of arrays. 3-12 2004 138 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(03)00265-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#AzizogluE04 2004-05-12 Interval data minmax regret network optimization problems. 289-301 2004 138 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00462-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#AverbakhL04 2004-05-12 On simplicial and co-simplicial vertices in graphs. 117-132 2004 138 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(03)00275-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#HoangHMM04 2004-08-20 Preface: ODSA. 1 2004 138 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(03)00264-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#BrandstadtEGL04 2004-05-12 On the log-concavity of sequences arising from integer bases. 153-175 2004 138 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(03)00292-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#Pitteloud04 2004-05-12 Superfluous edges and exponential expansions of De Bruijn and Kautz graphs. 303-331 2004 138 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00463-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#CanaleG04 2004-05-12 The Steiner ratio of high-dimensional Banach-Minkowski spaces. 29-34 2004 138 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(03)00267-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#Cieslik04 2004-05-12 Upper bounds for covering arrays by tabu search. 143-152 2004 138 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(03)00291-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#Nurmela04 2004-05-12 ₅, diamond)-free graphs revisited: structure and linear time optimization. 13-27 2004 138 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(03)00266-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#Brandstadt04 2004-05-12 Enumeration of balanced ternary designs. 133-141 2004 138 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(03)00276-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#KaskiO04 2004-05-12 On spaced seeds for similarity search. 253-263 2004 138 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00382-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#KeichLMT04 2006-03-31 Whist tournaments with the three person property. 265-276 2004 138 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00383-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#GeL04 2004-05-12 Fixed points and maximal independent sets in AND-OR networks. 277-288 2004 138 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00461-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#AracenaDC04 2004-05-12 Stable partitions with W -preferences. 333-347 2004 138 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(03)00464-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#CechlarovaH04 2004-05-12 Vertex-symmetric generalized Moore graphs. 195-202 2004 138 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(03)00294-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#Sampels04 2004-05-12 _nwith distinct sums of pairs. 99-106 2004 138 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(03)00273-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#HaanpaaHO04 2004-05-12 Orthogonal double covers of general graphs. 107-116 2004 138 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(03)00274-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#HartmannS04 2004-05-12 Illuminating labyrinths. 215-228 2004 138 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(03)00296-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam138.html#Toth04 2004-07-07 A digital analogue of the Jordan curve theorem. 231-251 2004 139 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2002.11.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam139.html#Slapal04 2004-07-07 Automated estimation of the parameters of Gibbs priors to be used in binary tomography. 149-170 2004 139 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.01.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam139.html#LiaoH04 2004-07-07 Digital straightness - a review. 197-230 2004 139 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2002.12.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam139.html#KletteR04 2004-07-07 Preface. 1-3 2004 139 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.08.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam139.html#FoureyHKR04 2004-07-07 Reconstruction of hv-convex binary matrices from their absorbed projections. 137-148 2004 139 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2002.11.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam139.html#KubaNB04 2004-07-07 Optimization of basis functions for both reconstruction and visualization. 95-111 2004 139 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2002.12.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam139.html#GardunoH04 2004-07-07 An approach for the estimation of the precision of a real object from its digitization. 51-63 2004 139 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2002.11.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam139.html#FeschetT04 2004-07-07 Generic axiomatized digital surface-structures. 65-93 2004 139 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.03.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam139.html#FoureyKH04 2004-10-11 An elementary algorithm for digital arc segmentation. 31-50 2004 139 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.08.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam139.html#CoeurjollyGRT04 2004-07-07 Spatial pattern discovery by learning a probabilistic parametric model from multiple attributed relational graphs. 113-135 2004 139 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2002.11.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam139.html#HongH04 2004-07-07 Digital homotopy with obstacles. 5-30 2004 139 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.08.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam139.html#AyalaDFQ04 2004-07-07 Computing large planar regions in terrains, with an application to fracture surfaces. 253-264 2004 139 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2002.11.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam139.html#SmidRWL04 2004-07-07 Sampling properties of the discrete radon transform. 265-281 2004 139 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2002.11.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam139.html#Svalbe04 2004-07-07 On the distance function approach to color image enhancement. 283-305 2004 139 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2002.11.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam139.html#SzczepanskiSPV04 2004-07-07 A 3D 12-subiteration thinning algorithm based on P-simple points. 171-195 2004 139 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2002.11.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam139.html#LohouB04 2004-07-07 Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs. 73-89 2004 140 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.04.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam140.html#KeilB04 2004-07-07 Continuous bottleneck tree partitioning problems. 185-206 2004 140 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.04.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam140.html#HalmanT04 2004-07-07 Worst-case analysis of a dynamic channel assignment strategy. 115-141 2004 140 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.02.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam140.html#NarayananT04 2004-07-07 The average connectivity of a digraph. 143-153 2004 140 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.04.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam140.html#HenningO04 2004-07-07 Gray code for derangements. 207-221 2004 140 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.06.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam140.html#BarilV04 2004-07-07 Searching in trees. 169-183 2004 140 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.05.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam140.html#Recker04 2004-07-07 A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree. 103-114 2004 140 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.06.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam140.html#NagamochiO04 2004-07-07 New upper and lower bounds on the channel capacity of read/write isolated memory. 35-48 2004 140 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.02.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam140.html#GolinYZS04 2004-07-07 The integrity of a cubic graph. 223-239 2004 140 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.07.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam140.html#Vince04 2004-07-07 On the construction of most reliable networks. 19-33 2004 140 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.06.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam140.html#DengCLLG04 2004-07-07 Hybrid grids and the Homing Robot. 155-168 2004 140 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.04.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam140.html#Rabinoff04 2004-07-07 New lower bounds for the three-dimensional finite bin packing problem. 241-258 2004 140 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.08.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam140.html#Boschetti04 2004-07-07 The stable crews problem. 1-17 2004 140 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.05.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam140.html#CechlarovaF04 2004-07-07 Exchange relations, Dyck paths and copolymer adsorption. 49-71 2004 140 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.08.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam140.html#RechnitzerR04 2004-07-07 Neighborhood unions and cyclability of graphs. 91-101 2004 140 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.05.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam140.html#LiuLT04 2004-07-07 A distributed algorithm to find k-dominating sets. 243-253 2004 141 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00368-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam141.html#PensoB04 2004-07-07 Exact enumeration of rooted 3-connected triangular maps on the projective plane. 149-159 2004 141 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00375-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam141.html#GaoW04 2004-07-07 Expected worst-case partial match in random quadtries. 103-117 2004 141 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00365-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam141.html#DevroyeZ04 2004-07-07 Distances and diameters on iterated clique graphs. 255-261 2004 141 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00379-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam141.html#Pizana04 2004-07-07 Trees with three leaves are (n+1)-unavoidable. 19-39 2004 141 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00366-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam141.html#CeroiH04 2004-07-07 Phorma: perfectly hashable order restricted multidimensional arrays. 209-223 2004 141 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00374-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam141.html#LinsLM04 2004-07-07 An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid. 225-241 2004 141 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00373-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam141.html#MorganaMS04 2004-07-07 Preface. 1 2004 141 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00362-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam141.html#ReedSS04 2004-07-07 On the complexity of the approximation of nonplanarity parameters for cubic graphs. 119-134 2004 141 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00370-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam141.html#FariaFN04 2004-07-07 Bounds for optimal coverings. 263-276 2004 141 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00372-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam141.html#MoreiraK04 2005-09-14 Clique divergent clockwork graphs and partial orders. 195-207 2004 141 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00378-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam141.html#LarrionNP04 2004-07-07 Decomposition of odd-hole-free graphs by double star cutsets and 2-joins. 41-91 2004 141 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00364-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam141.html#ConfortiCV04 2004-07-07 Strong lower bounds for the prize collecting Steiner problem in graphs. 277-294 2004 141 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00380-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam141.html#LucenaR04 2004-07-07 Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum. 93-101 2004 141 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00377-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam141.html#DantasGM04 2004-07-07 Partitioning chordal graphs into independent sets and cliques. 185-194 2004 141 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00371-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam141.html#HellKNP04 2004-07-07 AT-free graphs: linear bounds for the oriented diameter. 135-148 2004 141 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00376-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam141.html#FominMPR04 2005-01-19 ₄-composition schemes for perfect orderability. 161-183 2004 141 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00367-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam141.html#HaywardL04 2004-07-07 Cliques and extended triangles. A necessary condition for planar clique graphs. 3-17 2004 141 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(03)00369-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam141.html#AlconG04 2005-07-04 Definability of Boolean function classes by linear equations over GF(2). 29-34 2004 142 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.09.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam142.html#CouceiroF04 2005-07-04 <i>n</i><i>2n</i><i>n</i>ge3. 127-132 2004 142 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.02.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam142.html#XiaSPC04 2005-07-04 Permutation polytopes corresponding to strongly supermodular functions. 87-97 2004 142 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2002.11.010 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam142.html#HwangLR04 2005-07-04 Reasoning with ordered binary decision diagrams. 151-163 2004 142 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.02.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam142.html#HoriyamaI04 2005-07-04 Disjunctive analogues of submodular and supermodular pseudo-Boolean functions. 53-65 2004 142 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.12.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam142.html#FoldesH04 2005-07-04 _AX_AT. 17-27 2004 142 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.03.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam142.html#ChenK04 2005-07-04 A decomposability index in logical analysis of data. 165-180 2004 142 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.02.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam142.html#OnoYI04 2005-07-04 Improved approximations for max set splitting and max NAE SAT. 133-149 2004 142 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2002.07.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam142.html#ZhangYH04 2005-07-04 Post classes characterized by functional terms. 35-51 2004 142 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.01.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam142.html#FoldesP04 2005-07-04 Adaptive memory search for Boolean optimization problems. 99-109 2004 142 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.06.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam142.html#HvattumLG04 2005-07-04 Complexity of learning in concept lattices from positive and negative examples. 111-125 2004 142 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.11.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam142.html#Kuznetsov04 2005-07-04 Monotone Boolean formulas can approximate monotone linear threshold functions. 181-187 2004 142 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.02.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam142.html#Servedio04 2005-07-04 Dual-bounded generating problems: weighted transversals of a hypergraph. 1-15 2004 142 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2002.12.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam142.html#BorosGKM04 2005-07-04 Ordered binary decision diagrams and the Shannon effect. 67-85 2004 142 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.02.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam142.html#GroplPS04 2005-07-04 Sequential testing of complex systems: a review. 189-205 2004 142 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2002.08.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam142.html#Unluyurt04 2005-07-04 Broadcast time and connectivity. 359-363 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.07.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#Lichiardopol04 2005-07-04 Erasure-resilient codes from affine spaces. 292-297 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.02.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#MullerJ04 2005-07-04 _NCalgorithm for computing Pfaffians. 1-16 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.12.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#MahajanSV04 2005-07-04 <i>k, l</i>)-graph sandwich problems. 155-165 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.02.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#DantasFF04 2005-07-04 Order-preserving, upward drawing of binary trees using fewer bends. 318-323 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.02.011 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#Kim04 2005-07-04 Stable skew partition problem. 17-22 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.01.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#DantasFKGR04 2005-07-04 Chordal probe graphs. 221-237 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.12.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#GolumbicL04 2005-07-04 Polynomial transformations and data-independent neighborhood functions. 272-284 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.06.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#ArmstrongJ04 2005-07-04 Improving the trade-off between storage and communication in broadcast encryption schemes. 213-220 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.02.015 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#PadroGM04 2005-07-04 A type-B Tamari poset. 110-122 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.11.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#Sandman04 2005-07-04 Minimum average distance of strong orientations of graphs. 204-212 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.01.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#DankelmannOW04 2005-07-04 The achromatic number of the union of cycles. 330-335 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.12.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#LeeS04 2005-07-04 Minimizing maximum indegree. 374-378 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.07.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#Venkateswaran04 2005-07-04 Distributed algorithm for approximating the maximum matching. 62-71 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.10.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#CzygrinowHS04 2005-07-04 Hard cases of the multifacility location problem. 368-373 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.05.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#Karzanov04 2005-07-04 A note on tolerance graph recognition. 307-311 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.08.012 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#HaywardS04 2005-07-04 Eulerian disjoint paths problem in grid graphs is NP-complete. 336-341 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.12.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#Marx04 2005-07-04 <i>k</i>nearest points of a finite set in a normed linear space. 23-30 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.10.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#Alvoni04 2005-07-04 Extremal problems for ordered hypergraphs: small patterns and some enumeration. 144-154 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.02.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#Klazar04 2005-07-04 A linear-time algorithm to solve the Sports League Scheduling Problem (prob026 of SPLib). 252-265 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.10.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#HamiezH04 2005-07-04 <i>k</i>-trees. 285-291 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.03.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#Salavatipour04 2005-07-04 Recurrence relations for the spectrum polynomial of a matroid. 312-317 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.10.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#Kook04 2005-07-04 Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes. 123-129 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.10.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#SchroderSV04 2005-07-04 Multi-terminal multipath flows: synthesis. 182-193 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.02.014 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#ChandrasekaranNAK04 2005-07-04 <i>n</i>-gons. 353-358 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.09.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#Dumitrescu04 2005-07-04 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers. 72-83 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.12.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#EggeM04 2005-07-04 Replacing cliques by stars in quasi-median graphs. 194-203 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.03.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#HuberMS04 2005-07-04 An improved algorithm for the k-source maximum eccentricity spanning trees. 342-350 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.12.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#Wu04a 2005-07-04 On generalized greedy splitting algorithms for multiway partition problems. 130-143 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.10.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#ZhaoNI04 2005-07-04 <i>v</i><i>Z</i>-cyclic solutions. 43-53 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.12.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#AbelCF04 2005-07-04 Algorithms for on-line bin-packing problems with cardinality constraints. 238-251 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.05.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#BabelCKK04 2005-07-04 The weighted independent domination problem is NP-complete for chordal graphs. 351-352 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.05.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#Chang04 2006-05-23 Distributive online channel assignment for hexagonal cellular networks with constraints. 84-91 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.06.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#FitzpatrickJN04 2005-07-04 The complexity of arc-colorings for directed hypergraphs. 266-271 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.04.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#Vietri04 2005-07-04 Vertex-pancyclicity of edge-face-total graphs. 364-367 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.07.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#Wang04 2005-07-04 Characterizing convexity of games using marginal vectors. 298-306 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.01.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#VelzenHN04 2005-07-04 Approximate constrained bipartite edge coloring. 54-61 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.12.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#CaragiannisFKPPR04 2005-07-04 Scaling properties of generalized Carlitz sequences of polynomials. 166-181 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.02.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#BarbeHS04 2005-07-04 Overlap-free morphisms and finite test-sets. 92-109 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.10.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#RichommeW04 2005-07-04 Competition hypergraphs. 324-329 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.02.010 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#SonntagT04 2005-07-04 Optimal covering designs: complexity results and new bounds. 281-290 2004 144 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2003.11.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#CrescenziMR04 2005-07-04 Representing a concept lattice by a graph. 27-42 2004 144 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/j.dam.2004.02.016 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#BerryS04 2005-07-04 Introduction to special volume of Discrete Applied Mathematics. 1- 2004 144 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/j.dam.2004.06.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#AnthonyBHK04 2005-07-04 Saturated systems of homogeneous boxes and the logical analysis of numerical data. 103-109 2004 144 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/j.dam.2004.05.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#HammerLSS04 2005-07-04 Discrete models for data imputation. 59-69 2004 144 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/j.dam.2004.04.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#Bruni04 2005-07-04 Fun-Sort--or the chaos of unordered binary search. 231-236 2004 144 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.01.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#BiedlCDFGKM04 2005-07-04 Patterns in words and languages. 237-246 2004 144 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2003.11.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#CastiglioneRS04 2005-07-04 Distinguished representatives for equivalent labelled stratified graphs and applications. 183-208 2004 144 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/j.dam.2003.10.010 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#Tandareanu04 2005-07-04 Measures on Boolean polynomials and their applications in data mining. 123-139 2004 144 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/j.dam.2004.06.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#JaroszewiczSR04 2005-07-04 Pareto-optimal patterns in logical analysis of data. 79-102 2004 144 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/j.dam.2003.08.013 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#HammerKSS04 2005-07-04 Coordination without communication: the case of the flocking problem. 324-344 2004 144 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2003.11.010 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#GervasiP04 2005-07-04 Room allocation: a polynomial subcase of the quadratic assignment problem. 263-269 2004 144 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.01.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#CirianiPB04 2005-07-04 On searching strategies, parallel questions, and delayed answers. 247-262 2004 144 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2003.11.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#CicaleseGV04 2005-07-04 New type of coding problem motivated by database theory. 140-148 2004 144 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/j.dam.2004.03.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#KatonaS04 2005-07-04 A group testing method for finding patterns in data. 149-157 2004 144 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/j.dam.2003.07.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#MaculaP04 2005-07-04 Problem identification using program checking. 270-280 2004 144 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2003.11.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#CollbergP04 2005-07-04 Hard problems in similarity searching. 213-227 2004 144 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/j.dam.2004.06.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#MoanR04 2005-07-04 On the hardness of the minimum height decision tree problem. 209-212 2004 144 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/j.dam.2004.06.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#LaberN04 2005-07-04 ^TMrotation puzzles are intractable. 345-358 2004 144 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2003.11.011 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#HolzerH04 2005-07-04 Waiting patterns for a printer. 359-373 2004 144 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2003.11.012 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#MerliniSV04 2005-07-04 A note on line broadcast in digraphs under the edge-disjoint paths mode. 320-323 2004 144 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2003.11.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#Fraigniaud04 2005-07-04 The geometry of carpentry and joinery. 374-380 2004 144 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2003.11.013 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#MorinM04 2005-07-04 On data classification by iterative linear partitioning. 2-16 2004 144 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/j.dam.2004.04.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#Anthony04 2005-07-04 A modular approach to Sprouts. 303-319 2004 144 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2003.11.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#FocardiL04 2005-07-04 Some connections between learning and optimization. 17-26 2004 144 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/j.dam.2004.06.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#Anthony04a 2005-07-04 Fun with algorithms. 229-230 2004 144 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.04.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#LodiPS04 2005-07-04 Separability by two lines and by nearly straight polygonal chains. 110-122 2004 144 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/j.dam.2003.11.014 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#HurtadoMRS04 2005-07-04 Cluster graph modification problems. 173-182 2004 144 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/j.dam.2004.01.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#ShamirST04 2005-07-04 Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis. 43-58 2004 144 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/j.dam.2004.06.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#BorosM04 2005-07-04 Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems. 158-172 2004 144 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/j.dam.2004.05.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#Minoux04 2005-07-04 Monotone concepts for formal concept analysis. 70-78 2004 144 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/j.dam.2004.05.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#DeogunS04 2005-07-04 A bijection for the total area of parallelogram polyominoes. 291-302 2004 144 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2003.11.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam144.html#LungoNPR04 2005-07-04 On the variance of average distance of subsets in the Hamming space. 465-478 2005 145 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.08.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#FuLX05 2005-07-04 Erratum to: The lattice of closure systems, closure operators and implicational systems on a finite set: a survey: [Discrete Applied Mathematics 127(2) (2003) 241-269]. 333 2005 145 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.08.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#CaspardM05 2005-07-05 Structural decompositions, width parameters, and graph labelings. 141-142 2005 145 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.08.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#KratochvilPS05 2005-07-04 Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs. 219-231 2005 145 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.01.013 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#AlberDN05 2005-07-04 Sequencing by hybridization with isothermic oligonucleotide libraries. 40-51 2004 145 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2003.09.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#BlazewiczFKM04 2005-07-04 Jackson's pseudo-preemptive schedule and cumulative scheduling problems. 80-94 2004 145 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2003.09.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#CarlierP04 2005-07-04 <i>H</i>-coloring problem. 297-305 2005 145 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.01.018 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#DiazST05 2005-07-04 Block linear majorants in quadratic 0-1 optimization. 52-71 2004 145 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2003.09.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#BorosLS04 2005-07-04 An infinite family of Goethals-Seidel arrays. 498-504 2005 145 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2003.06.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#XiaXSW05 2005-07-04 Consensus algorithms for the generation of all maximal bicliques. 11-21 2004 145 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2003.09.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#AlexeACFHS04 2005-07-04 A note on the number of matchings and independent sets in trees. 483-489 2005 145 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.07.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#FischermannVR05 2005-07-04 Variable neighborhood search for the maximum clique. 117-125 2004 145 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2003.09.012 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#HansenMU04 2005-07-04 Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width. 276-290 2005 145 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.01.016 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#Makowsky05 2005-07-04 Augmenting graphs for independent sets. 3-10 2004 145 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2003.09.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#AlekseevL04a 2005-07-04 Distance labeling schemes for well-separated graph classes. 384-402 2005 145 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.03.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#KatzKP05 2005-07-04 The path-variance problem on tree networks. 72-79 2004 145 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2003.09.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#CaceresLM04 2005-07-04 Preface. 1-2 2004 145 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.02.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#GendreauHSW04 2005-07-04 Robotic cell scheduling with operational flexibility. 334-348 2005 145 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.02.012 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#AkturkGK05 2005-07-04 An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem. 22-39 2004 145 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2003.09.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#AnilyB04 2005-07-04 Compact scheduling of zero-one time operations in multi-stage systems. 95-103 2004 145 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2003.09.010 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#GiaroK04 2005-07-04 Performance evaluation of demodulation with diversity--a combinatorial approach II: bijective methods. 403-421 2005 145 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.05.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#KrobV05 2005-07-04 Connected triangle-free m-step competition graphs. 376-383 2005 145 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.06.010 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#Helleloid05 2005-07-04 Virtual network embedding in the cycle. 368-375 2005 145 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.05.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#ChoplinJP05 2005-07-04 An exact algorithm for the channel assignment problem. 326-331 2005 145 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.01.020 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#Kral05 2005-07-04 Bounding the probability of the union of events by aggregation and disaggregation in linear programs. 444-454 2005 145 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.03.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#PrekopaG05 2005-07-04 A simple linear time algorithm for cograph recognition. 183-197 2005 145 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.01.011 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#HabibP05 2005-07-04 <i>k</i><i>k</i>. 242-265 2005 145 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2002.12.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#GuptaNPR05 2005-07-04 Graph minor hierarchies. 167-182 2005 145 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.01.010 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#DiestelK05 2005-07-04 Eulerian subgraphs and Hamilton-connected line graphs. 422-428 2005 145 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.04.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#LiLZ05 2005-07-04 A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. 126-139 2004 145 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2003.09.013 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#Hernandez-PerezG04 2005-07-04 The algebraic Monge property and path problems. 455-464 2005 145 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.06.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#BeinBLP05 2005-07-04 Systems of distant representatives. 306-316 2005 145 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.02.018 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#FialaKP05 2005-07-04 Tree decompositions with small cost. 143-154 2005 145 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.01.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#BodlaenderF05 2005-07-04 Linear-time modular decomposition of directed graphs. 198-209 2005 145 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.02.017 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#McConnellM05 2005-09-27 <i>n</i>-cubes. 490-492 2005 145 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.08.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#HouXX05 2005-07-04 Adapting polyhedral properties from facility to hub location problems. 104-116 2004 145 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2003.09.011 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#HamacherLNS04 2005-07-04 <i>L</i>(2, 1)-labeling of direct product of paths and cycles. 317-325 2005 145 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.01.019 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#JhaKV05 2005-07-04 Equivalence classes of matchings and lattice-square designs. 349-357 2005 145 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.02.013 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#ChenT05 2005-07-04 On the mean radius of permutation polytopes. 358-367 2005 145 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.01.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#Robb05 2005-07-04 <i>P</i>₅, gem)-free graphs have bounded clique-width. 232-241 2005 145 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.01.014 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#BrandstadtLM05 2005-07-04 <i>P</i>₅, gem)-free graphs. 155-166 2005 145 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.01.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#BrandstadtK05 2005-07-04 Nested chain partitions of LYM posets. 403-497 2005 145 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.07.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#Wang05 2005-07-04 Computing the branchwidth of interval graphs. 266-275 2005 145 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.01.015 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#KloksKM05 2005-07-04 Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs. 479-482 2005 145 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.06.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#UeharaTN05 2005-07-04 Path partition for graphs with special blocks. 429-436 2005 145 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.03.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#PanC05 2005-07-04 Energy ordering of catacondensed hexagonal systems. 437-443 2005 145 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.03.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#Rada05 2005-07-04 Strong branchwidth and local transversals. 291-296 2005 145 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.01.017 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#Tuza05 2005-07-04 Tree-decompositions of small pathwidth. 210-218 2005 145 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.01.012 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam145.html#Telle05 2005-07-04 Minimization of ordered, symmetric half-products. 287-300 2005 146 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.07.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#Kubiak05 2005-07-08 A class of web-based facets for the generalized vertex packing problem. 273-286 2005 146 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.09.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#SheraliS05 2005-07-04 On-line construction of compact directed acyclic word graphs. 156-179 2005 146 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.04.012 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#InenagaHSTAMP05 2005-07-04 On sequential diagnosis of multiprocessor systems. 311-342 2005 146 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.08.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#YamadaOWU05 2005-07-04 Hamiltonian colorings of graphs. 257-272 2005 146 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.08.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#ChartrandNZ05 2005-07-04 Parallel Lempel Ziv coding. 180-191 2005 146 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.04.013 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#KleinW05 2005-07-04 Uniformly bounded duplication languages. 301-310 2005 146 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.10.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#LeupoldMM05 2005-07-04 A characterization problem on underlying graphs of line digraphs. 99-101 2005 146 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.06.012 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#Sahili05 2005-07-04 Complexity of the directed spanning cactus problem. 81-91 2005 146 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.08.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#Palbom05 2005-07-04 Delta additive and Delta ultra-additive maps, Gromov's trees, and the Farris transform. 51-73 2005 146 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2003.01.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#DressHHKMW05 2005-07-04 A remark on evolutionary systems. 111-115 2005 146 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.06.011 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#Csuhaj-VarjuD05 2005-07-04 Approximation algorithms for some vehicle routing problems. 27-42 2005 146 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.07.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#BazganHM05 2005-07-04 Parallel algorithms for separable permutations. 343-364 2005 146 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.10.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#YugandharS05 2005-07-04 The maximum traveling salesman problem on van der Veen matrices. 1-2 2005 146 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.06.014 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#SteinerX05 2005-07-04 A note on collections of graphs with non-surjective lambda labelings. 92-98 2005 146 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.06.013 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#GeorgesM05 2005-07-04 A very elementary presentation of the Hannenhalli-Pevzner theory. 134-145 2005 146 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.04.010 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#Bergeron05 2005-07-04 On the LU factorization of the Vandermonde matrix. 102-105 2005 146 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.08.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#Yang05 2005-07-04 An extension of the periodicity lemma to longer periods. 146-155 2005 146 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.04.011 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#FraenkelS05 2005-07-04 Data-independent neighborhood functions and strict local optima. 233-243 2005 146 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.09.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#ArmstrongJ05 2005-07-04 Finding complementary cycles in locally semicomplete digraphs. 245-256 2005 146 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.10.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#Bang-JensenN05 2005-07-04 Foreword. 123 2005 146 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.11.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#AmirL05 2005-07-04 A hypocoloring model for batch scheduling. 3-26 2005 146 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.06.016 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#WerraDMP05 2005-07-04 Tandem cyclic alignment. 124-133 2005 146 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.04.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#Benson05 2005-07-04 On approximating the b-chromatic number. 106-110 2005 146 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.09.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#CorteelVV05 2005-07-04 <i>n</i><i>m</i>chessboards. 219-232 2005 146 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.11.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#LinW05 2005-07-04 A note on identities of two-dimensional languages. 43-50 2005 146 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.07.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#Dolinka05 2005-07-04 Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs. 193-218 2005 146 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.10.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#Meister05 2005-07-04 <i>K</i>₂-free graphs. 74-80 2005 146 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.07.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam146.html#LozinM05 2005-07-04 Conjunctive prediction of an ordinal criterion variable on the basis of binary predictors. 91-100 2005 147 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.06.023 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#LombardiM05 2005-07-04 About the design of oligo-chips. 57-67 2005 147 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.06.020 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#Guenoche05 2005-07-04 Watersheds, mosaics, and the emergence paradigm. 301-324 2005 147 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/j.dam.2004.09.017 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#NajmanCB05 2005-07-04 Mixture decomposition of distributions by copulas in the symbolic data analysis framework. 27-41 2005 147 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.06.018 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#DidayV05 2005-07-04 Plane digitization and related combinatorial problems. 169-186 2005 147 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/j.dam.2004.09.010 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#BrimkovB05 2005-07-04 Algorithms for polyominoes based on the discrete Green theorem. 187-205 2005 147 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/j.dam.2004.09.011 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#BrlekLL05 2005-07-04 From hypertrees to arboreal quasi-ultrametrics. 3-26 2005 147 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.06.017 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#Brucker05 2005-07-04 Pseudo-models and propositional Horn inference. 43-55 2005 147 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.06.019 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#GanterK05 2005-07-04 Advances in Discrete Geometry and Topology: Special issue devoted to the 11th International Conference on Discrete Geometry for Computer Imagery (DGCI 2003) Naples, Italy 19-21 November 2003. 147-148 2005 147 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/j.dam.2004.11.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#NystromBS05 2005-07-04 Stability in Discrete Tomography: some positive results. 207-226 2005 147 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/j.dam.2004.09.012 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#BrunettiD05 2005-07-04 On storage of topological information. 287-300 2005 147 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/j.dam.2004.09.016 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#Kopperman05 2005-07-04 Derived neighborhoods and frontier orders. 227-243 2005 147 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/j.dam.2004.09.013 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#DaragonCB05 2005-07-04 Expanding selfsimilar solutions of a crystalline flow with applications to contour figure analysis. 265-285 2005 147 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/j.dam.2004.09.015 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#HontaniGGD05 2005-07-04 Object and image indexing based on region connection calculus and oriented matroid theory. 345-361 2005 147 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/j.dam.2004.09.019 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#StaffettiGSS05 2005-07-04 Preference modeling on totally ordered sets by the Sugeno integral. 113-124 2005 147 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.06.025 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#RicoGLC05 2005-07-04 Ordinal and symbolic data analysis. 1-2 2005 147 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.11.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#DoignonP05 2005-07-04 Closure spaces that are not uniquely generated. 69-79 2005 147 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.06.021 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#JamisonP05 2006-05-11 <i>PQI</i>interval orders. 125-146 2005 147 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.06.026 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#TheT05 2005-07-04 Reconstruction of 8-connected but not 4-connected hv-convex discrete sets. 149-168 2005 147 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/j.dam.2004.09.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#BalazsBK05 2005-07-04 Configurations induced by discrete rotations: periodicity and quasi-periodicity properties. 325-343 2005 147 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/j.dam.2004.09.018 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#NouvelR05 2005-07-04 On the cohomology of 3D digital images. 245-263 2005 147 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/j.dam.2004.09.014 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#Gonzalez-DiazR05 2005-07-04 Functorial scaling of ordinal data. 101-111 2005 147 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.06.024 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#PollandtW05 2005-07-04 Path-independence and closure operators with the anti-exchange property. 81-89 2005 147 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.06.022 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam147.html#Koshevoy05 2005-07-04 Faa` di Bruno's formula, lattices, and partitions. 246-255 2005 148 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.02.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#EncinasRM05 2005-07-04 Orientable convexity, geodetic and hull numbers in graphs. 256-262 2005 148 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.03.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#Farrugia05 2005-07-04 Decomposing toroidal graphs into circuits and edges. 147-159 2005 148 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.10.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#XuW05 2005-07-04 Balanced vertex-orderings of graphs. 27-48 2005 148 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.12.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#BiedlCGHW05 2005-07-04 Primitive partial words. 195-213 2005 148 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.03.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#Blanchet-Sadri05 2005-07-04 A competitive algorithm to find all defective edges in a graph. 273-277 2005 148 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.02.010 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#Hwang05 2005-07-04 A class of acyclic digraphs with interval competition graphs. 171-180 2005 148 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.02.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#ChoK05 2005-07-04 The complexity of base station positioning in cellular networks. 1-12 2005 148 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.07.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#GlasserRV05 2005-07-04 Optimal parallel machines scheduling with availability constraints. 63-87 2005 148 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.12.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#GharbiH05 2005-07-04 A note on rectilinear and polar visibility graphs. 263-272 2005 148 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2004.12.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#Hutchinson05 2005-07-04 Conversion of coloring algorithms into maximum weight independent set algorithms. 107-125 2005 148 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.11.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#ErlebachJ05 2005-07-04 Generalized list T-colorings of cycles. 13-25 2005 148 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.11.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#FialaS05 2005-07-04 Minimizing makespan with release times on identical parallel batching machines. 127-134 2005 148 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.11.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#LiLZ05a 2005-07-04 A solvable case of image reconstruction in discrete tomography. 240-245 2005 148 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.03.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#CostaWPS05 2005-07-04 A note on 3D orthogonal graph drawing. 189-193 2005 148 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.02.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#BiedlC05 2005-07-04 Variation of the Wiener index under tree transformations. 135-146 2005 148 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2004.07.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#Rada05a 2005-07-04 The effect of machine availability on the worst-case performance of LPT. 49-61 2005 148 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.12.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#HwangLC05 2005-07-04 On monochromatic component size for improper colourings. 89-105 2005 148 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.10.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#EdwardsF05 2005-07-04 Tight bounds for bandwidth allocation on two links. 181-188 2005 148 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.02.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#Epstein05 2005-07-04 Consistent formulas for estimating the total lengths of trees. 214-239 2005 148 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.03.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#Willson05 2005-07-04 Affine equivalence in the AES round function. 161-170 2005 148 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.02.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam148.html#YoussefT05 2005-09-15 On the computational complexity of defining sets. 101-110 2005 149 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.03.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam149.html#HatamiM05 2005-09-15 The complexity of modular decomposition of Boolean functions. 1-13 2005 149 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.12.010 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam149.html#Bioch05 2005-10-11 Supermodular functions and the complexity of MAX CSP. 53-72 2005 149 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.03.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam149.html#CohenCJK05 2005-09-15 Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes. 200-218 2005 149 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.06.028 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam149.html#Zverovich05 2005-09-15 <i>k</i>-th order symmetric SAC boolean functions and bisecting binomial coefficients. 73-86 2005 149 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam149.html#CusickL05 2005-09-15 Linear symmetries of Boolean functions. 192-199 2005 149 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam149.html#Xiao05 2005-09-15 Real royal road functions--where crossover provably is essential. 111-125 2005 149 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.02.019 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam149.html#JansenW05 2005-09-15 Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing. 14-52 2005 149 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.12.011 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam149.html#CepekK05 2005-09-15 On the size of maximum renamable Horn sub-CNF. 126-130 2005 149 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.05.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam149.html#Kucera05 2005-09-15 Computing the minimum DNF representation of Boolean functions defined by intervals. 154-173 2005 149 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.08.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam149.html#SchieberGZ05 2005-09-15 The many benefits of putting stack filters into disjunctive or conjunctive normal form. 174-191 2005 149 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.06.027 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam149.html#Wild05 2005-09-15 A polyhedral approach for a constrained quadratic 0-1 problem. 87-100 2005 149 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.02.020 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam149.html#FayeT05 2005-09-15 Factoring Boolean functions using graph partitioning. 131-153 2005 149 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam149.html#MintzG05 2006-04-21 Minmax subtree cover problem on cacti. 1254-1263 2006 154 Discrete Applied Mathematics 8 http://dx.doi.org/10.1016/j.dam.2005.10.013 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#NagamochiK06 2006-04-21 ₂ⁿ. 313-325 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.03.022 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Hou06 2006-04-21 An algorithm to analyze stability of gene-expression patterns. 1140-1156 2006 154 Discrete Applied Mathematics 7 http://dx.doi.org/10.1016/j.dam.2004.08.011 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#GebertLPWW06 2006-04-21 Review of combinatorial problems induced by spatial forest harvesting planning. 867-879 2006 154 Discrete Applied Mathematics 5 http://dx.doi.org/10.1016/j.dam.2005.05.025 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#WeintraubM06 2006-04-21 Enumeration of inequivalent irreducible Goppa codes. 399-412 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.03.017 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#RyanF06 2006-04-21 Randomized vs. deterministic distance query strategies for point location on the line. 478-484 2006 154 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.07.014 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Damaschke06 2006-04-21 A wrap error attack against NTRUEncrypt. 382-391 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.03.019 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#MeskanenR06 2006-04-21 List signature schemes. 189-201 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.08.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#CanardSST06 2006-04-21 Locating and total dominating sets in trees. 1293-1300 2006 154 Discrete Applied Mathematics 8 http://dx.doi.org/10.1016/j.dam.2006.01.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#HaynesHH06 2006-04-21 Description-meet compatible multiway dissimilarities. 493-507 2006 154 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.07.013 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Diatta06 2006-04-21 A class of heuristics for the constrained forest problem. 6-14 2006 154 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2005.06.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#LaszloM06 2006-04-25 Coloring mixed hypertrees. 660-672 2006 154 Discrete Applied Mathematics 4 http://dx.doi.org/10.1016/j.dam.2005.05.019 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#KralKPV06 2006-04-21 A linear algorithm for minimum 1-identifying codes in oriented trees. 1246-1253 2006 154 Discrete Applied Mathematics 8 http://dx.doi.org/10.1016/j.dam.2005.11.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#CharonGHLMM06 2006-04-21 A note on acyclic domination number in graphs of diameter two. 1019-1022 2006 154 Discrete Applied Mathematics 6 http://dx.doi.org/10.1016/j.dam.2005.09.012 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#ChengCN06 2006-04-21 A Branch-and-Cut algorithm for graph coloring. 826-847 2006 154 Discrete Applied Mathematics 5 http://dx.doi.org/10.1016/j.dam.2005.05.022 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Mendez-DiazZ06 2006-04-21 On the pagenumber of trivalent Cayley graphs. 1279-1292 2006 154 Discrete Applied Mathematics 8 http://dx.doi.org/10.1016/j.dam.2006.01.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#TanakaS06 2006-04-21 A generalization of the binary Preparata code. 337-345 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.03.021 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#KuzminMNN06 2006-04-21 A greedy approximation algorithm for the group Steiner problem. 15-34 2006 154 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2005.07.010 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#ChekuriEK06 2006-04-21 Hybrid rounding techniques for knapsack problems. 640-649 2006 154 Discrete Applied Mathematics 4 http://dx.doi.org/10.1016/j.dam.2005.08.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#MastrolilliH06 2006-04-21 An approximation algorithm for maximum triangle packing. 971-979 2006 154 Discrete Applied Mathematics 6 http://dx.doi.org/10.1016/j.dam.2005.11.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#HassinR06 2006-04-21 Construction of sports schedules with multiple venues. 47-58 2006 154 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2005.03.011 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#WerraER06 2006-04-21 Broadcasts in graphs. 59-75 2006 154 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2005.07.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#DunbarEHHH06 2006-04-21 Using graphs for some discrete tomography problems. 35-46 2006 154 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2005.07.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#CostaWP06 2006-04-21 Some simple optimization techniques for self-organized public key management in mobile ad hoc networks. 1223-1235 2006 154 Discrete Applied Mathematics 8 http://dx.doi.org/10.1016/j.dam.2005.12.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Bornand-JaccardSW06 2006-04-21 On the interval completion of chordal graphs. 1003-1010 2006 154 Discrete Applied Mathematics 6 http://dx.doi.org/10.1016/j.dam.2005.09.010 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#PengC06 2006-04-21 Exact enumeration of acyclic deterministic automata. 537-551 2006 154 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.06.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Liskovets06 2006-04-21 Subset-conjunctive rules for breast cancer diagnosis. 1100-1112 2006 154 Discrete Applied Mathematics 7 http://dx.doi.org/10.1016/j.dam.2004.10.010 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#KohliKJ06 2006-04-21 <i>L</i>(2, 1)-labelling of trees. 598-603 2006 154 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.09.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Wang06 2006-04-21 Sphericity, cubicity, and edge clique covers of graphs. 1309-1313 2006 154 Discrete Applied Mathematics 8 http://dx.doi.org/10.1016/j.dam.2006.01.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#MichaelQ06 2006-04-21 <i>lambda</i>⁽³⁾transitive graphs. 1011-1018 2006 154 Discrete Applied Mathematics 6 http://dx.doi.org/10.1016/j.dam.2005.09.015 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#ZhangM06 2006-04-21 <i>n</i><i>n</i>^<i>n</i>-1^<i>n</i>/2^<i>n</i>/2-2. 357-369 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.03.014 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#MaitraP06 2006-04-21 <i>P</i>₄'s. 485-492 2006 154 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.09.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#MelloML06 2006-04-21 Noising methods for a clique partitioning problem. 754-769 2006 154 Discrete Applied Mathematics 5 http://dx.doi.org/10.1016/j.dam.2005.05.029 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#CharonH06 2006-04-21 On an interpolation property of outerplanar graphs. 166-172 2006 154 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2005.07.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#LihLT06 2006-04-21 Optimal on-line flow time with resource augmentation. 611-621 2006 154 Discrete Applied Mathematics 4 http://dx.doi.org/10.1016/j.dam.2005.05.016 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#EpsteinS06 2006-04-21 On constant composition codes. 912-929 2006 154 Discrete Applied Mathematics 6 http://dx.doi.org/10.1016/j.dam.2005.09.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#ChuCD06 2006-04-25 The Hamiltonian problem on distance-hereditary graphs. 508-524 2006 154 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.07.012 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#HsiehHHK06 2006-04-21 Frequency-based views to pattern collections. 1113-1139 2006 154 Discrete Applied Mathematics 7 http://dx.doi.org/10.1016/j.dam.2005.08.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Mielikainen06 2006-08-30 On the complexity of suboptimal decoding for list and decision feedback schemes. 294-304 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.03.023 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#FreudenbergerZ06 2006-04-21 Enumeration of perfect matchings of a type of Cartesian products of graphs. 145-157 2006 154 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2005.07.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#YanZ06 2006-04-21 Non-independent randomized rounding and coloring. 650-659 2006 154 Discrete Applied Mathematics 4 http://dx.doi.org/10.1016/j.dam.2005.05.015 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Doerr06 2006-04-21 A simple expected running time analysis for randomized "divide and conquer" algorithms. 1-5 2006 154 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2005.07.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Dean06 2006-04-21 First vs. best improvement: An empirical study. 802-817 2006 154 Discrete Applied Mathematics 5 http://dx.doi.org/10.1016/j.dam.2005.05.020 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#HansenM06 2006-04-21 Worst-case performance of Wong's Steiner tree heuristic. 730-737 2006 154 Discrete Applied Mathematics 5 http://dx.doi.org/10.1016/j.dam.2005.05.027 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Candia-VejarB06 2006-04-21 Circular mixed hypergraphs II: The upper chromatic number. 1157-1172 2006 154 Discrete Applied Mathematics 8 http://dx.doi.org/10.1016/j.dam.2005.10.012 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#VoloshinV06 2006-04-21 Equivalence-free exhaustive generation of matroid representations. 1210-1222 2006 154 Discrete Applied Mathematics 8 http://dx.doi.org/10.1016/j.dam.2005.12.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Hlineny06 2006-04-21 Unconditionally secure key assignment schemes. 234-252 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.03.025 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#SantisFM06 2006-04-21 An explicit class of codes with good parameters and their duals. 346-356 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.03.013 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#LingXO06 2006-04-21 On irreversibility of von Neumann additive cellular automata on grids. 861-866 2006 154 Discrete Applied Mathematics 5 http://dx.doi.org/10.1016/j.dam.2005.05.024 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#SomaM06 2006-04-21 Trees of extremal connectivity index. 106-119 2006 154 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2004.10.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#LiuLT06 2006-04-21 Repeated-root cyclic and negacyclic codes over a finite chain ring. 413-419 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.03.016 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Salagean06 2006-04-21 Secure multi-party computation made simple. 370-381 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.03.020 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Maurer06 2006-04-21 Fine-grained forward-secure signature schemes without random oracles. 175-188 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.03.028 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#CamenischK06 2006-04-21 Graph splicing systems. 1264-1278 2006 154 Discrete Applied Mathematics 8 http://dx.doi.org/10.1016/j.dam.2005.12.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#SanthanamK06 2006-04-21 A characterization of triangle-free tolerance graphs. 471-477 2006 154 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.06.010 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Busch06 2006-04-21 Graph layering by promotion of nodes. 848-860 2006 154 Discrete Applied Mathematics 5 http://dx.doi.org/10.1016/j.dam.2005.05.023 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#NikolovT06 2006-04-21 <i>k</i>-trees: Characterization and recognition. 818-825 2006 154 Discrete Applied Mathematics 5 http://dx.doi.org/10.1016/j.dam.2005.05.021 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#MarkenzonJP06 2006-04-21 Precoloring extension on unit interval graphs. 995-1002 2006 154 Discrete Applied Mathematics 6 http://dx.doi.org/10.1016/j.dam.2005.10.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Marx06 2006-04-21 Minimum cost and list homomorphisms to semicomplete digraphs. 890-897 2006 154 Discrete Applied Mathematics 6 http://dx.doi.org/10.1016/j.dam.2005.11.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#GutinRY06 2006-04-21 Path problems in generalized stars, complete graphs, and brick wall graphs. 673-683 2006 154 Discrete Applied Mathematics 4 http://dx.doi.org/10.1016/j.dam.2005.05.017 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#ErlebachV06 2006-04-21 A Lagrangian heuristic algorithm for a real-world train timetabling problem. 738-753 2006 154 Discrete Applied Mathematics 5 http://dx.doi.org/10.1016/j.dam.2005.05.026 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#CapraraMTG06 2006-04-21 Preface. 693 2006 154 Discrete Applied Mathematics 5 http://dx.doi.org/10.1016/j.dam.2005.10.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Ribeiro06 2006-04-21 Latin squares with bounded size of row prefix intersections. 1028-1031 2006 154 Discrete Applied Mathematics 6 http://dx.doi.org/10.1016/j.dam.2005.11.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Malewicz06 2006-04-21 A note on power domination in grid graphs. 1023-1027 2006 154 Discrete Applied Mathematics 6 http://dx.doi.org/10.1016/j.dam.2005.08.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#DorflingH06 2006-04-21 <i>d</i>-1)/2] bound. 305-312 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.03.012 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#GabidulinP06 2006-04-21 A strongly polynomial algorithm for solving two-sided linear systems in max-algebra. 437-446 2006 154 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.09.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#ButkovicZ06 2006-04-21 Edge ranking of weighted trees. 1198-1209 2006 154 Discrete Applied Mathematics 8 http://dx.doi.org/10.1016/j.dam.2005.11.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Dereniowski06 2006-04-21 Multiprocessor scheduling under precedence constraints: Polyhedral results. 770-801 2006 154 Discrete Applied Mathematics 5 http://dx.doi.org/10.1016/j.dam.2004.07.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#CollRS06 2006-04-21 Update schedules of sequential dynamical systems. 980-994 2006 154 Discrete Applied Mathematics 6 http://dx.doi.org/10.1016/j.dam.2005.10.010 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#LaubenbacherP06 2006-04-21 Special Issue on Coding and Cryptography. 173 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.08.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#CharpinK06 2006-04-21 <i>delta</i><i>v</i>_<i>µ</i>+1<i>delta</i><i>v</i>_<i>µ</i><i>N</i><i>p</i>³}-minihypers. 277-293 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.03.029 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#FerretS06 2006-04-21 Accelerated algorithm for pattern detection in logical analysis of data. 1050-1063 2006 154 Discrete Applied Mathematics 7 http://dx.doi.org/10.1016/j.dam.2005.03.032 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#AlexeH06a 2006-04-21 Provably secure non-interactive key distribution based on pairings. 270-276 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.03.024 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#DupontE06 2006-04-21 Designing PTASs for MIN-SUM scheduling problems. 622-639 2006 154 Discrete Applied Mathematics 4 http://dx.doi.org/10.1016/j.dam.2005.05.014 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#AfratiM06 2006-04-21 A general two-sided matching market with discrete concave utility functions. 950-970 2006 154 Discrete Applied Mathematics 6 http://dx.doi.org/10.1016/j.dam.2005.10.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#FujishigeT06 2006-04-21 Level of repair analysis and minimum cost homomorphisms of graphs. 881-889 2006 154 Discrete Applied Mathematics 6 http://dx.doi.org/10.1016/j.dam.2005.06.012 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#GutinRYT06 2006-04-21 Introduction. 609 2006 154 Discrete Applied Mathematics 4 http://dx.doi.org/10.1016/j.dam.2005.09.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#BampisJ06 2006-04-21 On the colored Tutte polynomial of a graph of bounded treewidth. 1032-1036 2006 154 Discrete Applied Mathematics 6 http://dx.doi.org/10.1016/j.dam.2005.09.013 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Traldi06 2006-04-21 Generalized domination in closure systems. 1064-1084 2006 154 Discrete Applied Mathematics 7 http://dx.doi.org/10.1016/j.dam.2005.04.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#BerrySS06 2006-04-21 Sub-dominant theory in numerical taxonomy. 1085-1099 2006 154 Discrete Applied Mathematics 7 http://dx.doi.org/10.1016/j.dam.2005.09.011 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Brucker06 2006-04-21 Spanned patterns for the logical analysis of data. 1039-1049 2006 154 Discrete Applied Mathematics 7 http://dx.doi.org/10.1016/j.dam.2005.03.031 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#AlexeH06 2006-04-25 Preface. 1037 2006 154 Discrete Applied Mathematics 7 http://dx.doi.org/10.1016/j.dam.2005.10.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#AnthonyBHK06 2006-04-21 <i>Golomb ruler</i>problem. 120-144 2006 154 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2005.07.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#MeyerJ06 2006-04-21 Computational complexity of isothermic DNA sequencing by hybridization. 718-729 2006 154 Discrete Applied Mathematics 5 http://dx.doi.org/10.1016/j.dam.2005.05.028 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#BlazewiczK06 2006-04-21 Some subsets of points in the plane associated to truncated Reed-Muller codes with good parameters. 392-398 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.03.018 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Quarez06 2006-04-21 Solving the path cover problem on circular-arc graphs by using an approximation algorithm. 76-105 2006 154 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2005.07.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#HungC06 2006-04-21 Linear splicing and syntactic monoid. 452-470 2006 154 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.06.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#BonizzoniFMZ06 2006-04-21 Secret sharing schemes on access structures with intersection number equal to one. 552-563 2006 154 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.09.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Marti-FarreP06 2006-04-21 Locally restricted colorings. 158-165 2006 154 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/j.dam.2005.05.012 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#BlochligerW06 2006-04-21 Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem. 326-336 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.03.030 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#KiltzW06 2006-04-21 Distance-hereditary graphs are clique-perfect. 525-536 2006 154 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.07.011 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#LeeC06 2006-04-21 The satisfactory partition problem. 1236-1245 2006 154 Discrete Applied Mathematics 8 http://dx.doi.org/10.1016/j.dam.2005.10.014 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#BazganTV06 2006-04-21 ^,. 684-691 2006 154 Discrete Applied Mathematics 4 http://dx.doi.org/10.1016/j.dam.2005.05.018 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#MielikainenU06 2006-04-21 <i>n</i>th power of a 2×2 matrix. 1301-1308 2006 154 Discrete Applied Mathematics 8 http://dx.doi.org/10.1016/j.dam.2006.01.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#LaughlinW06 2006-04-21 Monotonicity of the minimum cardinality of an identifying code in the hypercube. 898-899 2006 154 Discrete Applied Mathematics 6 http://dx.doi.org/10.1016/j.dam.2005.05.030 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Moncel06 2006-04-21 <i>k</i>-coloring. 564-586 2006 154 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.06.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#MuratP06 2006-09-29 Scheduling workover rigs for onshore oil production. 695-702 2006 154 Discrete Applied Mathematics 5 http://dx.doi.org/10.1016/j.dam.2004.09.021 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#AloiseARRFM06 2006-04-21 Unextendible product bases and 1-factorization of complete graphs. 942-949 2006 154 Discrete Applied Mathematics 6 http://dx.doi.org/10.1016/j.dam.2005.10.011 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#Feng06 2006-04-21 Properties and constraints of cheating-immune secret sharing schemes. 219-233 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.03.026 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#DArcoKS06 2006-04-21 Finding nonnormal bent functions. 202-218 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.03.027 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#CanteautDDL06 2006-04-21 Entity authentication schemes using braid word reduction. 420-436 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.03.015 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#SibertDG06 2006-04-21 The number of convex polyominoes and the generating function of Jacobi polynomials. 587-593 2006 154 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.10.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#GuoZ06 2006-04-21 A new class of facets for the Latin square polytope. 900-911 2006 154 Discrete Applied Mathematics 6 http://dx.doi.org/10.1016/j.dam.2005.09.014 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#AppaMM06 2006-04-21 Positivity of second order linear recurrent sequences. 447-451 2006 154 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.10.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#HalavaHH06 2006-04-21 Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials. 1183-1197 2006 154 Discrete Applied Mathematics 8 http://dx.doi.org/10.1016/j.dam.2005.11.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#HouM06 2006-04-21 Recursive error correction for general Reed-Muller codes. 253-269 2006 154 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/j.dam.2005.05.013 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#DumerS06 2006-04-21 Several parameters of generalized Mycielskians. 1173-1182 2006 154 Discrete Applied Mathematics 8 http://dx.doi.org/10.1016/j.dam.2005.11.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#LinWLG06 2006-04-21 Using Lagrangian dual information to generate degree constrained spanning trees. 703-717 2006 154 Discrete Applied Mathematics 5 http://dx.doi.org/10.1016/j.dam.2005.06.011 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#AndradeLM06 2006-04-21 <i>h</i>-Assignments of simplicial complexes and reverse search. 594-597 2006 154 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/j.dam.2005.09.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam154.html#MoriyamaH06 2006-04-21 <i>k</i>-partite graphs. 153-181 2005 153 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.05.011 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam153.html#Voll05 2006-04-21 Special Issue on Typical Case Complexity and Phase Transitions. 1 2005 153 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.07.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam153.html#KirousisK05 2006-04-21 On the typical case complexity of graph optimization. 73-88 2005 153 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.05.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam153.html#Farago05 2006-04-21 On the complexity of unfrozen problems. 3-24 2005 153 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.05.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam153.html#BeachamC05 2006-04-21 SAT distributions with planted assignments and phase transitions between decision and optimization problems. 58-72 2005 153 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.05.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam153.html#Dimitriou05 2006-09-20 A sharp threshold for the renameable-Horn and the q-Horn properties. 48-57 2005 153 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.05.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam153.html#CreignouDF05 2006-04-21 <i>k</i>-colorability. 25-47 2005 153 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.05.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam153.html#BeameCMM05 2006-04-21 Threshold properties of random boolean constraint satisfaction problems. 141-152 2005 153 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.05.010 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam153.html#Istrate05 2006-09-20 Typical case complexity of Satisfiability Algorithms and the threshold phenomenon. 89-123 2005 153 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.05.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam153.html#Franco05 2006-04-21 Resolution complexity of random constraint satisfaction problems: Another half of the story. 124-140 2005 153 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.05.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam153.html#GaoC05 2006-04-21 Decomposition of integer matrices and multileaf collimator sequencing. 6-34 2005 152 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.04.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam152.html#BaatarHEW05 2006-04-21 Unique list-colourability and the fixing chromatic number of graphs. 123-138 2005 152 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.04.006 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam152.html#DaneshgarH05 2006-04-21 Special section: Using discrete mathematics to model multileaf collimators in radiation therapy. 4-5 2005 152 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.06.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam152.html#HamacherE05 2006-04-21 <i>b</i>-dominating coloring of graphs. 176-186 2005 152 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.04.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam152.html#HoangK05 2006-04-21 A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint. 52-88 2005 152 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.10.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam152.html#Kalinowski05 2006-04-21 The exchange-stable marriage problem. 109-122 2005 152 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.06.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam152.html#CechlarovaM05 2006-04-21 <i>Delta</i><i>D</i>)-graphs. 89-108 2005 152 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.03.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam152.html#CanaleG05 2006-04-21 <i>L</i><i>d</i>, 1)-labelings of certain direct products of cycles and Cartesian products of cycles. 257-265 2005 152 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.04.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam152.html#JhaKV05a 2006-04-21 The number of independent sets in unicyclic graphs. 246-256 2005 152 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.04.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam152.html#PedersenV05 2006-04-21 Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. 229-245 2005 152 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.029 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam152.html#NishimuraRT05 2006-04-21 Cluttered orderings for the complete bipartite graph. 213-228 2005 152 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.06.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam152.html#MullerAJ05 2006-04-21 Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph. 266-272 2005 152 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.03.010 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam152.html#LeeR05 2006-04-21 Searching for two counterfeit coins with two-arms balance. 187-212 2005 152 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.03.009 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam152.html#LiuZN05 2006-04-21 A new algorithm for optimal multileaf collimator field segmentation. 35-51 2005 152 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.10.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam152.html#Engel05 2006-04-21 Hamiltonian completions of sparse random graphs. 139-158 2005 152 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.05.001 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam152.html#GamarnikS05 2006-04-21 Optimal discovery of repetitions in 2D. 5-20 2005 151 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.019 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam151.html#ApostolicoB05 2006-04-21 <i>hv</i>-convex (0, 1)-matrices. 93-105 2005 151 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.023 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam151.html#DahlF05 2006-04-21 An elementary digital plane recognition algorithm. 169-183 2005 151 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.026 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam151.html#GerardDZ05 2006-04-21 An algorithm for the reconstruction of discrete sets from two projections in presence of absorption. 21-35 2005 151 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.020 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam151.html#BarcucciFR05 2006-04-21 Salient and reentrant points of discrete sets. 106-121 2005 151 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.024 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam151.html#DauratN05 2006-04-21 Simultaneous fuzzy segmentation of multiple objects. 55-77 2005 151 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.031 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam151.html#CarvalhoHK05 2006-04-21 On digital plane preimage structure. 78-92 2005 151 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.022 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam151.html#CoeurjollySDFC05 2006-04-21 The reconstruction of a subclass of domino tilings from two projections. 154-168 2005 151 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.032 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam151.html#FrosiniS05 2006-04-21 An evolutionary algorithm for discrete tomography. 36-54 2005 151 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.021 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam151.html#Batenburg05 2006-04-21 Discrete tomography by convex-concave regularization and D.C. programming. 229-243 2005 151 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.028 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam151.html#SchuleSWH05 2006-04-21 On the min DSS problem of closed discrete curves. 138-153 2005 151 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.025 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam151.html#FeschetT05 2006-04-21 Dedication. 1 2005 151 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(05)00258-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam151.html#GesuK05 2006-04-21 Preface. 3 2005 151 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.06.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam151.html#GesuK05a 2006-04-25 Linear segmentation of discrete curves into blurred segments. 122-137 2005 151 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.03.007 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam151.html#Debled-RennessonRR05 2006-04-21 <i>P</i>-simple points. 198-228 2005 151 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.030 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam151.html#LohouB05 2006-04-21 A coordinate ascent approach to tomographic reconstruction of label images from a few projections. 184-197 2005 151 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.027 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam151.html#LiaoH05 2006-04-26 <i>k</i>-partition problems. 121-139 2005 150 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.013 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam150.html#DellOlmoHPS05 2006-04-26 Generalized knight's tours on rectangular chessboards. 80-98 2005 150 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.11.008 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam150.html#ChiaO05 2006-04-26 Semi-online scheduling jobs with tightly-grouped processing times on three identical machines. 140-159 2005 150 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.12.005 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam150.html#HeD05 2006-04-26 2-Tree probe interval graphs have a large obstruction set. 216-231 2005 150 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.06.015 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam150.html#PrzuljC05 2006-04-26 <i>l</i>-Parametric eigenproblem in max-algebra. 16-28 2005 150 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.017 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam150.html#Plavka05 2006-04-26 Eigenvectors of interval matrices over max-plus algebra. 2-15 2005 150 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.016 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam150.html#Cechlarova05 2006-04-26 An infinite sequence of non-realizable weavings. 256-260 2005 150 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.011 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam150.html#RepovsSS05 2006-04-26 Signed domatic number of a graph. 261-267 2005 150 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.08.010 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam150.html#VolkmannZ05 2006-04-26 Monotonicity and positive invariance of linear systems over dioids. 29-39 2005 150 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.018 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam150.html#TruffetW05 2006-04-26 Mediated digraphs and quantum nonlocality. 41-50 2005 150 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.05.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam150.html#GutinJRSY05 2006-04-26 Efficient parallel recognition of cographs. 182-215 2005 150 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam150.html#NikolopoulosP05 2006-04-26 Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, "The disjunctive procedure and blocker duality". 251-255 2005 150 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2004.09.020 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam150.html#LeoniN05 2006-04-26 On a bidirected relaxation for the MULTIWAY CUT problem. 67-79 2005 150 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.04.003 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam150.html#ChekuriGK05 2006-04-26 Randic ordering of chemical trees. 232-250 2005 150 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.014 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam150.html#RadaU05 2006-04-26 Self-spanner graphs. 99-120 2005 150 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.04.004 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam150.html#CiceroneSH05 2006-04-26 Searching for a counterfeit coin with two unreliable weighings. 160-181 2005 150 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.015 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam150.html#LiuZN05a 2006-04-26 On the power of circular splicing. 51-66 2005 150 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2005.02.012 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam150.html#BonizzoniFMZ05 2004-02-05 Partial Unitals and Related Structures in Desarguesian Planes. 231-236 1998 15 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#Ball98 2004-02-05 Incomplete Sums, DC-Constrained Codes, and Codes that Maintain Synchronization. 105-116 1993 3 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#Barg93 2004-02-05 New Classes of Groups Containing Menon Difference Sets. 319-325 1996 8 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#Meisner96 2004-02-05 Some Remarks on Orders of Projective Planes, Planar Difference Sets and Multipliers. 69-75 1991 1 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#Ho91 2004-02-05 Incidence Matrices and Collineations of Finite Projective Planes. 159-162 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#Ho99 2004-02-05 McFarland's Conjecture on Abelian Difference Sets with Multiplier -1. 321-332 1991 1 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#Ma91 2004-02-05 A Survey of Partial Difference Sets. 221-261 1994 4 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#Ma94 2004-02-05 The GF(p)-Dimension of the Codes Generated by the Classical Point-Line Geometries over GP(p). 199-207 1993 3 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#Beth93 2004-02-05 Watching the Bhang Meter and Flying through Dirt. 17-25 1996 7 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc7.html#Beth96 2004-02-05 How to Avoid the Cheaters Succeeding in the Key Sharing Scheme. 221-228 1993 3 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#Rifa-Coma93 2004-02-05 Symmetric Designs Attached to Four-Weight Spin Models. 73-90 2002 25 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc25.html#BannaiS02 2004-02-05 Codes with a Disparity Property. 79-97 1997 11 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc11.html#Perkins97 2004-02-05 Kirkman Packing Designs KPD ({3, 5*}, v). 127-138 2002 26 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc26.html#CaoZ02 2004-02-05 Almost MDS Codes. 143-155 1996 9 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#Boer96 2006-05-23 True Dimension of Some Binary Quadratic Trace Goppa Codes. 81-97 2001 24 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#Veron01 2004-02-05 Forcing Linearity on Greedy Codes. 39-49 1996 9 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#Bonn96 2006-04-26 On the p-Rank of Incidence Matrices and a Bound of Bruen and Ott. 391-394 1992 2 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#CaenGR92 2004-02-05 Some Highly Symmetric Authentication Perpendicular Arrays. 307-319 1991 1 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#BierbrauerT91 2004-02-05 Optimal Ternary Linear Codes. 137-157 1992 2 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#HillN92 2004-02-05 Necessary Conditions for Menon Difference Sets. 147-154 1993 3 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#Chan93 2004-02-05 A Construction of Difference Sets. 247-250 1998 13 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#Chen98 2004-02-05 On a Family of Covering Extended Building Sets. 69-72 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#Chen99 2004-02-05 Three Systems for Threshold Generation of Authenticators. 299-312 1998 13 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#Safavi-Naini98 2004-02-05 Three Characterizations of Non-binary Correlation-Immune and Resilient Functions. 241-251 1995 5 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc5.html#GopalakrishnanS95 2004-02-05 Non-symmetric 2-Designs Modulo 2. 63-68 1993 3 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#Skinner93 2004-02-05 Combinatorial Problems in Infinite Spaces. 247-249 1996 9 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#Tallini96 2004-02-05 Constructions for Octonion and Exceptional Jordan Algebras. 191-203 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#RylandsT00 2004-08-19 On Symmetric Incidence Matrices of Projective Planes. 179-188 1995 6 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc6.html#DeyH95 2004-02-05 Giuseppe Tallini (1930--1995). 237-245 1996 9 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#Ceccherini96 2004-02-05 New Constructions of Disjoint Distinct Difference Sets. 157-165 1998 15 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#ChenCK98 2004-07-26 Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes. 97-110 2002 26 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc26.html#BlundoMSW02 2004-02-05 On the Information Rate of Perfect Secret Sharing Schemes. 143-169 1995 6 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc6.html#Dijk95 2004-02-05 A Linear Construction of Secret Sharing Schemes. 161-201 1997 12 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc12.html#Dijk97 2004-02-05 Parallel Multiplication in using Polynomial Residue Arithmetic. 155-173 2000 20 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc20.html#HalbutogullariK00 2004-02-05 An Exponent Bound on Skew Hadamard Abelian Difference Sets. 313-317 1994 4 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#ChenXS94 2004-02-27 Designs and Codes: An update. 7-27 1996 9 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#AssmusK96 2004-02-05 Relating Differential Distribution Tables to Other Properties of of Substitution Boxes. 45-63 2000 19 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc19.html#ZhangZI00 2004-02-05 On the Internal Nuclei of Sets in is Odd. 37-42 2001 24 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#Kovacs01 2004-02-05 A Correction to "Incidence Matrices and Collineations of Finite Projective Planes" by Chat Yin Ho, Designs, Codes and Cryptography, 18 (1999). 91-93 2002 25 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc25.html#BrozovicHM02 2004-09-07 Tight Bounds on the Information Rate of Secret Sharing Schemes. 107-122 1997 11 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc11.html#BlundoSSV97 http://dx.doi.org/10.1023/A:1008216403325 2004-02-05 On Linear Goethals Codes and Kloosterman Sums. 269-288 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#HellesethZ99 2004-02-05 On Sparse Parity Check Matrices. 107-130 1997 12 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc12.html#LefmannPS97 2004-02-05 Constructions of Large Translation Nets with Nonabelian Translation Groups. 219-236 1991 1 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#Hachenberger91 2004-02-05 On Completely Free Elements in Finite Fields. 129-143 1994 4 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#Hachenberger94 2004-02-05 Groups Admitting a Kantor Family and a Factorized Normal Subgroup. 135-143 1996 8 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#Hachenberger96 2004-02-05 A Steiner 5-Design on 36 Points. 181-186 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#BettenLW99 2004-02-05 Orthogonal Designs and Type II Codes over Z2k. 163-174 2002 25 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc25.html#GeorgiouHK02 2004-02-05 A General Zero-Knowledge Scheme. 13-37 1997 12 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc12.html#BurmesterDPW97 2004-02-05 The New Minimum Distance Bounds of Goppa Codes and Their Decoding. 157-176 1996 9 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#ParkFT96 2004-02-05 Binomial Moments of the Distance Distribution and the Probability of Undetected Error. 103-116 1999 16 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#BargA99 2004-02-05 Affine Invariant and Cyclic Codes over -adic Numbers and Finite Rings. 343-370 2001 23 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#Abdukhalikov01 2004-02-05 The Extended Euclidian Algorithm on Polynomials, and the Computational Efficiency of Hyperelliptic Cryptosystems. 53-74 2001 23 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#Enge01 2005-02-17 Quaternary Constructions for the Binary Single-Error-Correcting Codes of Julin, Best and Others. 31-42 1994 4 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#ConwayS94 2004-02-05 <i>n</i>-Transitive Sets of Permutations or of Mappings. 275-297 1991 1 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#Pasini91 2004-02-05 Constructions of Nested Partial Difference Sets with Galois Rings. 299-309 2002 25 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc25.html#Polhill02 2004-02-05 Two-Transitive Parallelisms. 179-189 2001 22 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#Johnson01 2004-02-05 A General Polynomial Sieve. 149-157 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#GaoH99 2004-02-05 Optimal Normal Bases. 315-323 1992 2 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#GaoL92 2004-02-05 The Newton Polygon of Plane Curves with Many Rational Points. 41-67 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#BeelenP00 2004-02-05 On Sequences with Zero Autocorrelation. 327-340 1994 4 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#KoukouvinosKSYY94 2004-02-05 Discrete Logarithms: The Past and the Future. 129-145 2000 19 Des. Codes Cryptography 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc19.html#Odlyzko00 2004-02-05 Hadamard Matrices and Dihedral Groups. 71-77 1996 9 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#Kimura96 2004-02-05 Successive Minimization of the State Complexity of the Self-dual Lattices Using Korkin-Zolotarev Reduced Basis. 145-158 2001 24 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#KhandaniE01 2004-02-05 The Translation Planes of Order 49. 57-72 1995 5 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc5.html#MathonR95 2004-02-05 Partitioning Sets of Triples into Small Planes. 119-130 2002 27 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc27.html#MathonS02 2004-02-05 Unitals and Unitary Polarities in Symmetric Designs. 237-250 1997 10 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#MathonT97 2004-02-05 Directed-Packings and Directed -Steiner Systems. 187-198 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#MathonT99 2004-02-05 A Formal Language for Cryptographic Protocol Requirements. 27-59 1996 7 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc7.html#SyversonM96 2004-02-05 Note on a Question by S. Bagchi and B. Bagchi. 395 1992 2 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#Schmidt92 2004-02-05 Williamson Matrices and a Conjecture of Ito's. 61-68 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#Schmidt99 2004-02-05 The Theory of Cyclic Codes and a Generalization to Additive Codes. 189-206 2002 25 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc25.html#Bierbrauer02 2004-02-05 Universal Hashing and Geometric Codes. 207-221 1997 11 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc11.html#Bierbrauer97 2004-02-05 An Extension Theorem for Linear Codes. 151-157 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#Hill99 2004-02-05 A Characterization of Association Schemes from Affine Spaces. 83-86 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#Dam00 2004-02-05 Classifications of Spreads of PG(3, 4) \ PG(3, 2). 193-198 1993 3 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#Dam93 2004-02-05 On the Incidence Matrix of the Ree Unital. 57-62 1997 10 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#Hiss97 2005-09-13 Single Change Covering Designs. 9-19 1993 3 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#WallisYZ93 2004-06-01 n Group-Divisible Designs with Block Size Four and Group-Type gum1. 5-24 2002 27 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc27.html#GeR02 2004-02-05 elf-Complementary Balanced Codes and Quasi-Symmetric Designs. 271-279 2002 27 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc27.html#FuW02 2004-02-05 Bent Functions, Partial Difference Sets, and Quasi-Frobenius Local Rings. 251-268 2000 20 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc20.html#Hou00 2004-02-05 On Binary Resilient Functions. 93-112 2003 28 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc28.html#Hou03 2004-02-05 Some Inequalities about the Covering Radius of Reed-Muller Codes. 215-224 1992 2 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#Hou92 2004-02-05 Further Results on the Covering Radii of the Reed-Muller Codes. 167-177 1993 3 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#Hou93 2004-02-05 The Covering Radius of R(1, 9) in R(4, 9). 285-292 1996 8 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#Hou96 2004-02-05 The Reed-Muller Code R(1, 7) Is Normal. 75-82 1997 12 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc12.html#Hou97 2004-02-05 A Necessary and Sufficient Condition for the Existence of Some Ternary [n, k, d] Codes Meeting the Greismer Bound. 41-56 1997 10 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#Hamada97 2004-02-05 Some New Optimal Ternary Linear Codes. 5-11 1997 12 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc12.html#Boukliev97 2004-02-27 Hermitian Varieties as Codewords. 255-259 1991 1 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#Key91 2004-02-05 ^a^a^a-1)-Relative Difference Sets. 57-71 1995 6 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc6.html#MaS95 2004-02-05 A Family of Semi-Regular Divisible Difference Sets. 73-78 1997 11 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc11.html#MaS97 2004-02-05 Verifiable Partial Escrow of Integer Factors. 327-342 2001 24 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#Mao01 2005-07-26 The Fundamental Theorem of q-Clan Geometry. 181-202 1996 8 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#Payne96 2004-02-05 On the Composition of Matroids and Ideal Secret Sharing Schemes. 49-67 2001 24 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#NgW01 2004-02-05 On the Non-Existence of Certain Cameron-Liebler Line Classes in PG(3, q). 127-132 1998 14 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#BruenD98 2004-02-05 The Jamison Method in Galois Geometries. 199-205 1991 1 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#BruenF91 2004-02-05 Partitioning Quadrics, Symmetric Group Divisible Designs and Caps. 145-155 1997 10 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#BruenW97 2004-02-05 Long Binary Linear Codes and Large Caps in Projective Space. 37-60 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#BruenW99 2004-02-05 The Nonexistence of Ternary [38, 6, 23] Codes. 165-172 1998 13 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#HamadaE98 2004-02-05 Designs, Codes and Crypts - A Puzzle Altogether. 91-101 1996 8 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#Beth96a 2004-02-05 Special Issue Dedicated to Gustavus J. Simmons - Foreword to this issue. 7-9 1996 7 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc7.html#BethD96 2004-02-05 Design Machines: Algebraically Well Described Interconnection Networks. 287-298 1992 2 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#BethH92 2004-02-05 New Combinatorial Bounds for Authentication Codes and Key Predistribution Schemes. 87-100 1998 15 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#KurosawaOSS98 2004-02-05 Jaap Seidel 80. 7-10 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#Bruijn00 2004-02-05 Note on Periodic Complementary Sets of Binary Sequences. 251-256 1998 13 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#Dokovic98 2004-02-05 Difference Sets in Dihedral Groups. 333-338 1991 1 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#LeungMW91 2004-02-05 A Note on Geometric Structures of Linear Ordered Orthogonal Arrays and (T, M, S)-Nets of Low Strength. 257-263 2002 26 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc26.html#Fuji-HaraM02 2004-02-05 Construction of Cartesian Authentication Codes from Unitary Geometry. 333-356 1992 2 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#Wan92 2004-02-05 The Weight Hierarchies of the Projective Codes from Nondegenerate Quadrics. 283-300 1994 4 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#Wan94 2004-02-05 State Spaces of Convolutional Codes. 361-369 1997 10 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#Wan97 2004-02-05 Almost Desarguesian Maximal Partial Spreads. 283-304 2001 22 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#JhaJ01 2004-02-05 Transversal-Free Translation Nets. 195-205 2002 27 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc27.html#JhaJ02 2004-02-05 A Representation of a Family of Secret Sharing Matroids. 5-19 2003 30 Des. Codes Cryptography 1 http://dx.doi.org/10.1023/A:1024741108241 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc30.html#Ng03 2004-02-05 Cyclic Ostrom Spreads. 41-51 1999 16 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#JhaJ99 2004-02-05 Hiding Cliques for Cryptographic Security. 269-280 2000 20 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc20.html#JuelsP00 2004-02-05 Generalized Steiner Systems GS(2, 4, v, 2) with a Prime Power equiv 7 (mod 12). 69-80 2001 24 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#WuZ01 2004-02-05 A Combinatorial Construction for Perfect Deletion-Correcting Codes. 99-110 2001 23 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#Yin01 2004-02-05 Hermitian Codes as Generalized Reed-Solomon Codes. 5-17 1992 2 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#YaghoobianB92 2005-07-27 The Invariants of the Clifford Groups. 99-122 2001 24 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#NebeRS01 2004-02-27 Edward F. Assmus, Jr. (1931-1998). 7-11 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#KeyM99 2004-02-27 Codes of Steiner Triple and Quadruple Systems. 117-125 1993 3 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#KeyS93 2004-02-05 The Eigenspaces of the Bose-Mesner-Algebras of the Association Schemes corresponding to Projective Spaces and Polar Spaces. 129-150 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#Eisfeld99 2004-02-05 Some New 2-Resolvable Steiner Quadruple Systems. 5-10 1994 4 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#Teirlinck94 2004-02-05 Decoding Affine Variety Codes Using Gröbner Bases. 147-158 1998 13 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#FitzgeraldL98 2004-02-05 Trace Representation of Legendre Sequences. 343-348 2001 24 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#KimS01 2004-02-05 Difference Families. 291-304 2001 24 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#LamM01 2004-02-05 The Weight Distribution of C5(1, n). 181-191 2001 24 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#LamS01 2005-10-14 Doubly beta-Derived Translation Planes. 65-74 2003 28 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc28.html#AbatangeloL03 2004-02-05 A Perfect Threshold Secret Sharing Scheme to Identify Cheaters. 183-187 1995 5 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc5.html#Carpentieri95 2004-02-05 ^k). 57-69 1998 14 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#KocA98 2004-02-05 Ring-Valued Assignments to the Points of a t-Design. 255-262 2002 25 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc25.html#MartinezV02 2004-02-05 The Classification of Doubly Trabsitive Affine Designs. 207-217 1991 1 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#Pfaff91 2004-02-05 On the Binary Self-Dual Codes with an Automorphism of Order 2. 39-48 1997 12 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc12.html#Buyuklieva97 2004-05-24 Hyperplane Sections of Kantor's Unitary Ovoids. 185-196 2001 23 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#Cooperstein01 2004-02-05 Self-Witnessing Polynomial-Time Complexity and Prime Factorization. 231-235 1992 2 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#FellowsK92 2004-02-05 Difference Sets Corresponding to a Class of Symmetric Designs. 223-236 1997 10 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#MaS97a 2004-02-05 A Life's Work in Geometry: An Homage to Hanfried Lenz. 9-22 1996 8 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#JungnickelG96 2004-06-21 Editorial. 5-6 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#JungnickelL99 2004-02-05 A New Class of Symmetric (nu, k, lambda)-Designs. 319-325 1994 4 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#JungnickelP94 2004-02-05 Exponential Number of Quasi-Symmetric SDP Designs and Codes Meeting. 247-253 1991 1 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#JungnickelT91 2004-02-05 On Covering Designs with Block Size 5 and Index 5. 91-107 1995 5 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc5.html#Assaf95 2004-02-05 The Automorphism Groups of the Delsarte-Goethals Codes. 237-249 1993 3 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#Carlet93a 2004-02-05 An Alternate Characterization of the Bentness of Binary Functions, with Uniqueness. 133-140 1998 14 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#CarletG98 2004-02-05 Covering Sequences of Boolean Functions and Their Cryptographic Significance. 263-279 2002 25 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc25.html#CarletT02 2004-02-05 Self-Orthogonal Greedy Codes. 79-83 1996 9 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#Monroe96 2004-02-05 Explicit N-Polynomials of 2-Power Degree over Finite Fields, I. 107-116 1995 6 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc6.html#Meyn95 2004-02-05 Varieties of Quasigroups Arising from 2-Perfect m-Cycle Systems. 159-168 1992 2 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#Bryant92 2004-07-05 A Note on Certain 2-Groups with Hadamard Difference Sets. 75-80 2001 23 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#Iiams01 2004-02-05 A New Approach to the Main Conjecture on Algebraic-Geometric MDS Codes. 115-120 1996 9 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#Walker96 2004-02-05 On the Automorphisms of Order 2 with Fixed Points for the Extremal Self-Dual Codes of Length 24m. 5-13 2002 25 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc25.html#Bouyuklieva02 2004-02-05 Looking for Difference Sets in Groups with Dihedral Images. 45-50 2003 28 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc28.html#MooreP03 2004-02-05 Existence of New Extremal Doubly-Even Codes and Extremal Singly-Even Codes. 273-283 1996 8 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#Harada96 2004-02-05 ₄. 271-284 1998 13 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#Harada98 2004-02-05 Constructions and Properties of k out of n Visual Secret Sharing Schemes. 179-196 1997 11 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc11.html#VerheulT97 2004-02-05 Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers. 131-146 2001 23 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#HonkalaK01 2004-02-05 On the Automorphism Groups of Affine-Invariant Codes. 215-221 1996 7 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc7.html#Berger96 2004-02-05 Integer Factoring. 101-128 2000 19 Des. Codes Cryptography 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc19.html#Lenstra00 2004-02-05 Binary Codes of Strongly Regular Graphs. 187-209 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#HaemersPR99 2004-02-05 On The Correlation of Binary Sequences. 249-256 1999 16 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#FriedlanderLLS99 2004-02-05 Classifying Subspaces of Hamming Spaces. 297-305 2002 27 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc27.html#Ostergard02a 2004-02-05 A New Table of Binary/Ternary Mixed Covering Codes. 151-178 1997 11 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc11.html#OstergardH97 2004-02-05 Enumeration of 2-(9, 3, lambda) Designs and Their Resolutions. 131-137 2002 27 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc27.html#OstergardK02 2004-02-05 Constructing Covering Codes with Given Automorphisms. 65-73 1999 16 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#OstergardW99 2004-02-05 Lattice Attacks on Digital Signature Schemes. 283-290 2001 23 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#Howgrave-GrahamS01 2004-02-05 Homogeneous Bent Functions, Invariants, and Designs. 139-154 2002 26 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc26.html#CharnesRB02 2004-02-05 Minimum Distance Bounds for -Regular Codes. 181-187 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#Martin00 2004-02-05 Designs in Product Association Schemes. 271-289 1999 16 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#Martin99 2004-02-05 On the Nonexistence of q-ary Linear Codes of Dimension Five. 165-177 2001 22 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#Maruta01 2004-02-05 On the Achievement of the Griesmer Bound. 83-87 1997 12 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc12.html#Maruta97 2004-02-05 Caps and Colouring Steiner Triple Systems. 51-55 1998 13 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#BruenHW98 2005-05-24 Association Schemes Related to Kasami Codes and Kerdock Sets. 89-102 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#CaenD99 2004-02-05 Dickson Polynomials, Completely Normal Polynomials and the Cyclic Module Structure of Specific Extensions of Finite Fields. 193-202 1996 9 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#Scheerhorn96 2004-02-05 The State of Elliptic Curve Cryptography. 173-193 2000 19 Des. Codes Cryptography 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc19.html#KoblitzMV00 2004-02-05 On Large Sets of v-1 L-Intersecting Steiner Triple Systems of Order v. 243-256 2002 26 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc26.html#FranekGGR02 2004-02-05 New Linear Codes with Covering Radius 2 and Odd Basis. 29-39 1999 16 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#DavydovO99 2004-02-05 On Some Properties of the Shrinking Generator. 147-156 2001 23 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#Shparlinski01a 2004-02-05 On the Linear Complexity of the Naor-Reingold Pseudo-random Function from Elliptic Curves. 279-289 2001 24 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#ShparlinskiS01 2004-02-05 Semiregular Large Sets. 81-87 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#CusackM99 2004-02-05 _p²_p²_p². 167-172 1996 8 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#LeungM96 2004-02-05 Equiorthogonal Frequency Hypercubes: Preliminary Theory. 177-185 1998 13 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#Morgan98 2004-02-05 Linear Frameworks for Block Ciphers. 65-87 2001 22 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#DaemenKR01 2004-02-05 ⁴²⁴³²- 2q; q]-Codes Meeting the Griesmer Bound. 225-229 1992 2 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#HamadaHY92 2004-02-05 Partially-Bent Functions. 135-145 1993 3 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#Carlet93 2004-02-05 Spreads in Strongly Regular Graphs. 145-157 1996 8 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#HaemersT96 2004-02-05 On Perfect t-Shift Codes in Abelian Groups. 253-259 1995 5 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc5.html#Munemasa95 2004-02-05 How to Play M13? 243-247 1999 16 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#EgnerB99 2004-02-05 Large Sets of Mutually Almost Disjoint Steiner Triple Systems Not From Steiner Quadruple Systems. 59-67 1997 12 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc12.html#FranekRG97 2004-02-05 Automorphisms of Constant Weight Codes and of Divisible Designs. 89-97 2000 20 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc20.html#SchulzS00 2004-02-05 On Abelian Difference Set Codes. 263-271 1992 2 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#Pott92 2004-02-05 Computing Linear Codes and Unitals. 39-52 1998 14 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#JaffeT98 2004-02-05 Improvement of the Delsarte Bound for t-Designs When It Is Not the Best Bound Possible. 201-222 2003 28 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc28.html#NikovaN03 2004-02-05 ₄^m₂^2m. 73-88 2000 20 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc20.html#Wolfmann00 2004-02-05 Extension of Gravity Centers Configuration to Steiner Triple Systems. 203-214 1996 8 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#Pickert96 2004-02-05 Check Character Systems Using Chevalley Groups. 137-143 1997 10 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#BroeckerSS97 2004-02-05 Packing Arrays and Packing Designs. 165-176 2002 27 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc27.html#StevensM02 2004-02-05 On the Rigidity of Spherical t-Designs that Are Orbits of Finite Reflection Groups. 157-170 1994 4 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#Sali94 2004-07-19 A Proof of the Jungnickel-Tonchev Conjecture on Quasi-Multiple Quasi-Symmetric Designs. 291-296 2001 23 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#Sane01 2004-02-05 ^s) Which are Also Linear Cyclic Codes of Worklength sv oper GF(q). 183-189 1991 1 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#Leonard91 2004-02-05 Some Triple Block Intersection Numbers of Paley 2-Designs of QN-type. 35-52 2001 23 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#Raposa01 2004-02-05 Primitive Rank 3 Groups on Symmetric Designs. 191-207 2001 22 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#Dempwolff01 2004-02-05 Translation Planes of Order 27. 105-121 1994 4 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#Dempwolff94 2004-02-05 On the p-Ranks of Net Graphs 139-153 1995 5 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc5.html#Peeters95 2004-02-05 Maximal Weight Divisors of Projective Reed-Muller Codes. 43-47 2001 24 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#Boner01 2004-02-05 Spectral-Null Codes and Null Spaces of {Hadamard} Submatrices. 177-191 1996 9 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#Roth96 2004-02-05 Existence of Perfect 4-Deletion-Correcting Codes with Length Six. 145-156 2002 27 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc27.html#ShalabyWY02 2004-09-28 ^a^a^a, 1)-Difference Sets. 281-295 2002 27 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc27.html#HoradamU02 2004-02-05 Subsets of PG(n, 2) and Maximal Partial Spreads in PG(4, 2). 209-222 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#Shaw00 2004-02-05 <i>PG</i>(m, 2). 253-256 1992 2 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#Shaw92 2004-02-05 On the Existence and Construction of Tight Fourth Order Quadrature Rules for the Sphere. 159-169 2001 24 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#Blunck01 2005-06-06 Perfect Baer Subplane Partitions and Three-Dimensional Flag-Transitive Planes. 19-39 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#BakerDEW00 2004-02-05 On Perfect Codes: Rank and Kernel. 183-194 2002 27 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc27.html#PhelpsV02a 2004-02-05 On the Construction of Perfect Deletion-Correcting Codes Using Design Theory. 5-20 1995 6 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc6.html#Bours95 2004-02-05 Some t-Homogeneous Sets of Permutations. 29-38 1996 9 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#BierbrauerBE96 2004-02-05 Characterizations of Translation Generalized Quadrangles. 249-258 2001 23 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#Thas01 2004-02-05 A Theorem Concerning Nets Arising from Generalized Quadrangles with a Regular Point. 247-253 2002 25 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc25.html#Thas02 2004-02-05 k-Arcs, Hyperovals, Partial Flocks and Flocks. 95-104 1996 9 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#Thas96 2004-02-05 A Technique for Constructing Symmetric Designs. 147-158 1998 14 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#Ionin98 2004-02-05 Building Symmetric Designs With Building Sets. 159-175 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#Ionin99 2004-02-05 Dimensional Linear Spaces Whose Automophism Groups is (Line, Hyperplane)-Flag Transitive. 237-245 1991 1 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#Delandtsheer91 2004-02-05 The Search for Pseudo Orthogonal Latin Squares of Order Six. 77-82 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#BussemakerHS00 2004-02-05 A Difference Set in. 317-324 2001 23 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#ArasuC01 2004-02-05 ^f), f odd: A Series of Cryptocodes. 141-148 1991 1 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#BierbrauerT91a 2004-02-05 Abelian Difference Sets Without Self-conjugacy. 223-230 1998 15 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#ArasuM98 2004-02-05 A New Family of Cyclic Difference Sets with Singer Parameters in Characteristic Three. 75-91 2003 28 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc28.html#ArasuP03 2004-02-05 On Quasiregular Collineation Groups of Projective Planes. 83-92 1991 1 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#ArasuP91 2004-02-05 Impossibility of a Certain Cyclotomic Equation with Applications to Difference Sets. 23-27 1996 8 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#ArasuP96 2004-02-05 Difference Sets in {Abelian} Groups of p-Rank Two. 5-12 1995 5 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc5.html#ArasuS95 2004-02-05 Answering a Question of Pott on Almost Perfect Sequences. 7-10 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#ArasuV99 2004-02-05 On the Existence of Periodic Complementary Binary Sequences. 257-262 1992 2 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#ArasuX92 2004-08-19 Generalized Hadamard Matrices. 69-73 1997 12 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc12.html#Hayden97 2004-02-05 An Optimal Ternary [69, 5, 45] Code and Related Codes. 271-282 1994 4 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#EupenH94 2004-02-05 Classification of Some Optimal Ternary Linear Codes of Small Length. 63-84 1997 10 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#EupenL97 2004-02-05 Pencils of Hyperconics in Projective Planes of Characteristic Two. 65-71 2000 20 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc20.html#McQuillan00 2004-02-05 New Families of Semi-Regular Relative Difference Sets. 131-146 1998 13 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#DavisJM98 2004-02-05 Trellis Structure and Higher Weights of Extremal Self-Dual Codes. 15-36 2001 24 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#ChenC01 2004-02-05 Weight Hierarchies of Linear Codes Satisfying the Chain Condition. 47-66 1998 15 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#ChenK98 2004-02-05 Existence of Difference Families with a Prime Power. 167-173 1998 15 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#ChenZ98 2004-02-05 On the Classification of Geometric Codes by Polynomial Functions. 189-204 1995 6 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc6.html#GlynnH95 2004-02-05 Authentication Codes in Plaintext and Chosen-Content Attacks. 83-99 1996 7 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc7.html#Safavi-NainiT96 2005-05-24 A Local Approach to 1-Homogeneous Graphs. 127-147 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#JurivsicK00 2004-02-05 The Lower bound of the Quadratic Spans of DeBruijn Sequences. 29-32 1993 3 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#Khachatrian93 2004-02-05 Combinatorial Classification of Optimal Authentication Codes with Arbitration. 281-305 2000 20 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc20.html#ObanaK00 2004-02-05 Bounds and Combinatorial Structure of Multi-Receiver-Codes. 47-63 2001 22 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#ObanaK01 2004-07-15 Constructions of Partial Difference Sets and Relative Difference Sets Using Galois Rings. 215-227 1996 8 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#Ray-ChaudhuriX96 2004-02-05 The Nonexistence of a [207, 4, 165] Code over GF(5). 139-148 2001 22 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#Ward01 2004-02-05 An Introduction to Divisible Codes. 73-79 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#Ward99 2004-02-05 Key-Exchange in Real Quadratic Congruence Function Fields. 153-174 1996 7 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc7.html#ScheidlerSW96 2004-02-05 Modular Arithmetic on Elements of Small Norm in Quadratic Fields. 111-117 2002 27 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc27.html#JacobsonW02 2004-02-05 On Weaknesses of Non-surjective Round Functions. 253-266 1997 12 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc12.html#RijmenPW97 2004-02-05 On the Linear Complexity of the Power Generator. 5-10 2001 23 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#Shparlinski01 2004-02-05 A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem. 229-241 2002 26 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc26.html#DrmotaP02 2004-02-05 Codes from Affine Permutation Groups. 183-186 1998 15 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#Kaikkonen98 2004-02-05 ^s-ary Cyclic Code. 171-175 1994 4 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#Seguin94 2005-07-26 Desarguesian Finite Generalized Quadrangles are Classical or Dual Classical. 299-305 1991 1 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#MaldeghemPT91 2004-02-05 Perfect Mendelsohn Packing Designs with Block Size Five. 5-22 1998 14 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#BennettYZA98 2004-02-05 On Perfect Codes and Related Concepts. 221-237 2001 22 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#AhlswedeAK01 2004-02-05 A Construction for Multisecret Threshold Schemes. 287-303 1996 9 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#JacksonMO96 2004-02-05 On the Security of Digital Signature Schemes Based on Error-Correcting Codes. 187-199 2003 28 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc28.html#XuDT03 2004-02-05 On the Binary Codes of Steiner Triple Systems. 29-43 1996 8 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#BaartmansLT96 2004-02-05 The Existence of Extremal Self-Dual [50, 25, 10] Codes and Quasi-Symmetric 2-(49, 9, 6) Designs. 97-106 1995 6 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc6.html#HuffmanT95 2004-02-05 Minihypers and Linear Codes Meeting the Griesmer Bound: Improvements to Results of Hamada, Helleseth and Maekawa. 143-162 2002 25 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc25.html#FerretS02 2004-02-05 On Sylow Subgroups of Abelian Affine Difference Sets. 157-163 2001 22 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#Dizon-GarcianoH01 2004-02-05 Signed Hypergraph Designs and Diagonal Forms for Some Incidence Matrices. 289-297 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#Wilson99 2004-02-05 McEliece Public Key Cryptosystems Using Algebraic-Geometric Codes. 293-307 1996 8 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#JanwaM96 2004-02-05 Some Upper Bounds on the Covering Radii of Linear Codes Over and Their Applications. 163-181 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#JanwaM99 2004-02-05 Two New Bounds on the Size of Binary Codes with a Minimum Distance of Three. 219-227 1995 6 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc6.html#KleinLV95 2004-02-05 Perfect Factors in the de Bruijn Graph. 115-138 1995 5 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc5.html#Paterson95 2004-02-05 Root Counting, the DFT and the Linear Complexity of Nonlinear Filtering. 247-259 1998 14 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#Paterson98 2004-02-27 ^n-2^*Geometries of Order 2. 317-330 1996 9 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#HuybrechtsP96 2004-02-05 Special Issue: Selected Areas in Cryptography - Introduction. 213 1997 12 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc12.html#KranakisO97 2004-02-05 Stories about Groups and Sequences. 109-133 1996 8 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#Cameron96 2004-02-05 Binary Optimal Odd Formally Self-Dual Codes. 11-22 2001 23 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#BetsumiyaH01 2004-02-05 Maximally Nonlinear Functions and Bent Functions. 211-218 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#Xiang99 2004-02-05 The Diffie-Hellman Protocol. 147-171 2000 19 Des. Codes Cryptography 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc19.html#MaurerW00 2004-02-05 A Note on Products of Relative Difference Sets. 117-119 1991 1 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#Davis91 2004-02-05 A Non-interactive Public-Key Distribution System. 305-316 1996 9 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#MaurerY96 2004-02-05 Epimorphisms of Generalized Polygons Part 1: Geometrical Characterizations. 99-111 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#GramlichM00 2004-02-05 Existence of Perfect 3-Deletion-Correcting Codes. 81-87 1998 14 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#Mahmoodi98 2004-02-05 Authentication and Authenticated Key Exchanges. 107-125 1992 2 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#DiffieOW92 2004-02-05 Stickelberger Codes. 203-213 1996 9 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#Shokrollahi96 2004-02-05 Bijections Between Group Rings Preserving Character Sums. 243-254 2001 24 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#HagitaS01 2004-02-05 There Exists a Simple Non Trivial t-design with an Arbitrarily Large Automorphism Group for Every t. 215-219 2001 22 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#Sebille01 2004-02-05 Pairwise Balanced Designs with Consecutive Block Sizes. 203-222 1997 10 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#LingZCM97 2004-02-05 On 2-Level Secret Sharing. 127-134 1993 3 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#BeutelspacherW93 2004-02-05 Complete Systems of Lines on a Hermitian Surface over a Finite Field. 253-268 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#EbertH99 2004-07-15 The Structure of 1-Generator Quasi-Twisted Codes and New Linear Codes. 313-326 2001 24 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#AydinSR01 2004-02-05 The Explicit Construction of Irreducible Polynomials over Finite Fields. 169-174 1992 2 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#Cohen92 2004-02-05 The Length of Primitive BCH Codes with Minimal Covering Radius. 5-16 1997 10 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#Cohen97 2004-02-05 Lower Bounds for Transversal Covers. 279-299 1998 15 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#StevensMM98 2004-02-05 On the Enumeration and Generation of Nonweight Equivalent Rate ½ Convolutional Codes. 17-27 1997 10 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#Conan97 2004-02-05 A New Proof of the Assmus-Mattson Theorem for Non-Binary Codes. 149-155 2001 22 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#Tanabe01 2004-02-05 Sets of Type (m, n) in the Affine and Projective Planes of Order Nine. 229-245 1995 6 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc6.html#PenttilaR95 2004-02-05 Directed Packings with Block Size 5 and Even v. 133-142 1995 6 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc6.html#ShalabyY95 2004-02-05 Nested Optimal -Packings and -Coverings of Pairs with Triples. 271-278 1998 15 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#ShalabyY98 2004-02-05 Bounds and Characterizations of Authentication/Secrecy Schemes. 107-129 1998 13 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#CasseMW98 2004-02-05 Correlation-Immune and Resilient Functions Over a Finite Alphabet and Their Applications in Cryptography. 121-149 1999 16 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#CamionC99 2004-02-05 On the Rank of Truncated Incidence Matrices of Linear Spaces. 307-313 1992 2 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#MeloneO92 2004-02-05 Two Remarks on Blocking Sets and Nuclei in Planes of Prime Order. 29-39 1997 10 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#GacsSS97 2004-02-05 Geometric Secret Sharing Schemes and Their Duals. 83-95 1994 4 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#JacksonM94 2004-02-05 Perfect Secret Sharing Schemes on Five Participants. 267-286 1996 9 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#JacksonM96 2004-02-05 Relations between Two Perfect Ternary Sequence Constructions. 325-332 1992 2 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#JacksonW92 2004-02-05 On GMW Designs and Cyclic Hadamard Designs. 185-191 1997 10 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#JacksonW97 2005-01-27 _i=1 kan k>2. 261-266 1991 1 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#Lambeck91 2004-02-05 On Harmonic Weight Enumerators of Binary Codes. 11-28 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#Bachoc99 2004-02-05 Two New Infinite Families of 3-Designs from Kerdock Codes over Z. 201-214 1998 15 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#YangH98 2004-02-05 New Colored Visual Secret Sharing Schemes. 325-336 2000 20 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc20.html#YangL00 2004-02-05 Parity Encoding of Binary Sequences. 157-164 2002 27 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc27.html#Simmons02 2004-02-05 An Upper Bound on the Number of Iterations for Transforming a Boolean Function of Degree Greater or Equal Than 4 to a Function of Degree 3. 305-312 2001 24 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#Tapia-RecillasV01 2004-02-05 Reducing the Elliptic Curve Cryptosystem of Meyer-Müuller to the Cryptosystem of Rabin-Williams. 53-56 1998 14 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#JoyeQ98 2004-02-05 Weight Enumerators of Double Circulant Codes and New Extremal Self-Dual Codes. 141-150 1997 11 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc11.html#GulliverH97a 2006-03-06 Analysis of the Xedni Calculus Attack. 1-64 2000 20 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc20.html#JacobsonKSST00 2004-02-05 Flag-Transitive Affine Planes of Order 64. 217-221 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#Prince99 2004-02-05 Constant Weight Codes and Group Divisible Designs. 11-27 1999 16 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#Blake-WilsonP99 2004-02-05 Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem. 61-81 1996 7 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc7.html#NybergR96 2004-02-05 Large Families of Cospectral Graphs. 205-208 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#Seress00 2004-02-05 All Lambda-Designs With are Type-1. 5-17 2001 22 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#Seress01 2004-02-05 Combinatorial Characterizations of Authentication Codes II. 239-259 1996 7 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc7.html#ReesS96 2004-02-05 On 1-Blocking Sets in PG(n, q), n >= 3. 235-251 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#StormeW00 2004-02-05 Subsquares in Orthogonal Latin Squares as Subspaces in Affine Geometries: A Generalization of an Equivalence of Bose. 21-28 1993 3 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#Laywine93 2004-02-05 The Universal Embedding Dimension of the Near Polygon on the 1-Factors of a Complete Graph. 299-303 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#BlokhuisB99 2004-07-19 Quasi-Symmetric Designs and the Smith Normal Form. 189-206 1992 2 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#BlokhuisC92 2004-02-05 Preface. 5 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#BlokhuisH00 2004-02-05 On the Size of a Maximal Partial Spread. 187-191 1993 3 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#BlokhuisM93 2004-02-05 Another Proof of Kasami's Theorem. 177-180 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#Dobbertin99 2004-02-05 On Quasi-Symmetric Designs. 69-79 1992 2 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#Bagchi92 2004-02-05 Subcodes of the Projective Generalized Reed-Muller Codes Spanned by Minimum-Weight Vectors. 197-211 2002 26 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc26.html#DingK02 2004-02-05 On String Replacement Exponentiation. 173-184 2001 23 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#OConnor01 2004-02-05 On Cyclic Caps in Projective Spaces. 327-332 1996 8 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#Szonyi96 2004-02-05 An Inequality on the Coding Gain of Densest Lattice Packings in Successive Dimensions. 207-212 1998 14 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#BanihashemiK98 2004-02-05 Construction of Weighing Matrices (17, 9) Having the Intersection Number 8. 259-269 1998 15 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#OhmoriM98 2004-02-05 Special Issue Dedicated to Hanfried Lenz - Preface. 7 1996 8 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#Jungnickel96 2004-02-05 Special Issue #2 Dedicated to Hanfried Lenz - Preface. 107 1997 10 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#Jungnickel97 2004-02-05 Some Estimates for Character Sums and Applications. 123-131 2001 22 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#Winterhof01 2004-02-05 Polynomial Interpolation of the Discrete Logarithm. 63-72 2002 25 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc25.html#Winterhof02 2004-02-05 A 2-(22, 8, 4) Design Cannot Have a 2-(10, 4, 4) Subdesign. 257-260 2002 27 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc27.html#Ostergard02 2004-02-05 Binary Quasi-Cyclic Goppa Codes. 107-124 2000 20 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc20.html#BommierB00 2004-02-05 New Constructions of Covering Codes. 305-316 2001 22 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#Davydov01 2004-02-05 Orthogonal Partitions in Designed Experiments. 45-77 1996 8 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#Bailey96 2004-02-05 Linear Key Predistribution Schemes. 281-298 2002 25 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc25.html#PadroGMM02 2004-02-05 Some Multiply Derived Translation Planes with SL(2, 5) as an Inherited Collineation Group in the Translation Complement. 109-114 1997 10 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#BonisoliKS97 2004-02-05 On Resolvable Difference Families. 11-23 1997 11 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc11.html#Buratti97a 2004-02-05 ^m-ary Cyclic Codes with Cyclic q-ary Image Are Known. 81-98 2001 23 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#MouahaS01 2004-02-05 Perfect Cayley Designs as Generalizations of Perfect Mendelsohn Designs. 233-248 2001 23 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#BurattiZ01 2004-02-05 MD2 Is not Secure without the Checksum Byte. 245-251 1997 12 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc12.html#RogierC97 2004-02-05 How to Choose Secret Parameters for RSA-Type Cryptosystems over Elliptic Curves. 297-316 2001 23 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#JoyeQT01 2004-02-05 New Good Rage (m-1)/pm Ternary and Quaternary Quasi-Cyclic Codes. 223-233 1996 7 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc7.html#GulliverB96 2004-02-05 Codes over and Improvements to the Bounds on Ternary Linear Codes. 89-96 2001 22 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#GulliverH01 2004-02-05 Classification of Extremal Double Circulant Formally Self-Dual Even Codes. 23-35 1997 11 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc11.html#GulliverH97 2004-02-05 Classification of Extremal Double Circulant Self-Dual Codes of Lengths 64 to 72. 257-269 1998 13 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#GulliverH98 2004-02-05 Optimal Ternary Linear Rate 1/2 Codes. 167-172 2001 23 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#GulliverS01 2004-02-05 Spherical Designs and Generalized Sum-Free Sets in Abelian Groups. 11-18 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#Bajnok00 2004-02-05 Some Constructions for Key Distribution Patterns. 177-191 1994 4 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#Quinn94 2004-02-05 Veronese Varieties Over Finite Fields and Their Projections. 19-32 2001 22 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#CossidenteLS01 2004-02-05 On Quasi-Symmetric 2-(28, 12, 11) and 2-(36, 16, 12) Designs. 43-55 1995 5 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc5.html#LamTT95 2004-02-05 A Bruen Chain for q = 19. 307-312 1994 4 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#BakerE94 2004-02-05 Regulus-free Spreads of PG(3, q). 79-89 1996 8 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#BakerE96 2004-02-05 Cyclic Designs with Block Size 4 and Related Optimal Optical Orthogonal Codes. 111-125 2002 26 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc26.html#Buratti02 2004-02-05 A Powerful Method for Constructing Difference Families and Optimal Optical Orthogonal Codes. 13-25 1995 5 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc5.html#Buratti95 2004-02-05 _k+ G, k, 1) Difference Family. 5-9 1997 11 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc11.html#Buratti97 2004-02-05 Some and BIBD Constructions. 117-120 1999 16 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#Buratti99 2004-06-21 Existence Results for Generalized Balanced Tournament Designs with Block Size 3. 33-61 1993 3 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#Lamken93 2004-06-21 The Existence of Partitioned Generalized Balanced Tournament Designs with Block Size 3. 37-71 1997 11 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc11.html#Lamken97 2005-10-14 Cubic Arcs in Cubic Nets. 99-104 1993 3 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#MavronW93 2004-02-05 On Complete Arcs Arising from Plane Curves. 237-246 2002 25 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc25.html#GiuliettiPTU02 2004-02-05 New Constructions for De Bruijn Tori. 47-56 1995 6 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc6.html#HurlbertI95 2004-02-05 Lower Bounds on the State Complexity of Geometric Goppa Codes. 95-115 2002 25 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc25.html#BlackmoreN02 2004-02-05 Something About All or Nothing (Transforms). 133-138 2001 22 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#Stinson01 2004-02-05 Combinatorial Characterizations of Authentication Codes. 175-187 1992 2 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#Stinson92 2004-02-05 Universal Hashing and Authentication Codes. 369-380 1994 4 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#Stinson94 2004-02-05 On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption. 215-243 1997 12 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc12.html#Stinson97 2004-02-05 On Row-Cyclic Codes with Algebraic Structure. 145-155 1994 4 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#Sabin94 2004-02-05 Large Caps in Small Spaces. 197-212 2001 23 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#EdelB01 2004-02-05 41 is the Largest Size of a Cap in PG(4, 4). 151-160 1999 16 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#EdelB99 2004-02-05 Bruck Nets, Codes, and Characters of Loops. 7-29 1991 1 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#Moorhouse91 2004-02-05 On Unitals with Many Baer Sublines. 237-252 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#BallBO99 2004-02-05 Cocyclic Codes of Length 40. 171-179 2001 24 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#Baliga01 2004-02-05 On a Particular Class of Minihypers and Its Applications. I. The Result for General varrho. 51-63 2003 28 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc28.html#GovaertsS03 2004-02-05 On the Minimum Distances of Non-Binary Cyclic Codes. 81-85 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#CharpinTZ99 2004-02-05 _ⁿ. 333-345 1993 3 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#GeiselmannG93 2004-02-05 A New Family of Ternary Sequences with Ideal Two-level Autocorrelation Function. 157-166 2001 23 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#HellesethKM01 2004-02-05 Bounds on the Sizes of Constant Weight Covering Codes. 217-239 1995 5 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc5.html#EtzionWZ95 2004-09-27 Codes with the Same Weight Distributions as the Goethals Codes and the Delsarte-Goethals Codes. 257-266 1996 9 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#HellesethKS96 2004-02-05 An Infinite Family of 3-Designs from Preparata Codes over Z. 175-181 1998 15 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#HellesethKY98 2004-02-05 Some Characterizations of Quasi-Symmetric Designs with a Spread. 155-166 1993 3 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#SaneS93 2004-02-05 Locally Paley Graphs. 69-76 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#Brouwer00 2004-02-05 The Existence of a Bush-Type Hadamard Matrix of Order 324 and Two New Infinite Classes of Symmetric Designs. 225-232 2001 24 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#JankoKT01 2004-02-05 Quasideterminant Characterization of MDS Group Codes over Abelian Groups. 313-330 1998 13 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#ZainR98 2004-02-05 Minimal Blocking Sets in Projective Spaces of Square Order. 131-144 2001 24 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#Bokler01 2004-02-05 An Enumeration of Binary Self-Dual Codes of Length 32. 61-86 2002 26 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc26.html#BilousR02 2004-02-05 Resistance of a CAST-Like Encryption Algorithm to Linear and Differential Cryptanalysis. 267-282 1997 12 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc12.html#LeeHT97 2004-02-05 On the Use of RSA as a Secret Key Cryptosystem. 317-329 2001 22 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#Brincat01 2004-02-05 Simple 8-Designs with Small Parameters. 5-27 1998 15 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#BettenKLW98 2004-02-05 Triads, Flocks of Conics and Q. 63-70 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#BrownOP99 2004-02-05 Severely Denting the Gabidulin Version of the McEliece Public Key Cryptosystem. 37-45 1995 6 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc6.html#Gibson95 2004-02-05 Upper and Lower Bounds on Maximum Nonlinearity of n-input m-output Boolean Function. 23-34 2001 23 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#WadayamaHWK01 2004-02-05 Weierstrass Pairs and Minimum Distance of Goppa Codes. 107-121 2001 22 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#Matthews01 2004-07-22 Split Weight Enumerators for the Preparata Codes with Applications to Designs. 103-124 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#DuursmaHRY99 2005-10-14 Quasi-Symmetric Designs with Good Blocks and Intersection Number One. 147-162 2003 28 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc28.html#MavronMS03 2004-02-05 An Approximate Distribution for the Maximum Order Complexity. 325-339 1997 10 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#ErdmannM97 2004-02-05 Covering Arrays of Strength Three. 235-242 1999 16 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#ChateauneufCK99 2004-02-05 An Efficient Protocol for Authenticated Key Agreement. 119-134 2003 28 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc28.html#LawMQSV03 2004-02-05 Some Observations on Quasi-3 Designs and Hadamard Matrices. 55-61 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#BroughtonM99 2004-02-05 A Signature Scheme Based on the Intractability of Computing Roots. 223-236 2002 25 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc25.html#BiehlBHM02 2004-02-05 On the [28, 7, 12] Binary Self-Complementary Codes and Their Residuals. 57-67 1994 4 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#DodunekovEK94 2004-02-05 Nonexistence of Certain Symmetrical Spherical Codes. 69-74 1993 3 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#Boyvalenkov93 2004-02-05 Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels. 15-61 2002 25 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc25.html#EisenS02 2004-07-15 Maximal Three-Independent Subsets of {0, 1, 2}. 203-211 1994 4 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#CalderbankF94 2004-07-15 ³⁷, 12) Code via Galois Rings. 157-165 1997 10 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#CalderbankM97 2005-07-26 Modular and p-adic Cyclic Codes. 21-35 1995 6 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc6.html#CalderbankS95 2004-02-05 Special Issue Containing Papers Presented at the Second Upper Michigan Combinatorics Workshop on Designs, Codes and Geometries - Preface. 5-6 1996 9 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#Tonchev96 2004-02-05 Linear Perfect Codes and a Characterization of the Classical Designs. 121-128 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#Tonchev99 2004-02-05 Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions. 131-160 1997 12 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc12.html#Levenshtein97 2004-02-05 Error-Correcting Codes over an Alphabet of Four Elements. 333-342 2001 23 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#BogdanovaBKO01 2004-02-05 Characterizing the Hermitian and Ree Unitals on 28 Points. 57-61 1998 13 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#McGuireTW98 2004-02-05 A New NP-Complete Problem and Public-Key Identification. 5-31 2003 28 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc28.html#PointchevalP03 2004-02-05 Covering Radius and Dual Distance. 31-46 1991 1 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#Tietavainen91 2004-02-05 Constructions of Group Divisible Designs. 309-318 1996 8 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#Landgev96 2004-02-05 A Public-Key Cryptosystem Utilizing Cyclotomic Fields. 117-131 1995 6 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc6.html#ScheidlerW95 2004-02-05 On Isomorphisms between Coxeter Groups. 189-189 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#Muhlherr00 2004-02-05 Redundant Integer Representations and Fast Exponentiation. 135-151 1996 7 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc7.html#GollmannHM96 2004-02-05 The Nonexistence of Some Optimal Ternary Codes of Dimension Five. 245-258 1998 15 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#Landjev98 2004-02-05 Nets and Their Codes. 315-331 1993 3 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#Dougherty93 2004-02-05 A Coding Theoretic Solution to the 36 Officer Problem. 123-128 1994 4 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#Dougherty94 2004-02-05 The Xedni Calculus and the Elliptic Curve Discrete Logarithm Problem. 5-40 2000 20 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc20.html#Silverman00 2004-06-21 The Existence of Kirkman Squares-Doubly Resolvable (v, 3, 1)-BIBDs. 169-196 2002 26 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc26.html#ColbournLLM02 2004-02-05 Normal Rational Curves over Prime Fields. 89-96 1997 12 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc12.html#Storme97 2004-02-05 Concerning Multiplier Automorphisms of Cyclic Steiner Triple Systems. 237-251 1992 2 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#ColbournMPT92 2004-07-19 Singly-Even Self-Dual Codes of Length 40. 131-141 1996 9 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#BuyuklievaY96 2004-02-05 Characterization of Linear Structures. 33-45 2001 22 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#Dubuc01 2004-02-05 On the Distance Distributions of BCH Codes and Their Duals. 223-232 2001 23 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#KrasikovL01 2005-03-17 <i>d</i>-Homogeneous Functions. 199-213 2004 33 Des. Codes Cryptography 3 http://www.springerlink.com/index/10.1023/B:DESI.0000036246.52472.81 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc33.html#No04 2004-02-05 Bounds on Spectra of Codes with Known Dual Distance. 285-297 1998 13 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#KrasikovL98 2004-02-05 Hash Functions and Cayley Graphs. 381-394 1994 4 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#Zemor94 2004-02-05 Planar Functions and Planes of Lenz-Barlotti Class II. 167-184 1997 10 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#CoulterM97 2004-02-05 Thwarts in Transversal Designs. 189-197 1995 5 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc5.html#ColbournDW95 2004-02-05 The Spectrum of Maximal Partial Steiner Triple Systems. 209-219 1993 3 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#ColbournRZ93 2004-02-05 Preface: In Honour of Ronald C. Mullin. 5-6 2002 26 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc26.html#ColbournSR02 2004-02-05 Partial-Spreads in. 199-216 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#MetschS99 2004-02-05 Fractal Properties of the Singular Function s(u). 133-139 1991 1 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#Peterson91 2004-06-21 On Perfect Ternary Constant Weight Codes. 231-234 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#LintT99 2004-02-05 Construction of Extremal Type II Codes over Z. 257-269 1999 16 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#GaboritH99 2005-02-16 On the Number of Representations of Matroids over Finite Fields. 215-226 1996 9 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#Skorobogatov96 2004-02-05 Complete Variable-Length ``Fix-Free'' Codes. 109-114 1995 5 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc5.html#GillmanR95 2004-02-05 On the Characterization of Linear Uniquely Decodable Codes. 87-96 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#CohenRTZ99 2004-02-05 A Note on the Nonexistence of Barker Sequences. 93-97 1992 2 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#JedwabL92 2004-02-05 Constructing c-ary Perfect Factors. 341-368 1994 4 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#Mitchell94 2004-07-15 New Linear Codes Over and and Improvements on Bounds. 223-233 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#SiapR00 2004-02-05 Codes Based on Complete Graphs. 159-165 1996 8 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#JungnickelRV96 2004-02-05 On Generalized Hamming Weights for Galois Ring Linear Codes. 107-126 1998 14 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#Ashikhmin98 2004-02-05 An Explication of Secret Sharing Schemes. 357-390 1992 2 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#Stinson92a 2004-02-05 Some New Results on Key Distribution Patterns and Broadcast Encryption. 261-279 1998 14 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#StinsonT98 2004-02-05 Trading Signed Designs and Some new 4-(12, 5, 4) Designs. 279-288 1997 11 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc11.html#KhosrovshahiNT97 2004-02-05 The Weight Enumerator of Linear Codes over GF Having Generator Matrix over GF. 87-92 1999 16 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#Shiromoto99 2004-02-05 Linearly Derived Steiner Triple Systems. 31-49 1998 13 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#Assmus98 2004-02-05 Linear Sections of the Finite Veronese Varieties and Authentication Systems Defined Using Geometry. 199-212 1998 13 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#Zanella98 2004-02-05 Optimal Ternary Quasi-Cyclic Codes. 81-91 1992 2 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#GreenoughH92 2004-02-05 Spreads and Group Divisible Designs. 229-235 1993 3 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#OKeefeR93 2005-03-17 Optimal Subcodes of Second Order Reed-Muller Codes and Maximal Linear Spaces of Bivectors of Maximal Rank. 165-180 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#MaksS00 2004-02-05 Linear Complexity of the Discrete Logarithm. 135-146 2003 28 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc28.html#KonyaginLS03 2004-02-05 On Lower Bounds for the Redundancy of Optimal Codes. 29-45 1998 15 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#PriscoS98 2004-02-05 ``And Now For Something Completely Different'' (The Egyptologist and the Cryptographer: A Personal Reminiscence). 13-15 1996 7 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc7.html#Fischer96 2004-02-05 On (q2+q+2, q+2)-arcs in the Projective Plane PG(2, q). 205-224 2001 24 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#BallHLW01 2004-02-05 Bounds for Binary Multiple Covering Codes. 251-275 1993 3 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#HamalainenHKL93 2004-02-05 The Covering Radius of Ternary Cyclic Codes with Length up to 25. 223-227 1998 13 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#Baicheva98 2004-02-05 Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems. 125-156 1998 15 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#CarletCZ98 2004-02-05 Balanced Incomplete Block Designs with Block Size 9 and lambda=2, 4, 8. 33-59 2002 26 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc26.html#AbelBG02a 2004-06-21 Four Pairwise Balanced Designs. 63-68 1991 1 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#LamkenMW91 2004-02-05 Existence of Incomplete Transversal Designs with Block Size Five and Any Index lambda. 275-307 1997 10 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#AbelCYZ97 2004-02-05 Detection of Cheaters in Vector Space Secret Sharing Schemes. 75-85 1999 16 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#PadroSV99 2004-02-05 Values of Minors of (1, -1) Incidence Matrices of SBIBDs and Their Application to the Growth Problem. 267-282 2001 23 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#KoukouvinosMS01 2004-02-05 Nonisomorphic Complete Sets of F-Rectangles with Prime Power Dimensions. 155-174 1995 5 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc5.html#Suchower95 2004-02-05 Weights of Abelian Codes. 239-245 1998 14 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#Langevin98 2004-02-05 ^{alpha mod N}. 229-245 1998 13 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#BrennanG98 2004-02-05 Classical Codes as Ideals in Group Algebras. 273-285 1992 2 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#LandrockM92 2004-02-05 Difference Sets and Hyperovals. 89-98 1998 14 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#Maschietti98 2004-02-05 On Orthogonal Double Covers of Graphs. 49-91 2002 27 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc27.html#GronauGHLL02 2004-02-27 Equilateral Dimension of the Rectilinear Space. 149-164 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#KoolenLS00 2004-02-05 On Orthogonal Double Covers of Graphs. 103-105 1998 13 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#BryantK98 2004-02-05 On Designs and Formally Self-Dual Codes. 43-55 1994 4 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#KennedyP94 2004-02-05 A Subclass of Binary Goppa Codes with Improved Estimation of the Code Dimension. 23-38 1998 14 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#BezzateevS98 2004-02-05 Can Montgomery Parasites Be Avoided? A Design Methodology Based on Key and Cryptosystem Modifications. 73-80 1995 5 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc5.html#NaccacheMR95 2004-02-05 Extremal Self-Dual [50, 25, 10] Codes with Automorphisms of Order 3 and Quasi-Symmetric 2-(49, 9, 6) Designs. 163-169 2003 28 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc28.html#BouyuklievaH03 2004-09-22 A Weak Difference Set Construction for Higher Dimensional Designs. 75-87 1993 3 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#LauneyH93 2004-02-05 Guest Editorial. 75-76 2000 19 Des. Codes Cryptography 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc19.html#Koblitz00 2004-02-05 Improved Schemes for Visual Cryptography. 255-278 2001 24 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#BlundoBS01 2004-02-05 On the Dealer's Randomness Required in Secret Sharing Schemes. 235-259 1997 11 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc11.html#BlundoGS97 2004-02-05 Almost Affine Codes. 179-197 1998 14 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#SimonisA98 2004-02-05 A Simple Proof of the Delsarte Inequalities. 77-82 1991 1 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#SimonisV91 2004-02-05 On the Minimal Number of Even Submatrices of 0-1 Matrices. 85-93 1996 9 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#Pinelis96 2004-02-05 On Embeddings of the Flag Geometries of Projective Planes in Finite Projective Spaces. 97-104 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#ThasM99 2005-09-19 Hadamard Matrices from Weighing Matrices via Signed Groups. 49-58 1997 12 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc12.html#CraigenK97 2004-02-05 Classification of Formally Self-Dual Even Codes of Lengths up to 16. 325-332 2001 23 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#BetsumiyaH01a 2004-02-05 ₂₂. 171-186 2003 28 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc28.html#BetsumiyaGH03 2004-02-05 Strongly Regular Graphs and Designs with Three Intersection Numbers. 113-125 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#IoninS00 2004-02-05 Decoding Perfect Maps. 11-30 1994 4 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#MitchellP94 2004-02-05 A Theory of Nets for Polyhedra and Polytopes Related to Incidence Geometries. 115-136 1997 10 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#BouzetteBDG97 2004-02-05 Quasi-Symmetric Designs Related to the Triangular Graph. 27-42 1995 5 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc5.html#CosterH95 2004-02-05 Maximal Partial Spreads and Flocks. 193-202 1997 10 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#JohnsonL97 2004-02-05 Curves in Projective Spaces and Almost MDS Codes. 233-237 2001 24 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#BallicoC01 2004-02-05 Hermitian Veronesean Schemes. 311-317 2002 25 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc25.html#BallicoC02 2004-02-05 The Last Packing Number of Quadruples, and Cyclic SQS. 283-313 1993 3 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#BitanE93 2004-02-05 Blocking Sets in (v, {2, 4}, 1)-Designs. 309-314 1997 10 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#BattenCS97 2004-02-05 Improvement of Bruck's Completion Theorem. 99-116 1991 1 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#Metsch91 2004-02-05 Embedding the Linear Structure of Planar Spaces into Projective Spaces. 251-263 1997 10 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#Metsch97 2004-02-05 A Bose-Burton Theorem for Elliptic Polar Spaces. 219-224 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#Metsch99 2004-02-05 Generalized Perfect Arrays and {Menon} Difference Sets. 19-68 1992 2 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#Jedwab92 2004-02-05 Efficient Arithmetic on Koblitz Curves. 195-249 2000 19 Des. Codes Cryptography 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc19.html#Solinas00 2004-02-05 The National Security Establishment and the Development of Public-Key Cryptography. 9-12 1996 7 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc7.html#Diffie96 2004-02-05 Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'98. 175-209 2000 20 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc20.html#Patarin00 2004-02-05 On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes. 71-80 1998 14 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#LaihonenL98 2004-02-05 On Minimal Realization Over a Finite Chain Ring. 161-178 1999 16 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#Norton99 2004-02-05 Bounds on the Covering Radius of Linear Codes. 261-269 2002 27 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc27.html#AshikhminB02 2004-02-05 Fast Decoding Algorithms for First Order Reed-Muller and Related Codes. 187-214 1996 7 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc7.html#AshikhminL96 2004-02-05 A Class of Self-Orthogonal 2-Sequencings. 149-181 1991 1 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#AndersonL91 2004-02-05 Oval Designs in Desarguesian Projective Planes. 51-59 1996 9 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#Carpenter96 2004-02-05 On the Characterization of AG(n, q) by its Parameters as a Nearly Triply Regular Design. 173-179 1996 8 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#PascasioPR96 2004-02-05 Characterizing the Structures of Cryptographic Functions Satisfying the Propagation Criterion for Almost All Vectors. 111-134 1996 7 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc7.html#ZhangZ96 2004-02-05 The Correspondence between Projective Codes and 2-weight Codes. 261-266 1997 11 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc11.html#BrouwerE97 2004-06-21 A Sharpening of the Johnson Bound for Binary Linear Codes and Nonexistence of Linear Codes with Preparata Parameters. 95-98 1993 3 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#BrouwerT93 2004-02-05 A Recursive Construction for 2-Designs. 159-164 1998 13 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#Mackenzie-Fleming98 2004-02-05 Construction of Certain Cyclic Distance-Preserving Codes Having Linear-Algebraic Characteristics. 185-199 1999 16 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#ZantenL99 2004-02-05 Multiround Unconditionally Secure Authentication. 67-86 1998 15 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#Gehrmann98 2004-02-05 Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes. 207-216 2002 25 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc25.html#GuajardoP02 2004-02-05 Shared Secret Reconstruction. 221-237 1998 14 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#JingminD98 2004-02-05 On Certain Schur Rings of Dimension 4. 213-222 2001 23 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc23.html#Akiyama01 2004-02-05 Short Polynomial Representations for Square Roots Modulo rho. 33-44 2003 28 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc28.html#AgouDN03 2004-02-05 Cyclic Steiner Quadruple Systems and Köhler's Orbit Graphs. 121-132 1991 1 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#Siemon91 2004-02-05 Piotrowski's Infinite Series of Steiner Quadruple Systems Revisited. 239-254 1996 8 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#Siemon96 2004-02-05 A Number Theoretic Conjecture and the Existence of S-Cyclic Steiner Quadruple Systems. 63-94 1998 13 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#Siemon98 2006-07-10 Unconditionally Secure Group Authentication. 281-296 1998 14 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#DijkGS98 2004-02-05 A Note on New Semi-Regular Divisible Difference Sets. 379-381 1993 3 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#DavisJ93 2004-02-05 Using the Simplex Code to Construct Relative Difference Sets in 2-groups. 267-277 1997 11 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc11.html#DavisS97 2004-02-05 A General Decomposition Construction for Incomplete Secret Sharing Schemes. 301-321 1998 15 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#DijkJM98 2004-02-05 New Extremal Doubly-Even [64, 32, 12] Codes. 91-96 1995 6 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc6.html#HaradaK95 2004-02-05 A Class of Perfect Ternary Constant-Weight Codes. 223-229 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#Svanstrom99 2004-02-05 A Complete Classification of Symmetric (31, 10, 3) Designs. 127-136 1992 2 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc2.html#Spence92 2004-02-05 Cross-Correlations of Geometric Sequences in Characteristic Two. 347-377 1993 3 Des. Codes Cryptography 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#Klapper93 2004-02-05 Cross-Correlations of Quadratic Form Sequences in Odd Characteristic. 289-305 1997 11 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc11.html#Klapper97 2004-02-05 Information Security, Mathematics, and Public-Key Cryptography. 77-99 2000 19 Des. Codes Cryptography 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc19.html#Blake-Wilson00 2004-02-05 Small Blocking Sets in PG(2, p). 319-324 2000 20 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc20.html#Polverino00 2004-02-05 Authentication Schemes, Perfect Local Randomizers, Perfect Secrecy and Secret Sharing Schemes. 101-110 1996 7 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc7.html#MitchellPWW96 2004-02-05 Concerning Difference Matrices. 61-70 1996 9 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#ColbournK96 2004-02-05 Point Code Minimum Steiner Triple Systems. 141-146 1998 14 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#ColbournL98 2004-02-05 Maximum Kirkman Signal Sets for Synchronous Uni-Polar Multi-User Communication Systems. 219-227 2000 20 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc20.html#ColbournZ00 2004-07-26 Multiplicative Difference Sets via Additive Characters. 225-235 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#Dillon99 2005-06-23 5-Cycle Systems with Holes. 103-108 1996 8 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#BryantHR96 2004-02-05 On the Key Equation Over a Commutative Ring. 125-141 2000 20 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc20.html#NortonS00 2004-02-05 Enumeration, Construction and Random Generation of Block Codes. 213-219 1998 14 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#Fripertinger98 2004-02-05 Resolvable Balanced Incomplete Block Designs with Block Size 8. 123-140 1997 11 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc11.html#GreigA97 2004-06-21 HOPs and COPs: Room frames with partitionable transversals. 5-26 2000 19 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc19.html#DinitzL00 2004-02-27 Minimum Weight and Dimension Formulas for Some Geometric Codes. 105-120 1999 17 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc17.html#CalkinKR99 2005-09-19 The Structure of Weighing Matrices Having Large Weights. 199-216 1995 5 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc5.html#Craigen95 2004-10-04 Codes of Small Defect. 341-350 1997 10 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#FaldumW97 2004-02-05 Properties of Codes from Difference Sets in 2-Groups. 291-306 1999 16 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#Smeltzer99 2004-02-05 ⁿ. 263-269 1994 4 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#Robshaw94 2004-07-14 On Codes Identifying Sets of Vertices in Hamming Spaces. 193-204 2001 24 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#HonkalaLR01 2004-02-05 On Circulant Complex Hadamard Matrices. 123-142 2002 25 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc25.html#ArasuLM02 2004-02-05 On the Limit of Maximal Density of Sequences with a Perfect Linear Complexity Profile. 351-359 1997 10 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#Houston97 2004-02-05 Two-Weight Codes, Partial Geometries and Steiner Systems. 87-98 2000 21 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc21.html#ClerckD00 2004-02-05 The Automorphism Groups of BCH Codes and of Some Affine-Invariant Codes Over Extension Fields. 29-53 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#BergerC99 2004-02-05 On the Construction of Authentication and Secrecy Codes. 269-280 1995 5 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc5.html#Trung95 2004-02-05 A Generalization of a Theorem of Dehon for Simple t-Designs. 105-114 1996 9 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#Trung96 2004-07-12 m-Systems and Partial m-Systems of Polar Spaces. 229-238 1996 8 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#ShultT96 2004-02-05 Balanced Incomplete Block Designs with Block Size 7. 5-30 1998 13 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#AbelG98 2004-09-17 On the Classification of Extremal Even Formally Self-Dual Codes. 125-148 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#FieldsGHP99 2004-02-05 A Note on Sequences with the Shift and Add Property. 251-256 1996 9 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc9.html#Blackburn96 2004-02-05 A Generalization of Rational Interpolation Problem and the Solution of the Welch-Berlekamp Key Equation. 223-234 1997 11 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc11.html#Blackburn97 2004-02-05 On Lower Bounds For Covering Codes. 237-243 1998 15 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#BhandariCL98 2004-02-05 Some Results on NQR Codes. 5-9 1999 16 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#BhandariGL99 2004-02-05 A New Approach for Visual Cryptography. 207-227 2002 27 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc27.html#TzengH02 2004-02-05 Linear Codes and Their Coordinate Ordering. 229-250 2000 20 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc20.html#EnchevaC00 2004-02-05 The Connectivity of the Block-Intersection Graphs of Designs. 5-8 1993 3 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc3.html#HareM93 2004-02-05 Constructing Symmetric Ciphers Using the CAST Design Procedure. 283-316 1997 12 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc12.html#Adams97 2004-02-05 The Non-Collinearity Graph of the (8, 2) Quadric Is Uniquely Geometrisable. 307-317 2000 20 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc20.html#Panigrahi00 2004-02-05 ^{-(8, 2)}Quadric Is Not Geometrisable. 187-198 1998 13 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#Panigrahi98 2004-02-05 Linear Codes with Non-Uniform Error Correction Capability. 315-323 1997 10 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#BernardS97 2004-02-05 Computation of Discrete Logarithms in Prime Fields. 47-62 1991 1 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc1.html#LaMacchiaO91 2004-02-05 Kernels of Nonlinear Hamming Codes. 247-257 1995 6 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc6.html#PhelpsL95 2004-02-05 Switching Equivalence Classes of Perfect Codes. 179-184 1999 16 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#PhelpsL99 2004-02-05 Ranks of q-Ary 1-Perfect Codes. 139-144 2002 27 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc27.html#PhelpsV02 2004-02-05 Key-Dependent S-Boxes and Differential Cryptanalysis. 229-255 2002 27 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc27.html#MurphyR02 2004-02-05 Discrete Logarithm Based Cryptosystems in Quadratic Function Fields of Characteristic 2. 159-178 1998 14 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc14.html#MullerVZ98 2004-02-05 Secret Sharing Schemes with Detection of Cheaters for a General Access Structure. 175-188 2002 25 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc25.html#CabelloPS02 2004-02-05 Achieving Rights Untransferability with Client-Independent Servers. 263-271 1996 8 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc8.html#Domingo-Ferrer96 2004-02-05 Combinatorial Bounds on Authentication Codes with Arbitration. 265-281 2001 22 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#KurosawaO01 2004-02-05 Efficient Rabin-type Digital Signature Scheme. 53-64 1999 16 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#KurosawaO99 2004-02-05 Structure Theorems for Group Ring Codes with an Application to Self-Dual Codes. 5-14 2001 24 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc24.html#Hughes01 2004-02-05 Anticodes for the Grassman and Bilinear Forms Graphs. 73-79 1995 6 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc6.html#MartinZ95 2004-09-22 Cocyclic Generalised Hadamard Matrices and Central Relative Difference Sets. 187-200 1998 15 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#PereraH98 2004-02-05 Mixed Partitions of Projective Geometries. 143-154 2000 20 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc20.html#BonisoliC00 2004-02-05 The Nonexistence of Ternary [50, 5, 32] Codes. 235-237 1996 7 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc7.html#EupenHW96 2004-02-05 On the Embedding of -Arcs is Maximal Arcs. 235-246 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#Szhonyi99 2004-02-05 A Maximal Partial Spread of Size 45 in PG(3, 7). 331-334 2001 22 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#Heden01 2004-02-05 A Binary Perfect Code of Length 15 and Codimension 0. 213-220 1994 4 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#Heden94 2004-02-05 Cryptography in Quadratic Function Fields. 239-264 2001 22 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc22.html#Scheidler01 2004-02-05 A Gap in GRM Code Weight Distributions. 27-43 2000 19 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc19.html#Vance00 2004-02-05 Antichain Codes. 71-80 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#CohenEZ99 2004-02-05 Hypergraphical Codes Arising from Binary Trades. 183-186 1999 18 Des. Codes Cryptography 1/3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc18.html#KhosrovshahiN99 2004-02-05 Key Distribution Patterns Using Minkowski Planes. 261-267 1995 5 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc5.html#OKeefe95 2004-02-05 On the Security of the Digital Signature Algorithm. 87-96 2002 26 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc26.html#BlakeG02 2004-02-05 Arcs and Ovals from Abelian Groups. 213-228 2002 26 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc26.html#ResminiGJ02 2004-02-05 How to Build Robust Shared Control Systems. 111-124 1998 15 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc15.html#AndersonDHK98 2004-06-01 The Existence of Four HMOLS with Equal Sized Holes. 7-31 2002 26 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc26.html#AbelBG02 2004-02-05 Jacobi Polynomials, Type II Codes, and Designs. 215-234 1999 16 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#BonnecazeMS99 2004-02-05 Some Sets of Type in Cubic Order Planes. 211-213 1999 16 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc16.html#BattenD99 2004-02-05 Lexicographic Order and Linearity. 85-97 1997 10 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc10.html#Zanten97 2004-02-05 General Constructions for Double Group Divisible Designs and Double Frames. 155-168 2002 26 Des. Codes Cryptography 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc26.html#ChangM02 2004-02-05 Finite Linear Spaces II. 25-47 2002 27 Des. Codes Cryptography 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc27.html#Greig02 2004-02-05 A Shift Register Construction of Unconditionally Secure Authentication Codes. 69-81 1994 4 Des. Codes Cryptography 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc4.html#Johansson94 2004-02-05 Authentication Codes for Nontrusting Parties Obtained from Rank Metric Codes. 205-218 1995 6 Des. Codes Cryptography 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc6.html#Johansson95 2004-02-05 Skew-Hadamard Matrices and the Smith Normal Form. 173-176 1998 13 Des. Codes Cryptography 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc13.html#MichaelW98 2004-02-05 Designs and Representation of the Symmetric Group. 283-302 2003 28 Des. Codes Cryptography 3 http://dx.doi.org/10.1023/A:1024166205907 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc28.html#Masson03 2004-02-05 <i>Z</i>₄-Goethals Codes via a New Kloosterman Sum Identity. 247-263 2003 28 Des. Codes Cryptography 3 http://dx.doi.org/10.1023/A:1024153804090 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc28.html#ShinKH03 2004-02-05 Hypercubic 4 and 5-Designs from Double-Error-Correcting BCH Codes. 265-282 2003 28 Des. Codes Cryptography 3 http://dx.doi.org/10.1023/A:1024110021836 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc28.html#HellesethKL03 2004-02-05 <i>p</i>th Roots Modulo Polynomials over Finite Fields. 303-311 2003 28 Des. Codes Cryptography 3 http://dx.doi.org/10.1023/A:1024118322745 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc28.html#Huber03 2004-02-05 Providing Anonymity in Unconditionally Secure Secret Sharing Schemes. 227-245 2003 28 Des. Codes Cryptography 3 http://dx.doi.org/10.1023/A:1024198519111 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc28.html#GuillermoMO03 2004-02-05 <i>Q</i><i>q</i><i>q</i>Even. 179-197 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024112710780 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#LuyckxT03 2004-02-05 <i>M</i>₂₂. 177-178 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024160626710 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#Leemans03 2004-02-05 Complete Spans on Hermitian Varieties. 7-15 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024179703511 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#AgugliaCE03 2004-02-05 Some New Maximal Sets of Mutually Orthogonal Latin Squares. 141-147 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024104508963 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#GovaertsJST03 2004-02-05 <i>q + t, t</i><i>t</i>). 131-139 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024152424893 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#GacsW03 2004-02-05 <i>PG</i>³) and on Related Minihypers. 105-122 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024196207146 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#FerretS03 2004-02-05 Projective Planes, Coverings and a Network Problem. 71-89 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024140122167 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#BierbrauerMP03 2004-02-05 ⁿ: The Restricted Case. 17-28 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024131820350 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#AhlswedeAK03 2004-02-05 Some Remarks on Steiner Systems. 199-213 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024164727619 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#Maldeghem03 2004-02-05 <i>PG(n, q)</i>. 123-129 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024148308054 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#GacsS03 2004-02-05 On Sets without Tangents in Galois Planes of Even Order. 91-98 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024192106237 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#BlokhuisSW03 2004-02-05 <i>AG</i>(4, 4) and Its Uniqueness. 99-104 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024144223076 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#EdelB03 2004-02-05 A New Class of Designs Which Protect against Quantum Jumps. 51-70 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024188005329 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#BethCGADM03 2004-02-05 <i>n</i>-Arcs and Complete Designs. 247-250 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024121012598 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#Tonchev03 2004-02-05 On the Characterization of the Folded Halved Cubes by Their Intersection Arrays. 215-225 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024116811689 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#Metsch03 2004-02-05 On Optimal Codes Over the Field with Five Elements. 165-175 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024108609872 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#LandjevRMH03 2004-02-05 On the Linear Complexity of the Sidelnikov-Lempel-Cohn-Eastman Sequences. 149-164 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024156525801 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#KyureghyanP03 2004-02-05 Symmetry in Generalized Quadrangles. 227-245 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024168928527 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#Thas03 2005-07-26 Finite Geometries. 5 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024130419441 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#BlokhuisHJT03 2004-02-05 Symmetries of BLT-Sets. 41-50 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024135921258 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#BaderDLLP03 2004-02-05 Cone Dependence - A Basic Combinatorial Concept. 29-40 2003 29 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/A:1024183804420 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc29.html#AhlswedeK03 2004-02-05 ⁵. 97-111 2003 30 Des. Codes Cryptography 1 http://dx.doi.org/10.1023/A:1024763410967 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc30.html#BouyuklievS03 2004-02-05 A Criterion for Designs in {\tf="P101461" Z}_4-codes on the Symmetrized Weight Enumerator. 169-185 2003 30 Des. Codes Cryptography 2 http://dx.doi.org/10.1023/A:1025432804803 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc30.html#Tanabe03 2004-02-05 New Extremal Type I Codes of Lengths 40, 42, and 44. 151-157 2003 30 Des. Codes Cryptography 2 http://dx.doi.org/10.1023/A:1025476619824 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc30.html#Dalan03 2004-02-05 <i>GF</i>(4). 187-199 2003 30 Des. Codes Cryptography 2 http://dx.doi.org/10.1023/A:1025484821641 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc30.html#KimP03 2004-02-05 A Geometric Relationship Between Equivalent Spreads. 63-71 2003 30 Des. Codes Cryptography 1 http://dx.doi.org/10.1023/A:1024707325988 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc30.html#Mellinger03 2004-02-05 On a Class of Symmetric Balanced Generalized Weighing Matrices. 139-149 2003 30 Des. Codes Cryptography 2 http://dx.doi.org/10.1023/A:1025436002985 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc30.html#Kharaghani03 2004-02-05 ₄₄. 301-323 2003 30 Des. Codes Cryptography 3 http://dx.doi.org/10.1023/A:1025798111841 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc30.html#Nocon03 2004-02-05 Towards Practical Non-Interactive Public-Key Cryptosystems Using Non-Maximal Imaginary Quadratic Orders. 281-299 2003 30 Des. Codes Cryptography 3 http://dx.doi.org/10.1023/A:1025746127771 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc30.html#HuhnleinJW03 2004-02-05 <i>BCH</i><i>k</i>). 159-168 2003 30 Des. Codes Cryptography 2 http://dx.doi.org/10.1023/A:1025428720732 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc30.html#Sala03 2004-02-05 On the Algebraic Structure of Quasi-cyclic Codes II: Chain Rings. 113-130 2003 30 Des. Codes Cryptography 1 http://dx.doi.org/10.1023/A:1024715527805 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc30.html#LingS03 2004-02-05 <i>p</i>-Ranks. 325-343 2003 30 Des. Codes Cryptography 3 http://dx.doi.org/10.1023/A:1025750228679 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc30.html#ChandlerX03 2004-02-05 Construction of Symmetric Balanced Squares with Blocksize More than One. 235-280 2003 30 Des. Codes Cryptography 3 http://dx.doi.org/10.1023/A:1025729310932 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc30.html#SarkarS03 2004-02-05 Exact Bounds on the Sizes of Covering Codes. 21-38 2003 30 Des. Codes Cryptography 1 http://dx.doi.org/10.1023/A:1024703225079 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc30.html#AxenovichF03 2004-07-15 A Practical Protocol for Advantage Distillation and Information Reconciliation. 39-62 2003 30 Des. Codes Cryptography 1 http://dx.doi.org/10.1023/A:1024755209150 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc30.html#LiuTD03 2004-02-05 Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets. 73-84 2003 30 Des. Codes Cryptography 1 http://dx.doi.org/10.1023/A:1024759310058 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc30.html#DingGK03 2004-02-05 On the Sporadic Semifield Flock. 219-226 2003 30 Des. Codes Cryptography 2 http://dx.doi.org/10.1023/A:1025488922550 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc30.html#CardinaliPT03 2004-02-05 <i>x</i>⁶<i>x</i><i>a</i>in Characteristic Three. 85-95 2003 30 Des. Codes Cryptography 1 http://dx.doi.org/10.1023/A:1024711426896 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc30.html#Bluher03 2004-02-05 The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces. 201-217 2003 30 Des. Codes Cryptography 2 http://dx.doi.org/10.1023/A:1025436905711 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc30.html#NguyenS03 2004-02-05 On a Class of Traceability Codes. 125-132 2004 31 Des. Codes Cryptography 2 http://dx.doi.org/10.1023/B:DESI.0000012440.32810.23 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#TrungM04 2004-02-05 On Koetter's Algorithm and the Computation of Error Values. 169-188 2004 31 Des. Codes Cryptography 2 http://dx.doi.org/10.1023/B:DESI.0000012445.67356.7a http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#OSullivan04 2004-10-05 Minimal Blocking Sets in PG(2, 8) and Maximal Partial Spreads in PG(3, 8). 15-26 2004 31 Des. Codes Cryptography 1 http://dx.doi.org/10.1023/A:1027378202140 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#BaratFIS04 2004-02-05 A Lower Bound on the Greedy Weights of Product Codes. 27-42 2004 31 Des. Codes Cryptography 1 http://dx.doi.org/10.1023/A:1027382418978 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#Schaathun04 2004-02-05 Extensions of Generalized Product Caps. 5-14 2004 31 Des. Codes Cryptography 1 http://dx.doi.org/10.1023/A:1027365901231 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#Edel04 2004-02-05 Affine Planes and Flag Linear Spaces. 133-137 2004 31 Des. Codes Cryptography 2 http://dx.doi.org/10.1023/B:DESI.0000012441.40777.ec http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#RajolaT04 2004-02-05 ₄. 75-92 2004 31 Des. Codes Cryptography 1 http://dx.doi.org/10.1023/A:1027338603957 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#ShinKH04 2004-02-05 ₅Constructed from Certain Conference Matrices. 139-145 2004 31 Des. Codes Cryptography 2 http://dx.doi.org/10.1023/B:DESI.0000012442.78414.e4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#GulliverH04 2004-02-05 Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders. 99-123 2004 31 Des. Codes Cryptography 2 http://dx.doi.org/10.1023/B:DESI.0000012439.20075.16 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#BiehlPT04 2004-02-05 On the Orthogonality of Geometric Codes. 43-50 2004 31 Des. Codes Cryptography 1 http://dx.doi.org/10.1023/A:1027334503048 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#Glynn04 2004-02-05 Correlation Analysis of the Alternating Step Generator. 51-74 2004 31 Des. Codes Cryptography 1 http://dx.doi.org/10.1023/A:1027386519887 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#GolicM04 2004-02-05 Boolean Functions with Five Controllable Cryptographic Properties. 147-157 2004 31 Des. Codes Cryptography 2 http://dx.doi.org/10.1023/B:DESI.0000012443.88578.69 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#StanicaS04 2004-02-05 Affine Rank 3 Groups on Symmetric Designs. 159-168 2004 31 Des. Codes Cryptography 2 http://dx.doi.org/10.1023/B:DESI.0000012444.37411.1c http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#Dempwolff04 2005-03-17 Small Point Sets that Meet All Generators of W(2n+1, iq). 283-288 2004 31 Des. Codes Cryptography 3 http://www.springerlink.com/index/10.1023/B:DESI.0000015888.27935.e2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#Metsch04 2005-07-26 ₂(o), alpha-flocks and Ovals. 251-282 2004 31 Des. Codes Cryptography 3 http://www.springerlink.com/index/10.1023/B:DESI.0000015887.35146.14 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#BrownOPPR04 2005-03-17 Ovals and Hyperovals in Desarguesian Nets. 195-212 2004 31 Des. Codes Cryptography 3 http://www.springerlink.com/index/10.1023/B:DESI.0000015883.89954.80 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#DrakeK04 2005-03-17 Register Synthesis for Algebraic Feedback Shift Registers Based on Non-Primes. 227-250 2004 31 Des. Codes Cryptography 3 http://www.springerlink.com/index/10.1023/B:DESI.0000015886.71135.e1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#KlapperX04 2005-03-17 The Classification of Some Perfect Codes. 313-318 2004 31 Des. Codes Cryptography 3 http://www.springerlink.com/index/10.1023/B:DESI.0000015891.01562.c1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#AvgustinovichHS04 2005-03-17 On the Computation of Square Roots in Finite Fields. 301-312 2004 31 Des. Codes Cryptography 3 http://www.springerlink.com/index/10.1023/B:DESI.0000015890.44831.e2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#Muller04 2005-03-17 Key Distribution Patterns Using Tangent Circle Structures. 289-300 2004 31 Des. Codes Cryptography 3 http://www.springerlink.com/index/10.1023/B:DESI.0000015889.12620.21 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#Rinaldi04 2005-03-17 Partial Ovoids in Classical Finite Polar Spaces. 221-226 2004 31 Des. Codes Cryptography 3 http://www.springerlink.com/index/10.1023/B:DESI.0000015885.23333.ca http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#Klein04 2005-03-17 The p-Rank of the Incidence Matrix of Intersecting Linear Subspaces. 213-220 2004 31 Des. Codes Cryptography 3 http://www.springerlink.com/index/10.1023/B:DESI.0000015884.34185.4a http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc31.html#Sin04 2006-06-26 On a Bound of Cover-Free Families. 303-321 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029231.44423.43 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#MaW04 2005-03-17 Symplectic Spreads. 9-14 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029209.24742.89 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#BallBLP04 2005-03-17 Constructions for Permutation Codes in Powerline Communications. 51-64 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029212.52214.71 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#ChuCD04 2005-03-17 ^t). 45-50 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029211.79206.e1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#Brown04 2005-03-17 <i>t</i>-Covering Arrays. 323-339 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029232.40302.6d http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#MartirosyanT04 2005-07-25 <i>t</i>-Designs. 235-238 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029226.07366.dd http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#KhosrovshahiT04 2005-05-09 SPG-Reguli Satisfying the Polar Property and a New Semipartial Geometry. 153-166 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029219.90058.3a http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#WinterT04 2005-03-17 The Lovász Local Lemma and Its Applications to some Combinatorial Arrays. 121-134 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029217.97956.26 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#DengSW04 2005-03-17 Nets of Small Degree Without Ovals. 167-183 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029220.27696.d0 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#DrakeM04 2005-07-25 Minimum Covering for Hexagon Triple Systems. 251-265 2004 32 Des. Codes Cryptography 1-3 http://dx.doi.org/10.1023/B:DESI.0000029228.76566.3e http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#KuccukccIfccIL04 2005-03-17 Anonymous Membership Broadcast Schemes. 135-151 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029218.71926.b0 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#SantisM04 2005-03-17 Regular Hadamard Matrices Generating Infinite Families of Symmetric Designs. 227-233 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029225.69728.39 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#Ionin04 2005-03-17 Remarks on Singer Cyclic Groups and Their Normalizers. 97-102 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029214.50635.17 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#CossidenteR04 2005-05-27 Enumeration of t-Designs Through Intersection Matrices. 185-191 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029221.98300.04 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#EslamiKN04 2005-03-17 Amalgams of Cubic Bipartite Graphs. 267-275 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029229.06512.83 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#Labbate04 2005-03-17 On Non-Polynomial Latin Squares. 217-226 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029224.20896.8b http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#GrosekHT04 2005-03-17 Self-Orthogonal and Self-Dual Codes Constructed via Combinatorial Designs and Diophantine Equations. 193-206 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029222.35938.bf http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#GeorgiouK04 2005-12-21 On the Security of Two Public Key Cryptosystems Using Non-Abelian Groups. 207-216 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029223.76665.7e http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#VascoHMS04 2005-03-17 Planar Oval Sets in Desarguesian Planes of Even Order. 111-119 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029216.82297.fb http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#Feyter04 2005-03-17 On (0, alpha)-Geometries and Dual Semipartial Geometries Fully Embedded in an Affine Space. 103-110 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029215.28176.62 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#ClerckD04 2005-03-17 <i>t</i>-Designs. 277-301 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029230.50742.8f http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#Laue04 2005-03-17 Cover-Free Families and Topology-Transparent Scheduling for MANETs. 65-95 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029213.74879.e0 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#ColbournLS04 2005-03-17 Design of Self-Healing Key Distribution Schemes. 15-44 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029210.20690.3f http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#BlundoDSL04 2005-03-17 Parallel Symmetric Attack on NTRU using Non-Deterministic Lattice Reduction. 369-379 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029235.59808.77 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#SeidelSS04 2005-03-17 LDPC Codes from Triangle-Free Line Sets. 341-350 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029233.20866.41 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#Mellinger04 2005-03-17 _{{1, 4, 2}}in PG(9, 2). 381-396 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029236.10701.61 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#ShawG04 2005-03-17 Spreads and Ovoids Translation with Respect to Disjoint Flags. 351-367 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029234.00193.60 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#OfferM04 2005-03-17 Hyperbolic Ovals in Finite Planes. 239-249 2004 32 Des. Codes Cryptography 1-3 http://www.springerlink.com/index/10.1023/B:DESI.0000029227.72102.ed http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc32.html#KorchmarosS04 2005-03-17 Towards a Uniform Description of Several Group Based Cryptographic Primitives. 215-226 2004 33 Des. Codes Cryptography 3 http://www.springerlink.com/index/10.1023/B:DESI.0000036247.38461.c9 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc33.html#VascoMS04 2005-03-17 Three Constructions of Authentication Codes with Perfect Secrecy. 227-239 2004 33 Des. Codes Cryptography 3 http://www.springerlink.com/index/10.1023/B:DESI.0000036248.82691.11 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc33.html#DingT04 2005-03-17 Eigenvalues of Finite Projective Planes with an Abelian Cartesian Group. 159-172 2004 33 Des. Codes Cryptography 2 http://www.springerlink.com/index/10.1023/B:DESI.0000035469.24046.f3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc33.html#Hayden04 2005-03-17 A Linear Algebraic Approach to Metering Schemes. 241-260 2004 33 Des. Codes Cryptography 3 http://www.springerlink.com/index/10.1023/B:DESI.0000036249.86262.d5 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc33.html#BlundoMMP04 2005-03-17 Parameter Inequalities for Orthogonal Arrays with Mixed Levels. 187-197 2004 33 Des. Codes Cryptography 3 http://www.springerlink.com/index/10.1023/B:DESI.0000036245.92856.f0 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc33.html#Diestelkamp04 2005-03-17 Security of Signature Schemes in a Multi-User Setting. 261-274 2004 33 Des. Codes Cryptography 3 http://www.springerlink.com/index/10.1023/B:DESI.0000036250.18062.3f http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc33.html#MenezesS04 2005-03-17 How Many Bits have to be Changed to Decrease the Linear Complexity?. 109-122 2004 33 Des. Codes Cryptography 2 http://www.springerlink.com/index/10.1023/B:DESI.0000035466.28660.e9 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc33.html#Meidl04 2005-03-17 A Proof of Simmons' Conjecture. 39-43 2004 33 Des. Codes Cryptography 1 http://www.springerlink.com/index/10.1023/B:DESI.0000032605.98142.7f http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc33.html#HellesethM04 2005-03-17 On the Weight Hierarchy of Product Codes. 95-108 2004 33 Des. Codes Cryptography 2 http://www.springerlink.com/index/10.1023/B:DESI.0000035465.76668.89 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc33.html#Martinez-PerezW04 2005-03-17 Self-Reciprocal Irreducible Polynomials Over Finite Fields. 275-281 2004 33 Des. Codes Cryptography 3 http://www.springerlink.com/index/10.1023/B:DESI.0000036251.41345.1f http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc33.html#YucasM04 2005-03-17 A Sequence of Unique Quaternary Griesmer Codes. 71-85 2004 33 Des. Codes Cryptography 1 http://www.springerlink.com/index/10.1023/B:DESI.0000032608.92853.95 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc33.html#Ward04 2005-03-17 <i>d</i>-FCSR Sequences. 123-148 2004 33 Des. Codes Cryptography 2 http://www.springerlink.com/index/10.1023/B:DESI.0000035467.93014.90 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc33.html#GoreskyK04 2005-03-17 <i>n</i><i>q</i><i>n</i>>3. 5-21 2004 33 Des. Codes Cryptography 1 http://www.springerlink.com/index/10.1023/B:DESI.0000032603.40135.6b http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc33.html#BaratS04 2005-03-17 The Non-Existence of Maximal Sets of Four Mutually Orthogonal Latin Squares of Order 8. 63-69 2004 33 Des. Codes Cryptography 1 http://www.springerlink.com/index/10.1023/B:DESI.0000032607.03637.1c http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc33.html#DrakeM04a 2005-03-17 On the Covering Radius of Ternary Extremal Self-Dual Codes. 149-158 2004 33 Des. Codes Cryptography 2 http://www.springerlink.com/index/10.1023/B:DESI.0000035468.86695.40 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc33.html#HaradaOT04 2005-03-17 <i>Mat</i>_{n, s}_k) with a Non-Hamming Metric and Uniform Distributions. 45-61 2004 33 Des. Codes Cryptography 1 http://www.springerlink.com/index/10.1023/B:DESI.0000032606.11770.89 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc33.html#DoughertyS04 2005-03-17 On the Linear Codes Arising from Schubert Varieties. 173-180 2004 33 Des. Codes Cryptography 2 http://www.springerlink.com/index/10.1023/B:DESI.0000035470.05639.2b http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc33.html#GuerraV04 2005-03-17 <i>p</i>-Ranks and Characteristic Polynomials of Cyclic Difference Sets. 23-37 2004 33 Des. Codes Cryptography 1 http://www.springerlink.com/index/10.1023/B:DESI.0000032604.18844.31 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc33.html#NoSH04 2005-03-17 Some Characterizations of Finite Hermitian Veroneseans. 283-293 2005 34 Des. Codes Cryptography 2-3 http://www.springerlink.com/index/10.1007/s10623-004-4860-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#ThasM05 2005-03-17 Elements of Prescribed Order, Prescribed Traces and Systems of Rational Functions Over Finite Fields. 35-54 2005 34 Des. Codes Cryptography 1 http://www.springerlink.com/index/10.1007/s10623-003-4193-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#Ozbudak05 2005-03-17 A Solution of a Problem of A. E. Brouwer. 249-264 2005 34 Des. Codes Cryptography 2-3 http://www.springerlink.com/index/10.1007/s10623-004-4858-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#MuzychukK05 2005-03-17 _{1, 4, 2}. 203-227 2005 34 Des. Codes Cryptography 2-3 http://www.springerlink.com/index/10.1007/s10623-004-4855-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#ShawMG05 2005-03-17 On Meta-Thin Association Schemes. 187-201 2005 34 Des. Codes Cryptography 2-3 http://www.springerlink.com/index/10.1007/s10623-004-4854-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#Hirasaka05 2005-03-17 Square-Free Non-Cayley Numbers. On Vertex-Transitive Non-Cayley Graphs of Square-Free Order. 265-281 2005 34 Des. Codes Cryptography 2-3 http://www.springerlink.com/index/10.1007/s10623-004-4859-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#Seress05 2005-03-17 ²³^7*. 333-337 2005 34 Des. Codes Cryptography 2-3 http://www.springerlink.com/index/10.1007/s10623-004-4863-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#Cuypers05 2005-03-17 Secret Sharing Schemes with Three or Four Minimal Qualified Subsets. 17-34 2005 34 Des. Codes Cryptography 1 http://www.springerlink.com/index/10.1007/s10623-003-4192-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#Marti-FarreP05 2005-03-17 <i>q</i><i>t</i><i>v</i><i>k</i>, lambda)-Designs. 55-70 2005 34 Des. Codes Cryptography 1 http://www.springerlink.com/index/10.1007/s10623-003-4194-z http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#BraunKL05 2005-03-17 Preface. 135-135 2005 34 Des. Codes Cryptography 2-3 http://www.springerlink.com/index/10.1007/s10623-004-4849-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#BlokhuisH05 2005-03-17 Some Interlacing Results for the Eigenvalues of Distance-regular graphs. 173-186 2005 34 Des. Codes Cryptography 2-3 http://www.springerlink.com/index/10.1007/s10623-004-4853-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#SejeongK05 2006-05-04 Symmetric (4,4)-Nets and Generalized Hadamard Matrices Over Groups of Order 4. 71-87 2005 34 Des. Codes Cryptography 1 http://www.springerlink.com/index/10.1007/s10623-003-4195-y http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#HaradaLT05 2005-03-17 <i>F</i>_<i>q</i>_q^m: DFT Approach. 89-116 2005 34 Des. Codes Cryptography 1 http://www.springerlink.com/index/10.1007/s10623-003-4196-x http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#DeyR05 2005-03-17 Blocking Structures of Hermitian Varieties. 339-360 2005 34 Des. Codes Cryptography 2-3 http://www.springerlink.com/index/10.1007/s10623-004-4864-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#Metsch05 2005-03-17 Distance Regular Covers of Complete Graphs from Latin Squares. 149-153 2005 34 Des. Codes Cryptography 2-3 http://www.springerlink.com/index/10.1007/s10623-004-4851-x http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#CaenF05 2005-03-17 On the Minimum Size of Some Minihypers and Related Linear Codes. 5-15 2005 34 Des. Codes Cryptography 1 http://www.springerlink.com/index/10.1007/s10623-003-4191-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#MarutaLR05 2005-03-17 Two Linear Transformations each Tridiagonal with Respect to an Eigenbasis of the other; Comments on the Parameter Array. 307-332 2005 34 Des. Codes Cryptography 2-3 http://www.springerlink.com/index/10.1007/s10623-004-4862-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#Terwilliger05 2005-03-17 <i>g</i>^<i>u</i><i>m</i>¹<i>m</i>. 117-126 2005 34 Des. Codes Cryptography 1 http://www.springerlink.com/index/10.1007/s10623-003-4197-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#GeL05 2005-03-17 <i>q</i>-Clans. 295-305 2005 34 Des. Codes Cryptography 2-3 http://www.springerlink.com/index/10.1007/s10623-004-4861-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#BakerEP05 2005-03-17 The Combinatorics of Dom de Caen. 137-148 2005 34 Des. Codes Cryptography 2-3 http://www.springerlink.com/index/10.1007/s10623-004-4850-y http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#Dam05 2005-03-17 <i>-2</i>: A New Proof of the 31 Forbidden Subgraphs Theorem. 229-240 2005 34 Des. Codes Cryptography 2-3 http://www.springerlink.com/index/10.1007/s10623-004-4856-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#CvetkovicRS05 2005-03-17 Algebraic Characterizations of Graph Regularity Conditions. 241-248 2005 34 Des. Codes Cryptography 2-3 http://www.springerlink.com/index/10.1007/s10623-004-4857-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#Curtin05 2005-09-28 A Computer-Assisted Proof of the Uniqueness of the Perkel Graph. 155-171 2005 34 Des. Codes Cryptography 2-3 http://www.springerlink.com/index/10.1007/s10623-004-4852-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc34.html#CoolsaetD05 2005-03-17 Generic Groups, Collision Resistance, and ECDSA. 119-152 2005 35 Des. Codes Cryptography 1 http://www.springerlink.com/index/10.1007/s10623-003-6154-z http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc35.html#Brown05 2005-03-17 On the Linear Complexity and Multidimensional Distribution of Congruential Generators over Elliptic Curves. 111-117 2005 35 Des. Codes Cryptography 1 http://www.springerlink.com/index/10.1007/s10623-003-6153-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc35.html#HessS05 2005-03-17 Support Weight Enumerators and Coset Weight Distributions of Isodual Codes. 81-109 2005 35 Des. Codes Cryptography 1 http://www.springerlink.com/index/10.1007/s10623-003-6152-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc35.html#Milenkovic05 2005-03-17 A Public-Key Traitor Tracing Scheme with Revocation Using Dynamic Shares. 47-61 2005 35 Des. Codes Cryptography 1 http://www.springerlink.com/index/10.1007/s10623-003-6150-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc35.html#TzengT05 2005-03-17 How to Mask the Structure of Codes for a Cryptographic Use. 63-79 2005 35 Des. Codes Cryptography 1 http://www.springerlink.com/index/10.1007/s10623-003-6151-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc35.html#BergerL05 2005-09-19 Double Arrays, Triple Arrays and Balanced Grids. 21-45 2005 35 Des. Codes Cryptography 1 http://www.springerlink.com/index/10.1007/s10623-003-6149-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc35.html#McsorleyPWY05 2005-03-17 Vectorial Approach to Fast Correlation Attacks. 5-19 2005 35 Des. Codes Cryptography 1 http://www.springerlink.com/index/10.1007/s10623-003-6148-x http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc35.html#GolicH05 2006-01-24 Optimal Colored Threshold Visual Cryptography Schemes. 311-335 2005 35 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-003-6741-z http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc35.html#CimatoPS05 2006-01-24 New Constructions for IPP Codes. 227-239 2005 35 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-005-6402-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc35.html#TrungM05 2006-01-24 <i>n</i>, 2). 259-270 2005 35 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-003-6737-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc35.html#LisonekK05 2006-01-24 A Recursive Construction for New Symmetric Designs. 303-310 2005 35 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-003-6740-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc35.html#IoninK05 2006-01-24 The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments. 271-285 2005 35 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-003-6738-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc35.html#HaanpaaK05 2006-01-24 Resolvable Maximum Packings with Quadruples. 287-302 2005 35 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-003-6739-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc35.html#GeLLS05 2006-01-24 On Goppa Codes and Weierstrass Gaps at Several Points. 211-225 2005 35 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-005-6403-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc35.html#CarvalhoT05 2006-01-24 ⁺(7, q). 337-352 2005 35 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-003-6742-y http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc35.html#LuyckxT05 2006-01-24 New Results on Codes with Covering Radius 1 and Minimum Distance 2. 241-250 2005 35 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-005-6404-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc35.html#OstergardQW05 2006-01-24 Extendability of Ternary Linear Codes. 175-190 2005 35 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-005-6400-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc35.html#Maruta05 2006-01-24 A New Method for Constructing Williamson Matrices. 191-209 2005 35 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-005-6401-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc35.html#XiaXS05 2006-01-24 Modified Alternating vec{k}-generators. 159-174 2005 35 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-005-6399-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc35.html#BialotaK05 2006-01-24 Hyperelliptic Curves with Compact Parameters. 245-261 2005 36 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-004-1718-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#BrownMS05 2006-01-24 A General Approach to Robust Web Metering. 5-27 2005 36 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-003-1158-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#BarwickJM05 2006-01-24 Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults. 33-43 2005 36 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-003-1160-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#CietJ05 2006-01-24 Binary Fingerprinting Codes. 69-81 2005 36 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-003-1163-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#Lofvenberg05 2006-01-24 _^s. 227-244 2005 36 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-004-1717-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#GuptaBL05 2006-01-24 Local Schur's Lemma and Commutative Semifields. 203-216 2005 36 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-004-1705-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#Jha05 2006-01-24 <i>v</i><i>k</i>, 1) Designs Admitting a Ree Group of Characteristic Two. 159-169 2005 36 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-004-1702-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#Zhou05 2006-01-24 A Public Key Cryptosystem Based On A Subgroup Membership Problem. 301-316 2005 36 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-004-1721-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#NietoBD05 2006-01-24 On the Non-existence of Semiregular Relative Difference Sets in Groups with All Sylow Subgroups Cyclic. 29-31 2005 36 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-003-1159-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#Galati05 2006-01-24 <i>n</i><i>d</i>_<i>q</i><i>q</i>⁴<i>q</i>²<i>q</i><i>d</i><i>q</i>⁴<i>q</i>²<i>q</i>. 289-299 2005 36 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-004-1720-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#CheonKK05 2006-01-24 Concatenating Indicators of Flats for Designing Cryptographic Functions. 189-202 2005 36 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-004-1704-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#Carlet05 2006-01-24 Two New Four-Error-Correcting Binary Codes. 327-329 2005 36 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-004-1723-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#Ostergard05 2006-01-24 <i>GS</i>(2, 4, v, 2). 83-99 2005 36 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-1164-z http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#JiWZ05 2006-01-24 <i>n</i>-dimension One-way Hash Chain. 53-67 2005 36 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-003-1162-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#LinHC05 2006-01-24 Finite Field Elements with Specified Order and Traces. 331-340 2005 36 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-004-1724-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#Cohen05 2006-05-23 Proof of Conjectures on the True Dimension of Some Binary Goppa Codes. 317-325 2005 36 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-004-1722-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#Veron05 2006-01-24 Type II Codes over Z/2kZ, Invariant Rings and Theta Series. 147-158 2005 36 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-004-1701-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#Chiera05 2006-01-24 <i>PG</i><i>n</i><i>q</i><i>n</i>>= 3. 101-110 2005 36 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-1165-y http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#EisfeldSS05 2006-01-24 On a More General Characterisation of Steiner Systems. 117-129 2005 36 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-004-1699-z http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#Kaey05 2006-02-22 Distributing the Encryption and Decryption of a Block Cipher. 263-287 2005 36 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-003-1719-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#MartinSWW05 2006-01-24 Nonlinearity of Some Invariant Boolean Functions. 131-146 2005 36 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-004-1700-x http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#LangevinZ05 2006-01-24 Characterization of SDP Designs That Yield Certain Spin Models. 45-52 2005 36 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-003-1161-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#BrackenM05 2006-01-24 The Field Descent Method. 171-188 2005 36 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-004-1703-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc36.html#LeungS05 2006-05-23 Check Character Systems using Quasigroups: I. 215-227 2005 37 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-004-3987-z http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#BelyavskayaIM05 2006-05-23 MRD Hashing. 229-242 2005 37 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-004-3988-y http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#Safavi-NainiC05 2006-05-24 XOR-based Visual Cryptography Schemes. 169-186 2005 37 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-3816-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#TuylsHLT05 2006-05-23 On the Non-linearity of Power Functions. 31-43 2005 37 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-3803-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#LangevinV05 2006-05-23 One (96, 20, 4)-symmetric Design and related Nonabelian Difference Sets. 5-13 2005 37 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-3801-y http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#GolemacVM05 2006-05-23 <i>STD</i>₇[21; 3]. 525-528 2005 37 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-004-4041-x http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#Suetake05a 2006-05-23 ⁿ: The unrestricted case. 151-167 2005 37 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-3811-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#AhlswedeAK05 2006-05-23 Bounds for Covering Codes over Large Alphabets. 45-60 2005 37 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-3804-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#KeriO05 2006-05-23 <i>t</i>-designs of Prime Sizes. 143-149 2005 37 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-3809-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#Tayfeh-Rezaie05 2006-05-23 Constructions of Small Complete Caps in Binary Projective Spaces. 61-80 2005 37 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-3805-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#DavydovFP05 2006-05-23 Near-Extremal Formally Self-Dual Even Codes of Lengths 24 and 32. 465-471 2005 37 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-004-4037-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#GulliverHNO05 2006-05-23 Symmetric Weighing Matrices Constructed using Group Matrices. 195-210 2005 37 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-004-3985-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#AngM05 2006-05-23 Remark on a 5-Design Related to a Putative Extremal Doubly-Even Self-Dual [96, 48, 20] Code. 355-358 2005 37 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-004-3997-x http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#Harada05 2006-05-23 _ⁿ. 493-507 2005 37 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-004-4039-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#AhmadiM05 2006-05-23 <i>v</i><i>r</i><i>c</i>- 1. 313-318 2005 37 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-004-3994-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#McSorley05 2006-05-23 <i>p</i><i>p</i>^<i>r</i>-ary 1-Perfect Codes. 243-261 2005 37 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-004-3989-x http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#PhelpsRV05 2006-05-23 Non Existence of Triangle Free Quasi-symmetric Designs. 347-353 2005 37 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-004-3996-y http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#Pawale05 2006-05-23 Matrix Groups Related to the Quaternion Group and Spherical Orbit Codes. 391-404 2005 37 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-004-4032-y http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#DorofeevKST05 2006-06-29 <i>MST</i>₁. 509-524 2005 37 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-004-4040-y http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#BohliSVM05 2006-05-23 Elliptic Curves Suitable for Pairing Based Cryptography. 133-141 2005 37 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-3808-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#BrezingW05 2006-05-23 Cyclic Difference Packing and Covering Arrays. 281-292 2005 37 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-004-3991-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#Yin05 2006-05-23 Asymptotically Good Codes from Generalized Algebraic-Geometry Codes. 305-312 2005 37 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-004-3993-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#Spera05 2006-05-23 Weierstrass Semigroups and Codes from a Quotient of the Hermitian Curve. 473-492 2005 37 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-004-4038-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#Matthews05 2006-05-23 Highly Nonlinear Resilient Functions Through Disjoint Codes in Projective Spaces. 319-346 2005 37 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-004-3995-z http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#CharpinP05 2006-05-23 <i>t</i><i>m</i><i>s</i>)-Nets of Strength 5. 211-214 2005 37 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-004-3986-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#BierbrauerE05 2006-05-23 Toward the Determination of the Minimum Distance of Two-Point Codes on a Hermitian Curve. 111-132 2005 37 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-3807-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#HommaK05 2006-05-23 Check Character Systems Using Quasigroups: II. 405-419 2005 37 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-004-4033-x http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#BelyavskayaIM05a 2006-05-23 Piecewise Constructions of Bent and Almost Optimal Boolean Functions. 449-464 2005 37 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-005-4036-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#CarletY05 2006-05-23 Signcryption with Non-interactive Non-repudiation. 81-109 2005 37 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-3806-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#Malone-Lee05 2006-05-23 An Optimal Multisecret Threshold Scheme Construction. 367-389 2005 37 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-004-4031-z http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#BarwickJ05 2006-05-23 On the Minimum Length of some Linear Codes of Dimension 5. 421-434 2005 37 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-004-4034-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#CheonKK05a 2006-05-23 <i>STD</i>₄[12; 3]'s. 293-304 2005 37 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-004-3992-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#Suetake05 2006-06-27 Codes from Generalized Hexagons. 435-448 2005 37 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-005-4035-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#WispelaereM05 2006-05-23 <i>q</i>-ary Lexicodes. 15-29 2005 37 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-3802-x http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#ZantenS05 2006-05-23 Slim Near Polygons. 263-280 2005 37 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-004-3990-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc37.html#Bruyn05 2006-05-23 A New Class of Optimal 3-splitting Authentication Codes. 373-381 2006 38 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-005-1501-x http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#Wang06 2006-05-23 Cheating in Visual Cryptography. 219-236 2006 38 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-005-6342-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#HorngCT06 2006-05-23 Generating More MNT Elliptic Curves. 209-217 2006 38 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-005-0538-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#ScottB06 2006-05-23 ₂. 395-397 2006 38 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-005-2031-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#Ahmadi06 2006-05-23 Communication-Computation Trade-off in Executing ECDSA in a Contactless Smartcard. 399-415 2006 38 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-005-2069-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#Arazi06 2006-05-23 Some Observations on the Theory of Cryptographic Hash Functions. 259-277 2006 38 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-005-6344-y http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#Stinson06 2006-05-24 <i>alpha</i>)-Reguli. 179-194 2006 38 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-005-0370-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#ClerckWKT06 2006-05-23 A Full Rank Perfect Code of Length 31. 125-129 2006 38 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-005-5665-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#Heden06 2006-05-23 On the Algebraic Structure of Quasi-cyclic Codes IV: Repeated Roots. 337-361 2006 38 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-005-1431-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#LingNS06 2006-05-23 Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences. 159-178 2006 38 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-005-6340-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#MeidlW06 2006-05-23 Sublines of Prime Order Contained in the Set of Internal Points of a Conic. 113-123 2006 38 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-5664-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#Lavrauw06 2006-05-23 The Two-Point Codes on a Hermitian Curve with the Designed Minimum Distance. 55-81 2006 38 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-5661-x http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#HommaK06 2006-05-23 _q^s) with Respect to the Rosenbloom-Tsfasman Metric. 17-29 2006 38 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-5658-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#OzenS06 2006-05-23 Asymptotic Determination of the Last Packing Number of Quadruples. 83-95 2006 38 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-5662-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#Ji06 2006-05-23 A Fuzzy Vault Scheme. 237-257 2006 38 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-005-6343-z http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#JuelsS06 2006-05-23 <i>q</i><i>q</i>Odd. 195-208 2006 38 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-005-6341-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#Cauchie06 2006-05-23 A Generalization of Niho's Theorem. 331-336 2006 38 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-005-6686-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#Rosendahl06 2006-05-23 Index Calculation Attacks on RSA Signature and Encryption. 41-53 2006 38 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-5660-y http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#CoronNDOS06 2006-05-23 Co-Orthogonal Codes. 363-372 2006 38 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-005-1495-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#Grolmusz06 2006-05-23 On Ovoids of Parabolic Quadrics. 131-145 2006 38 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-005-5666-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#BallGS06 2006-05-23 Self-Orthogonal 3-(56, 12, 65) Designs and Extremal Doubly-Even Self-Dual Codes of Length 56. 5-16 2006 38 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-5657-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#Harada06 2006-05-23 Exponentially Many Hadamard Designs. 297-308 2006 38 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-005-6346-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#Merchant06 2006-05-23 A Low-Memory Algorithm for Point Counting on Picard Curves. 383-393 2006 38 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-005-1598-y http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#Weng06 2006-05-23 Higher Weights for Ternary and Quaternary Self-Dual Codes*. 97-112 2006 38 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-5663-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#DoughertyGO06 2006-05-23 (6, 3)-MDS Codes over an Alphabet of Size 4. 31-40 2006 38 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-004-5659-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#Alderson06 2006-05-23 The Round Functions of Cryptosystem PGM Generate the Symmetric Group. 147-155 2006 38 Des. Codes Cryptography 1 http://dx.doi.org/10.1007/s10623-005-5667-z http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#CarantiV06 2006-05-23 Quasi-Cyclic Codes from a Finite Affine Plane. 311-329 2006 38 Des. Codes Cryptography 3 http://dx.doi.org/10.1007/s10623-005-6685-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#KamiyaF06 2006-05-23 A New Characterization of Semi-bent and Bent Functions on Finite Fields*. 279-295 2006 38 Des. Codes Cryptography 2 http://dx.doi.org/10.1007/s10623-005-6345-x http://www.informatik.uni-trier.de/~ley/db/journals/dcc/dcc38.html#KhooGS06 2002-01-03 On Approximate Geometric k-Clustering. 61-84 2000 24 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/00/10019/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#Matousek00 2002-01-03 On Directional Convexity. 389-403 2001 25 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/00/10069/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#Matousek01 2002-06-20 A Lower Bound for Weak epsilon-Nets in High Dimension. 45-48 2002 28 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0090/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#Matousek02 2002-12-16 Construction of epsilon-Nets. 427-448 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#Matousek90 2002-12-16 Lower Bounds on the Length of Monotone Paths in Arrangement. 129-134 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Matousek91 2002-12-09 Efficient Partition Trees. 315-334 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#Matousek92 2002-12-09 Range Searching with Efficient Hiearchical Cutting. 157-182 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#Matousek93 2002-12-09 On Geometric Optimization with Few Violated Constraints. 365-384 1995 14 Discrete & Computational Geometry 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#Matousek95 2002-11-25 A Helly-Type Theorem for Unions of Convex Sets. 1-12 1997 18 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/18n1p1.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#Matousek97 2002-11-25 On Constants for Cuttings in the Plane. 427-448 1998 20 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/20n4p427.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#Matousek98 2002-11-25 Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. 307-331 1998 20 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/20n3p307.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#AkutsuTT98 2002-06-20 K-Levels of Concave Surfaces. 567-584 2002 27 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0086/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#KatohT02 2002-11-25 Packing up to 50 Equal Circles in a Square. 111-120 1997 18 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/18n1p111.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#NurmelaO97 2004-09-24 More Optimal Packings of Equal Circles in a Square. 439-457 1999 22 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/22n3p439.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#NurmelaO99 2002-12-09 The Reserse Isoperimetric Problem for Gaussian Measure. 411-420 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#Ball93 2002-12-09 Mahler's Conjecture and Wavelets. 271-277 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Ball95 2002-11-25 Piercing d -Intervals. 333-334 1998 19 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/19n3p333.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#Alon98 2003-02-14 The Combinatorial and Topological Complexity of a Single Cell. 41-59 2003 29 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/02/2799/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#Basu03 2003-11-20 On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets. 1-18 1999 22 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/22n1p1.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#Basu99 2002-01-03 <i>d</i>-Intervals. 283-287 2001 26 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/01/0037/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#Matousek01a 2002-12-16 Cutting Hyperplane Arrangements. 385-406 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Matousek91a 2002-12-09 Tight Upper Bounds for the Discrepancy of Half-Spaces. 593-601 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Matousek95a 2006-11-06 On Functional Separately Convex Hulls. 105-130 1998 19 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/19n1p105.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#MatousekP98 2002-12-09 On Ray Shooting in Convex Polytopes. 215-232 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#MatousekS93 2002-12-16 Computing the Geodesic Center of a Simple Polygon. 611-626 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#PollackSR89 2002-12-16 Separating Two Simple Polygons by a Sequence of Translations. 123-136 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#PollackSS88 2002-12-02 Grid Embedding of 4-Connected Plane Graphs. 339-358 1997 17 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/17n3p339.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#He97 2002-12-02 On Voronoi Diagrams in the $R^D$. 177-196 1996 16 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/16n2p177.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#Le96 2002-11-18 Guest Editor's Foreword. 575-576 2000 24 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/0024004/00240575.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#Bern00 2005-05-23 Straight Line Arrangements in the Real Projective Plane. 155-161 1998 20 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/20n2p143.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#ForgeA98 2002-12-16 Computing Convolutions by Reciprocal Search. 175-193 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#GuibasS87 2002-12-02 Computation of Betti Numbers of Monomial Ideals Associated with Cyclic Polytopes. 287-295 1996 15 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/15n3p287.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#TeraiH96 2002-12-02 Lower Bounds for the Complexity of the Graph of the Hausdorff Distance as a Function of Transformation. 135-153 1996 16 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/16n2p135.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#Rucklidge96 2002-12-16 diameter Partitioning. 265-276 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#Avis86 2005-10-31 On Quasiperiodic Space Tilings, Inflation, and Dehn Invariants. 147-171 2001 26 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0020/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#OgievetskyP01 2002-11-25 The Euler Characteristic Is the Unique Locally Determined Numerical Invariant of Finite Simplicial Complexes which Assigns the Same Number to Every Cone. 485-488 2000 23 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/00/10016/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#Forman00 2005-05-18 Straight-Line Embeddings of Two Rooted Trees in the Plane. 603-613 1999 21 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/21n4p603.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#KanekoK99 2002-12-16 Uniform Oriented Matroids Without the Isotopy Property. 97-100 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#JaggiMSW89 2002-12-09 On Subdivisions of Simplicial Complexes: Characterizing Local h-Vectors. 465-476 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#Chan94 2002-12-02 Optimal Output-Sensitive Convex Hull Algorithms in Two and Three Dimensions. 361-368 1996 16 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/16n4p361.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#Chan96 2002-11-25 Approximate Nearest Neighbor Queries Revisited. 359-373 1998 20 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/20n3p359.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#Chan98 2002-11-25 Geometric Applications of a Randomized Optimization Technique. 547-567 1999 22 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/22n4p547.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#Chan99 2002-12-09 On the Euler Characteristic of Finite Unions of Convex Sets. 79-93 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#Chen93 2002-11-25 On the Volume Formula for Hyperbolic Tetrahedra. 347-366 1999 22 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/22n3p347.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#ChoK99 2002-12-09 On Minimum and Maximum Spanning Trees of Linearly Moving Points. 161-176 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#KatohTI95 2002-12-09 Computing a Centerpoint of a Finite Planar Set of Points in Linear Time. 291-312 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#JadhavM94 2003-07-24 An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane. 377-383 1997 18 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/18n4p377.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#KapoorMM97 2002-12-09 The Worm Problem of Leo Moser. 153-162 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#NorwoodPL92 2002-01-03 A Continuous Analogue of the Upper Bound Theorem. 205-219 2001 26 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/01/0028/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#WagnerW01 2002-11-25 How to Cut Pseudoparabolas into Segments. 265-290 1998 19 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/19n2p265.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#TamakiT98 2002-12-09 New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visbility in Terrains. 313-326 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#HalperinS94 2002-12-09 Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. 385-410 1995 14 Discrete & Computational Geometry 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#HalperinS95 2002-12-02 A Near-Quadratic Algorithm for Planning the Motion of a Polygon in a Polygonal Environment. 121-134 1996 16 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/16n2p121.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#HalperinS96 2002-12-09 Counting Triangle Crossing and Halving Planes. 231-289 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#DeyE94 2002-11-25 Extremal Problems for Geometric Hypergraphs. 473-484 1998 19 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/19n4p473.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#DeyP98 2002-12-09 A New Technique To Compute Polygonal Schema for 2-Manifolds with Application to Null-homotopy Detection. 93-110 1995 14 Discrete & Computational Geometry 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#DeyS95 2002-12-19 On Extremal Finite Packings. 389-403 2002 28 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/02/0747/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#Schurmann02 2002-11-25 A Characterization of Gram Matrices of Polytopes. 581-601 1999 21 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/21n4p581.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#Diaz99 2002-01-03 Dynamic Skin Triangulation. 525-568 2001 25 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0007/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#ChengDES01 2002-01-03 Drawing Planar Graphs with Circular Arcs. 405-418 2001 25 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/00/10080/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#ChengDGK01 2002-12-09 Arrangements of Segments that Share Endpoints Single Face Results. 257-270 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#ArkinHKMN95 2005-12-30 Convex, Acyclic, and Free Sets of an Oriented Matroid. 99-116 2002 27 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0055/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#EdelmanRW02 2003-07-31 The Algebraic Degree of Geometric Optimization Problems. 177-191 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#Bajaj88 2005-01-12 Embedding Tree Metrics into Low-Dimensional Euclidean Spaces. 105-116 2000 24 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/00/10020/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#Gupta00 2002-11-25 Art Galleries with Interior Walls. 249-258 1999 22 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/22n2p249.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#Kundgen99 2002-12-16 On Seperating Two Simple Polygons by a Single Translation. 265-278 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#Toussaint89 2002-01-03 On the Number of Regular Vertices of the Union of Jordan Regions. 203-220 2001 25 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/01/0001/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#AronovEHS01 2003-02-14 In between k -Sets, j -Facets, and i -Faces: (i , j) - Partitions. 105-131 2003 29 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/02/2778/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#AndrzejakW03 2002-06-20 Canonical Modules of Semigroup Rings and a Conjecture of Reiner. 85-97 2002 27 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0054/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#Dong02 2002-01-03 On the Helly Number for Hyperplane Transversals to Unit Balls. 171-176 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/contents/00/10024/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#AronovGPW00 2002-01-03 A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets. 507-517 2001 25 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0016/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#AronovGPW01 2002-06-20 Visibility Queries and Maintenance in Simple Polygons. 461-483 2002 27 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0089/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#AronovGTZ02 2002-12-09 On-Line Steine Trees in the Euclidean Plane. 113-121 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#AlonA93 2002-12-16 Steiner Minimal Trees for Regular Polygons. 65-84 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#DuHW87 2002-12-16 Disjoint Edges in Geometric Graphs. 287-290 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#AlonE89 2002-12-16 Covering a Square by Small Perimeter Rectangles. 1-7 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#AlonK86 2002-12-09 Bounding the Piercing Number. 245-256 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#AlonK95 2002-12-16 The Complexity of Cutting Complexes. 139-181 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#ChazelleEG89 2002-01-03 A Trace Bound for the Hereditary Discrepancy. 221-231 2001 26 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/01/0030/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#ChazelleL01a 2002-12-09 An Elementary Approach to Lower Bounds in Geometric Discrepancy. 363-381 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#ChazelleMS95 2002-12-16 Branced Covering. 339-348 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#Mohar88a 2002-11-25 Tessellation and Visibility Representations of Maps on the Torus. 249-263 1998 19 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/19n2p249.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#MoharR98 2004-01-12 Mixed-Volume Computation by Dynamic Lifting Applied to Polynomial System Solving. 69-112 1996 16 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/16n1p69.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#VerscheldeGC96 2002-11-25 Infinitesimal Rigidity of Convex Polytopes. 177-192 1999 22 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/22n2p177.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#Bauer99 2002-12-09 An Invariant Property of Balls in Arrangements of Hyperplanes. 421-425 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#AronovNPS93 2002-12-09 Reconfigurating Closed Polygonal Chains in Euclidean d-Space. 123-140 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#LenhartW95 2002-12-09 Special Representations for n-Bridge Links. 9-27 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#CavicchioliR94 2006-05-26 A Simple and Relatively Efficient Triangulation of the n-Cube. 287-289 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Haiman91 2002-12-16 Approximation of Convex Discs by Polygons. 241-263 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#Florian86 2002-06-20 Fractional Power Series Solutions for Systems of Equations. 501-529 2002 27 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0077/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#McDonald02 2005-02-16 On the Covering Multiplicity of Lattices. 109-130 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#ConwayS92