2003-11-21 Deriving Spectral Reflectance Functions of Computer-Simulated Object Colours. 211-217 1994 13 Comput. Graph. Forum 4 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf13.html#Schettini94 2003-11-21 An Adaptive Method for Indirect Illumination Using Light Vectors. 2001 20 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf20.html#SerpaggiP01 2003-11-21 Form Factor Calculation: a New Expression with Implementations on a Parallel T.Node Computer. 421-432 1993 12 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf12.html#MichelinMAG93 2003-11-21 An Object Model for Multimedia Programming. 101-113 1993 12 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf12.html#ArbabHR93 2003-11-21 Introducing Blending Operations in Feature Models. 165-176 1993 12 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf12.html#LaakkoM93 2003-11-21 Multiresolution Curve and Surface Representation: Reversing Subdivision Rules by Least-Squares Data Fitting. 97-119 1999 18 Comput. Graph. Forum 2 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf18.html#SamavatiB99 2005-04-08 Incremental Line Labelling for Sketch Input of Solid Models. 155-166 1996 15 Comput. Graph. Forum 2 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf15.html#GrimsteadM96 http://www.eg.org/EG/CGF/volume15/issue2/v15i2pp155-166_abstract.html 2003-11-21 The Art of Knitted Fabrics, Realistic & Physically Based Modeling Of Knitted Fabrics. 355-362 1998 17 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf17.html#MeissnerE98 2004-04-21 The Determiniation of Form-Factors by Lookup Table. 191-198 1993 12 Comput. Graph. Forum 4 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf12.html#SunZG93 2003-11-21 Emotion Editing using Finite Elements. 295-302 1998 17 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf17.html#KochGB98 2003-11-21 Synthetic Vision and Audition for Digital Actors. 325-336 1995 14 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf14.html#NoserT95 2003-11-21 A Hand Control and Automatic Grasping System for Synthetic Actors. 167-177 1994 13 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf13.html#SansoT94 2003-11-21 A Hybrid Approach for Stroke-Based Letterform Composition Including Outline-Based Methods. 243-256 2000 19 Comput. Graph. Forum 4 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf19.html#Schneider00 2003-11-21 A Camera Engine for Computer Games: Managing the Trade-Off Between Constraint Satisfaction and Frame Coherence. 2001 20 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf20.html#HalperHS01 2003-11-21 Modeling the Motion of Dense Smoke in the Wind Field. 2000 19 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf19.html#RudolfR00 2003-11-21 A 4D Ray Tracing. 285-294 1993 12 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf12.html#MaurelDC93 2006-01-11 A Coherence-based Collision Detection Method for Dressed Human Simulation. 33-42 2002 21 Comput. Graph. Forum 1 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf21.html#ZhangY02 2003-11-21 Designing 2D Vector Fields of Arbitrary Topology. 2002 21 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/volume21/issue3/abstracts/CGF710.HTML http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf21.html#Theisel02a 2003-11-21 An Enhanced Spring Model for Information Visualization. 335-344 1998 17 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf17.html#TheiselK98 2003-11-21 Multiresolution Isosurface Extraction with Adaptive Skeleton Climbing. 137-148 1998 17 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf17.html#PostonWH98 2003-11-21 Psychovisual Evaluation of Lossy CMYK Image Compression for Printing Applications. 5-17 2002 21 Comput. Graph. Forum 1 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf21.html#DeneckerNAWLP02 2003-11-21 An Inexpensive BRDF Model for Physically-Based Rendering. 233-246 1994 13 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf13.html#Schlick94a 2003-11-21 Realistic collision avoidance of upper limbs based on neuroscience models. 2000 19 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf19.html#Nebel00 2003-11-21 Multiresolution Tiling. 325-340 1994 13 Comput. Graph. Forum 5 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf13.html#Meyers94 2003-11-21 Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids. 369-376 1999 18 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf18.html#CombaKMMSW99 2003-11-21 Fast Spheres. 61-72 1993 12 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf12.html#Patterson93 2005-01-27 Growing and Animating Polygonal Models of Animals. 151-158 1997 16 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf16.html#WalterF97 2003-12-18 Generation of 3D Texture Using Multiple 2D Models Analysis. 311-323 1996 15 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf15.html#GhazanfarpourD96 http://www.eg.org/EG/CGF/volume15/issue3/v15i3pp311-323_abstract.html 2003-11-21 The Development of Programs for the Processing of Parametric Curves. 135-144 1983 2 Comput. Graph. Forum 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf2.html#KoparkarM83 2003-12-03 Accelerated Evaluation of Box Splines via a Parallel Inverse FFT. 35-46 1996 15 Comput. Graph. Forum 1 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf15.html#McCool96 http://www.eg.org/EG/CGF/volume15/issue1/v15i1pp35-45_abstract.html 2003-11-21 A Method for Choosing Tickmarks on a Nonlinear Scale. 243-248 1983 2 Comput. Graph. Forum 4 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf2.html#Kjelldahl83 2003-11-21 Selective Visualization of Vector Fields. 339-347 1994 13 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf13.html#WalsumP94 2003-11-21 A Modelling Method and User Interface for Creating Plants. 73-82 1998 17 Comput. Graph. Forum 1 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf17.html#LintermannD98 2003-12-18 3D Interactive Topological Modeling using Visible Human Dataset. 33-44 1996 15 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf15.html#BeylotGKMMTF96 http://www.eg.org/EG/CGF/volume15/issue3/v15i3pp33-44_abstract.html 2003-11-21 A Progressive Algorithm for Three Point Transport. 41-56 1999 18 Comput. Graph. Forum 1 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf18.html#DumontBG99 2003-11-21 Implementation and Complexity of the Watershed-from-Markers Algorithm Computed as a Minimal Cost Forest. 2001 20 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf20.html#FelkelBW01 2003-11-21 Boolean Operation and Spatial Complexity of Face Octrees. 153-164 1993 12 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf12.html#Pia-Garcia93 2003-11-21 Fast Wavelet Based Volume Rendering by Accumulation of Transparent Texture Maps. 431-444 1995 14 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf14.html#LippertG95 2003-11-21 Adaptive Acquisition of Lumigraphs from Synthetic Scenes. 151-160 1999 18 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf18.html#SchirmacherHS99 2005-05-25 On-the-Fly Processing of Generalized Lumigraphs. 2001 20 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf20.html#SchirmacherMS01 2005-07-26 Optimised CSG Tree Evaluation for Space Subdivision. 139-146 1995 14 Comput. Graph. Forum 2 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf14.html#ZemcikC95 2003-12-18 A Three Dimensional Image Cache for Virtual Reality. 227-236 1996 15 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf15.html#SchauflerS96 http://www.eg.org/EG/CGF/volume15/issue3/v15i3pp227-235_abstract.html 2003-11-21 Mass-Spring Simulation using Adaptive Non-Active Points. 345-354 1998 17 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf17.html#HowlettH98 2003-11-21 Graceful Degradation of Collision Handling Physically Based Animation. 2000 19 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf19.html#DinglianaO00 2003-12-18 Topologically Exact Evaluation of Polyhedra Defined in CSG with Loose Primitives. 205-217 1996 15 Comput. Graph. Forum 4 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf15.html#BanerjeeR96 http://www.eg.org/EG/CGF/volume15/issue4/v15i4pp205-217_abstract.html 2003-11-21 Using Multimedia to Support Cooperative Editing. 73-87 1993 12 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf12.html#SantosT93 2003-11-21 An Integrated Line Tracking and Vectorization Algorithm. 349-359 1994 13 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf13.html#NieuwenhuizenKB94 2003-11-21 Multiresolution for Algebraic Curves and Surfaces using Wavelets. 47-58 2001 20 Comput. Graph. Forum 1 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf20.html#EsteveBV01 2003-11-21 Sketching 3D Animations. 241-258 1995 14 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf14.html#BalaguerG95 2003-11-21 Triangle Strip Compression. 91-101 2001 20 Comput. Graph. Forum 2 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf20.html#Isenburg01 2003-12-18 CCD-Camera Based Optical Beacon Tracking for Virtual and Augmented Reality. 207-216 1996 15 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf15.html#MadritschG96 http://www.eg.org/EG/CGF/volume15/issue3/v15i3pp207-216_abstract.html 2003-11-21 Antialiasing of Environment Maps. 5-11 2001 20 Comput. Graph. Forum 1 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf20.html#Schilling01 2003-11-21 Efficient Fitting and Rendering of Large Scattered Data Sets Using Subdivision Surfaces. 2002 21 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/volume21/issue3/abstracts/CGF595.HTML http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf21.html#ScheibHLS02 2003-11-21 Dithered Color Quantization. 219-232 1998 17 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf17.html#BuhmannFHKP98 2003-11-21 Constrained Fairing for Meshes. 115-123 2001 20 Comput. Graph. Forum 2 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf20.html#LiuBPHW01 2005-10-14 Metafiles at Albuquerque. 47-49 1982 1 Comput. Graph. Forum 2 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf1.html#Osland82 2003-11-21 Impressions of the EUROGRAPHICS '82 Exhibition. 176 1982 1 Comput. Graph. Forum 4 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf1.html#Watkins82 2003-11-21 Filtered Jitter. 223-230 2000 19 Comput. Graph. Forum 4 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf19.html#Klassen00 2003-11-21 Getting Rid of Links in Hierarchical Radiosity. 165-174 1998 17 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf17.html#StammingerSSS98 2003-11-21 Graphics related activities at NCSDCT, Bombay. 25-29 1983 2 Comput. Graph. Forum 1 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf2.html#Mudur83 2003-11-21 Image-Swept Volumes. 2002 21 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/volume21/issue3/abstracts/CGF604.HTML http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf21.html#WinterC02 2003-11-21 Drawing for Illustration and Annotation in 3D. 2001 20 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf20.html#BourguignonCD01 2003-12-18 Symbiosis of Virtual Reality and Scientific Visualization System. 443-451 1996 15 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf15.html#Haase96 http://www.eg.org/EG/CGF/volume15/issue3/v15i3pp443-451_abstract.html 2003-11-21 Rapid and Accurate Contact Determination between Spline Models using ShellTrees. 315-326 1998 17 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf17.html#KrishnanGLMP98 2003-11-21 The Generation of Straight Lines on Hexagonal Grids. 27-32 1993 12 Comput. Graph. Forum 1 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf12.html#Yong-Kui93a 2005-01-27 Modelling the Garden of Perfect Brightness. 365-369 1997 16 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf16.html#WangBEF97 2003-12-16 GKS-9x: Some Implementation Considerations. 295-313 1993 12 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf12.html#DamnjanovicDR93 2003-11-21 An Approach for CAD-System Simulation. 116-123 1982 1 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf1.html#Encarnacao82 2003-11-21 Fair Surface Reconstruction Using Quadratic Functionals. 469-480 1995 14 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf14.html#KolbPS95 2003-11-21 Rendering Caustics on Non-Lambertian Surfaces. 57-64 1997 16 Comput. Graph. Forum 1 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf16.html#Jensen97 2003-11-21 The Area of Graphics Standardization. 14-16 1982 1 Comput. Graph. Forum 1 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf1.html#Hagen82 2003-11-21 Report on the 6th Meeting of ISO/TC97/SC5/WG2 Computer Graphics. 189-191 1983 2 Comput. Graph. Forum 4 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf2.html#Hagen83 2003-11-21 SADIST: an Interactive Editor for Structured Analysis. 104-114 1983 2 Comput. Graph. Forum 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf2.html#Munro83 2003-11-21 A New Paradigm for Geometric Processing. 177-188 1993 12 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf12.html#YamaguchiN93 2005-01-24 A Free Form Feature Taxonomy. 107-118 1999 18 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf18.html#FontanaGM99 2003-12-18 Three-Dimensional Modeling and Effects on Still Images. 3-10 1996 15 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf15.html#ZakaiR96 http://www.eg.org/EG/CGF/volume15/issue3/v15i3pp3-10_abstract.html 2003-11-21 Volume Rendering on Non-Regular Grids. 247-258 1994 13 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf13.html#TabatabaiSM94 2005-05-09 Modeling and Rendering of the Atmosphere Using Mie-Scattering. 201-210 1997 16 Comput. Graph. Forum 4 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf16.html#JackelW97 2003-11-21 Observational Models of Graphite Pencil Materials. 27-49 2000 19 Comput. Graph. Forum 1 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf19.html#SousaB00 2003-11-21 Computer-Generated Graphite Pencil Rendering of 3D Polygonal Models. 195-208 1999 18 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf18.html#SousaB99 2005-01-06 Variational Surface Design and Surface Interrogation. 447-459 1993 12 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf12.html#HahmannB93 2003-11-21 Standardization of Graphics Metafiles. 50-57 1982 1 Comput. Graph. Forum 2 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf1.html#Enderle82 2003-11-21 GKS-implementations - Overview and inquiry. 15-22 1983 2 Comput. Graph. Forum 1 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf2.html#Enderle83 2003-11-21 Automatic Creation of Object Hierarchies of Radiosity Clustering. 213-221 2000 19 Comput. Graph. Forum 4 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf19.html#MullerSF00 2003-11-21 Relying on Abstraction to Facilitate Graphics Programming. 124-128 1982 1 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf1.html#Gnatz82 2003-11-21 An Algebraic Approach to the Standardization and the Certification of Graphics Software. 153-166 1983 2 Comput. Graph. Forum 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf2.html#Gnatz83 2004-09-21 Raster Graphics at the University of Manchester. 58-70 1982 1 Comput. Graph. Forum 2 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf1.html#HewittHA82 2003-11-21 Artistic Surface Rendering Using Layout of Text. 99-110 2002 21 Comput. Graph. Forum 2 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf21.html#SurazhskyE01 2003-11-21 Guided Exploration with Dynamic Potential Fields: the CubicalPath System. 201-210 2001 20 Comput. Graph. Forum 4 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf20.html#BeckhausRS01 2005-04-19 Fast Feature-Based Metamorphosis and Operator Design. 15-22 1998 17 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf17.html#LeeLLS98 2006-05-11 PRIP - A Parallel Raster Image Processor. 95-104 1993 12 Comput. Graph. Forum 2 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf12.html#CampenhoutL93 2003-11-21 Filtering, Clustering and Hierarchy Construction: a New Solution for Ray-Tracing Complex Scenes. 371-382 1995 14 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf14.html#CazalsDP95 2003-11-21 Context-based Space Filling Curves. 2000 19 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf19.html#DafnerCM00 2003-11-21 Streaming of Complex 3D Scenes for Remote Walkthroughs. 2001 20 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf20.html#TelerL01 2003-12-18 Demand-Driven Geometry Transmission for Distributed Virtual Environments. 421-431 1996 15 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf15.html#SchmalstiegG96 http://www.eg.org/EG/CGF/volume15/issue3/v15i3pp421-432_abstract.html 2003-11-21 Rendering Silhouettes with Virtual Lights. 271-282 2001 20 Comput. Graph. Forum 4 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf20.html#MartinT01 2003-11-21 A Framework for Synchronized Editing of Multiple Curve Representations. 31-40 1998 17 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf17.html#GrimmA98 2003-12-18 An Image based Measurement System for Anisotropic Reflection. 119-128 1996 15 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf15.html#KarnerMG96 http://www.eg.org/EG/CGF/volume15/issue3/v15i3pp119-128_abstract.html 2004-09-21 The HUMANOID Environment for Interactive Animation of Multiple Deformable Human Characters. 337-348 1995 14 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf14.html#BoulicCHKLMMMPSSST95 2003-12-18 Implicit Sweep Objects. 165-174 1996 15 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf15.html#CrespinBS96 http://www.eg.org/EG/CGF/volume15/issue3/v15i3pp165-174_abstract.html 2003-11-21 Dynamic Textures for Image-based Rendering of Fine-Scale 3D Structure and Animation of Non-rigid Motion. 2002 21 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/volume21/issue3/abstracts/CGF609.HTML http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf21.html#CobzasYJ02 2003-11-21 Texturing 3D Models of Real World Objects from Multiple Unregistered Photographic Views. 245-256 1999 18 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf18.html#HeugebauerK99 2003-12-18 Compositing Computer and Video Image Sequences: Robust Algorithms for the Reconstruction of the Camera Parameters. 23-32 1996 15 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf15.html#BergerCS96 http://www.eg.org/EG/CGF/volume15/issue3/v15i3pp23-32_abstract.html 2003-11-21 A Video-Based 3D-Reconstruction of Soccer Games. 2000 19 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf19.html#BebieB00 2003-12-18 Mesh Simplification. 77-86 1996 15 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf15.html#AlgorriS96a http://www.eg.org/EG/CGF/volume15/issue3/v15i3pp77-86_abstract.html 2003-11-21 Adaptive Supersampling in Object Space Using Pyramidal Rays. 29-54 1998 17 Comput. Graph. Forum 1 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf17.html#GenettiGW98 2003-11-21 Fast Wavelet Radiosity Method. 407-420 1994 13 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf13.html#PattanaikB94 2003-11-21 The Potential Equation and Importance in Illumination Computations. 131-136 1993 12 Comput. Graph. Forum 2 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf12.html#PattanaikM93 2003-12-18 Computation of Higher Order Illumination with a Non-Deterministic Approach. 327-337 1996 15 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf15.html#PattanaikZ96 http://www.eg.org/EG/CGF/volume15/issue3/v15i3pp327-337_abstract.html 2003-12-15 Efficient Hierarchical Refinement and Clustering for Radiosity in Complex Environments. 297-310 1996 15 Comput. Graph. Forum 5 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf15.html#GibsonH96 http://www.eg.org/EG/CGF/volume15/issue5/v15i5pp297-310_abstract.html 2003-11-21 Perceptually-Driven Radiosity. 129-141 1997 16 Comput. Graph. Forum 2 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf16.html#GibsonH97 2003-11-21 A Theoretical Framework for Physically Based Rendering. 97-107 1994 13 Comput. Graph. Forum 2 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf13.html#LafortuneW94 2003-11-21 Interactive Construction and Animation of Layered Elastically Deformable Characters. 135-152 1998 17 Comput. Graph. Forum 2 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf17.html#TurnerG98 2003-12-18 Efficient Lossless Image Contour Coding. 107-118 1996 15 Comput. Graph. Forum 2 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf15.html#TurnerW96 http://www.eg.org/EG/CGF/volume15/issue2/v15i2pp107-117_abstract.html 2003-11-21 Tunnel-Free Supercover 3D Polygons and Polyhedra. 3-14 1997 16 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf16.html#AndresNF97 2003-11-21 Storage Support for Multidimensional Discrete Data in Databases. 89-100 1993 12 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf12.html#FurtadoT93 2003-11-21 Visualization of Regular Polytopes in Three and Four Dimensions. 305-316 1994 13 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf13.html#HausmannS94 2005-10-14 Graphics Standards: The Pace Quickens. 67-75 1983 2 Comput. Graph. Forum 1 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf2.html#Straayer83 2003-11-21 Egocentric Object Manipulation in Virtual Environments: Evaluation of Interaction Techniques. 41-52 1998 17 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf17.html#PoupyrevWBI98 2003-11-21 Modeling Dynamic Hair as a Continuum. 2001 20 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf20.html#HadapM01 2003-12-18 BOXTREE: A Hierarchical Representation for Surfaces in 3D. 387-396 1996 15 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf15.html#BarequetCGMT96 http://www.eg.org/EG/CGF/volume15/issue3/v15i3pp387-396_abstract.html 2003-11-21 Visual Perception in Realistic Image Synthesis. 211-224 2001 20 Comput. Graph. Forum 4 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf20.html#McNamara01 2003-11-21 Versatile Tuning of Humanoid Agent Activity. 231-242 2000 19 Comput. Graph. Forum 4 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf19.html#EmeringBMT00 2003-11-21 Physically-Based Patination for Underground Objects. 2000 19 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf19.html#ChangS00 2003-11-21 A VLSI Implementation of the Graphics Standard GKS. 115-121 1983 2 Comput. Graph. Forum 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf2.html#EncarnacaoLMPS83 2003-11-21 Ray Traversal of Spatial Structures. 223-227 1994 13 Comput. Graph. Forum 4 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf13.html#Kuzmin94 2003-11-21 Bresenham's Line Generation Algorithm with Built-in Clipping. 275-280 1995 14 Comput. Graph. Forum 5 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf14.html#Kuzmin95 2004-09-21 A Muscle-based Feed-forward Controller of the Human Body. 165-176 1997 16 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf16.html#KomuraSK97 2003-11-21 Subdivision Surface Tesselation on the Fly using a versatile Mesh Data Structure. 2000 19 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf19.html#MullerH00 2003-11-21 Creating Architectural Models from Images. 39-50 1999 18 Comput. Graph. Forum 3 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf18.html#LiebowitzCZ99 2003-12-18 A Unified, Object-Oriented Graphics System and Software Architecture for Visualising CAD/CAM Presentations. 229-248 1996 15 Comput. Graph. Forum 4 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf15.html#KochharH96 http://www.eg.org/EG/CGF/volume15/issue4/v15i4pp229-248_abstract.html 2003-12-15 Colour Raster Operations. 151-159 1988 7 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/volume7/issue3/v07i3pp151-159_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#WillisW88 2003-12-15 Modelling Natural Branching Structures. 105-115 1988 7 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/volume7/issue2/v07i2pp105-115_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#Waite88 2003-12-15 Incremental Polygon Rendering on a SIMD Processor Array. 331-341 1988 7 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/volume7/issue4/v07i4pp331-341_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#TheoharisP88 2003-12-15 Survey of Computer Animation. 281-300 1988 7 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/volume7/issue4/v07i4pp281-300_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#PueyoT88 2005-01-17 Architecture of Graphic Processors for Interactive 2D Graphics. 79-89 1988 7 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/volume7/issue2/v07i2pp79-89_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#FontenierG88 2006-10-05 3D Images of Molecular Properties by Triangulation of Contour Lines. 195-201 1988 7 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/volume7/issue3/v07i3pp195-201_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#RochWP88 2003-12-15 A Top Down Method for Interactive Drawing. 323-329 1988 7 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/volume7/issue4/v07i4pp323-329_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#Slater88 2003-12-15 Experience with Chisl, a Configurable Hierarchical Interface Specification Language. 117-127 1988 7 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/volume7/issue2/v07i2pp117-127_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#WoodGK88 2003-12-15 GRAFLOG: Understanding Drawings through Natural Language. 97-103 1988 7 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/volume7/issue2/v07i2pp97-103_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#PinedaKL88 2003-12-15 A Texture Mapping Approach to 3-D Facial Image Synthesis. 129-134 1988 7 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/volume7/issue2/v07i2pp129-134_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#YauD88 2003-12-15 Continuous Processing of Images through User Sketched Functional Blocks. 273-280 1988 7 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/volume7/issue4/v07i4pp273-280_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#KayaO88 2003-12-15 A Note on Random Thresholding for Colour Synthesis. 343-346 1988 7 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/volume7/issue4/v07i4pp343-346_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#LastraR88 2003-12-15 A Prolog Environment for GKS-Based Graphics. 9-20 1988 7 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/volume7/issue1/v07i1pp9-20_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#Milanese88 2003-12-16 Techniques for Animation on Microcomputers. 21-27 1988 7 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/volume7/issue1/v07i1pp21-27_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#NeelamkavilB88 2003-12-15 A Proposal for a Distributed Model of GKS Based on Prolog. 203-213 1988 7 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/volume7/issue3/v07i3pp203-213_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#Milanese88a 2003-12-15 Planar Convex Hull Algorithms in Theory and Practice. 177-193 1988 7 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/volume7/issue3/v07i3pp177-193_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#Day88 2003-12-15 Computer Generation of Penrose Tilings. 29-37 1988 7 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/volume7/issue1/v07i1pp29-37_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#Rangel-MondragonA88 2003-12-15 Construction of Interactive Programs in Computer Graphics. 161-176 1988 7 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/volume7/issue3/v07i3pp161-176_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#Dufourd88 2004-09-21 Some Remarks on the Modelling Clip Problem. 265-271 1988 7 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/volume7/issue4/v07i4pp265-271_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#HermanR88 2003-12-15 Dialogue Cell Resource Model and Basic Dialogue Cells. 311-322 1988 7 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/volume7/issue4/v07i4pp311-322_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#SchoutenH88 2003-12-15 Adding Namesets and Workstation Filters to GKS: a Future Extension. 3-7 1988 7 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/volume7/issue1/v07i1pp3-7_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#Bakker88 2003-12-15 A Processor for an Object-Oriented Rendering System. 301-310 1988 7 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/volume7/issue4/v07i4pp301-310_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#Schneider88 2003-12-15 The Use of Digital Signal Processors in Computer Graphics. 91-96 1988 7 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/volume7/issue2/v07i2pp91-96_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#BlandB88 2003-12-15 Theoretical Developments on Polygonal Approximation of Parametric Surfaces for Ray Tracing. 257-264 1988 7 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/volume7/issue4/v07i4pp257-264_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf7.html#Bouatouch88 2003-12-15 Using a Transputer Ring to Transform Raster Images. 151-158 1989 8 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/volume8/issue2/v08i2pp151-158_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#RushM89 2005-04-26 Towards an Object-Oriented Interaction Model for Graphics User Interfaces. 207-217 1989 8 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/volume8/issue3/v08i3pp207-217_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#HubnerL89 2003-12-15 Developing an Animated Local Network Simulator. 139-142 1989 8 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/volume8/issue2/v08i2pp139-142_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#Perez-CazaresR89 2003-12-15 Photosimulation: Interreflection with Arbitrary Reflectance Models and Illuminations. 21-34 1989 8 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/volume8/issue1/v08i1pp21-34_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#NeumannN89 2003-12-15 Anti-aliased Ray Tracing with Covers. 325-336 1989 8 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/volume8/issue4/v08i4pp325-336_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#ThomasNF89 2003-12-15 SIAS, Strokes Interpreted Animated Sequences. 35-47 1989 8 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/volume8/issue1/v08i1pp35-47_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#Berkel89 2003-12-15 A Method for the Representation, Evaluation and Display of CSG Models in PHIGS and PHIGS+. 337-345 1989 8 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/volume8/issue4/v08i4pp337-345_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#Patel89 2003-12-15 Algorithm for Clipping Arbitrary Polygons. 183-191 1989 8 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/volume8/issue3/v08i3pp183-191_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#Andreev89 2004-09-28 On Implementing Parallel GKS. 13-19 1989 8 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/volume8/issue1/v08i1pp13-19_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#ArnoldH89 2004-09-21 Faster Phong Shading via Angular Interpolation. 315-324 1989 8 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/volume8/issue4/v08i4pp315-324_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#KuijkB89 2003-12-15 A Transputer Network for Fast Operations on Digitised Images. 3-11 1989 8 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/volume8/issue1/v08i1pp3-11_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#ArabniaO89 2003-12-15 The CGM Today and Tomorrow. 125-128 1989 8 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/volume8/issue2/v08i2pp125-128_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#Mumford89 2003-12-15 Image Representations Using Miranda Laws. 99-106 1989 8 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/volume8/issue2/v08i2pp99-106_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#Parsons89 2003-12-15 The Line-Picture Attribute. 129-132 1989 8 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/volume8/issue2/v08i2pp129-132_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#Gossling89 2003-12-15 The Problematics of Human Prototyping and Animation. 115-123 1989 8 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/volume8/issue2/v08i2pp115-123_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#Magnenat-ThalmannT89 2003-12-15 The Controller Animation System. 133-138 1989 8 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/volume8/issue2/v08i2pp133-138_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#JohnW89 2003-12-15 On The Projective Invariant Representation of Conics in Computer Graphics. 301-314 1989 8 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/volume8/issue4/v08i4pp301-314_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#Herman89 2003-12-15 The Incremental Display of a Single-Valued Curve. 159-165 1989 8 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/volume8/issue2/v08i2pp159-165_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#SmithL89 2003-12-15 Hidden Octree Removal. 199-206 1989 8 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/volume8/issue3/v08i3pp199-206_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#Heal89 2003-12-15 Mass Market Applications for Real Time 3D Graphics. 143-150 1989 8 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/volume8/issue2/v08i2pp143-150_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#PlummerP89 2006-11-02 Notes on the Mathematics of the PHIGS Viewing Pipeline. 219-226 1989 8 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/volume8/issue3/v08i3pp219-226_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#Krammer89 2003-12-15 Polygon Triangulation Algorithm as a Powerful Core Processor of PLAN-I. 193-198 1989 8 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/volume8/issue3/v08i3pp193-198_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#ChenY89 2003-12-15 Yet another Remark on the Modelling Clip Problem. 237-238 1989 8 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/volume8/issue3/v08i3pp237-238_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#Zachrisen89 2003-12-15 A Parallel HW/SW Environment for Image Synthesis. 227-236 1989 8 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/volume8/issue3/v08i3pp227-236_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#PaoluzziRS89 2003-12-15 A Framework for Functional Specification and Transformation of Hidden Surface Elimination Alogorithms. 75-98 1989 8 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/volume8/issue2/v08i2pp75-98_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf8.html#LakshiminarasimhamS89 2003-12-15 An Approach to Hierarchical Input Devices. 15-26 1990 9 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/Volume9/Issue1/v09i1pp15-26_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#DuceLH90 2003-12-15 IFSs and Interactive Image Synthesis. 127-137 1990 9 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/Volume9/Issue2/v09i2pp127-137_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#Horn90 2003-12-15 Factoring a Homogeneous Transformation for a more Efficient Graphics Pipeline. 245-255 1990 9 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume9/Issue3/v09i3pp245-255_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#Abi-EzziW90 2003-12-15 Modelling Clip: Some More Results. 101-107 1990 9 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/Volume9/Issue2/v09i2pp101-107_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#HublH90 2003-12-15 A Prolog Rule-Based System for Cartographic Name Placement. 109-126 1990 9 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/Volume9/Issue2/v09i2pp109-126_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#CookJ90 2003-12-15 A Direct Manipulation Technique for Specifying 3D Object Transformations with a 2D Input Device. 355-361 1990 9 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/Volume9/Issue4/v09i4pp355-361_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#Emmerik90 2003-12-15 Project DIGIS Building Interactive Applications by Direct Manipulation. 181-193 1990 9 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume9/Issue3/v09i3pp181-193_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#BosL90 2003-12-15 Combining Graphics and Windowing Standards in the XGKS System. 229-237 1990 9 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume9/Issue3/v09i3pp229-237_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#RogersSK90 2003-12-15 Rational Zoom of Bit Maps Using B-Spline Interpolation in Computerized 2-D Animation. 27-37 1990 9 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/Volume9/Issue1/v09i1pp27-37_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#DurandF90 2003-12-15 A Browser for Large Directed Graphs. 195-204 1990 9 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume9/Issue3/v09i3pp195-204_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#Bovey90 2003-12-15 Language for Description of Geometric Configurations. 9-13 1990 9 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/Volume9/Issue1/v09i1pp9-13_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#BarbicS90 2003-12-15 An Efficient Circle-Drawing Algorithm. 333-336 1990 9 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/Volume9/Issue4/v09i4pp333-336_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#Kuzmin90 2005-06-03 Graphics Object Management in The X Window System. 93-99 1990 9 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/Volume9/Issue2/v09i2pp93-99_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#DavisonSS90 2003-12-15 Node Partitioning in an Octree Display Pipeline. 205-211 1990 9 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume9/Issue3/v09i3pp205-211_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#Heal90 2003-12-15 The Implementation of a 2D Convex Hull Algorithm Using Perturbation. 309-316 1990 9 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/Volume9/Issue4/v09i4pp309-316_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#Day90 2003-12-15 TopDraw: A Structure Network Visualiser for PHIGS. 139-147 1990 9 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/Volume9/Issue2/v09i2pp139-147_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#Howard90 2003-12-15 GosiP: A GKS-3D Shell for PHIGS. 317-326 1990 9 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/Volume9/Issue4/v09i4pp317-326_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#French90 2005-09-12 Using GKS Concurrently: a Practical Solution. 239-244 1990 9 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume9/Issue3/v09i3pp239-244_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#FloresCPHA90 2003-12-15 Dürer, Gaskets and Barnsley's Chaos Game. 327-332 1990 9 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/Volume9/Issue4/v09i4pp327-332_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#Jones90 2003-12-15 KADMOS: A Clausal Language for CAD Modeling Systems with Morphological Constraints. 39-51 1990 9 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/Volume9/Issue1/v09i1pp39-51_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#Milanese90 2006-11-09 3D Display: Synthetic Image Generation and Visual Effect Simulation. 337-348 1990 9 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/Volume9/Issue4/v09i4pp337-348_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#TheoharisTW90 2003-12-15 The Douglas-Peucker Algorithm for Line Simplification: Re-evaluation through Visualization. 213-228 1990 9 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume9/Issue3/v09i3pp213-228_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#VisvalingamW90 2003-12-15 Parametric Surfaces in PHIGS PLUS a New Chance for Patterning and Hatching? 3-8 1990 9 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/Volume9/Issue1/v09i1pp3-8_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf9.html#Bakker90 2003-12-16 Block Iterations in the Complex Plane. 67-70 1991 10 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/Volume10/issue1/v10i1pp67-70_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#Szyszkowicz91 2003-12-16 Million-Point Sculptures. 333-336 1991 10 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/Volume10/issue4/v10i4pp333-336_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#Pickover91a 2003-12-16 A Picture Archive Browser. 49-59 1991 10 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/Volume10/issue1/v10i1pp49-59_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#WillisH91 2003-12-16 Inverse Displacement Mapping. 129-139 1991 10 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/Volume10/issue2/v10i2pp129-139_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#PattersonHL91 2003-12-16 Quadtrees, Transforms and Image Coding. 91-96 1991 10 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/Volume10/issue2/v10i2pp91-96_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#MartinA91 2003-12-16 Object-Oriented Data Modelling for Graphics Databases: a Declarative Approach. 297-308 1991 10 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/Volume10/issue4/v10i4pp297-308_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#BhallaB91 2003-12-16 Classification of Quad-encoding Techniques. 97-112 1991 10 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/Volume10/issue2/v10i2pp97-112_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#HunterW91 2003-12-16 From Math Comes Beauty: Monkey Curves, Spirals, and Saddles. 329-331 1991 10 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/Volume10/issue4/v10i4pp329-331_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#Pickover91 2003-12-16 Triangle Sets in PHIGS PLUS: a Valuable Link with Finite Element Modeling. 61-65 1991 10 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/Volume10/issue1/v10i1pp61-65_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#Bakker91 2003-12-16 Search for the Intersection Polygon of any Two Polygons: Application to the Garment Industry. 195-208 1991 10 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume10/issue3/v10i3pp195-208_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#MangenL91 2004-03-12 Fat curves. 237-248 1991 10 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume10/issue3/v10i3pp237-248_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#YaoR91 2003-12-16 Simultaneous Generation of Stereoscopic Views. 3-10 1991 10 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/Volume10/issue1/v10i1pp3-10_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#AdelsonBCHW91 2003-12-16 The Formal Specification of Level l a of GKS. 11-25 1991 10 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/Volume10/issue1/v10i1pp11-25_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#Damnjanovic91 2003-12-16 Development of an Intelligent Wheelchair Using Computer Graphics Animation and Simulation. 285-295 1991 10 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/Volume10/issue4/v10i4pp285-295_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#OjalaIST91 2003-12-16 At Last an ISO C Binding of GKS. 249-254 1991 10 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume10/issue3/v10i3pp249-254_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#Bakker91a 2003-12-16 Cartographic Algorithms: Problems of Implementation and Evaluation and the Impact of Digitising Errors. 225-235 1991 10 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume10/issue3/v10i3pp225-235_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#VisvalingamW91 2003-12-16 Inspection of Lace Using Machine Vision. 113-119 1991 10 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/Volume10/issue2/v10i2pp113-119_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#Norton-Wayne91 2003-12-16 Computer Art from Numerical Methods. 255-259 1991 10 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume10/issue3/v10i3pp255-259_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#Szyszkowicz91b 2003-12-16 A Survey of Several Root-Finding Methods in the Complex Plane. 141-144 1991 10 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/Volume10/issue2/v10i2pp141-144_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#Szyszkowicz91a 2003-12-16 A Physically Based Colour Model. 121-127 1991 10 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/Volume10/issue2/v10i2pp121-127_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#OddyW91 2003-12-16 A Methodology And Tool Set For Supporting The Development Of Graphical User Interfaces. 37-47 1991 10 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/Volume10/issue1/v10i1pp37-47_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#NeelamkavilM91 2003-12-16 The GKS Input Model in MANIFOLD. 209-224 1991 10 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume10/issue3/v10i3pp209-224_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#SoedeAHH91 2003-12-16 Integrating PHIGS and User Interface Systems. 27-36 1991 10 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/Volume10/issue1/v10i1pp27-36_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#HardenberghM91 2003-12-16 The Shortest Way to Draw a Connected Picture. 319-327 1991 10 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/Volume10/issue4/v10i4pp319-327_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#SeeboldS91 2003-12-16 Control Points for Multivariate B-Spline Surfaces over Arbitrary Triangulations. 309-317 1991 10 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/Volume10/issue4/v10i4pp309-317_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf10.html#FongS91 2003-12-16 Computing Dynamic Changes to BSP Trees. 321-332 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp321-332_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#ChrysanthouS92 2003-12-16 Pandora: An Experiment in Distributed Multimedia. 23-34 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp23-34_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#King92 2004-09-20 X: Why Z? 221-234 1992 11 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/Volume11/Issue4/v11i4pp221-234_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#Bowen92 2003-12-16 Survey of Continuities of Curves and Surfaces. 93-112 1992 11 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/Volume11/Issue2/v11i2pp93-112_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#Veltkamp92 2003-12-16 Reference, Synthesis and Constraint Sat isfaction. 333-344 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp333-344_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#Pineda92 2003-12-16 Equidistant Smoothing of Polyhedra with Arbitrary Topologies. 405-414 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp405-414_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#MaLP92 2003-12-16 Two-manifold cell-decomposition of r-sets.. 391-404 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp391-404_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#FalcidienoR92 2003-12-16 PHIFI : A PHIGS Interactive System for the Visualization of Scalar and Vector Fields. 139-149 1992 11 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/Volume11/Issue2/v11i2pp139-149_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#AscaniM92 2005-05-23 Accurate Image Generation and Interactive Image Editing with the A-buffer. 279-288 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp279-288_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#LauW92 2003-12-16 Ray Tracing and Graphics Standards. 55-60 1992 11 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/Volume11/Issue1/v11i1pp55-60_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#UrbanH92 2003-12-16 HAGI, a High-level Application/Graphics Interface. 71-80 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp71-80_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#HsuK92 2003-12-16 A Simple Description of Complex Curves. 425-433 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp425-433_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#BourasSV92 2003-12-16 A Cooperative Architecture for Hypermedia Editing - CoMEdiA. 309-322 1992 11 Comput. Graph. Forum 5 http://www.eg.org/EG/CGF/Volume11/Issue5/v11i5pp309-322_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#Santos92 2003-12-16 Modeling with Time and Events in Computer Animation. 45-58 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp45-58_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#KalraB92 2003-12-16 An adaptive Discretization Method For Radiosity. 205-216 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp205-216_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#LanguenouBT92 2003-12-16 Integer de Casteljau Algorithm for Rasterizing NURBS Curves. 151-162 1992 11 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/Volume11/Issue2/v11i2pp151-162_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#AnantakrishnanP92 2003-12-16 Modelling and Programming Evolutions of Surfaces. 323-341 1992 11 Comput. Graph. Forum 5 http://www.eg.org/EG/CGF/Volume11/Issue5/v11i5pp323-341_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#ChenL92 2003-12-16 The Parametric Differential Method: An Alternative to the Calculation of Form Factors. 193-204 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp193-204_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#Baranoski92 2003-12-16 Fractals and Solid Modeling. 415-424 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp415-424_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#Groller92 2004-07-23 Interactive Shape Control of Interpolating B-splines. 435-447 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp435-447_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#KrokosS92 2003-12-16 A Statistical Comparison of Two Hidden Surface Techniques : the Scan-line and Z-buffer Algorithms. 131-138 1992 11 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/Volume11/Issue2/v11i2pp131-138_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#SlaterDDKBM92 2005-06-21 Radiosity in Flatland. 181-192 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp181-192_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#Heckhert92 2003-12-16 A CAD System for Color Design of a Car. 381-390 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp381-390_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#OshimaYSO92 2003-12-16 Area Sampling Buffer: Tracing Rays with Z-Buffer Hardware. 299-310 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp299-310_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#Sung92 2003-12-16 Stochastic Motion-Motion Under the Influence of Wind. 119-128 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp119-128_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#ShinyaF92 2003-12-16 Affine Texture Mapping and Antialiasing Using Integer Arithmetic. 227-236 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp227-236_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#NehligG92 2003-12-16 Fast Generation and Surface Structuring Methods for Terrain and Other Natural Phenomena. 169-180 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp169-180_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#KohH92 2005-01-27 Formal Specification in the Revision of GKS: An Illustrative Example. 17-30 1992 11 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/Volume11/Issue1/v11i1pp17-30_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#DuceD92 2003-12-16 Hidden Surface Elimination on Parallel Processors. 293-307 1992 11 Comput. Graph. Forum 5 http://www.eg.org/EG/CGF/Volume11/Issue5/v11i5pp293-307_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#HighfieldB92 2003-12-16 Combined Direct and Inverse Kinematic Control for Articulated Figure Motion Editing. 189-202 1992 11 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/Volume11/Issue4/v11i4pp189-202_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#BoulicT92 2003-12-16 Realistic Generation and Real Time Animation of Images of the Human Colon. 367-379 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp367-379_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#HaritsisGW92 2003-12-16 A Unified Approach for Physical and Geometric Modeling for Graphics and Animation. 129-138 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp129-138_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#EssaSP92 2003-12-16 A Development Environment for Constructing Graph-Based Editing Tools. 345-355 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp345-355_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#ChenTW92 2003-12-16 A Graphic Programming Environment Based on KAAMOS. 3-16 1992 11 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/Volume11/Issue1/v11i1pp3-16_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#DulliM92 2003-12-16 The Fractal Nature of an Ecological Model. 61-64 1992 11 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/Volume11/Issue1/v11i1pp61-64_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#BennanY92 2003-12-16 A line clipping algorithm and its analysis. 253-266 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp253-266_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#Krammer92 2003-12-16 A Computer Model For Pinscreen Simulation : A New Animation Paradigm. 31-42 1992 11 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/Volume11/Issue1/v11i1pp31-42_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#LopesG92 2003-12-16 The Graphical Translation of English Text into Signed English in the Hand Sign Translator System. 357-366 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp357-366_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#HoldenR92 2003-12-16 Geometric and Group-theoretic Methods for Computer Graphic Studies of Islamic Symmetric Patterns. 43-53 1992 11 Comput. Graph. Forum 1 http://www.eg.org/EG/CGF/Volume11/Issue1/v11i1pp43-53_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#AbasS92 2003-12-16 A Functional Approach to the Visual Simulation of Gaseous Turbulence. 107-117 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp107-117_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#SakasW92 2003-12-16 Adaptive Sampling of Area Light Sources in Ray Tracing Including Diffuse Interreflection. 289-298 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp289-298_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#KokJ92 2003-12-16 Visual Composition and Multimedia. 9-22 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp9-22_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#MeyBDGT92 2003-12-16 SX/Tools - An Open Design Environment for Adaptable Multimedia User Interfaces. 93-105 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp93-105_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#KuhmeS92 2003-12-16 Composing Hierarchically Structured Images. 311-320 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp311-320_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#PattersonC92 2004-09-21 Rendering NURB Regions For 2D Animation. 35-44 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp35-44_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#WillisO92 2003-12-16 Template-Based Volume Viewing. 153-167 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp153-167_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#YagelK92 2003-12-16 A New Two Dimensional Line Clipping Algorithm for Small Windows. 241-245 1992 11 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/Volume11/Issue4/v11i4pp241-245_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#Day92 2003-12-16 Representing Conics using NURBS of Degree Two. 285-291 1992 11 Comput. Graph. Forum 5 http://www.eg.org/EG/CGF/Volume11/Issue5/v11i5pp285-291_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#QinJW92 2003-12-16 Consistent Schemes for Addressing Surfaces when Ray Tracing Transparent CSG Objects. 203-211 1992 11 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/Volume11/Issue4/v11i4pp203-211_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#Gervautz92 2003-12-16 The Visualization Input Pipeline - Enabling Semantic Interaction in Scientific Visualization. 139-151 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp139-151_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#FelgerS92 2003-12-16 A Run-Length Slice Line Drawing Algorithm without Division Operations. 267-277 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp267-277_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#FungND92 2004-03-03 Ray Coherence Between a Sphere and a Convex Polyhedron. 163-172 1992 11 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/Volume11/Issue2/v11i2pp163-172_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#HorvathMRS92 2006-10-18 An Open Model for Hypermedia and Its Application to Geographical Information Systems. 1-7 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp1-7_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#HallS92 2003-12-16 Normal orientation methods for 3D offset curves, sweep surfaces and skinning. 449-457 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp449-457_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#SiltanenW92 2003-12-16 An Efficient Adaptive Algorithm for Constructing the Convex Differences Tree of a Simple Polygon. 235-240 1992 11 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/Volume11/Issue4/v11i4pp235-240_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#Rappoport92 2003-12-16 An Object-Oriented View of the User Interface. 81-92 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp81-92_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#ZhouK92 2003-12-16 Modelling the Texture of Paint. 217-226 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp217-226_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#CockshottPE92 2003-12-16 The Input Model of Standard Graphics Systems Revisited by Formal Specification. 237-251 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp237-251_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#FacontiZP92 2003-12-16 Simulation of Facial Muscle Actions Based on Rational Free Form Deformations. 59-69 1992 11 Comput. Graph. Forum 3 http://www.eg.org/EG/CGF/Volume11/Issue3/v12i3pp59-69_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#KalraMMT92 2003-12-16 User Interface Management Systems for Engineering Applications. 113-129 1992 11 Comput. Graph. Forum 2 http://www.eg.org/EG/CGF/Volume11/Issue2/v11i2pp113-129_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#Sastry92 2003-12-16 Performance of Space Subdivision Techniques in Ray Tracing. 213-220 1992 11 Comput. Graph. Forum 4 http://www.eg.org/EG/CGF/Volume11/Issue4/v11i4pp213-220_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf11.html#McNeillSHLG92 2003-12-18 Dynamics and Chaos: The Spherical Pendulum. 263-270 1996 15 Comput. Graph. Forum 4 http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf15.html#PalaciosGR96 http://www.eg.org/EG/CGF/volume15/issue4/v15i4pp263-270_abstract.html 2004-09-21 Making Drawings Talk: Pictures in Minds and Machines. 289-298 1987 6 Comput. Graph. Forum 4 http://diglib.eg.org/EG/CGF/volume6/issue4/v06i4pp289-298_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#Bijl87 2004-09-21 Systolic Architecture for Boolean Operations on Polygons and Polyhedra. 203-210 1987 6 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume6/issue3/v06i3pp203-210_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#KrishnanP87 2004-09-21 Sight - A Dedicated Computer Graphics Machine. 327-334 1987 6 Comput. Graph. Forum 4 http://diglib.eg.org/EG/CGF/volume6/issue4/v06i4pp327-334_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#NaruseYTN87 2004-09-21 A Scanline Method for Solid Model Display. 141-150 1987 6 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume6/issue2/v06i2pp141-150_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#PatelH87 2004-09-21 A Simple and Efficient Haloed Line Algorithm for Hidden Line Elimination. 103-109 1987 6 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume6/issue2/v06i2pp103-109_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#FranklinA87 2004-09-21 An Experiment In Algorithm Animation using SMALLTALK on a Macintosh. 151-155 1987 6 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume6/issue2/v06i2pp151-155_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#Mohamed87 2004-10-26 Graphic Acquisition and Retrieval of Stereochemical Information. 309-316 1987 6 Comput. Graph. Forum 4 http://diglib.eg.org/EG/CGF/volume6/issue4/v06i4pp309-316_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#DuboisCG87 2004-09-21 Graphics, Bifurcation, Order and Chaos. 26-33 1987 6 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume6/issue1/v06i1pp26-33_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#Pickover87 2004-09-21 Logical Input Devices and Interaction. 348-357 1987 6 Comput. Graph. Forum 4 http://diglib.eg.org/EG/CGF/volume6/issue4/v06i4pp348-357_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#LiereH87 2004-09-21 Using Abstract Data Types To Define Large-scale World Models For Image Generation Systems. 77-85 1987 6 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume6/issue2/v06i2pp77-85_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#MarshG87 2004-09-21 An Implementer's View of CGM in GKS Environment. 91-101 1987 6 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume6/issue2/v06i2pp91-101_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#MoltedoN87 2004-09-21 Graphics in Reservoir Simulation. 111-117 1987 6 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume6/issue2/v06i2pp111-117_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#Watkins87 2004-09-21 Evaluation of Standard Graphics Packages. 299-308 1987 6 Comput. Graph. Forum 4 http://diglib.eg.org/EG/CGF/volume6/issue4/v06i4pp299-308_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#Klok87 2004-09-21 An Intersecting Modification to the Bresenham Algorithm for Hidden-Line Solution. 343-347 1987 6 Comput. Graph. Forum 4 http://diglib.eg.org/EG/CGF/volume6/issue4/v06i4pp343-347_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#Skala87 2004-09-21 Irregular Polygon Fill Using Contour Encoding. 317-326 1987 6 Comput. Graph. Forum 4 http://diglib.eg.org/EG/CGF/volume6/issue4/v06i4pp317-326_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#GourretP87 2004-09-21 ADA and NIL: Two Concurrent Languages for GKS. 219-233 1987 6 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume6/issue3/v06i3pp219-233_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#Milanese87 2004-09-21 Arbitrary Rotation of Raster Images with SIMD Machine Architectures. 3-11 1987 6 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume6/issue1/v06i1pp03-11_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#ArabniaO87 2004-09-21 Graphical Interaction Management. 119-124 1987 6 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume6/issue2/v06i2pp119-124_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#BarnW87 2004-09-21 Graphical Analysis of Complex O.D.E. Solutions. 335-342 1987 6 Comput. Graph. Forum 4 http://diglib.eg.org/EG/CGF/volume6/issue4/v06i4pp335-342_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#Richard87 2004-09-21 Visual Simulation of Atmospheric Haze. 35-41 1987 6 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume6/issue1/v06i1pp35-41_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#Willis87 2004-09-21 Scan Converting Extruded Lines at Ultra High Definition. 133-140 1987 6 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume6/issue2/v06i2pp133-140_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#WattersW87a 2004-09-21 An Economic High Performance Pixel Memory with 3-D Solids Capability. 13-25 1987 6 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume6/issue1/v06i1pp13-25_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#Belch87 2004-09-21 RasterCalc: Calculus for Operations on Graphics Colour Rasters . 181-193 1987 6 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume6/issue3/v06i3pp181-193_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#Bos87 2006-10-27 The CGM - A Metafile for GKS? 87-90 1987 6 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume6/issue2/v06i2pp87-90_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#BrodlieHM87 2004-09-21 A User-Interface Toolkit in Object-Oriented POSTSCRIPT. 171-179 1987 6 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume6/issue3/v06i3pp171-179_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#DensmoreR87 2004-09-21 Filling Complex Polygons by Region-Fill Methods on Raster Graphics Terminals. 49-54 1987 6 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume6/issue1/v06i1pp49-54_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#Richards87 2004-09-21 Preserving the Area of Regions. 43-48 1987 6 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume6/issue1/v06i1pp43-48_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#Williams87 2004-09-21 UltraPaint: A New Approach to a Painting System. 125-132 1987 6 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume6/issue2/v06i2pp125-132_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#WattersW87 2004-09-21 Some Aspects of Binding GKS to C++ . 211-218 1987 6 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume6/issue3/v06i3pp211-218_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#Richards87a 2004-09-21 New Methods for Improving the GKS Fill Area Output Primitive. 195-201 1987 6 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume6/issue3/v06i3pp195-201_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf6.html#HermanR87 2004-09-21 Automatic View Selection Using Viewpoint Entropy and its Applications to Image-based Modelling. 689-700 2003 22 Comput. Graph. Forum 4 http://diglib.eg.org/EG/CGF/volume22/issue4/CGF_717.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#VazquezFSH03 2004-09-21 Freeform Shape Representations for Efficient Geometry Processing. 221 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_667.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#Kobbelt03 2004-09-21 ShieldTester: Cell-to-Cell Visibility Test for Surface Occluders. 291-302 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_676.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#NavazoRJS03 2004-09-21 BRDF Measurement Modelling using Wavelets for Efficient Path Tracing. 701-716 2003 22 Comput. Graph. Forum 4 http://diglib.eg.org/EG/CGF/volume22/issue4/CGF_718.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#ClaustresPB03 2004-09-21 Real-Time Consensus-Based Scene Reconstruction Using Commodity Graphics Hardware. 207-216 2003 22 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume22/issue2/cgf_661.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#YangWB03 2004-09-21 State of the Art in Global Illumination for Interactive Applications and High-quality Animations. 55-78 2003 22 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume22/issue1/cgf_646.htm http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#DamezDM03 2004-09-21 Bias Compensation for Photon Maps. 729-742 2003 22 Comput. Graph. Forum 4 http://diglib.eg.org/EG/CGF/volume22/issue4/CGF_720.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#Roland03 2004-09-21 Sub-Voxel Topology Control for Level-Set Surfaces. 273-280 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_674.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#BischoffK03 2004-09-21 Real-Time Caustics. 611-620 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_709.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#WandS03 2004-09-21 Local Exact Particle Tracing on Unstructured Grids. 133-142 2003 22 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume22/issue2/cgf_655.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#KipferRG03 2004-09-21 Image Categorization using Color Blobs in a Mobile Environment. 427-432 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_690.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#RuizTN03 2004-09-21 Soft Object Modelling with Generalised ChainMail - Extending the Boundaries of Web-based Graphics. 717-728 2003 22 Comput. Graph. Forum 4 http://diglib.eg.org/EG/CGF/volume22/issue4/CGF_719.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#LiB03 2004-09-21 Planning Collision-Free Reaching Motions for Interactive Object Manipulation and Grasping. 313-322 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_678.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#KallmannAAT03 2004-09-21 Animation of Bubbles in Liquid . 253-262 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_672.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#HongK03 2004-09-21 Compression of 2D Vector Fields Under Guaranteed Topology Preservation. 333-342 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_680.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#TheiselR03 2004-09-21 On Visual Similarity Based 3D Model Retrieval. 223-232 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_669.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#ChenTSO03 2006-07-25 Two-dimensional Potential Fields for Advanced Implicit Modeling Operators. 23-34 2003 22 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume22/issue1/cgf_643.htm http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#BartheDSWG03 2004-09-21 Approximating Parametric Curves With Strip Trees Using Affine Arithmetic. 171-180 2003 22 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume22/issue2/cgf_658.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#FigueiredoSV03 2004-09-21 The Scale Method for Blending Operations in Functionally-Based Constructive Geometry. 143-158 2003 22 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume22/issue2/cgf_656.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#HsuL03 2004-09-21 Field Functions for Blending Range Controls on Soft Objects. 233-242 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_670.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#HsuL03a 2004-09-21 Visyllable Based Speech Animation. 632-640 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_711.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#KshirsagarM03 2004-09-21 Reanimating Faces in Images and Video. 641-650 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_712.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#BlanzBPV03 2004-09-21 Multiresolution Surface Representation Based on Displacement Volumes. 483-492 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_696.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#BotschK03 2004-10-07 Hierarchical and Heterogenous Reactive Agents for Real-Time Applications. 323-332 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_679.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#NiederbergerG03 2004-09-21 Ray Tracing Surfaces with Contours. 743-752 2003 22 Comput. Graph. Forum 4 http://diglib.eg.org/EG/CGF/volume22/issue4/CGF_721.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#BalsysS03 2004-09-23 Adaptive Ray Tracing of Subdivision Surfaces. 553-562 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_703.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#MullerTF03 2004-09-21 Automatic Texture Atlas Generation from Trimmed NURBS Models. 453-462 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_693.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#GutheK03 2004-09-21 Beyond Stippling - Methods for Distributing Objects on the Plane. 515-522 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_699.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#HillerHD03 2005-06-29 Rendering and Affect. 359-368 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_683.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#DukeBHM03 2004-09-21 Hierarchical Higher Order sFace Cluster Radiosity for Global Illumination Walkthroughs of Complex Non-Diffuse Environments. 563-572 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_704.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#GobbettiSA03 2006-01-02 Adaptive Logarithmic Mapping For Displaying High Contrast Scenes. 419-426 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_689.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#DragoMAC03 2004-09-21 Image Based Interactive Rendering with View Dependent Geometry. 573-582 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_705.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#Evers-SenneK03 2004-09-21 Efficient Modeling of An Anatomy-Based Face and Fast 3D Facial Expression Synthesis. 159-170 2003 22 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume22/issue2/cgf_657.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#ZhangPS03 2004-10-25 Precise Ink Drawing of 3D Models. 369-380 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_684.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#SousaFWS03 2004-09-21 3D Video Recorder: a System for Recording and Playing Free-Viewpoint Video. 181-194 2003 22 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume22/issue2/cgf_659.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#WurmlinLSG03 2004-09-21 Fast Photo-Realistic Rendering of Trees in Daylight. 243-252 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_671.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#QinNTN03 2004-09-21 Interactive Rendering of Translucent Objects. 195-206 2003 22 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume22/issue2/cgf_660.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#LenschGBKMLS03 2005-04-06 Quad/Triangle Subdivision. 79-86 2003 22 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume22/issue1/cgf_647.htm http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#StamL03 2004-09-21 Out-of-core Compression and Decompression of Large n-dimensional Scalar Fields. 343-348 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_681.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#IbarriaLRS03 2004-09-21 A Few Good Lines: Suggestive Drawing of 3D Models. 381-390 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_685.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#SousaP03 2004-09-21 Interactive Cutaway Illustrations. 523-532 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_700.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#DiepstratenWE03 2004-09-21 Automatic Hybrid Hierarchy Creation: a Cost-model Based Approach. 5-14 2003 22 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume22/issue1/cgf_641.htm http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#MassoL03 2004-09-21 Narrative Use of Sign Language by a Virtual Character for the Hearing Impaired. 651-660 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_713.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#RiegerB03 2006-03-17 Emotion Disc and Emotion Squares: Tools to Explore the Facial Expression Space. 49-54 2003 22 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume22/issue1/cgf_645.htm http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#RuttkayNH03 2005-09-05 Particle-Based Simulation of Fluids. 401-410 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_687.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#PremzoeTBLW03 2004-09-21 Open Issues in Photo-realistic Rendering. 222 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_668.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#Purgathofer03 2004-09-21 Interactive Rendering with Bidirectional Texture Functions. 463-472 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_694.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#SuykensBLD03 2004-10-25 Ray Differentials and Multiresolution Geometry Caching for Distribution Ray Tracing in Complex Scenes. 543-552 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_702.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#ChristensenLFWB03 2004-09-21 Progressive Hulls for Intersection Applications. 107-116 2003 22 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume22/issue2/cgf_653.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#PlatisT03 2004-09-21 Solving Geometric Optimization Problems using Graphics Hardware. 441-452 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_692.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#Denny03 2004-09-21 On the Optimality of Valence-based Connectivity Coding. 99-102 2003 22 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume22/issue1/cgf_649.htm http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#Gotsman03 2004-09-21 Interactive Design of Bonsai Tree Models. 591-600 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_707.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#BoudonPFGK03 2004-09-21 Recent Developments and Applications of Haptic Devices. 117-132 2003 22 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume22/issue2/cgf_654.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#LaycockD03 2005-09-15 Creation and Control of Real-time Continuous Level of Detail on Programmable. 35-48 2003 22 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume22/issue1/cgf_644.htm http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#SouthernG03 2004-09-21 Hierarchical Context-based Pixel Ordering. 349-358 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_682.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#Bar-JosephC03 2004-09-21 The State of the Art in Flow Visualisation: Feature Extraction and Tracking. 775-792 2003 22 Comput. Graph. Forum 4 http://diglib.eg.org/EG/CGF/volume22/issue4/CGF_723.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#PostVHLD03 2004-09-21 Progressive Simplification of Tetrahedral Meshes Preserving All Isosurface Topologies. 493-504 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_697.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#ChiangL03 2004-10-27 Volumetric Filtering, Modeling and Visualization for Nano-Medicine. 220 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_666.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#Bajaj03 2004-10-07 Multi-scale Feature Extraction on Point-sampled Surfaces. 281-290 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_675.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#PaulyKG03 2004-09-21 A Fast Rendering Method for Refractive and Reflective Caustics Due to Water Surfaces. 601-610 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_708.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#IwasakiDN03 2004-09-21 A Survey of Real-time Soft Shadows Algorithms. 753-774 2003 22 Comput. Graph. Forum 4 http://diglib.eg.org/EG/CGF/volume22/issue4/CGF_722.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#HasenfratzLHS03 2004-09-21 Planned Sampling of Spatially Varying BRDFs. 473-482 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_695.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#LenschLSS03 2004-09-21 Shadow Volumes on Programmable Graphics Hardware. 433-440 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_691.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#BrabecS03 2004-09-21 Realistic Animation of Fluid with Splash and Foam. 391-400 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_686.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#TakahashiFKHSTU03 2004-09-21 Volumetric Cell-and-Portal Generation. 303-312 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_677.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#HaumontDS03 2004-09-21 The Perspective Silhouette of a Canal Surface. 15-22 2003 22 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume22/issue1/cgf_642.htm http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#KimL03 2004-09-21 A Survey of Inverse Rendering Problems. 663-688 2003 22 Comput. Graph. Forum 4 http://diglib.eg.org/EG/CGF/volume22/issue4/CGF_716.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#PatowP03 2004-09-21 BDAM - Batched Dynamic Adaptive Meshes for High Performance Terrain Visualization. 505-514 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_698.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#CignoniGGMPS03 2004-09-21 Interpolating an Unlimited Number of Curves Meeting at Extraordinary Points on Subdivision Surfaces. 87-98 2003 22 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume22/issue1/cgf_648.htm http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#Nasri03 2004-09-21 A Scalable Approach to Interactive Global Illumination. 621-631 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_710.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#BenthinWS03 2004-09-21 Advanced Design for a Realistic Virtual Brush. 533-542 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_701.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#XuLTP03 2004-09-21 The Stringed Haptic Workbench: a New Haptic Workbench Solution. 583-590 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_706.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#TarrinCHBS03 2004-09-21 Animating Hair with Loosely Connected Particles. 411-418 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_688.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#BandoNC03 2004-09-21 Cloth Motion Capture. 263-272 2003 22 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume22/issue3/cgf_673.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf22.html#PritchardH03 2004-09-21 Hierarchical Retargetting of Fine Facial Motions. 687-695 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp687-695_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#NaJ04 2004-09-21 Rendering with Spherical Radiance Transport Maps. 281-290 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp281-290_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#MeiSW04 2004-09-21 Instant Volumetric Understanding with Order-Independent Volume Rendering. 489-498 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp489-498_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#MoraE04 2004-09-21 Modeling Trees with Hypertextures. 173-188 2004 23 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume23/issue2/v23i2pp173-188_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#StrnadG04 2004-09-21 Interference Detection for Subdivision Surfaces. 577-584 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp577-584_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#WuP04 2004-09-21 Procedural Texture Matching and Transformation. 461-468 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp461-468_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#BourqueD04 2004-09-21 Image Interpolation by Pixel-Level Data-Dependent Triangulation. 189-202 2004 23 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume23/issue2/v23i2pp189-202_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#SuW04 2004-09-21 Real-time Rigid Body Simulation for Haptic Interactions Based on Contact Volume of Polygonal Objects. 529-538 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp529-538_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#HasegawaS04 2004-09-21 Crowd of Virtual Humans: a New Approach for Real Time Navigation in Complex and Structured Environments. 509-518 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp509-518_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#LamarcheD04 2004-09-21 Approximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening. 381-390 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp381-390_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#ValetteC04 2004-09-21 Immersive Integration of Physical and Virtual Environments. 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3ppxix-xix_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#Fuchs04 2004-09-21 Scalable Behaviors for Crowd Simulation. 519-528 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp519-528_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#SungGC04 2005-12-23 An Integer One-Pass Algorithm for Voxel Traversal. 167-172 2004 23 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume23/issue2/v23i2pp167-171_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#LiuZY04 2004-09-21 Optimized Sub-Sampling of Point Sets for Surface Splatting. 643-652 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp643-652_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#WuK04 2004-09-21 Virtual Drypoint by a Model-driven Strategy. 431-440 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp431-440_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#TasakiMO04 2004-09-21 Synthesizing Sound from Turbulent Field using Sound Textures for Interactive Fluid Simulation. 539-546 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp539-546_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#DobashiYN04 2004-10-08 Computing Maximal Tiles and Application to Impostor-Based Simplification. 401-410 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp401-410_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#AndujarBCRNV04 2004-09-21 A Physically-Based Model for Rendering Realistic Scratches. 361-370 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/EG/CGF/volume23/issue3/v23i3pp361-370_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#BoschPMG04 2004-09-21 Space-Time Hierarchical Radiosity with Clustering and Higher-Order Wavelets. 129-142 2004 23 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume23/issue2/v23i2pp129-142_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#DamezHS04 2004-12-21 Implicit Visualization and Inverse Modeling of Growing Trees. 351-360 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp351-360_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#GalbraithMW04 2004-09-21 Real-time Light Animation. 291-300 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp291-300_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#SbertSS04 2004-09-21 Approximate Soft Shadows with an Image-Space Flood-Fill Algorithm. 271-280 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp271-280_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#ArvoHT04 2004-09-27 Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful. 615-624 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp615-624_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#BittnerWPP04 2004-09-21 Combined Correlated and Importance Sampling in Direct Light Source Computation and Environment Mapping. 585-594 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp585-594_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#SzecsiSS04 2004-09-21 Anisotropic Filtering of Non-Linear Surface Features. 391-400 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp391-400_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#HildebrandtP04 2004-09-21 Simulating and Modeling Lichen Growth. 341-350 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp341-350_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#DesbenoitGA04 2004-11-10 Prototype Modeling from Sketched Silhouettes based on Convolution Surfaces. 71-84 2004 23 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume23/issue1/v23i1pp071-083_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#TaiF04 2004-09-21 Applied Geometry: Discrete Differential Calculus for Graphics. 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3ppxx-xx_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#Desbrun04 2004-09-21 Point Cloud Collision Detection. 567-576 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp567-576_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#KleinZ04 2004-09-21 Way-Finder: Guided Tours Through Complex Walkthrough Models. 499-508 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp499-508_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#GranAG04 2004-09-21 A Viewpoint-Dependent Approach to Ray Trace Free-Form Surfaces. 143-156 2004 23 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume23/issue2/v23i2pp143-156_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#FormellaM04 2004-09-21 The State of the Art in Flow Visualization: Dense and Texture-Based Techniques. 203-222 2004 23 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume23/issue2/v23i2pp203-222_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#LarameeHDVPW04 2004-09-21 SMARTPAPER: An Interactive and User Friendly Sketching System. 301-310 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp301-310_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#SheshC04 2004-09-21 DiFi: Fast 3D Distance Field Computation Using Graphics Hardware. 557-566 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp557-566_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#SudOM04 2004-09-21 Implicit Fitting Using Radial Basis Functions with Ellipsoid Constraint. 55-70 2004 23 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume23/issue1/v23i1pp055-069_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#LiWPVGW04 2005-01-24 Cultural Heritage Preservation Using Constructive Shape Modeling. 25-42 2004 23 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume23/issue1/v23i1pp025-041_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#VilbrandtPPFVGGK04 2005-07-07 Visualizing Objects with Mirrors. 157-166 2004 23 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume23/issue2/v23i2pp157-166_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#HurtadoNRSS04 2004-09-21 Dye Advection without the Blur: A Level-Set Approach for Texture-Based Visualization of Unsteady Flow. 479-488 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp479-488_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#Weiskopf04 2004-09-21 Approximation of Optimal Voxel Size for Collision Detection in Maintainability Simulations within Massive Virtual Environments. 13-24 2004 23 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume23/issue1/v23i1pp013-023_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#BorroGM04 2004-09-21 Fast Multipath Radiosity using Hierarchical Subscenes. 43-54 2004 23 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume23/issue1/v23i1pp043-053_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#CastroSN04 2004-09-21 Quadric Transfer for Immersive Curved Screen Displays. 451-460 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp451-460_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#RaskarBWR04 2004-09-21 Distributed and Collaborative Visualization. 223-251 2004 23 Comput. Graph. Forum 2 http://diglib.eg.org/EG/CGF/volume23/issue2/v23i2pp223-251_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#BrodlieDGWW04 2005-07-26 High Resolution Acquisition, Learning and Transfer of Dynamic 3D Facial Expressions. 677-686 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp677-686_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#WangHLZLSMEH04 2004-09-21 Exchanging Faces in Images. 669-676 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp669-676_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#BlanzSVS04 2004-10-07 Hardware-Accelerated Rendering of Photo Hulls. 635-642 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp635-642_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#LiMS04 2004-09-21 Image-based Relighting and Computer Vision. 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3ppxxi-xxi_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#Dutre04 2004-09-21 Dupin Cyclide Blends Between Quadric Surfaces for Shape Modeling. 321-330 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp321-330_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#FoufouG04 2004-09-21 A System for View-Dependent Animation. 411-420 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp411-420_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#ChaudhuriKB04 2004-09-21 Balancing Considered Harmful - Faster Photon Mapping using the Voxel Volume Heuristic. 595-604 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp595-604_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#WaldGS04 2004-09-21 VOTS: VOlume doTS as a Point-Based Representation of Volumetric Data. 661-668 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp661-668_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#GrimmBKG04 2004-09-21 Measurement-Based Interactive Simulation of Viscoelastic Solids. 547-556 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp547-556_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#SchonerLS04 2004-09-21 An Eye Gaze Model for Dyadic Interaction in an Immersive Virtual Environment: Practice and Experience. 1-12 2004 23 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume23/issue1/v23i1pp001-011_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#VinayagamoorthyGSS04 2004-09-21 Hardware Lighting and Shading: a Survey. 85-112 2004 23 Comput. Graph. Forum 1 http://diglib.eg.org/EG/CGF/volume23/issue1/v23i1pp085-112_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#Kautz04 2004-09-21 Deferred Splatting. 653-660 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp653-660_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#GuennebaudBP04 2004-09-21 A Biophysically-Based Spectral Model of Light Interaction with Human Skin. 331-340 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp331-340_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#KrishnaswamyB04 2004-09-21 The Design of an Inexpensive Very High Resolution Scan Camera System. 441-450 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp441-450_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#WangH04 2004-09-21 Single-Strip Triangulation of Manifolds with Arbitrary Topology. 371-380 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp371-380_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#GopiE04 2004-09-21 Fast Surface Modelling Using a 6th Order PDE. 311-320 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp311-320_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#ZhangY04 2006-01-23 High Quality Hatching. 421-430 2004 23 Comput. Graph. Forum 3 http://dx.doi.org/10.1111/j.1467-8659.2004.00773.x http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#ZanderISS04 2004-09-21 GPU-Based Nonlinear Ray Tracing. 625-634 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp625-634_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#WeiskopfSE04 2004-09-21 Topological Construction and Visualization of Higher Order 3D Vector Fields. 469-478 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp469-478_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#WeinkaufTHS04 2004-09-21 A Progressive Rendering Algorithm Using an Adaptive Perceptually Based Image Metric. 605-614 2004 23 Comput. Graph. Forum 3 http://diglib.eg.org/EG/CGF/volume23/issue3/v23i3pp605-614_abstract.html http://www.informatik.uni-trier.de/~ley/db/journals/cgf/cgf23.html#FarrugiaP04 2003-07-29 Gypsy Reason: Niklas Luhmann's Sociological Enlightenment. 1999 6 Cybernetics and Human Knowing 3 http://www.imprint.co.uk/C&HK/vol6/v6_3-baecker.html http://www.informatik.uni-trier.de/~ley/db/journals/chk/chk6.html#Baecker99 2003-07-29 Software Development Process: Some Reflections on its Cultural, Political and Ethical Aspects from a Constructivist Epistemology Point of View. 1999 6 Cybernetics and Human Knowing 2 http://www.imprint.co.uk/C&HK/vol6/v6-2-floyd.html http://www.informatik.uni-trier.de/~ley/db/journals/chk/chk6.html#Floyd99 2003-07-29 Can Virtual Enterprises Build up an Own Identity? 1999 6 Cybernetics and Human Knowing 2 http://www.imprint.co.uk/C&HK/vol6/v6-2-paetau.html http://www.informatik.uni-trier.de/~ley/db/journals/chk/chk6.html#Paetau99 2003-07-29 Sign as Form. 1999 6 Cybernetics and Human Knowing 3 http://www.imprint.co.uk/C&HK/vol6/v6_3-luhmann.html http://www.informatik.uni-trier.de/~ley/db/journals/chk/chk6.html#Luhmann99 2003-07-29 Correlational Analysis of Complex Systems. 1999 6 Cybernetics and Human Knowing 3 http://www.imprint.co.uk/C&HK/vol6/v6_3-voorhees.html http://www.informatik.uni-trier.de/~ley/db/journals/chk/chk6.html#Voorhees99 2003-07-29 Step-by-Step: A Method to Support Self-organized Co-ordination within Workflow Management Systems. 1999 6 Cybernetics and Human Knowing 2 http://www.imprint.co.uk/C&HK/vol6/v6-2-just.html http://www.informatik.uni-trier.de/~ley/db/journals/chk/chk6.html#Just-HahnH99 2003-07-29 Sociotechnics and the Structuring of Meaning: Beyond the Idea of Autopoietic Social Systems. 1999 6 Cybernetics and Human Knowing 2 http://www.imprint.co.uk/C&HK/vol6/v6-2-keller.html http://www.informatik.uni-trier.de/~ley/db/journals/chk/chk6.html#Keller99 2003-07-29 Foreword - Niklas Luhmann: Cybernetics, Systems and Semiotics. 1999 6 Cybernetics and Human Knowing 3 http://www.imprint.co.uk/C&HK/vol6/v6-3ind.html http://www.informatik.uni-trier.de/~ley/db/journals/chk/chk6.html#Brier99 2003-07-29 Niklas Luhmann: "Sign as Form" - A comment. 1999 6 Cybernetics and Human Knowing 3 http://www.imprint.co.uk/C&HK/vol6/v6_3-ort.html http://www.informatik.uni-trier.de/~ley/db/journals/chk/chk6.html#OrtP99 2003-07-29 Self-Organising Social Systems: A Challenge to Computer Supported Cooperative Work - Introduction. 1999 6 Cybernetics and Human Knowing 2 http://www.imprint.co.uk/C&HK/vol6/v6-2ind.html http://www.informatik.uni-trier.de/~ley/db/journals/chk/chk6.html#ErikssonW99 2003-07-29 Evolving Cooperation when Introducing Groupware: A Self-Organization Perspective. 1999 6 Cybernetics and Human Knowing 2 http://www.imprint.co.uk/C&HK/vol6/v6-2-wulf.html http://www.informatik.uni-trier.de/~ley/db/journals/chk/chk6.html#Wulf99 2005-10-17 Proteus, a Grid based Problem Solving for Bioinformatics: Architecture and Experiments. 7-18 2004 3 IEEE Intelligent Informatics Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2004/Feb/2004/Feb/cib_vol3no1_article1.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib3.html#CannataroCSV04 2003-06-06 Message from the Editor-in-Chief. 3 2002 1 IEEE Computational Intelligence Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2002/cib_iss1a.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib1.html#Liu02 2003-08-01 USC/ISI Polymorphic Robotics Laboratory - Self-configurable and Adaptive Robots (Profile). 1-2 2003 2 IEEE Computational Intelligence Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2003/June/cib_vol2no1_profile.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib2.html#Shen03 2003-08-01 The 18th ACM Symposium on Applied Computing (Conference Review). 3-4 2003 2 IEEE Computational Intelligence Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2003/June/cib_vol2no1_confreview.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib2.html#Menezes03 2005-10-17 The Predicting Power of Textual Information on Financial Markets. 1-10 2005 5 IEEE Intelligent Informatics Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2005/Jun/iib_vol5no1_article1.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib5.html#FungYL05 2003-06-06 Blondie24, Playing at the Edge of AI (Book Review). 25-27 2002 1 IEEE Computational Intelligence Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2002/cib_iss1f.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib1.html#Harley02 2003-06-06 The BISON Project (Research Outlook). 6-9 2002 1 IEEE Computational Intelligence Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2002/cib_iss1c.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib1.html#MontresorB02 2003-06-06 Cork Constraint Computation Centre (Profile). 4-5 2002 1 IEEE Computational Intelligence Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2002/cib_iss1b.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib1.html#Freuder02 2003-06-06 Web-log Mining for Quantitative Temporal-Event Prediction. 10-18 2002 1 IEEE Computational Intelligence Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2002/cib_iss1d.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib1.html#YangWZ02 2005-10-17 Classification Rule Discovery with Ant Colony Optimization. 31-35 2004 3 IEEE Intelligent Informatics Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2004/Feb/2004/Feb/cib_vol3no1_article4.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib3.html#LiuAM04 2005-10-17 Identifying Global Exceptional Patterns in Multi-database Mining. 19-24 2004 3 IEEE Intelligent Informatics Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2004/Feb/2004/Feb/cib_vol3no1_article2.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib3.html#ZhangLNZ04 2005-10-17 A Partial-Repeatability Approach to Data Mining. 26-34 2005 5 IEEE Intelligent Informatics Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2005/Jun/iib_vol5no1_article4.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib5.html#CaiYZ05 2003-08-01 Mercure: Towards an Automatic E-mail Follow-up System. 14-18 2003 2 IEEE Computational Intelligence Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2003/June/cib_vol2no1_article2.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib2.html#LapalmeK03 2005-10-17 Data Mining: An AI Perspective. 23-26 2004 4 IEEE Intelligent Informatics Bulletin http://www.comp.hkbu.edu.hk/~cib/2004/Dec/iib_vol4no2_article3.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib4.html#Wu04 2003-06-06 Message from the TCCI Chair. 1-2 2002 1 IEEE Computational Intelligence Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2002/cib_iss1a.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib1.html#Wu02 2005-10-17 Mining Local Data Sources For Learning Global Cluster Models Via Model Exchange. 16-22 2004 4 IEEE Intelligent Informatics Bulletin http://www.comp.hkbu.edu.hk/~cib/2004/Dec/iib_vol4no2_article2.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib4.html#ZhangLC04 2005-10-17 Exploiting the Immune System for Computation (Profile). 1-2 2004 4 IEEE Intelligent Informatics Bulletin http://www.comp.hkbu.edu.hk/~cib/2004/Dec/iib_vol4no2_profile.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib4.html#Timmis04 2005-10-17 Spike-Based Sensing and Processing (Profile). 1-2 2004 3 IEEE Intelligent Informatics Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2004/Feb/cib_vol3no1_profile.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib3.html#Harris04 2005-10-17 A Support Environment for Domain Ontology Development with General Ontologies and Text Corpus. 25-30 2004 3 IEEE Intelligent Informatics Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2004/Feb/2004/Feb/cib_vol3no1_article3.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib3.html#SugiuraIY04 2003-08-01 Cross-Language Information Retrieval. 19-24 2003 2 IEEE Computational Intelligence Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2003/June/cib_vol2no1_article3.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib2.html#Nie03 2005-10-17 An On-Line Web Visualization System with Filtering and Clustering Graph. 11-17 2005 5 IEEE Intelligent Informatics Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2005/Jun/iib_vol5no1_article2.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib5.html#LaiHWT05 2005-10-17 2003 AAAI Robot Competition and Exhibition (Conference Reports). 5-6 2004 3 IEEE Intelligent Informatics Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2004/Feb/2004/Feb/cib_vol3no1_confreport2.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib3.html#Maxwell04 2005-10-17 Association-Based Segmentation for Chinese-Crossed Query Expansion. 18-25 2005 5 IEEE Intelligent Informatics Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2005/Jun/iib_vol5no1_article3.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib5.html#ZhangQY05 2005-10-17 Web-Based Semantic Pervasive Computing Services. 4-15 2004 4 IEEE Intelligent Informatics Bulletin http://www.comp.hkbu.edu.hk/~cib/2004/Dec/iib_vol4no2_article1.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib4.html#LeeCG04 2005-10-17 2003 IEEE/WIC International Joint Conference on Web Intelligence and Intelligent Agent Technology (Conference Reports). 3-4 2004 3 IEEE Intelligent Informatics Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2004/Feb/2004/Feb/cib_vol3no1_confreport1.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib3.html#Li04 2005-10-17 The CP-04 Workshop on CSP Techniques with Immediate Application (Conference Report). 3 2004 4 IEEE Intelligent Informatics Bulletin http://www.comp.hkbu.edu.hk/~cib/2004/Dec/iib_vol4no2_confreport.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib4.html#Bartak04 2003-06-06 Exploring Computational Mechanismfor Contexts. 19-24 2002 1 IEEE Computational Intelligence Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2002/cib_iss1e.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib1.html#Gong02 2003-08-01 Book Review: Anaphora Resolution. 31-32 2003 2 IEEE Computational Intelligence Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2003/June/cib_vol2no1_bookreview.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib2.html#Nicolov03 2003-08-01 Announcements. 33-36 2003 2 IEEE Computational Intelligence Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2003/June/cib_vol2no1_announcements.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib2.html#X03 2003-08-01 Smart Distance for Information Systems: The Concept. 25-30 2003 2 IEEE Computational Intelligence Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2003/June/cib_vol2no1_article4.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib2.html#YeNK03 2005-10-17 Web-based Multi-Criteria Group Decision Support System with Linguistic Term Processing Function. 34-43 2005 5 IEEE Intelligent Informatics Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2005/Jun/iib_vol5no1_article5.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib5.html#LuZW05 2003-08-01 Multi-Database Mining. 5-13 2003 2 IEEE Computational Intelligence Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2003/June/cib_vol2no1_article1.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib2.html#ZhangWZ03 2003-06-06 Announcements. 28- 2002 1 IEEE Computational Intelligence Bulletin 1 http://www.comp.hkbu.edu.hk/~cib/2002/cib_iss1g.pdf http://www.informatik.uni-trier.de/~ley/db/journals/cib/cib1.html#X02 2003-06-17 Shuffling Biological Sequences. 171-185 1996 71 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)81456-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam71.html#KandelMUW96 2003-07-02 On some Infinite Series of (r, 1)-Designs. 13-21 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00122-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#Gropp00 2003-04-02 A large set of non-Hamiltonian graphs. 99-115 2001 115 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam115.html#Katona01 2003-06-16 Edge Disjoint Polyp Packing. 133-152 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00025-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#Katona97 2003-06-30 Covering t-sets with (t+2)-sets. 425-437 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00090-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#NurmelaO99 2002-01-03 Local search algorithms for a single-machine scheduling problem with positive and negative time-lags. 179-197 2001 112 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam112.html#HurinkK01 2003-04-02 A tabu search algorithm for scheduling a single robot in a job-shop environment. 181-203 2002 119 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#HurinkK02 2003-05-21 Classes of Graphs for Which Upper Fractional Domination Equals Independence, Upper Domination, and upper Irredundance. 241-258 1994 55 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)90011-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#ChestonF94 2003-05-27 <i>n</i>-Dimensional Cube. 9-11 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#Alon92 http://dx.doi.org/10.1016/0166-218X(92)90121-P 2002-03-21 On the Complexity of Inferring Functional Dependencies. 237-243 1992 40 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#MannilaR92 2003-06-30 Resolution Remains Hard Under Equivalence. 139-148 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00055-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#BuningL99 2003-05-27 The Forwarding Index of Communication Networks with Given Connectivity. 147-155 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#VegaM92 http://dx.doi.org/10.1016/0166-218X(92)90129-X 2003-06-18 An Approximation Scheme for Strip Packing of Rectangles with Bounded Dimensions. 93-101 1998 82 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00130-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam82.html#VegaZ98 2003-05-21 Graphs in Which All Hamiltonian Cycles Have the Same Length. 87-89 1994 55 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)90038-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#Krynski94 2003-04-01 K-submodular functions and convexity of their Lovász extension. 1-12 2002 122 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam122.html#Ando02 2003-06-30 The Hall Number, the Hall Index, and the Total Hall Number of a Graph. 227-245 1999 94 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00023-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam94.html#HiltonJ99 2003-06-16 Vertex-splitting and Chromatic Index Critical Graphs. 205-211 1997 76 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00125-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam76.html#HiltonZ97 2005-08-25 Fast Detection and Display of Symmetry in Outerplanar Graphs. 13-35 1992 39 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#ManningA92 http://dx.doi.org/10.1016/0166-218X(92)90112-N 2003-05-21 Probing the Arrangement of Hyperplanes. 101-125 1995 56 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00082-o http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#Aoki95 2003-07-08 An Enumerative Algorithm for the Frequency Assignment Problem. 155-169 2003 129 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00239-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#ManninoS03 2003-05-22 on Component-size Bounded Steiner Trees. 131-140 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00045-F http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#Du95 2003-06-30 The Multi-SAT Algorithm. 111-126 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00035-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#Gu99 2003-07-04 Bipartite-perfect Graphs. 581-599 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00390-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#Le03 2003-06-16 Hexagonal Systems with Forcing Single Edges. 295-301 1997 72 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00116-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam72.html#Li97 2003-05-22 A Note on Biased and Non-biased Games. 285-291 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00059-M http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#Lu95 2003-06-30 Sorting by Bounded Block-moves. 181-206 1998 88 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00072-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam88.html#HeathV98a 2003-07-02 On Complexity, Representation and Approximation of Integral Multicommodity Flows. 183-208 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00133-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#SrivastavS00 2003-05-21 Weighted Fractional and Integral K-matching in Hypergraphs. 255-269 1995 57 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00106-N http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam57.html#SrivastavS95 2003-06-18 Tight Approximations for Resource Constrained Scheduling and Bin Packing. 223-245 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00045-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#SrivastavS97 2002-01-03 On finding a maximum spanning tree of bounded radius. 249-253 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#Serdjukov01 2003-05-27 Augmentations of Consistent Partial orders for the one-machine Total Tardiness Problem. 189-202 1996 68 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00051-R http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#Yu96 2003-06-23 d-minimal Languages. 243-262 1998 89 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00105-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam89.html#Yu98 2002-01-03 On the visibility graph of convex translates. 195-210 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#HosonoMR01 2002-01-03 Preface. 1-2 2001 108 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#HromkovicS01 2002-01-03 Solving satisfiability problems using elliptic approximations - effective branching rules. 241-259 2000 107 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam107.html#WarnersM00 2003-07-04 Parameterized Complexity of Vertex Colouring. 415-429 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00242-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#Cai03a 2003-05-21 An Algorithm for an Eulerian Trail Traversing Specified Edges in Given order. 233-239 1994 55 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)90010-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#Cai94a 2003-06-23 Multi-machine Scheduling with Variance Minimization. 55-70 1998 84 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00020-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam84.html#CaiC98 2003-05-22 <i>k</i>-Tree Problem. 139-156 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#CaiM93 http://dx.doi.org/10.1016/0166-218X(93)90228-G 2003-06-16 A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph. 27-34 1997 73 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00074-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#CaiS97 2003-04-01 Improving the efficiency of parallel minimum spanning tree algorithms. 33-54 2003 126 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam126.html#ChongHIL03 2003-06-18 Polyhedral Characterizations, Perfection of Line Graphs. 141-154 1998 81 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00081-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam81.html#CaoN98 2003-05-21 The Permutahedron of Series-parallel Posets. 85-90 1995 57 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00079-S http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam57.html#Schulz95 2003-06-16 Finding the Maximum and Minimum. 1-12 1997 74 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00012-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#Aigner97 2003-06-23 A Communication Problem and Directed Triple Systems. 139-147 1998 85 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(98)00028-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam85.html#GyarfasS98 2003-04-02 Recognizing pseudo-median graphs. 261-269 2002 116 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam116.html#Vesel02 2006-02-02 Straight line embeddings of rooted star forests in the plane. 167-175 2000 101 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam101.html#KanekoK00 2003-04-01 Wiener index versus maximum degree in trees. 127-137 2002 122 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam122.html#FischermannHRSV02 2003-04-02 Sandpiles and order structure of integer partitions. 51-64 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#ChMP02 2003-05-26 The Basic Cyclic Scheduling Problem with Linear Precedence Constraints. 219-238 1996 64 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00126-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam64.html#Munier96 2003-05-22 Polyhedral Results for the Precedence-Constrained Knapsack Problem. 185-201 1993 41 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#Boyd93 http://dx.doi.org/10.1016/0166-218X(90)90053-F 2003-05-22 Solving Makespan Minimization Problems with Lagrangean Decomposition. 17-29 1993 42 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#Guignard93 http://dx.doi.org/10.1016/0166-218X(93)90176-O 2003-04-01 An inductive definition of cubic toroidal maps. 117-140 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#Harmuth02 2003-05-22 Rational and Affine Expressions for Image Description. 85-120 1993 41 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#CulikD93 http://dx.doi.org/10.1016/0166-218X(93)90031-I 2003-05-21 Weighted Finite Transducers in Image Processing. 223-237 1995 58 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(93)E0149-S http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#CulikF95 2003-05-26 Coronoid Systems with Perfect Matchings. 117-133 1996 64 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00124-V http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam64.html#Chen96 2003-06-16 Parallel Machine Scheduling with Time Dependent Processing Times. 103 1997 75 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(97)00002-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#Chen97 2002-03-21 A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control. 379-395 1992 40 Discrete Applied Mathematics 4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#KatohIK92 2003-06-16 On Quasi-Cayley Graphs. 43-58 1997 77 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(97)00098-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam77.html#Gauyacq97 2003-05-26 on a Partition into Convex Polygons. 179-191 1996 64 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00120-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam64.html#Urabe96 2003-05-21 Insertion Techniques for the Heuristic Solution of the Job Shop Problem. 191-211 1995 58 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(93)E0127-K http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#WernerW95 2005-06-06 Some minimum broadcast graphs. 275-285 1994 53 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam53.html#MaheoS94 2004-05-12 on the Structure of Trapezoid Graphs. 109-133 1996 66 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00158-A http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#CheahC96 2002-11-18 Acyclic colouring of 1-planar graphs. 29-41 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#BorodinKRS01 2003-05-21 <i>p</i>-Competition Numbers. 87-92 1993 46 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam46.html#KimMMR93 http://dx.doi.org/10.1016/0166-218X(93)90160-P 2003-06-18 Polynomial Invariants for Trees a Statistical Mechanics Approach. 225-237 1998 81 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)88003-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam81.html#ContiCF98 2002-01-03 Asymptotically optimal erasure-resilient codes for large disk arrays. 3-36 2000 102 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam102.html#CheeCL00 2003-05-22 Classification by Polynomial Surfaces. 91-103 1995 61 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00008-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam61.html#Anthony95 2003-06-30 Accuracy of Techniques for the Logical Analysis of Data. 247-257 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00094-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#Anthony99 2003-05-13 on Edge-hamiltonian Cayley Graphs. 27-37 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90091-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#Baumann94 2003-05-27 Super Edge-Connectivity of Dense Digraphs and Graphs. 511-523 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#Soneoka92 http://dx.doi.org/10.1016/0166-218X(92)90155-4 2002-01-03 Relative completeness with respect to two unary functions. 337-342 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#PantovicTV01 2003-05-22 Whist Tournaments - Three Person Property. 125-137 1993 45 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam45.html#Finizio93 http://dx.doi.org/10.1016/0166-218X(93)90056-T 2003-05-21 Z-cyclic Whist Tournaments with a Patterned Starter Initial Round. 287-293 1994 52 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)90147-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#Finizio94 2003-05-26 An Infinite Class of Z-cyclic Whist Tournaments on v Players, v 1 (mod 4). 135-146 1996 66 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00159-B http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#Finizio96 2003-06-23 Simple Splicing Systems. 145-163 1998 84 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00002-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam84.html#MateescuPRS98 2003-05-27 Finding Regular Subgraphs in Both Arbitrary and Planar Graphs. 223-235 1996 68 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00061-U http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#Stewart96 2002-01-03 Radon transforms and packings. 3-22 2001 111 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam111.html#Boguslavsky01 2003-05-22 A Genuinely Polynomial Primal Simplex Algorithm for the Assignment Problem. 93-115 1993 45 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam45.html#Akgul93 http://dx.doi.org/10.1016/0166-218X(93)90054-R 2003-05-21 Directed Steiner Problems with Connectivity Constraints. 109-128 1993 47 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#Dahl93 http://dx.doi.org/10.1016/0166-218X(93)90086-4 2003-06-27 A Transfinite Form of Sibson's Interpolant. 33-50 1999 93 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam93.html#GrossF99 http://dx.doi.org/10.1016/S0166-218X(99)00004-9 2002-01-03 Fast gossiping with short unreliable messages. 15-24 1994 53 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam53.html#ChlebusDP94 2003-05-06 On the Complexity of the Embedding Problem for Hypercube Related Graphs. 75-95 1993 43 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#WagnerC93 http://dx.doi.org/10.1016/0166-218X(93)90170-S 2002-03-21 An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem. 73-81 1992 40 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#WagnerW92 2003-06-27 On the Cut-off Point for Combinatorial Group Testing. 83-92 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00119-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#FischerKW99 2003-06-16 Orbits of Boolean Functions. 269-275 1997 75 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00092-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#Gorodkin97 2004-01-06 A Survey of Integrity. 13-28 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#BaggaBGLP92 http://dx.doi.org/10.1016/0166-218X(92)90122-Q 2005-05-13 A note on transitive orientations with maximum sets of sources and sinks. 91-95 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#FigueiredoGMS02 2005-05-13 Even and Odd Pairs in Comparability and in P4-comparability Graphs. 293-297 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00139-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#FigueiredoGMS99 2003-05-21 on the Channel Capacity of Read/write Isolated Memory. 1-8 1995 56 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0130-Q http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#Cohn95 2003-05-21 Some Results on Greedy Algorithm Conjectures. 169-194 1994 52 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)90080-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#Cole94 2003-07-02 ₄-connected Graphs. 295-315 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00140-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#Babel00 2003-06-23 ₄'s. 45-57 1998 89 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00115-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam89.html#Babel98 2003-06-18 Some General Aspects of the Framing Number of a Digraph. 115-133 1998 82 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00127-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam82.html#HenningM98 2003-04-02 Boundary uniqueness of fusenes. 209-222 2002 118 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#GuoHZ02 2003-05-22 Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints. 123-138 1993 42 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#BlazewiczKM93 http://dx.doi.org/10.1016/0166-218X(93)90042-M 2004-05-12 Hamilton Paths in Z-transformation Graphs of Perfect Matchings of Hexagonal Systems. 191-196 1997 74 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(97)81447-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#ChenF97a 2002-01-03 Lower bounds for computing geometric spanners and approximate shortest paths. 151-167 2001 110 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#ChenDS01 2002-01-03 Correlation theorems in cryptanalysis. 177-188 2001 111 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam111.html#Nyberg01 2003-07-02 Strongly Orderable Graphs a Common Generalization of Strongly Chordal and Chordal Bipartite Graphs. 427-442 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00149-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#Dragan00 2003-06-30 Almost Diameter of a House-hole-free Graph in Linear Time Via LexBFS. 223-239 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00077-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#Dragan99 2003-05-21 obstruction Set Isolation for the Gate Matrix Layout Problem. 169-213 1994 54 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)90021-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam54.html#KinnersleyL94 2003-05-21 Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope. 9-18 1995 56 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0082-A http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#Fischetti95 2003-05-27 Strong Elimination Ordering of the Total Graph of a Tree. 293-295 1992 39 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#AlesB92 http://dx.doi.org/10.1016/0166-218X(92)90181-9 2003-05-27 Graph Theoretical Invariants and Elementary Subgraphs of Polyhex and Polypent/polyhex Systems of Chemical Relevance. 79-114 1996 67 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00012-G http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam67.html#Dias96 2003-09-15 Sorting with Fixed-length Reversals. 269-295 1996 71 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00069-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam71.html#ChenS96a 2003-05-21 Codage des polyominos convexes et équations pour l'énumération suivant l'aire. 21-43 1994 48 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#Bousquet-Melou94 http://dx.doi.org/10.1016/0166-218X(92)00103-S 2002-01-03 Minimal enumerations of subsets of a finite set and the middle level problem. 109-114 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#EvdokimovP01 2004-03-30 Pruning the Search Tree in the Constructive Enumeration of Molecular Graphs. 189-207 1996 67 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00019-N http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam67.html#PospichalK96 2003-05-22 <i>T</i>-Colorings of Graphs. 277-289 1993 45 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam45.html#Tesman93 http://dx.doi.org/10.1016/0166-218X(93)90015-G 2003-06-18 Polyhedral Analysis and Decompositions for Capacitated Plant Location-type Problems. 79-91 1998 82 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00096-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam82.html#ChenaG98 2003-06-17 Batch Scheduling and Common Due-date Assignment on a Single Machine. 231-245 1996 70 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(96)80468-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam70.html#ChengK96 2003-04-02 Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness. 163-179 2002 118 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#ChengL02 2003-05-21 A Lower Bound of the Expected Maximum Number of Edge-disjoint S-t Paths on Probabilistic Graphs. 137-155 1995 56 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00084-Q http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#ChengM95 2003-06-17 Local Multiple Alignment Via Subgraph Enumeration. 337-365 1996 71 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00072-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam71.html#ZhangHM96 2002-01-03 Broadcasting on recursively decomposable Cayley graphs. 171-182 1994 53 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam53.html#Sankaran94 2003-05-21 Hexagonal Systems with Fixed Bonds. 285-296 1993 47 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(93)90133-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#ZhangLZ93 2002-01-03 Cellular telephone networks and random maps in hypergraphs. 111-126 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#HalpertLP00 2003-06-16 On the Number of Spanning Trees and Eulerian Tours in Iterated Line Diagraphs. 59-67 1997 73 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(95)00118-B http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#ZhangZH97 2002-01-03 Sparse orthogonal matrices and the Haar wavelet. 63-76 2000 101 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam101.html#CheonS00 2003-11-20 A cycle augmentation algorithm for minimum cost multicommodity flows on a ring. 301-315 2001 110 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#ShepherdZ01 2002-01-03 On the dominant of the Steiner 2-edge connected subgraph polytope. 3-10 2001 112 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam112.html#Baiou01 2002-01-03 Makespan minimization for flow-shop problems with transportation times and a single robot. 199-216 2001 112 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam112.html#HurinkK01a 2003-04-01 On the facets of the simple plant location packing polytope. 27-53 2002 124 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam124.html#CanovasLM02 2003-05-26 A Multifacility Location Problem on Median Spaces. 1-29 1996 64 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(95)00115-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam64.html#Chepoi96 2003-06-16 Peakless Functions on Graphs. 175-189 1997 73 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(96)00007-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#Chepoi97 2002-01-03 Total Matchings and Total Coverings of Threshold Graphs. 325-330 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#PeledS94a 2003-05-21 Polynomial Invariants of Graphs with State Models. 323-331 1995 56 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00093-S http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#NegamiK95 2003-06-23 Disjunctive Programming: Properties of the Convex Hull of Feasible Points. 3-44 1998 89 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00136-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam89.html#Balas98 2003-06-18 Reliable broadcasting in product networks. 3-20 1998 83 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam83.html#BaoIO98 http://dx.doi.org/10.1016/S0166-218X(97)00100-5 2003-07-02 ₃. 331-338 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00143-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#BettenBP00 2004-07-01 On k-partitioning of Hamming Graphs. 127-140 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00070-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#BezrukovES99 2003-05-21 <i>n</i>-Cube Graph. 99-116 1993 46 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam46.html#BezrukovGW93 http://dx.doi.org/10.1016/0166-218X(93)90023-H 2003-06-30 Simple 8-(40, 11, 1440) Designs. 109-114 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00068-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#BettenLW99 2003-06-16 A Special Case for Subset Interconnection Designs. 51-60 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00023-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#DuGW97 2003-05-27 <i>d</i>Digraphs. 169-177 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#DuHP92 http://dx.doi.org/10.1016/0166-218X(92)90131-S 2003-06-27 Separable Partitions. 39-51 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00142-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#AlonO99 2003-06-18 T-choosability in Graphs. 1-13 1998 82 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00124-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam82.html#AlonZ98 2003-06-16 Constructing Efficient Simulated Annealing Algorithms. 139-159 1997 77 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(96)00132-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam77.html#Duque-Anton97 2003-05-26 on Some Multicriteria Arborescence Problems: Complexity and Algorithms. 191-206 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00035-P http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#DellAmicoM96 2003-06-16 The k-cardinality Assignment Problem. 103-121 1997 76 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00120-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam76.html#DellAmicoM97 2002-01-03 Algorithms and codes for dense assignment problems: the state of the art. 17-48 2000 100 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam100.html#DellAmicoT00 2003-05-27 Openshop Scheduling with Machine Dependent Processing Times. 197-205 1992 39 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#Dror92 http://dx.doi.org/10.1016/0166-218X(92)90176-B 2003-05-27 Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search. 207-229 1992 39 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#FlajoletGT92 http://dx.doi.org/10.1016/0166-218X(92)90177-C 2003-06-30 A supertree method for rooted trees. 147-158 2000 105 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam105.html#SempleS00 2002-01-03 Symmetric patterns in the cellular automaton that generates Pascal's triangle modulo 2. 1-38 2000 105 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam105.html#Barbe00 2003-05-26 Linear Cellular Automata, Finite Automata and Pascal's Triangle. 1-22 1996 66 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00132-W http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#AlloucheHPS96 2003-06-17 On the Complexity of Comparing Evolutionary Trees. 153-169 1996 71 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00062-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam71.html#HeinJWZ96 2003-05-21 On a Universal Chain Problem. 219-229 1994 48 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#Dyer94 http://dx.doi.org/10.1016/0166-218X(92)00178-O 2003-05-27 <i>_k</i><i>_k</i>Graphs. 205-226 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#Ghafoor92 http://dx.doi.org/10.1016/0166-218X(92)90134-V 2003-05-26 Strongly Polynomial Simplex Algorithm for Bipartite Vertex Packing. 97-103 1996 64 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00122-T http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam64.html#ArmstrongJ96 2004-05-12 The Rotation Graphs of Perfect Matchings of Plane Bipartite Graphs. 5-12 1997 73 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00024-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#HepingZ97 2003-06-16 Complexity of Searching an Immobile Hider in a Graph. 235-249 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00011-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#StengelW97 2003-04-01 Recognizing DNA graphs is difficult. 85-94 2003 127 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#PendavinghSW03 2003-05-26 Constrained Matroidal Bottleneck Problems. 201-214 1995 63 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00114-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#AverbakhBP95 2003-04-02 Rigidity of multi-story buildings. 187-198 2001 115 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam115.html#Radics01 2002-03-21 Optimal Multiple Interval Assignments in Frequency Assignment and Traffic Phasing. 319-332 1992 40 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#Raychaudhuri92 2003-06-18 Characterizations and Algorithmic Applications of Chordal Graph Embeddings. 171-188 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00041-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#ParraS97 2003-05-21 Scheduling Identical Parallel Machines to Minimize Total Weighted Completion Time. 201-218 1994 48 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#BelouadahP94 http://dx.doi.org/10.1016/0166-218X(92)00176-M 2003-05-26 On 4-connected Claw-free Well-covered Graphs. 57-65 1996 64 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00117-V http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam64.html#HartnellP96 2002-01-03 Simple image set of (max, +) linear mappings. 73-86 2000 105 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam105.html#Butkovic00 2003-05-21 Strong Regularity of Matrices - A Survey of Results. 45-68 1994 48 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#Butkovic94 http://dx.doi.org/10.1016/0166-218X(92)00104-T 2003-05-21 Regularity of Matrices in Min-algebra and Its Time- Complexity. 121-132 1995 57 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00099-Y http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam57.html#Butkovic95 2002-01-03 Linear time approximation scheme for the multiprocessor open shop problem. 273-288 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#SevastianovW01 2003-04-01 A framework for the greedy algorithm. 247-260 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#Vince02 2003-06-27 How to Find a Point on a Line Within a Fixed Distance. 67-73 1999 93 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam93.html#HipkeIKL99 http://dx.doi.org/10.1016/S0166-218X(99)00009-8 2003-07-08 Foreword. 1 2003 129 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00230-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#BonuccelliM03 2002-01-03 On the complexity of minimizing the number of late jobs in unit time open shop. 127-132 2000 100 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam100.html#Kravchenko00 2003-05-27 Explicit Expressions for the Central Characters of the Symmetric Group. 149-156 1996 67 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00016-K http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam67.html#Katriel96 2003-05-26 Graphs That Admit 3-to-1 or 2-to-1 Maps onto the Circle. 347-377 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00041-O http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#HiltonLZ96 2003-04-01 Efficient dualization of O(log n)-term monotone disjunctive normal forms. 305-312 2003 126 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam126.html#Makino03 2003-05-21 Bipolar orientations Revisited. 157-179 1995 56 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00085-R http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#FraysseixMR95 2003-05-22 In Memoriam Paolo M. Camerini. 121-122 1993 42 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#Maffioli93 http://dx.doi.org/10.1016/0166-218X(93)90041-L 2003-05-27 One-Story Buildings as Tensegrity Frameworks III. 137-146 1992 39 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#RecskiS92 http://dx.doi.org/10.1016/0166-218X(92)90164-6 2006-09-12 On the robustness of primitive words. 239-252 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#PaunSTY02 2004-01-15 Proper and Unit Tolerance Graphs. 99-117 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00044-E http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#BogartFIL95 2003-05-22 Linear Time optimization Algorithms for P4-sparse Graphs. 155-175 1995 61 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00012-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam61.html#JamisonO95 2003-06-16 Simple But Efficient Approaches for the Collapsing Knapsack Problem. 271-280 1997 77 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00134-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam77.html#PferschyPW97 2003-05-21 The Complexities of the Coefficients of the Tutte Polynomial. 93-103 1995 57 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00097-W http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam57.html#Annan95 2003-06-30 Complexity Analysis of Propositional Resolution with Autarky Pruning. 195-221 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00040-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#Gelder99 2003-05-22 Two Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds. 75-86 1995 59 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0153-P http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#Strusevich95 2003-06-27 A Heuristic for the Two-machine Open-shop Scheduling Problem with Transportation Times. 287-304 1999 93 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00115-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam93.html#Strusevich99 2003-07-08 All-to-all Personalized Communication on Multistage Interconnection Networks. 435-446 2003 128 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00504-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#Massini03 2003-07-08 Higher Weights and Graded Rings for Binary Self-dual Codes. 121-143 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00440-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#DoughertyGO03 2002-01-03 On the subword complexity of iteratively generated infinite words. 115-120 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#Frid01 2002-01-03 On the minimum average distance of binary codes: linear programming approach. 263-281 2001 111 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam111.html#FuWY01 2004-10-27 Editorial. 1 2001 110 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#BattatiBM01 2003-05-22 Errata to "Selecting the Top Three Elements" by M. Aigner: A Result of a Computer-Assisted Proof Search. 131-137 1993 41 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#Eusterbrock93 http://dx.doi.org/10.1016/0166-218X(93)90033-K 2003-05-22 Solving the Max-cut Problem Using Eigenvalues. 249-278 1995 62 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00155-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam62.html#PoljakR95 2003-06-27 Geometric Methods to Solve Max-Ordering Location Problems. 3-20 1999 93 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam93.html#EhrgottHN99 http://dx.doi.org/10.1016/S0166-218X(99)00005-0 2005-07-26 The Algorithmic Complexity of Minus Domination in Graphs. 73-84 1996 68 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00056-W http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#DunbarGHMH96 2003-05-21 A Note on Generalizing the Maximum Lateness Criterion for Scheduling. 129-137 1993 47 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#Hall93 http://dx.doi.org/10.1016/0166-218X(93)90087-5 2003-06-23 Splicing Representations of Strictly Locally Testable Languages. 139-147 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00053-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#Head98 2003-05-22 on the Problem of Sorting Burnt Pancakes. 105-120 1995 61 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00009-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam61.html#CohenB95 2003-05-22 Biography of Martin Farber, 1951-1989. 5-7 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#Hell93 http://dx.doi.org/10.1016/0166-218X(93)90218-D 2003-04-01 Digital pseudomanifolds, digital weakmanifolds and Jordan-Brouwer separation theorem. 45-57 2003 125 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam125.html#KhachanCD03 2003-05-21 Intersection Graphs of Concatenable Subtrees of Graphs. 195-209 1994 52 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)90081-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#GavrilU94 2003-04-01 Approximate protein folding in the HP side chain model on extended cubic lattices. 163-177 2003 127 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#Heun03 2003-06-16 Time-optimal Tree Computations on Sparse Meshes. 201-220 1997 77 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(97)00135-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam77.html#BhagavathiBGOS97 2003-05-26 Efficient Algorithms for Minimum Weighted Colouring of Some Classes of Perfect Graphs. 133-143 1994 55 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)90004-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#Hoang94 2003-05-26 A Note on Perfectly orderable Graphs. 379-386 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00042-P http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#Hoang96 2003-06-30 On the Disc-structure of Perfect Graphs I the Co-paw-structure. 247-262 1999 94 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00024-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam94.html#Hoang99 2003-06-23 On the Relations Between Arboricity and Independent Number Or Covering Number. 279-283 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00062-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#ZhongfuLJJ98 2003-06-17 Polygon Scheduling. 37-55 1996 70 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(95)00100-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam70.html#Hurink96 2003-06-30 On the Complexity of Linear Programming in the BSS-model. 35-40 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00063-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#Bar99 2003-06-30 Critical Edges in Perfect Line Graphs and some Polyhedral Consequences. 455-466 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00093-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#Wagler99 2003-06-30 The Erdos-Ko-Rado Bound for the Function Lattice. 115-125 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00069-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#Bey99 2003-05-27 <i>k</i>-Connected Graphs. 287-296 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#HeydemannMOS92 http://dx.doi.org/10.1016/0166-218X(92)90140-6 2003-04-01 A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor. 9-31 2003 126 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam126.html#Cai03 2003-05-21 NP-Completeness of Minimum Spanner Problems. 187-194 1994 48 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#Cai94 http://dx.doi.org/10.1016/0166-218X(94)90073-6 2003-06-16 On Spanning 2-trees in a Graph. 203-216 1997 74 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00045-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#Cai97 2003-06-27 Matrices with Maximum Exponents in the Class of Doubly Stochastic Primitive Matrices. 53-66 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00097-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#BoL99 2003-07-04 Exact Bounds on the Order of the Maximum Clique of a Graph. 535-543 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00386-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#Budinich03 2002-01-03 Cycle regular graphs need not be transitive. 261-264 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#FouquetH01 2002-01-03 On extendibility of voltage and current regimes from subnetworks. 87-97 2000 105 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam105.html#Cel00 2003-06-18 Routing a Vehicle of Capacity Greater than one. 41-57 1998 81 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00074-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam81.html#Guan98 2003-06-16 A Variant of the Permutation Flow Shop Model with Variable Processing Times. 123-140 1997 76 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00121-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam76.html#FinkeJ97 2003-05-21 Two Machine open Shop Scheduling Problem with Bi-criteria. 253-259 1994 52 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)90144-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#MasudaI94 2003-05-27 <i>k</i>+ 1)-Connected Digraphs. 539-552 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#WadaK92 http://dx.doi.org/10.1016/0166-218X(92)90157-6 2003-04-01 The cycle structure of regular multipartite tournaments. 109-116 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#GuoK02 2003-04-01 The graph sandwich problem for 1-join composition is NP-complete. 73-82 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#FigueiredoKV02 2003-06-18 Bypaths in Tournaments. 127-135 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00038-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#GuoV97 2004-07-01 The Cyclic Wirelength of Trees. 275-277 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00106-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#BezrukovS98 2003-05-22 Competitive Group Testing. 221-232 1993 45 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam45.html#DuH93 http://dx.doi.org/10.1016/0166-218X(93)90011-C 2003-06-16 Lifting Cover Inequalities for the Precedence-constrained Knapsack Problem. 219-241 1997 72 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00113-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam72.html#ParkP97 2003-06-16 Scheduling Imprecise Computation Tasks with 0/1-constraint. 117-132 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00024-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#HoLW97 2003-06-23 Triangulating Multitolerance Graphs. 183-197 1998 84 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00026-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam84.html#Parra98 2003-05-27 The Asymptotic Optimality of Spider-Web Networks. 437-450 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#Pippenger92 http://dx.doi.org/10.1016/0166-218X(92)90150-9 2004-02-24 Retractions of Finite Distance Functions Onto Tree Metrics. 215-233 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00128-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#MoultonS99 2002-01-03 Parallel machine scheduling with a common server. 223-243 2000 102 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam102.html#HallPS00 2003-05-22 on Determining Non-isotopic Configurations of Points on a Circle. 33-50 1995 59 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0158-U http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#HeS95 2003-06-30 Optimal Sequential Inspections of Reliability Systems Subject to Parallel-chain Precedence Constraints. 327-336 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00097-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#ChiuCS99 2002-01-03 Multicolor routing in the undirected hypercube. 169-181 2000 100 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam100.html#GuT00 2003-06-18 Spanning Local Tournaments in Locally Semicomplete Digraphs. 119-125 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00037-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#Guo97 2003-06-30 Outpaths in Semicomplete Multipartite Digraphs. 273-277 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00080-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#Guo99 2003-05-22 Thin and Slender Languages. 257-270 1995 61 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00014-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam61.html#PaunS95 2003-05-27 Random Walks with Absorbing Points. 57-67 1992 39 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#Shapiro92 http://dx.doi.org/10.1016/0166-218X(92)90114-P 2003-05-22 Extending Shelling orders and a Hierarchy of Functions of Unimodal Simple Polytopes. 211-217 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00052-F http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#Hoke95 2003-04-02 On acyclic systems with minimal Hosoya index. 251-257 2002 119 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#Hou02 2003-05-27 An Improved Upper Bound for the Subarray Partial Concentrators. 341-346 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#HuH92 http://dx.doi.org/10.1016/0166-218X(92)90143-X 2003-05-21 Cutting Numbers for the Forward Loop Backward Hop Network. 147-161 1994 48 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#HuH94 http://dx.doi.org/10.1016/0166-218X(92)00123-4 2003-06-18 A Strongly Polynomial Algorithm for the Inverse Shortest Arborescence Problem. 135-154 1998 82 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)86750-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam82.html#HuL98 2003-05-21 Stochastic Scheduling and Forwards Induction. 145-165 1995 57 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00101-I http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam57.html#Glazebrook95 2003-01-22 Guarding rectangular art galleries. 149-157 1994 50 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#CzyzowiczESUZ94 2002-01-03 Smallest independent dominating sets in Kronecker products of cycles. 303-306 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#Jha01 2002-01-03 Partial monotonizations of Hamiltonian cycle polytopes: dimensions and diameters. 173-182 2000 105 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam105.html#SierksmaT00 2006-06-06 <i>l</i>_infty-Distance. 397-410 1992 40 Discrete Applied Mathematics 4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#KoC92 2003-05-22 Large Survivable Nets and the Generalized Prisms. 181-185 1995 61 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00131-V http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam61.html#Lai95 2006-05-02 Graphs with Largest Number of Minimum Cuts. 387-407 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00043-Q http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#LehelMP96 2003-06-16 Two-segmented Channel Routing Is Strong NP-complete. 291-298 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00020-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#Li97a 2003-06-17 Single Machine Scheduling Subject To Precedence Delays. 247-266 1996 70 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(96)00110-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam70.html#FintaL96 2003-05-21 A Unified Approach to the First Derivatives of Graph Polynomials. 293-297 1995 58 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00121-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#LiG95 2003-05-13 Hamiltonicity of a Type of Interchange Graphs. 107-111 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90099-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#LiZ94 2002-01-03 On the computational complexity of edge concentration. 197-205 2000 101 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam101.html#Lin00 2003-06-23 The Exact Bound of Lee's MLPT. 251-254 1998 85 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(97)00139-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam85.html#Lin98 2003-05-22 The Shields-Harary Number for Wheel and Broken Wheel Graphs. 193-199 1995 59 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(93)E0162-R http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#Wunsch95 2002-01-03 Existence of whist tournaments with the three-person property 3PWh(v). 207-219 2000 101 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam101.html#LuS00 2003-04-02 Weighted efficient domination problem on some perfect graphs. 163-182 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#LuT02 2003-06-23 Solving the Weighted Efficient Edge Domination Problem on Bipartite Permutation Graphs. 203-211 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00057-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#LuT98 2002-01-03 Cycles of length 1 modulo 3 in graph. 329-336 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#LuY01 2005-09-28 NeST graphs. 139-153 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#HaywardKM02 2002-01-03 A note about games-composition dimension. 265-273 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#FreixasP01 2003-06-23 A Relation Between the Knapsack, Group Knapsack Problems. 255-268 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00061-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#Nan98 2002-05-13 On shortest three-edge-connected Steiner networks with Euclidean distance. 141-152 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#HsuH00 2003-06-17 Reconstruction of Rooted Trees From Subtrees. 19-31 1996 69 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00074-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam69.html#NgW96 2002-01-03 A laminarity property of the polyhedron described by a weakly posi-modular set function. 123-126 2000 100 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam100.html#Fujishige00 2003-07-02 Reducible Configurations for the Cycle Double Cover Conjecture. 71-90 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00126-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#Huck00 2003-05-26 Some Properties of Non-bicolorable Hypergraphs and the Four-color Problem. 73-79 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00028-P http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#Berge96 2003-06-18 The Exponent of the Primitive Cayley Digraphs on Finite Abelian Groups. 177-191 1997 80 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(97)00055-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#WangM97 2003-06-27 Solving Restricted Line Location Problems via a Dual Interpretation. 109-125 1999 93 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam93.html#Schobel99 http://dx.doi.org/10.1016/S0166-218X(99)00008-6 2002-01-03 An asymmetric analogue of van der Veen conditions and the traveling salesman problem. 279-292 2001 109 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam109.html#Oda01 2003-05-21 k-NLC Graphs and Polynomial Algorithms. 251-266 1994 54 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)90026-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam54.html#Wanke94 2002-01-03 The Complexity of Colouring Symmetric Relational Systems. 95-105 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#Brewster94 2003-05-26 Directed Moore Hypergraphs. 117-127 1995 63 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00069-P http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#ErgincanG95 2002-01-03 An approximation guarantee of the greedy descent algorithm for minimizing a supermodular set function. 131-146 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#Ilev01 2003-05-26 on Subwords of Infinite Words. 277-279 1995 63 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00063-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#Ilie95 2006-01-02 Experimental Behavior of an Interior Point Cutting Plane Algorithm for Convex Programming: An Application to Geometric Programming. 3-23 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#BahnGVM94 2003-06-30 Earliness and Tardiness Scheduling Problems on a Batch Processor. 131-145 1999 98 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(99)00113-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#QiT99 2002-01-03 Interactive L Systems with a Fast Local Growth. 163-179 1989 22 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam22.html#Raz89 2002-01-03 Complexity classification of some edge modification problems. 109-128 2001 113 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#NatanzonSS01 2003-06-16 Minimum Dispersion Problems. 93-102 1997 75 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00082-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#PunnenA97 2003-04-02 Domination analysis of some heuristics for the traveling salesman problem. 117-128 2002 119 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#PunnenK02 2003-05-21 Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite Matching Problem. 91-93 1994 55 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)90039-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#PunnenN94 2003-05-21 Two Strongly Polynomial Cut Cancelling Algorithms for Minimum Cost Network Flow. 133-165 1993 46 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam46.html#ErvolinaM93 http://dx.doi.org/10.1016/0166-218X(93)90025-J 2003-05-22 Algorithms for Weak and Wide Separation of Sets. 139-159 1993 45 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam45.html#Houle93 http://dx.doi.org/10.1016/0166-218X(93)90057-U 2002-01-03 Congruences concerning Bernoulli numbers and Bernoulli polynomials. 193-223 2000 105 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam105.html#Sun00 2003-05-13 Minimizing the Weighted Number of Tardy Task Units. 307-316 1994 51 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(92)00037-M http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#LeungYW94 2003-06-17 On the Primer Selection Problem in Polymerase Chain Reaction Experiments. 231-246 1996 71 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00066-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam71.html#PearsonRWZ96 2003-06-30 Editorial. 1 1998 88 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00108-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam88.html#Hammer98 2003-05-26 On a Problem of P. Erds. 75-79 1996 66 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#AntoniD96 2003-06-16 Computing Optimal Assignments for Residual Network Reliability. 285-295 1997 75 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(97)89164-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#StivarosS97 2004-07-19 Inverse radiation therapy planning - a multiple objective optimization approach. 145-161 2002 118 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#HamacherK02 2003-04-02 Complexity analysis of job-shop scheduling with deteriorating jobs. 195-209 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#Mosheiov02 2003-07-04 A Complete Adaptive Algorithm for Propositional Satisfiability. 523-534 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00385-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#BruniS03 2003-06-18 Cartesian Products of Graphs as Subgraphs of De Bruijn Graphs of Dimension at Least Three. 3-34 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00029-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#AndreaeHNSSS97 2002-01-03 Independent tree spanners: fault-tolerant spanning trees with constant distance guarantees. 105-127 2001 108 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#Handke01 2003-05-21 Some New Results Concerning three Counterfeit Coins Problem. 81-85 1994 48 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#Bosnjak94 http://dx.doi.org/10.1016/0166-218X(94)90119-8 2003-04-01 Opacity of a finite automaton, method of calculation and the Ising chain. 289-318 2003 125 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam125.html#Yao03 2003-05-27 Dense Group Networks. 65-71 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#Campbell92 http://dx.doi.org/10.1016/0166-218X(92)90125-T 2006-04-28 Ø-Threshold and Ø-Tolerance Chain Graphs. 191-203 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#JacobsonLL93 http://dx.doi.org/10.1016/0166-218X(93)90231-C 2003-06-18 Performance of Coffman-Graham Schedules in the Presence of Unit Communication Delays. 93-108 1998 81 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00077-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam81.html#HanenK98 2003-06-18 An approximation algorithm for scheduling dependent tasks on m processors with small communication delays. 239-257 2001 108 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#HanenM01 2003-05-27 <i>P</i>₄-Trees and Substitution Decomposition. 263-291 1992 39 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#Spinrad92 http://dx.doi.org/10.1016/0166-218X(92)90180-I 2003-05-21 A Study of the Cyclic Scheduling Problem on Parallel Processors. 167-192 1995 57 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00102-J http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam57.html#HanenM95 2003-04-01 A survey on maximum distance holey packings. 279-294 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#Yin02 2002-01-03 Optimal algorithms for dissemination of information in generalized communication modes. 55-78 1994 53 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam53.html#FeldmannHMMM94 2004-03-30 Generating the States of a Binary Stochastic System. 489-500 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#ShierVJ92 http://dx.doi.org/10.1016/0166-218X(92)90153-2 2004-01-06 <i>t</i>-Designs. 31-50 1993 42 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#HedayatKM93 http://dx.doi.org/10.1016/0166-218X(93)90177-P 2002-01-03 A strongly polynomial time algorithm for a constrained submodular optimization problem. 183-194 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#Hartvigsen01 2003-07-08 Characterizing the Flow Equivalent Trees of a Network. 387-394 2003 128 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00501-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#Hartvigsen03 2003-06-23 The Planar Multiterminal Cut Problem. 203-222 1998 85 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(98)00036-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam85.html#Hartvigsen98 2003-06-18 Maximal Independent Sets in Graphs with at Most One Cycle. 67-73 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00033-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#JouC97 2003-05-22 The Complexity of Domination Problems in Circle Graphs. 51-63 1993 42 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#Keil93 http://dx.doi.org/10.1016/0166-218X(93)90178-Q 2003-05-06 On the Depth of Combinatorial Optimization Problems. 115-129 1993 43 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#Kern93 http://dx.doi.org/10.1016/0166-218X(93)90003-7 2003-05-27 Games, Equations and Dot-Depth Two Monoids. 99-111 1992 39 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#Blanchet-Sadri92 http://dx.doi.org/10.1016/0166-218X(92)90161-3 2003-05-27 On a complete set of generators for dot-depth two. 1-25 1994 50 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#Blanchet-Sadri94 2003-05-27 Inclusion Relations Between Some Congruences Related to the Dot-depth Hierarchy. 33-71 1996 68 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00047-U http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#Blanchet-Sadri96 2003-06-23 Trees, Congruences and Varieties of Finite Semigroups. 157-179 1998 86 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(98)00040-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam86.html#Blanchet-Sadri98 2003-05-27 Construction of Discrete Structures, Especially Isomers. 115-126 1996 67 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00013-H http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam67.html#GrundKL96 2003-06-16 Competition Numbers of Graphs with a Small Number of Triangles. 153-162 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00026-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#KimR97 2003-06-30 ^d_2k. 217-221 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00076-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#Cieslik99 2003-07-08 A Lower Bound for the Job Insertion Problem. 395-419 2003 128 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00502-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#KisH03 2002-01-03 Diameter determination on restricted graph families. 143-166 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#CorneilDHP01 2003-05-22 Sensitivity Analysis in Isotonic Regression. 183-196 1993 45 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam45.html#Chakravarti93 http://dx.doi.org/10.1016/0166-218X(93)90008-C 2002-01-03 Upper bounds for the complexity of sequences generated by symmetric Boolean functions. 227-231 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#Merekin01 2003-06-23 The Complexity of Multidimensional Periodic Scheduling. 213-242 1998 89 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00112-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam89.html#VerhaeghLAMW98 2002-01-03 A fair and efficient solution to the socialist millionaires' problem. 23-36 2001 111 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam111.html#BoudotST01 2002-01-03 Sweeps, arrangements and signotopes. 67-94 2001 109 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam109.html#FelsnerW01 2003-05-26 Every Matroid Is a Submatroid of a Uniformly Dense Matroid. 151-160 1995 63 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00029-D http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#LaiL95 2003-06-16 On Bandwidth for the Tensor Product of Paths and Cycles. 133-141 1997 73 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(95)00005-C http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#LaiW97 2002-01-03 Selecting the k largest elements with parity tests. 187-196 2000 101 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam101.html#LamT00 2003-06-23 Edge Ranking of Graphs Is Hard. 71-86 1998 85 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(98)00029-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam85.html#LamY98 2003-06-23 The Disjoint Shortest Paths Problem. 113-138 1998 85 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(97)00121-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam85.html#Eilam-Tzoreff98 2003-06-23 Efficient Optimal Equation Formulation in Lumped Power-conserving Systems. 239-249 1998 85 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(98)00037-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam85.html#Lamb98 2003-06-30 On the Approximability of the Steiner Tree Problem in Phylogeny. 129-145 1998 88 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00069-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam88.html#Fernandez-BacaL98 2003-04-02 Discrete convexity: convexity for functions defined on discrete spaces. 297-304 2002 119 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#Yuceer02 2005-02-15 Some Democratic Secret Sharing Schemes. 293-298 1995 59 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)80007-Q http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#Carpentieri95 2003-06-16 Independence and Average Distance in Graphs. 27-37 1997 75 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00078-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#FirbyH97 2003-05-27 Changing and Unchanging the Diameter of a Hypercube. 265-274 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#GrahamH92 http://dx.doi.org/10.1016/0166-218X(92)90137-Y 2003-06-16 Optimal Orientations of Products of Paths and Cycles. 163-174 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00017-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#KohT97 2003-06-30 On Optimal Orientations of Cartesian Products with a Bipartite Graph. 103-120 1999 98 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(99)00110-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#KohT99 2002-03-21 Set to Set Broadcasting in Communication Networks. 411-421 1992 40 Discrete Applied Mathematics 4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#LeeC92 2003-05-22 Capacitated Two-Parallel Machines Scheduling to Minimize Sum of Job Completion Times. 211-222 1993 41 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#LeeL93 http://dx.doi.org/10.1016/0166-218X(90)90055-H 2003-05-27 On the Fixed Interval Due-date Scheduling Problem. 101-117 1996 68 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00049-W http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#LeeL96 2003-05-21 Geometric Comparison of Combinatorial Polytopes. 163-182 1994 55 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)90006-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#LeeM94 2002-01-03 Polyhedral methods for piecewise-linear functions I: the lambda method. 269-285 2001 108 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#LeeW01 2003-06-23 Size Bounds for Dynamic Monopolies. 263-273 1998 86 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(98)00043-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam86.html#Peleg98 2004-05-12 Pancyclicity and NP-completeness in Planar Graphs. 219-225 2000 98 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(99)00163-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#LiCM00 2003-05-27 Design and Analysis of Fault-Tolerant Multibus Interconnection Networks. 45-64 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#CamardaG92 http://dx.doi.org/10.1016/0166-218X(92)90124-S 2003-05-22 Probability of Diameter Two for Steinhaus Graphs. 165-171 1993 41 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#BrandCDJ93 http://dx.doi.org/10.1016/0166-218X(93)90036-N 2003-04-01 Edge colorings of the complete graph K149 and the lower bounds of three Ramsey numbers. 167-179 2003 126 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam126.html#LiSL03 2002-01-03 Tree spanners in planar graphs. 85-103 2001 108 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#FeketeK01 2002-01-03 A degree condition of 2-factors in bipartite graphs. 311-318 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#LiWY01 2006-06-20 The Infinite Families of Optimal Double Loop Networks. 179-183 1993 46 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam46.html#LiXZ93 http://dx.doi.org/10.1016/0166-218X(93)90028-M 2005-02-02 Length-bounded disjoint paths in planar graphs. 251-261 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#HolstP02 2003-04-02 The centdian subtree on tree networks. 263-278 2002 118 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#TamirPP02 2003-05-21 Isostatic Bar and Joint Frameworks in the Plane with Irreducible Pure Conditions. 37-57 1994 55 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)90035-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#Penne94 2005-10-14 Graphs whose Vertex Independence Number is Unaffected by Single Edge Addition of Deletion. 167-172 1993 46 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam46.html#GuntherHR93 http://dx.doi.org/10.1016/0166-218X(93)90026-K 2003-05-26 Optimal Parallel Algorithm for Brooks' Colouring Bounded Degree Graphs in Logarithmic Time on EREW PRAM. 249-265 1996 64 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00128-Z http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam64.html#SajithS96 2003-05-21 Lower Bounds for the Job-shop Scheduling Problem on Multi-purpose Machines. 145-156 1995 58 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(93)E0124-H http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#Jurisch95 2003-05-06 The Equivalence Classes of LR Arrays. 47-61 1993 43 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#LinL93 http://dx.doi.org/10.1016/0166-218X(93)90168-N 2003-06-18 A Fast Parallel Algorithm to Recognize P4-sparse Graphs. 191-215 1998 81 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00085-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam81.html#LinO98 2003-06-30 Non-adaptive Group Testing in the Presence of Errors. 261-290 1998 88 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00075-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam88.html#KnillBT98 2002-01-03 Fixed-parameter complexity of lambda-labelings. 59-72 2001 113 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#FialaKK01 2004-06-28 Extremal Values for Ratios of Distances in Trees. 37-56 1997 80 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(97)00068-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#BarefootES97 2003-05-21 Coset Correlation of LR m-Arrays. 263-273 1993 47 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(93)90131-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#LiuL93 2003-06-16 Irreducible Polynomials and Linear Recurring Arrays. 93-99 1997 74 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00112-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#LiuM97 2003-05-21 Preemptive Scheduling with Variable Profile, Precedence Constraints and Due Dates. 253-280 1995 58 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(93)E0151-N http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#LiuS95 2003-05-22 Generating Lower Bounds for the Linear Arrangement Problem. 137-151 1995 59 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(93)E0168-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#LiuV95 2002-01-03 Scheduling one batch processor subject to job release dates. 129-136 2000 105 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam105.html#LiuY00 2003-06-23 An Optimal Parallel Algorithm for Node Ranking of Cographs. 187-201 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00056-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#LiuY98 2003-07-08 Some Problems on Factorizations with Constraints in Bipartite Graphs. 421-434 2003 128 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00503-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#LiuZ03 2002-01-03 A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions. 177-196 2001 109 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam109.html#Kuhn01 2003-06-30 Perfect and Almost Perfect Sequences. 331-359 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00085-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#JungnickelP99 2002-01-03 An analytic study of the phase transition line in local sequence alignment with gaps. 113-142 2000 104 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam104.html#BundschuhH00 2003-06-27 A Family of Cayley Graphs on the Hexavalent Grid. 169-189 1999 93 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00106-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam93.html#Deserable99 2005-07-05 Bipartite Embeddings of Trees in the Plane. 141-148 1999 93 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00042-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam93.html#AbellanasGHNR99 2003-06-23 Morphisms and Almost-periodicity. 233-248 1998 86 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(98)00038-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam86.html#Maes98 2003-05-21 Distances Between Traveling Salesman Tours. 281-291 1995 58 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(93)E0115-F http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#MakM95 2003-07-04 Medians and Majorities in Semimodular Posets. 325-336 2003 127 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00252-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#Powers03 2003-05-26 Arrow's Theorem for Closed Weak Hierarchies. 271-278 1996 66 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00166-B http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#Powers96 2003-07-08 On k-ary n-cubes: Theory and Applications. 171-193 2003 129 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00238-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#MaoN03 2003-06-16 Meyniel Weakly Triangulated Graphs - I: Co-perfect Orderability. 199-210 1997 73 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00008-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#Hayward97 2003-05-22 on Paving Matroids and a Generalization of MDS Codes. 343-347 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00064-K http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#Rajpal95 2003-06-17 Polynomial-time Algorithm for Computing Translocation Distance Between Genomes. 137-151 1996 71 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00061-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam71.html#Hannenhalli96 2003-05-27 The Characteristic Polynomials of Modified Graphs. 209-219 1996 67 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(96)85159-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam67.html#Rowlinson96 2002-01-03 The complexity of irredundant sets parameterized by size. 155-167 2000 100 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam100.html#DowneyFR00 2003-06-18 Time-relaxed broadcasting in communication networks. 263-278 1998 83 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam83.html#Shastri98 http://dx.doi.org/10.1016/S0166-218X(97)00114-5 2002-01-03 Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms). 231-255 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#Glover94 2003-05-26 Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems. 223-253 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00037-E http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#Glover96 2003-06-17 On the Complexity of Some Edge-partition Problems for Graphs. 177-183 1996 70 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(95)00107-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam70.html#Lonc96 2003-06-18 Coloring Edges of Self-complementary Graphs. 279-284 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00049-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#WojdaZ97 2002-03-21 Circular Permutation Graph Family with Applications. 433-457 1992 40 Discrete Applied Mathematics 4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#LouS92 2003-05-21 Maximizing Traveling Salesman Problem for Special Matrices. 83-86 1995 56 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00074-N http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#BlokhG95 2003-04-02 An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices. 139-148 2002 119 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#BlokhL02 2003-07-04 Connectivity of Vertex and Edge Transitive Graphs. 601-613 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00391-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#Meng03 2003-04-02 Perfect edge domination and efficient edge domination in graphs. 227-250 2002 119 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#LuKT02 2002-01-03 Searching for a minimal solution subgraph in explicit AND/OR graphs. 213-225 2001 110 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#Hvalica01 2003-04-01 Scheduling and constraint propagation. 227-256 2002 123 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam123.html#Brucker02 2003-05-22 Efficient Algorithms for Some Path Partitioning Problems. 77-85 1995 62 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00146-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam62.html#Brucker95 2003-04-01 Fractional dominations and fractional total dominations of graph complements. 283-291 2002 122 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam122.html#Fisher02 2003-04-01 On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem. 141-157 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#KlavzarMP02 2003-05-26 A Sequencing Problem with Family Setup Times. 161-183 1996 66 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00139-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#Zdrzalka96 2003-07-04 Complexity of Robust Single Facility Location Problems on Networks with Uncertain Edge Lengths. 505-522 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00384-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#Averbakh03 2002-01-03 On (d, 2)-dominating numbers of binary undirected de Bruijn graphs. 137-145 2000 105 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam105.html#LuXZ00 2003-05-26 Robust Universal Complete Codes for Transmission and Compression. 31-55 1996 64 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)00116-H http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam64.html#FraenkelK96 2005-05-30 A scheme for the synchronization of variable length codes. 231-245 2000 101 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam101.html#PerkinsS00 2002-01-03 Decompositions into Linear Forests and Difference Labelings of Graphs. 61-75 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#BloomR94 2003-06-23 Comparison of Permanental Bounds of (0, 1)-matrices. 133-144 1998 84 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00008-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam84.html#HwangK98 2006-06-27 Optimal quantitative group testing on cycles and paths. 299-302 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#HwangL01 2003-05-21 On minimum cuts and the linear arrangement problem. 127-139 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#HortonPB00 2006-06-29 <i>k</i><i>m</i>-Tuples of Consecutive ones. 283 1993 46 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam46.html#HwangP93 http://dx.doi.org/10.1016/0166-218X(93)90108-Z 2003-05-27 The Capacity of the Subarray Partial Concentrators. 231-240 1992 39 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#HwangR92 http://dx.doi.org/10.1016/0166-218X(92)90178-D 2002-01-03 Constrained partitioning problems. 93-96 1994 50 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#HwangR94 2006-06-28 Group testing and fault detection for replicated files. 231-242 2002 116 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam116.html#HwangZ02 2003-05-13 Embedding Graphs of Small Size. 233-241 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90112-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#Wozniak94 2002-01-03 Some Complexity Results about Threshold Graphs. 299-308 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#Margot94 2003-06-27 ₄-structure of Bipartite Graphs. 157-168 1999 93 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00104-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam93.html#BabelBL99 2003-05-21 on an optimization Problem occurring in FMSs: A Hypergraph-theoretical Formulation. 107-111 1994 55 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)90002-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#Werra94 2003-06-30 On a Multiconstrained Model for Chromatic Scheduling. 171-180 1999 94 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00019-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam94.html#Werra99 2003-06-30 The Difficulty of Constructing a Leaf-labelled Tree Including or Avoiding Given Subtrees. 227-235 2000 98 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(99)00160-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#NgSW00 2003-06-23 Maximum Vertex-weighted Matching in Strongly Chordal Graphs. 71-77 1998 84 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00136-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam84.html#CampeloK98 2002-01-03 Three-dimensional orthogonal graph drawing algorithms. 55-87 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#EadesSW00 2003-06-27 Minimizing a Submodular Function Arising From a Concave Function. 211-215 1999 92 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00051-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam92.html#FujishigeI99 2003-05-22 Covering the Complete Graph with Plane Cycles. 305-310 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#HartmanM93 http://dx.doi.org/10.1016/0166-218X(93)90239-K 2003-04-01 A note on greedy algorithms for the maximum weighted independent set problem. 313-322 2003 126 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam126.html#SakaiTY03 2003-06-30 Asymptotic Results on Suborthogonal "B"-decompositions of Complete Digraphs. 311-320 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00083-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#Hartmann99 2003-05-21 On the Complexity of two Circle Connecting Problems. 17-32 1993 47 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#Huang93 http://dx.doi.org/10.1016/0166-218X(93)90149-I 2003-06-23 A Note on Spanning Local Tournaments in Locally Semicomplete Digraphs. 277-279 1998 89 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00113-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam89.html#Huang98 2003-05-22 Why Should Biconnected Components be Identified First. 203-210 1993 42 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#Hochbaum93 http://dx.doi.org/10.1016/0166-218X(93)90046-Q 2002-01-03 Generic rigidity of molecular graphs via ear decomposition. 131-155 2000 101 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam101.html#Franzblau00 2003-07-08 Bit-optimal Decoding of Codes Whose Tanner Graphs Are Trees. 293-303 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00452-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#SoljaninO03 2003-05-26 Drawing Graphs on Rectangular Grids. 75-89 1995 63 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00020-E http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#Schaffter95 2003-06-16 Scheduling with Forbidden Sets. 155-166 1997 72 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(96)00042-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam72.html#Schaffter97 2004-06-08 Routing permutations and 2-1 routing requests in the hypercube. 43-58 2001 113 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#BaudonFH01 2003-05-21 Routeing Winter Gritting Vehicles. 231-244 1994 48 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#Eglese94 http://dx.doi.org/10.1016/0166-218X(92)00003-5 2003-07-04 Pyramids and weak hierarchies in the ordinal model for clustering. 55-81 2002 122 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam122.html#BertrandJ02 2003-07-04 The k-weak Hierarchical Representations: An Extension of the Indexed Closed Weak Hierarchies. 199-220 2003 127 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00206-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#BertrandJ03 2003-05-21 The Complexity of One-Machine Batching Problems. 87-107 1993 47 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#AlbersB93 http://dx.doi.org/10.1016/0166-218X(93)90085-3 2003-05-21 Cross-Correlations of Linearly and Quadratically Related Geometric Sequences and GMW Sequences. 1-20 1993 46 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam46.html#KlapperCG93 http://dx.doi.org/10.1016/0166-218X(93)90155-H 2002-01-03 Scheduling with unexpected machine breakdowns. 85-99 2001 110 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#AlbersS01 2002-01-03 Fixed topology alignment with recombination. 281-300 2000 104 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam104.html#WangML00 2003-05-21 Linear Recognition of Pseudo-split Graphs. 307-312 1994 52 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00022-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#MaffrayP94 2003-06-30 Sequential Colorings and Perfect Graphs. 287-296 1999 94 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00026-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam94.html#MaffrayP99 2003-05-21 Graph Homomorphisms with Infinite Targets. 29-35 1994 54 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)90131-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam54.html#MacGillivray94 2003-07-04 Heuristics and Meta-heuristics for 2-layer Straight Line Crossing Minimization. 665-678 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00397-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#MartiL03 2003-07-02 Recognition of Tractable Satisfiability Problems through Balanced Polynomial Representations. 229-244 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00135-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#WarnersM00a 2003-06-18 Fast Equi-partitioning of Rectangular Domains Using Stripe Decomposition. 193-207 1998 82 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00122-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam82.html#Martin98 2003-04-02 On the binary solitaire cone. 3-14 2001 115 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam115.html#AvisD01 2003-05-26 Reverse Search for Enumeration. 21-46 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00026-N http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#AvisF96 2002-01-03 Minimum convex partition of a constrained point set. 95-107 2001 109 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam109.html#FevensMR01 2003-05-22 Compositions for Matroids with the Fulkerson Property. 87-101 1995 62 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00147-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam62.html#Chopra95 2002-01-03 Computing Prüfer codes efficiently in parallel. 205-222 2000 102 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam102.html#GreenlawP00 2003-05-22 The Efficiency of AC Graphs. 119-138 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#Blair93 http://dx.doi.org/10.1016/0166-218X(93)90227-F 2003-06-18 Sensitivity Analysis for Knapsack Problems: A Negative Result. 133-139 1998 81 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00080-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam81.html#Blair98 2004-02-24 Analyzing and Visualizing Sequence and Distance Data Using SplitsTree. 95-109 1996 71 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00059-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam71.html#DressHM96 2003-07-02 Optimal Paths in Network Games with P Players. 339-348 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00144-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#BoliacLS00 2003-05-21 The Combinations of Resistances. 225-228 1994 54 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)90024-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam54.html#Macmahon94 2002-03-21 Integer Programming in VLSI Design. 29-43 1992 40 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#Raghavan92 2003-07-08 Physical Network Design to Facilitate Capacity Reallocation. 129-153 2003 129 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00237-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#HarmsH03 2003-05-26 Homomorphically Full Graphs. 23-31 1996 66 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00134-Y http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#BrewsterM96 2003-10-24 Measures on monotone properties of graphs. 17-36 2002 116 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam116.html#BaloghBW02 2003-07-08 A Linear-programming Approach to the Generalized Randic Index. 375-385 2003 128 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00500-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#FischermannHRV03 2003-05-21 Counting Representable Sets on Simple Graphs. 33-46 1993 47 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#Jeavons93 http://dx.doi.org/10.1016/0166-218X(93)90150-M 2003-06-17 Triangulating the Surface of a Molecule. 5-22 1996 71 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00054-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam71.html#AkkirajuE96 2003-06-30 From Logical Gates Synthesis to Chromatic Bicritical Clutters. 259-305 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00095-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#Benzaken99 2003-05-27 Characterizations of Max-Balanced Flows. 241-261 1992 39 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#RothblumSS92 http://dx.doi.org/10.1016/0166-218X(92)90179-E 2003-06-30 On an Isoperimetric Problem for Hamming Graphs. 285-309 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00082-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#Harper99 2003-04-02 Optimal embeddings of odd ladders into a hypercube. 73-102 2002 116 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam116.html#CahaK02 2003-05-06 Two-Page Book Embedding of Trees under Vertex-Neighborhood Constraints. 233-241 1993 43 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#MoranW93 http://dx.doi.org/10.1016/0166-218X(93)90114-4 2003-06-23 Special Issue of DAM on the Vapnik-chervonenkis Dimension. 1-2 1998 86 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(98)00019-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam86.html#Shawe-Taylor98 2003-05-21 Short Encodings of Planar Graphs and Maps. 239-252 1995 58 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(93)E0150-W http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#KeelerW95 2003-04-01 Algorithm for recognizing Cartesian graph bundles. 275-302 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#ZmazekZ02 2002-01-03 Asteroidal triples of moplexes. 219-229 2001 111 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam111.html#BerryB01 2003-06-23 Separability Generalizes Dirac's Theorem. 43-53 1998 84 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00005-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam84.html#BerryB98 2006-09-21 Path Optimization for Graph Partitioning Problems. 27-50 1999 90 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00084-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam90.html#BerryG99 2002-01-03 On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes. 251-272 2001 110 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#PakV01 2003-06-23 Bisection Width of Transposition Graphs. 221-235 1998 84 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00009-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam84.html#StachoV98 2003-06-17 On the Splicing Operation. 57-79 1996 70 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(96)00101-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam70.html#Paun96 2003-06-16 Two Machine Openshop Scheduling with Machine-dependent Processing Times. 283-288 1997 73 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00108-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#VakhariaC97 2003-05-26 Establishing Determinantal Inequalities for Positive-definite Matrices. 13-24 1995 63 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00027-B http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#CerdeiraFB95 2002-01-03 More facets from fences for linear ordering and acyclic subgraph polytopes. 185-200 1994 50 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#LeungL94 2005-11-30 Uniquely 2-list colorable graphs. 217-225 2002 119 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#GanjaliGHMS02 2002-01-03 Probabilistic analysis of two k-cluster problems. 27-51 1994 50 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#Cooper94 2003-05-21 A New Class of Nonbinary Codes Meeting the Griesmer Bound. 219-226 1993 47 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(93)90127-A http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#HamadaHY93 2003-07-08 Locally bounded hereditary subclasses of k-colourable graphs. 301-311 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#Zverovich01 2003-07-08 Extension of Hereditary Classes with Substitutions. 487-509 2003 128 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00507-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#Zverovich03 2003-06-16 Optimum Partitioning into Intersections of Ring Families. 81-91 1997 76 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00118-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam76.html#CochandGG97 2002-01-03 Foreword. 1 2001 111 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam111.html#Carlet01 2003-07-08 Preface. 1 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00431-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#Carlet03 2003-05-06 A Faster Algorithm to Recognize Undirected Path Graphs. 261-295 1993 43 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#Schaffer93 http://dx.doi.org/10.1016/0166-218X(93)90116-6 2003-05-22 Computing the Throughput of a Network with Dedicated Lines. 271-278 1993 42 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#PapadimitriouSY93 http://dx.doi.org/10.1016/0166-218X(93)90050-X 2003-05-22 A Simple Proof of Liang's Lower Bound for On-Line bin Packing and the Extension to the Parametric Case. 173-178 1993 41 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#GalambosF93 http://dx.doi.org/10.1016/0166-218X(93)90037-O 2003-05-22 The Time Complexity of Deterministic Broadcast Radio Networks. 219-222 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00053-G http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#Hwang95 2003-04-02 Crossing-free segments and triangles in point configurations. 77-88 2001 115 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam115.html#KarolyiW01 2003-06-23 Neither Reading Few Bits Twice Nor Reading Illegally Helps Much. 223-238 1998 85 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(98)00042-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam85.html#JuknaR98 2003-07-08 On the Non-minimal Codewords in Binary Reed-Muller Codes. 65-74 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00436-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#BorissovMN03 2003-06-18 On the Number of Abelian Square-free Words on Four Letters. 155-167 1998 81 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)88002-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam81.html#Carpi98 2004-05-12 Equivalent literal propagation in the DLL procedure. 251-276 2003 130 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00407-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam130.html#Li03 2003-07-04 Surmise Relations Between Tests - Mathematical Considerations. 221-239 2003 127 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00207-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#BrandtAH03 2003-07-04 On Sum Coloring of Graphs. 477-488 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00249-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#Salavatipour03 2003-04-01 A new Greedoid: the family of local maximum stable sets of a forest. 91-101 2002 124 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam124.html#LevitM02 2003-07-08 Local Search Algorithms for the k-cardinality Tree Problem. 511-540 2003 128 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00548-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#BlumE03 2003-05-21 The Minimum Spanning Tree Problem on a Planar Graph. 91-94 1995 58 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00095-U http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#Matsui95 2004-09-22 An introduction to cocyclic generalised Hadamard matrices. 115-131 2000 102 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam102.html#Horadam00 2003-06-27 Minimal Connected Enclosures on an Embedded Planar Graph. 25-38 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00095-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#AlexopoulosPRS99 2003-06-23 Partial and Perfect Path Covers of Cographs. 143-153 1998 89 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00101-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam89.html#KirkpatrickRRS98 2003-05-22 Preface. 119 1993 42 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(93)90040-U http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#GalbiatiM93 2003-05-13 on the Computation of Pfaffians. 269-275 1994 51 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(92)00034-J http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#GalbiatiM94 2003-04-01 Algorithms for the fixed linear crossing number problem. 93-115 2002 122 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam122.html#Cimikowski02 2003-05-06 On Certain Hamiltonian Inner Triangulations. 185-195 1993 43 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#Cimikowski93 http://dx.doi.org/10.1016/0166-218X(93)90111-Z 2003-04-01 Increasing digraph arc-connectivity by arc addition, reversal and complement. 13-22 2002 122 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam122.html#ArkinHS02 2003-04-02 Combinatorial properties of the family of maximum stable sets of a graph. 149-161 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#LevitM02a 2004-01-15 A Combinatorial Problem in Database Security. 119-126 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00122-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#HorakBM99 2002-01-03 On the relations between SAT and CSP enumerative algorithms. 27-40 2000 107 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam107.html#GenissonJ00 2003-04-01 Single machine scheduling with assignable due dates. 211-233 2002 122 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam122.html#QiYB02 2003-06-27 Generalized Partitions of Graphs. 143-153 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00124-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#MacGilivrayY99 2003-05-22 Bounds on the Size of Merging Networks. 187-194 1995 61 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00015-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam61.html#AignerS95 2003-06-16 The Cardinality and Precedence Constrained Maximum Value Sub-hypergraph Problem, Its Applications. 57-68 1997 74 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00015-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#NehmeY97 2003-06-17 Conserved Synteny As a Measure of Genomic Distance. 247-257 1996 71 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00067-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam71.html#SankoffN96 2003-05-21 The Single-Item Discrete Lotsizing and Scheduling Problem: Optimization by Linear and Dynamic Programming. 289-303 1994 48 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#HoeselKSW94 http://dx.doi.org/10.1016/0166-218X(92)00182-L 2003-05-22 A Shifting Algorithm for Constrained min-max Partition on Trees. 1-28 1993 45 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam45.html#AgasiBP93 http://dx.doi.org/10.1016/0166-218X(93)90137-D 2003-05-27 Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs. 421-436 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#Maurer92 http://dx.doi.org/10.1016/0166-218X(92)90149-5 2003-05-21 On the Equivalence Between Roof Duality and Lagrangian Duality for Unconstrained 0-1 Quadratic Programming Problems. 1-20 1994 48 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#AdamsD94 http://dx.doi.org/10.1016/0166-218X(92)00119-7 2003-05-27 Generating Bent Sequences. 155-159 1992 39 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#AdamsT92 http://dx.doi.org/10.1016/0166-218X(92)90166-8 2003-05-22 Complete Linear Descriptions of Small Asymmetric Traveling Salesman Polytopes. 193-208 1995 62 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)98954-Y http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam62.html#EulerV95 2003-05-26 Time-tables, Polyhedra and the Greedy Algorithm. 207-221 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00036-Q http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#EulerV96 2003-05-26 Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc Graphs. 135-149 1996 64 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00118-W http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam64.html#MaratheHR96 2003-06-27 Compound Constructions of Broadcast Networks. 205-232 1999 93 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00043-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam93.html#DinneenVWZ99 2003-05-27 Generalized Vertex Covering in Interval Graphs. 87-93 1992 39 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#MaratheRR92 http://dx.doi.org/10.1016/0166-218X(92)90116-R 2003-05-27 Generalized Degrees and Menger Path Systems. 179-191 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#FaudreeGL92 http://dx.doi.org/10.1016/0166-218X(92)90132-T 2003-05-27 Chemistry and Discrete Mathematics. 1-4 1996 67 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00022-J http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam67.html#Read96 2003-04-02 On-line scheduling with precedence constraints. 169-180 2002 119 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#AzarE02 2003-05-22 New Complexity Results on Scheduling with Small Communication Delays. 331-342 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00063-J http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#Picouleau95 2004-03-01 Rooted Routing in the Plane. 213-227 1995 57 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00104-L http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam57.html#Reed95 2003-06-18 The k-ball l-path Branch Weight Centroid. 239-246 1997 80 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(97)80003-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#Reid97 2003-07-14 Foreword. 1 2001 109 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam109.html#HurtadoMN01 2002-01-03 Enumerating near-4-regular maps on the sphere and the torus. 273-288 2001 110 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#RenL01 2003-06-27 How to Count Efficiently all Affine Roots of a Polynomial System. 21-32 1999 93 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam93.html#EmirisV99 http://dx.doi.org/10.1016/S0166-218X(99)00003-7 2003-04-01 The complexity of minimizing and learning OBDDs and FBDDs. 263-282 2002 122 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam122.html#Sieling02 2002-01-03 Homogeneous bent functions. 133-139 2000 102 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam102.html#QuSP00 2003-07-08 Sharing Video on Demand. 3-30 2003 129 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00231-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#Bar-NoyGH03 2003-05-21 optimal Computation of Census Functions in the Postal Model. 213-222 1995 58 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)E0148-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#Bar-NoyKS95 2003-07-08 Generation of Key Predistribution Schemes Using Secret Sharing Schemes. 239-249 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00448-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#Saez03 2003-05-21 Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations. 259-272 1994 55 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)90012-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#HoogeveenVV94 2002-01-03 Disjunctive and conjunctive normal forms of pseudo-Boolean functions. 1-26 2000 107 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam107.html#FoldesH00 2003-06-23 Approximation Algorithms for Min-sum p-clustering. 125-142 1998 89 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00100-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam89.html#Guttmann-BeckH98a 2002-01-03 On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane. 291-298 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#Hosono01 2003-05-06 Voronoi Diagrams over Dynamic Scenes. 243-259 1993 43 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#Roos93 http://dx.doi.org/10.1016/0166-218X(93)90115-5 2002-01-03 Vehicle routing with split deliveries. 239-254 1994 50 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#DrorLT94 2003-06-23 A Predetermined Algorithm for Detecting a Counterfeit Coin with a Multi-arms Balance. 181-200 1998 86 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(98)00025-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam86.html#Bonis98 2003-05-21 Adjacency on Combinatorial Polyhedra. 311-321 1995 56 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00092-R http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#MatsuiT95 2006-03-29 Monotonicity and Efficient Computation of Optimal Dichotomous Search. 221-234 1993 46 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam46.html#HassinH93 http://dx.doi.org/10.1016/0166-218X(93)90104-V 2003-04-01 Subgraphs decomposable into two trees and k-edge-connected subgraphs. 181-195 2003 126 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam126.html#HassinL03 2003-06-17 Polynomial Algorithms for (integral) Maximum Two-flows in Vertex Edge-capacitated Planar Graphs. 267-283 1996 70 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00111-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam70.html#GranotP96 2003-05-22 On Polynomial Solvability of the High Multiplicity Total Weighted Tardiness Problem. 139-146 1993 41 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#GranotS93 http://dx.doi.org/10.1016/0166-218X(93)90034-L 2003-05-21 <i>k</i><i>k</i>-Trees. 129-145 1994 48 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#GranotS94 http://dx.doi.org/10.1016/0166-218X(92)00122-3 2003-04-01 Algorithm for statistical alignment of two sequences derived from a Poisson sequence length distribution. 79-84 2003 127 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#Miklos03 2003-05-21 The Nonexistence of Reduction Rules Giving an Embedding into a K-tree. 219-223 1994 54 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)90023-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam54.html#Lagergren94 2003-05-26 Bounded Depth Broadcasting. 255-270 1996 66 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00165-A http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#PetersP96 2003-06-25 A Characterization of Signed Hypergraphs and Its Applications to VLSI Via Minimization and Logic Synthesis. 223-243 1999 90 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00092-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam90.html#ShiB99 2002-01-03 An approximation result for a periodic allocation problem. 53-72 2001 112 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam112.html#ConfessoreDG01 2003-04-01 An approximation result for the interval coloring problem on claw-free chordal graphs. 73-90 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#ConfessoreDG02 2003-06-18 Broadcast and Gossip in Line-communication Mode. 161-176 1997 80 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(97)00054-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#Laforest97 2003-05-21 On the Directionality of Interval Orders. 87-92 1994 48 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#BouchitteJR94 http://dx.doi.org/10.1016/0166-218X(94)90120-1 2003-05-22 A Tight Bound for 3-Partitioning. 249-259 1993 45 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam45.html#KellererW93a http://dx.doi.org/10.1016/0166-218X(93)90013-E 2003-06-23 The Capacity of Monotonic Functions. 95-107 1998 86 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(98)00016-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam86.html#Sill98 2003-05-22 Preface. 1 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)90083-R http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#Boros95 2003-06-30 Maximum Renamable Horn sub-CNFs. 29-40 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00031-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#Boros99 2003-05-22 On the Occurrence of Null Clauses in Random Instances of Satisfiability. 203-209 1993 41 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#Franco93 http://dx.doi.org/10.1016/0166-218X(90)90054-G 2003-06-30 ₄-domination in Minimal Imperfect Graphs. 329-336 1999 94 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00029-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam94.html#Rusu99 2003-05-27 Chordal Rings as Fault-Tolerant Loops. 563-573 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#ZimmermanE92 http://dx.doi.org/10.1016/0166-218X(92)90159-8 2002-01-03 On the complexity of the dual method for maximum balanced flows. 77-88 1994 50 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#Zimmermann94 2003-05-22 A Generalization of the Stable Matching Problem. 87-102 1995 59 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0154-Q http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#TanH95 2003-06-25 Routing Multiterminal Nets on a Hexagonal Grid. 245-255 1999 90 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00093-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam90.html#TanS99 2003-05-22 Deterministic Communication Complexity of Set Intersection. 271-283 1995 61 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00021-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam61.html#Tamm95 2002-01-03 Euler is standing in line dial-a-ride problems with precedence-constraints. 87-107 2001 113 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#HauptmeierKRW01 2003-05-21 The Depth and Width of Local Minima in Discrete Solution Spaces. 75-82 1995 56 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0134-K http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#Ryan95 2002-03-21 Algorithms for Routing around a Rectangle. 363-378 1992 40 Discrete Applied Mathematics 4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#FrankNSS92 2003-07-24 Dynamic Behavior of Cyclic Automata Networks. 161-184 1997 77 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(97)84104-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam77.html#MatamalaG97 2002-01-03 Generalized self-approaching curves. 3-24 2001 109 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam109.html#AichholzerAIKLR01 2003-05-21 Expanding and Forwarding. 67-78 1995 58 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0118-I http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#Sole95 2003-05-22 Generalization of aTheorem on the Parametric Maximum Flow Problem. 69-74 1993 41 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#AraiUK93 http://dx.doi.org/10.1016/0166-218X(93)90245-J 2003-09-16 The Asymmetric Median Tree - A New Model for Building Consensus Trees. 311-335 1996 71 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00071-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam71.html#PhillipsW96 2003-05-27 Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies. 465-488 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#Rosenberg92 http://dx.doi.org/10.1016/0166-218X(92)90152-Z 2003-07-22 On the Consecutive Ones Property. 325-354 1998 88 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00078-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam88.html#MeidanisPT98 2003-04-01 Detection of the discrete convexity of polyominoes. 115-133 2003 125 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam125.html#Debled-RennessonRR03 2003-04-01 Discrete location problems with push-pull objectives. 363-378 2002 123 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam123.html#KrarupPP02 2003-07-04 Parsimonious Set Representations of Orders, a Generalization of the Interval Order Concept, and Knowledge Spaces. 373-386 2003 127 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00255-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#Suck03 2003-05-27 The Connectivity of Hierarchical Cayley Digraphs. 275-280 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#HamidouneLS92 http://dx.doi.org/10.1016/0166-218X(92)90138-Z 2003-06-18 Correlation Functions of a Family of Generalized Geometric Sequences. 193-201 1997 80 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(97)00060-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#SunY97 2003-04-01 The structure of stable marriage with indifference. 167-181 2002 122 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam122.html#Manlove02 2003-06-27 On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs. 155-175 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00147-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#Manlove99 2003-05-22 A Linear Algorithm for the Group Path Problem on Chordal Graphs. 185-190 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#ArikatiP93 http://dx.doi.org/10.1016/0166-218X(93)90230-L 2003-05-26 A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs. 5-20 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00086-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#ArikatiP96 2002-01-03 Broadcasting in m-dimensional grid graphs with a given neighborhood template. 25-36 1994 53 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam53.html#Djelloul94 2003-04-02 Graph representations of a bicircular matroid. 249-262 2002 118 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#Neudauer02 2002-01-03 Reflectiveness and compression of threshold transformations. 215-224 2000 107 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam107.html#Ueda00 2003-06-23 A Parametric Critical Path Problem and an Application for Cyclic Scheduling. 149-158 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00054-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#LevnerK98 2004-01-15 The train marshalling problem. 41-54 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#DahlhausHMR00 2003-06-16 Directed Rectangle-visibility Graphs Have Unbounded Dimension. 35-39 1997 73 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00075-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#Romanik97 2003-06-16 Graph Domination, Tabu Search and the Football Pool Problem. 217-228 1997 74 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00049-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#DaviesR97 2003-06-18 A Constructive Proof for the Induction of M-convex Functions through Networks. 271-278 1998 82 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00089-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam82.html#Shioura98 2003-04-01 ₃₂)-configurations. 3-12 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#ArbibF02 2003-04-02 A group testing problem for graphs with several defective edges. 99-108 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#Johann02 2003-05-26 The Modified Differencing Method for the Set Partitioning Problem with Cardinality Constraints. 175-180 1995 63 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00032-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#Tsai95 2003-06-18 Transversal Partitioning in Balanced Hypergraphs. 75-89 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00034-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#DahlhausKMM97 2003-06-16 Switchdec Polyhedra. 141-163 1997 76 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00122-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam76.html#Gaillard97 2003-05-21 Heat Conduction on Graphs. 1-16 1994 52 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(92)00183-M http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#Abu-JaradehP94 2003-04-01 Aligning two fragmented sequences. 119-143 2003 127 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#VeeramachaneniBM03 2002-01-03 Score certificate numbers of upset tournaments. 177-189 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#PoetS00 2003-05-26 A Fixed Point Operator for the Generalised Maximum Satisfiability Problem. 117-132 1993 46 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam46.html#Cochand93 http://dx.doi.org/10.1016/0166-218X(93)90024-I 2003-05-21 The Performance Ratio of Grouping Policies for the Joint Replenishment Problem. 43-72 1993 46 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam46.html#QueyranneS93 http://dx.doi.org/10.1016/0166-218X(93)90157-J 2003-06-16 Approximation Algorithms for Multi-index Transportation Problems with Decomposable Costs. 239-253 1997 76 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00128-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam76.html#QueyranneS97 2003-04-02 Efficient generation of rotating workforce schedules. 85-98 2002 118 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#MusliuGS02 2005-11-10 The Maximal Clique and Colourability of Curve Contact Graphs. 59-68 1998 81 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00075-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam81.html#Hlincny98 2003-05-13 Inequalities for Minimal Covering Sets in Set Systems of Given Rank. 187-195 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90108-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#Tuza94 2003-04-02 On the computational complexity of strong edge coloring. 239-248 2002 118 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#Mahdian02 2003-04-01 Annealed replication: a new heuristic for the maximum clique problem. 27-49 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#BomzeBPR02 2003-05-26 A Simple as Correct Algorithm for Deciding If a Graph Has a Perfect Matching. 181-185 1995 63 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(95)00052-S http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#Brito95 2003-05-27 Structural Properties of Matroid Matchings. 69-85 1992 39 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#Vate92 http://dx.doi.org/10.1016/0166-218X(92)90115-Q 2003-05-26 Laplacian Spectra and Spanning Trees of Threshold Graphs. 255-273 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00049-J http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#HammerK96 2003-05-22 NP-completeness of Some Edge-disjoint Paths Problems. 83-90 1995 61 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0177-Z http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam61.html#Vygen95 2003-06-18 Weighted Domination of Cocomparability Graphs. 135-148 1997 80 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(97)80001-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#Chang97 2002-01-03 Determining the automorphism group of the linear ordering polytope. 121-128 2001 112 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam112.html#Fiorini01 2003-05-22 optimal Separable Partitioning in the Plane. 215-224 1995 59 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)80002-L http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#BenelliH95 2003-05-21 <i>n</i>) Algorithm to Solve the Bottleneck Traveling Salesman Problem Restricted to Ordered Product Matrices. 57-75 1993 47 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#Veen93 http://dx.doi.org/10.1016/0166-218X(93)90152-E 2003-06-23 Complexity of Minimum Biclique Cover and Minimum Biclique Decomposition for Bipartite Domino-free Graphs. 125-144 1998 86 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(98)00039-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam86.html#AmilhastreVJ98 2003-06-30 Bidual Horn Functions and Extensions. 55-88 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00033-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#EiterIM99 2003-05-22 Recognizing Renamable Generalized Propositional Horn Formulas Is NP-complete. 23-31 1995 59 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0152-O http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#EiterKM95 2003-06-16 Stage-graph Representations. 71-80 1997 75 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00080-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#KranakisKMNSU97 2003-06-25 Optimal Layout of Edge-weighted Forests. 135-159 1999 90 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00088-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam90.html#FischerP99 2003-04-01 Total interval numbers of complete r-partite graphs. 83-92 2002 122 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam122.html#ChenC02 2004-05-12 Regular Coronoid Systems. 147-158 1997 74 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(96)00027-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#ChenF97 2003-06-17 Parallel Complexity of Partitioning a Planar Graph Into Vertex-induced Forests. 183-198 1996 69 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(96)00089-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam69.html#ChenH96 2003-05-26 An Improved Lower Bound for the Bin Packing Problem. 81-94 1996 66 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(96)80459-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#ChenS96 2003-07-04 A New Proof of Wojcicka's Conjecture. 545-554 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00387-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#ChenT03 2003-06-23 Scale-sensitive Dimensions and Skeleton Estimates for Classification. 37-61 1998 86 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(98)00013-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam86.html#HorvathL98 2003-06-17 The Complexity of Generalized Graph Colorings. 257-270 1996 69 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(96)00096-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam69.html#Brown96 2005-10-31 Interval orders Based on Weak orders. 93-98 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00110-D http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#BogartBM95 2002-01-03 On exclusion regions for optimal triangulations. 49-65 2001 109 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam109.html#DrysdaleMS01 2003-04-01 Cutting planes in integer and mixed integer programming. 397-446 2002 123 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam123.html#MarchandMWW02 2002-01-03 Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem. 175-191 2001 108 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#ShahrokhiS01 2003-06-18 Edge-forwarding Index of Star Graphs and Other Cayley Graphs. 149-160 1997 80 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(97)00052-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#Gauyacq97a 2002-01-03 On optimal broadcasting in faulty hypercubes. 3-13 1994 53 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam53.html#Bruck94 2003-05-27 Examples of Products Giving Large Graphs with Given Degree and Diameter. 157-167 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#Delorme92 http://dx.doi.org/10.1016/0166-218X(92)90130-3 2003-06-16 Long Cycles and Long Paths in the Kronecker Product of a Cycle, a Tree. 101-121 1997 74 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(96)00022-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#JhaAK97 2003-05-22 A Note on Graphs Which Have Upper Irredundance Equal to Independence. 91-97 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#JacobsonP93 http://dx.doi.org/10.1016/0166-218X(93)90224-C 2003-05-22 On Specifying Boolean Functions by Labelled Examples. 1-25 1995 61 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00007-Z http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam61.html#AnthonyBS95 2002-01-03 The m-step competition graph of a digraph. 115-127 2000 105 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam105.html#ChoKN00 2003-05-22 The Arborescence-realization Problem. 267-283 1995 59 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)80005-O http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#SwaminathanW95 2003-04-01 Bounds for probabilistic integer programming problems. 55-65 2002 124 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam124.html#DentchevaPR02 2003-06-16 How to Cut a Cake Fairly Using a Minimal Number of Cuts. 183-190 1997 74 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(96)00032-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#Webb97 2002-03-21 Steiner's Problem in Graphs: Heuristic Methods. 45-72 1992 40 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#Voss92 2005-06-06 Note on the problem of gossiping in multidimensional grids. 287-290 1994 53 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam53.html#MaheoS94a 2003-05-22 Bounded Discrete Representations of Interval Orders. 157-183 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#Isaak93 http://dx.doi.org/10.1016/0166-218X(93)90229-H 2003-04-01 Generalized balances in Sturmian words. 83-101 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#FagnotV02 2002-03-21 Partial Dependencies in Relational Databases and their Realization. 127-138 1992 40 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#DemetrovicsKM92 2003-05-21 A Random Polynomial Time Algorithm for Well-rounding Convex Bodies. 117-144 1995 58 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(93)E0123-G http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#FaigleGK95 2002-03-21 The Characterization of Branching Dependencies. 139-153 1992 40 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#DemetrovicsKS92 2002-03-21 Functional Dependencies in Relational Databases: A Lattice Point of View. 155-185 1992 40 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#DemetrovicsLM92 2003-06-16 Bounds on the Number of Knight's Tours. 171-181 1997 74 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(96)00031-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#KyekPW97 2003-06-23 The Degree of Approximation of Sets in Euclidean Space Using Sets with Bounded Vapnik-Chervonenkis Dimension. 81-93 1998 86 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(98)00015-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam86.html#MaiorovR98 2002-03-21 The Communication Complexity of Interval Orders. 19-28 1992 40 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#FaigleST92 2003-05-21 Two Remarks on "Expanding and Forwarding" By P. Solé. 85-89 1995 58 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(95)00109-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#Vrto95 2003-05-21 A Set Covering Reformulation of the Pure Fixed Charge Transportation Problem. 245-259 1994 48 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#Gothe-LundgrenL94 http://dx.doi.org/10.1016/0166-218X(92)00177-N 2003-07-02 Tree Partitioning Under Constraints - Clustering for Vehicle Routing Problems. 55-69 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00125-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#HamacherHM00 2003-05-27 Cost-Performance Tradeoffs for Interconnection Networks. 359-385 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#KruskalS92 http://dx.doi.org/10.1016/0166-218X(92)90146-2 2003-06-17 Representation Theory and Invariant Neural Networks. 33-60 1996 69 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00075-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam69.html#WoodS96 2003-06-30 An Exact Method for Minimizing the Makespan of an Application Processed on a Master Slave Bus Oriented Multiprocessor System. 51-76 1999 94 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00014-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam94.html#BouffletC99 2004-07-22 From weight enumerators to zeta functions. 55-73 2001 111 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam111.html#Duursma01 2003-06-23 A Representation Theorem of the Suffixes of Characteristic Sequences. 47-57 1998 85 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(97)00142-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam85.html#Chuan98 2003-07-08 Recognition of Some Perfectly Orderable Graph Classes. 355-373 2003 128 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00499-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#EschenJSS03 2003-05-27 Graphs with Small Diameter After Edge Deletion. 73-94 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#Chung92 http://dx.doi.org/10.1016/0166-218X(92)90126-U 2003-06-30 Matching-star Ramsey Sets. 417-424 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00089-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#MengersenO99 2003-05-27 Measure Theoretic Approach to the Classification of Cellular Automata. 125-136 1992 39 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#Ishii92 http://dx.doi.org/10.1016/0166-218X(92)90163-5 2003-05-13 Algorithmic Characterizations of Interval ordered Hypergraphs and Applications. 159-170 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90105-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#QuilliotC94 2003-05-21 A Result of Vapnik with Applications. 207-217 1993 47 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(93)90126-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#AnthonyS93 2003-05-21 A Result of Vapnik with Applications. 211 1994 52 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00025-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#AnthonyS94 2003-06-16 A Sufficient Condition for Polynomial Distribution-dependent Learnability. 1-12 1997 77 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00129-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam77.html#AnthonyS97 2002-01-03 Optimal arrangement of data in a tree directory. 243-253 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#LuczakN01 2003-04-01 Optimal arrangement of data in a tree directory. 307-315 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#LuczakN02 2003-06-17 Some Results About Normal Forms for Functional Dependency in the Relational Datamodel. 61-74 1996 69 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00076-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam69.html#DemetrovicsT96 2002-01-03 Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. 73-99 2001 112 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam112.html#CrainicFG01 2002-01-03 A Localization and Reformulation Discrete Programming Approach for the Rectilinear Distance Location-Allocation Problem. 357-378 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#SheraliRK94 2005-07-07 Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations. 247-267 2000 101 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam101.html#SheraliSA00 2003-06-27 Separating Lifted Odd-hole Inequalities to Solve the Index Selection Problem. 111-134 1999 92 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00050-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam92.html#CapraraG99 2002-01-03 Lower bounds and algorithms for the 2-dimensional vector packing problem. 231-262 2001 111 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam111.html#CapraraT01 2002-01-03 Approximation algorithms for the shortest total path length spanning tree problem. 273-289 2000 105 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam105.html#WuCT00 2003-06-30 Approximation Algorithms for Partitioning Small Items in Unequal Bins to Minimize the Total Size. 181-191 1999 94 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00020-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam94.html#DellOlmoS99 2003-04-02 The vehicle routing problem with pickups and deliveries on some special graphs. 193-229 2002 116 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam116.html#Eilam-TzoreffGGS02 2003-07-08 ^e₄. 3-9 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00432-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#AbualrubO03 2003-05-26 Design of a D-connected Digraph with a Minimum Number of Edges and a Quasiminimal Diameter: II. 267-279 1996 64 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00113-R http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam64.html#SoneokaIM96 2003-06-23 On the Average Hamming Distance for Binary Codes. 269-276 1998 89 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00081-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam89.html#XiaF98 2003-06-27 On the Average Hamming Distance for Binary Codes. 85-89 1999 92 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(99)80002-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam92.html#XiaF99 2002-01-03 A comparison of Steiner tree relaxations. 241-261 2001 112 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam112.html#PolzinD01 2004-01-09 ₃. 401-411 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00147-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#CarstensDS00 2003-06-23 More ZCPS-Wh(v) and Several New Infinite Classes of Z-cyclic Whist Tournaments. 193-202 1998 85 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(98)00034-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam85.html#FinizioL98 2002-01-03 Some new Z-cyclic whist tournaments. 115-130 2000 101 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam101.html#FinizioM00 2003-05-21 Stable Marriage and Indifference. 261-272 1994 48 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#Irving94 http://dx.doi.org/10.1016/0166-218X(92)00179-P 2002-03-21 Balanced Block Spacing for VLSI Layout. 303-318 1992 40 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#CederbaumKW92 2003-07-08 The Construction of Cubic and Quartic Planar Maps with Prescribed Face Degrees. 541-554 2003 128 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00549-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#BrinkmannHH03 2004-02-17 Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. 13-23 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#BauerBMS02 2003-06-23 A constructive enumeration of nanotube cap. 55-71 2002 116 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam116.html#BrinkmannNP02 2003-06-16 Large Cayley Graphs on an Abelian Group. 125-133 1997 75 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(96)00084-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#GarciaP97 2003-06-16 VC-dimensions of Finite Automata and Commutative Finite Automata with k Letters and n States. 229-240 1997 74 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00050-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#IshigamiT97a 2003-05-27 Minimum Perfect Bipartite Matchings and Spanning Trees under Categorization. 147-153 1992 39 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#RicheyP92 http://dx.doi.org/10.1016/0166-218X(92)90165-7 2003-06-17 Regularity of Splicing Languages. 101-124 1996 69 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00079-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam69.html#Pixton96 2003-06-17 All-pairs-shortest-length on Strongly Chordal Graphs. 169-182 1996 69 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00088-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam69.html#BalachandhranR96 2003-06-30 Combinatorics of RNA Secondary Structures. 207-237 1998 88 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00073-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam88.html#HofackerSS98 2003-06-23 Weighted Connected Domination and Steiner Trees in Distance-hereditary Graphs. 245-253 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00060-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#YehC98 2003-07-04 The Disjunctivities of w-languages. 627-641 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00393-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#YehY03 2003-05-26 The Weighted Perfect Domination Problem and Its Variants. 147-160 1996 66 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00138-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#YenL96 2004-02-17 The Complexity of Recognizing Tough Cubic Graphs. 35-44 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00030-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#BauerHMS97 2003-04-01 Matchings in colored bipartite networks. 261-277 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#YiMS02 2003-06-27 Learning with Queries Corrupted by Classification Noise. 157-175 1999 92 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00045-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam92.html#JacksonSS99 2003-05-21 Finding Degeneracies Among Sets of Lines. 49-60 1995 56 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(92)00187-Q http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#Leblanc95 2004-02-25 On bandwidth-2 graphs. 1-13 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#CapraraMP02 2003-05-22 Algorithms for Weakly Triangulated Graphs. 181-191 1995 59 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(93)E0161-Q http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#SpinradS95 2003-04-01 On the consistency of the minimum evolution principle of phylogenetic inference. 63-77 2003 127 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#DenisG03 2003-07-02 Chordality and 2-factors in Tough Graphs. 323-329 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00142-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#BauerKKV00 2002-01-03 Approximation algorithms for some optimum communication spanning tree problems. 245-266 2000 102 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam102.html#WuCT00a 2003-06-23 Efficient Broadcasting with Linearly Bounded Faults. 99-105 1998 89 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00118-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam89.html#CiebieraM98 2003-06-30 An Alternate Formulation of the Symmetric Traveling Salesman Problem and Its Properties. 173-190 2000 98 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(99)00154-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#ArthanariU00 2002-01-03 Maximal cubic graphs with diameter 4. 53-61 2000 101 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam101.html#Buset00 2003-06-23 The Set of Reversible 90/150 Cellular Automata Is Regular. 199-213 1998 84 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00004-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam84.html#SarkarB98 2003-06-30 On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs. 41-60 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00064-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#Bang-JensenG99 2003-05-22 Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs. 75-79 1993 41 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#Bang-JensenH93 http://dx.doi.org/10.1016/0166-218X(93)90246-K 2003-05-22 Right Invariant Metrics and Measures of Presortedness. 1-16 1993 42 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#Estivill-CastroMW93 http://dx.doi.org/10.1016/0166-218X(93)90175-N 2003-05-21 Using Local Adaptations to Reconfigure a Spanning Tree of a Network. 67-74 1995 57 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00077-Q http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam57.html#Pruhs95 2003-06-16 k-Path Partitions in Trees. 227-233 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00012-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#YanCHH97 2003-05-22 optimal Detection of a Counterfeit Coin with Multi-arms Balances. 121-131 1995 61 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00010-B http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam61.html#BonisGV95 2002-01-03 Statistical learning formulation of the DNA base-calling problem and its solution in a Bayesian EM framework. 229-258 2000 104 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam104.html#PereiraADKM00 2003-05-22 Decomposability of Partially Defined Boolean Functions. 51-75 1995 62 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00145-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam62.html#BorosGHIK95 2003-06-16 Comparability Graph Augmentation for some Multiprocessor Scheduling Problems. 71-84 1997 72 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(96)00037-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam72.html#DellOlmoST97 2003-05-06 The Allocation Problem in Hardware Design. 37-46 1993 43 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#Jansen93 http://dx.doi.org/10.1016/0166-218X(93)90167-M 2003-05-21 Analysis of Scheduling Problems with Typed Task Systems. 223-232 1994 52 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)90142-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#Jansen94 2003-05-22 Scheduling of Conditional Executed Jobs on Unrelated Processors. 245-255 1995 61 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00013-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam61.html#Jansen95 2003-05-22 The Chromatic Difference Sequence of the Cartesian Product of Graphs: Part II. 263-267 1993 41 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#Zhou93 http://dx.doi.org/10.1016/0166-218X(90)90059-L 2003-05-21 Classic Squares and Broadcast Squares. 89-96 1994 54 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00024-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam54.html#ValerioMM94 2003-06-18 On Aggregating Two Linear Diophantine Equations. 231-246 1998 82 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00123-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam82.html#ZhuB98 2003-05-21 On Constructing the Elimination Tree. 93-98 1994 48 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#ZhuM94 http://dx.doi.org/10.1016/0166-218X(94)90121-X 2003-04-01 Total domination number of grid graphs. 119-128 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#Gravier02 2003-05-21 Combinatorial Algorithms on a Class of Graphs. 215-217 1994 54 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)90022-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam54.html#Korneyenko94 2002-01-03 A note on the generalized steiner tree polytope. 137-144 2000 100 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam100.html#Salazar00 2003-04-01 Surface digitizations by dilations which are tunnel-free. 81-91 2003 125 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam125.html#LinckeW03 2003-05-22 Lower Bounds for Hypergraph Ramsey Numbers. 177-180 1995 61 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00167-C http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam61.html#AbbottS95 2002-01-03 Improved algorithms for the Steiner problem in networks. 263-300 2001 112 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam112.html#PolzinD01a 2003-05-26 Labeled Versus Unlabeled Distributed Cayley Networks. 223-236 1995 63 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00070-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#KranakisK95 2003-06-23 Simple Planar Graph Partition into Three Forests. 121-132 1998 84 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00007-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam84.html#GrossiL98 2003-07-08 Some Constructions of Superimposed Codes in Euclidean Spaces. 85-101 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00438-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#Danev03 2003-06-23 Fringe Thickness and Maximum Path Length of Binary Trees. 75-97 1998 89 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00117-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam89.html#Cameron98 2003-05-27 Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems. 119-146 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#DasGD92 http://dx.doi.org/10.1016/0166-218X(92)90128-W 2003-05-13 Constructing Colorings for Diagrams. 85-93 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90096-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#FelsnerGMR94 2003-04-02 Lengths of tours and permutations on a vertex set of a convex polygon. 63-71 2001 115 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam115.html#HiroHM01 2003-11-27 The Shapley value on convex geometries. 33-40 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#BilbaoE00 2003-06-27 Efficient m-ary Balanced Codes. 17-56 1999 92 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(98)00129-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam92.html#TalliniV99 2003-05-22 A Primal Dual Integer Programming Algorithm. 261-275 1993 45 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam45.html#LlewellynR93 http://dx.doi.org/10.1016/0166-218X(93)90014-F 2003-05-06 Dividing and Conquering the Square. 131-153 1993 43 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#LlewellynT93 http://dx.doi.org/10.1016/0166-218X(93)90004-8 2003-05-27 Stable Matchings with Couples. 203-207 1996 68 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(96)89151-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#AldershofC96 2002-01-03 A minimum broadcast graph on 63 vertices. 247-250 1994 53 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam53.html#Labahn94 2003-04-02 Single bend wiring on surfaces. 27-40 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#GarridoMMP02 2002-03-21 Processor Interconnection Networks from Cayley Graphs. 333-357 1992 40 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#SchibellS92 2002-01-03 Solution of the knight's Hamiltonian path problem on chessboards. 125-134 1994 50 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#ConradHMW94 2003-06-18 On the Average Steiner Distance of Graphs with Prescribed Properties. 91-103 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00035-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#DankelmannSO97 2003-06-27 Lower Bounds for the Number of Edge-crossings Over the Spine in a Topological Book Embedding of a Graph. 149-155 1999 92 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00044-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam92.html#EnomotoMO99 2003-06-23 Pyramidal Tours with Step-backs and the Asymmetric Traveling Salesman Problem. 57-65 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00048-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#EnomotoOO98 2003-04-01 Strong thinning and polyhedric approximation of the surface of a voxel object. 93-114 2003 125 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam125.html#BurguetM03 2003-05-21 A Recurrence Template for Several Parameters in Series-parallel Graphs. 151-168 1994 54 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)90020-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam54.html#GrinsteadS94 2003-06-16 A Proof of Jean De Rumeur's Conjecture. 295-299 1997 74 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(97)00003-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#Perennes97 2003-06-20 Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks. 247-262 1998 83 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam83.html#Perennes98 http://dx.doi.org/10.1016/S0166-218X(97)00113-3 2003-06-17 Minimizing Phylogenetic Number To Find Good Evolutionary Trees. 111-136 1996 71 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00060-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam71.html#GoldbergGPSW96 2003-05-22 A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem. 279-290 1993 42 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#KanSV93 http://dx.doi.org/10.1016/0166-218X(93)90051-O 2003-04-02 Complexity of list coloring problems with a fixed total number of colors. 65-79 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#GravierKK02 2003-06-23 How Good Are Branching Rules in DPLL? 281-286 1998 89 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00045-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam89.html#Ouyang98 2002-01-03 A Generalization of maximal independent sets. 223-235 2001 109 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam109.html#JagotaNS01 2003-05-21 Auclidean Steiner Minimal Trees with Obstacles and Steiner Visibility Graphs. 187-206 1993 47 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#Winter93 http://dx.doi.org/10.1016/0166-218X(93)90092-3 2002-01-03 Algorithmic aspects of clique-transversal and clique-independent sets. 183-202 2000 100 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam100.html#GuruswamiR00 2003-06-18 Line broadcasting in cycles. 207-228 1998 83 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam83.html#KaneP98 http://dx.doi.org/10.1016/S0166-218X(97)00111-X 2003-05-22 ₃₅e. 209-219 1995 62 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00153-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam62.html#Mahjoub95 2002-01-03 Parallel machine scheduling with splitting jobs. 259-269 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#XingZ00 2003-05-26 Matroid optimization with Generalized Constraints. 161-174 1995 63 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00031-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#Srinivas95 2003-06-18 On Trees and Noncrossing Partitions. 263-269 1998 82 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00118-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam82.html#Klazar98 2003-06-27 The b-chromatic Number of a Graph. 127-141 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00146-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#IrvingM99 2003-05-22 Elemantary Sequences, Sub-Fibonacci Sequences. 261-281 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#FishburnR93 http://dx.doi.org/10.1016/0166-218X(93)90236-H 2002-01-03 Interference patterns in bijective colorings of 2-regular graphs. 189-204 2000 102 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam102.html#FishburnW00 2003-04-01 Vertex pancyclic graphs. 219-237 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#RanderathSTV02 2003-05-26 No-hole K-tuple (r+1)-distant Colorings of odd Cycles. 87-92 1996 64 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(95)00108-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam64.html#Guichard96 2003-06-30 Embeddings of Complete Binary Trees into Grids and Extended Grids with Total Vertex-congestion 1. 237-254 2000 98 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(99)00161-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#OpatrnyS00 2003-05-21 on Sparse Languages L such that LL = Sigma. 275-285 1994 52 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)90146-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#EnfloGSY94 2003-04-01 Graphs having distance-n domination number half their order. 97-107 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#FischermannV02 2003-06-16 Multiplicative Circulant Networks Topological Properties and Communication Algorithms. 281-305 1997 77 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00138-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam77.html#Stojmenovic97 2003-06-25 Transistor Chaining in Static CMOS Functional Cells of Arbitrary Planar Topology. 89-114 1999 90 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00086-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam90.html#CarlsonCM99 2002-01-03 Broadcasting on [0, L]. 299-319 1994 53 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam53.html#RavishankarS94 2003-05-22 Asymptotically optimal Gossiping in Radio Networks. 61-82 1995 61 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0176-Y http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam61.html#RavishankarS95 2003-06-30 The Proper Linear Spaces on 17 Points. 83-108 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00151-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#BettenB99 2003-04-02 Higher order connectivity index of starlike trees. 287-295 2002 119 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#RadaA02 2003-06-23 Combinatorial Variability of Vapnik-chervonenkis Classes with Applications to Sample Compression Schemes. 3-25 1998 86 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(98)00000-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam86.html#Ben-DavidL98 2003-07-08 Randic Structure of a Graph. 447-463 2003 128 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00505-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#RadaU03 2003-07-04 Reconstructing Minimal Rooted Trees. 489-503 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00250-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#Semple03 2003-06-18 Tree Enterprises and Bankruptcy Ventures a Game Theoretic Similarity Due to a Graph Theoretic Proof. 105-117 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00036-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#Driessen97 2003-06-16 A Nice Class for the Vertex Packing Problem. 3-19 1997 76 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00114-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam76.html#BertolazziSG97 2003-05-06 The Skeleton of the Symmetric Traveling Salesman Polytope. 63-74 1993 43 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#Sierksma93 http://dx.doi.org/10.1016/0166-218X(93)90169-O 2003-06-18 Interchange Graphs and the Hamiltonian Cycle Polytope. 217-224 1998 81 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00086-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam81.html#Sierksma98 2003-06-17 Gap Strings and Spanning Forests for Bridge Graphs of Biconnected Graphs. 125-145 1996 69 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00080-B http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam69.html#Stephens96 2003-06-16 Bond Graphs II: Causality and Singularity. 143-173 1997 73 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(96)00006-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#LambWA97a 2003-06-18 Cardinality Constrained Boolean Quadratic Polytope. 137-154 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00039-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#Mehrotra97 2002-01-03 A class of greedy algorithms for the generalized assignment problem. 209-235 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#RomeijnM00 2002-01-03 A probabilistic analysis of the multi-period single-sourcing problem. 301-328 2001 112 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam112.html#RomeijnM01 2003-06-23 Median Hyperplanes in Normed Spaces - A Survey. 181-195 1998 89 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00103-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam89.html#MartiniS98 2003-06-16 Rectangle-visibility Representations of Bipartite Graphs. 9-25 1997 75 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00029-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#DeanH97 2003-04-02 Bipartition constrained edge-splitting in directed graphs. 49-62 2001 115 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam115.html#GabowJ01 2003-06-18 Wiener Number of Vertex-weighted Graphs and a Chemical Application. 73-81 1997 80 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(97)00070-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#KlavzarG97 2003-07-15 Stabbing Information of a Simple Polygon. 67-82 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00144-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#EverettHN99 2003-05-22 Dominating Cartesian Products of Cycles. 129-136 1995 59 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(93)E0167-W http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#KlavzarS95 2003-06-23 ₄s. 1-13 1998 84 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)90120-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam84.html#BabelO98 2003-05-27 Algebraic Approach to Fasciagraphs and Rotagraphs. 93-100 1996 68 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00058-Y http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#KlavzarZ96 2003-06-16 An Algorithm for Finding Homogeneous Pairs. 209-218 1997 72 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00090-E http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam72.html#EverettKR97 2003-06-30 On the p-connectedness of Graphs - A Survey. 11-33 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00062-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#BabelO99 2003-05-13 Hard-to-color Graphs for Connected Sequential Colorings. 3-25 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90090-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#BabelT94 2003-05-21 Nearly on Line Scheduling of Preemptive Independent Tasks. 229-241 1995 57 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00105-M http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam57.html#Sanlaville95 2003-05-22 <i>k</i>Edges. 295-304 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#HaynesBD93 http://dx.doi.org/10.1016/0166-218X(93)90238-J 2003-06-25 Spectral Partitioning with Multiple Eigenvectors. 3-26 1999 90 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00083-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam90.html#AlpertKY99 2003-05-22 Enumeration of Acyclic Walks in a Graph. 117-123 1993 45 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam45.html#BabicG93 http://dx.doi.org/10.1016/0166-218X(93)90055-S 2003-05-26 Selecting Jobs for Scheduling on a Machine Subject to Failure. 257-265 1995 63 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00072-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#Stadje95 2003-05-27 Möbius Inversion on a Poset of a Graph and Its Acyclic Subgraphs. 5-11 1996 67 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00007-E http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam67.html#BabicT96 2003-04-02 A note on orientations of mixed graphs. 271-278 2002 116 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam116.html#ArkinH02 2003-05-21 Approximation Algorithms for the Geometric Covering Salesman Problem. 197-218 1994 55 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)90008-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#ArkinH94 2003-07-22 Bisecting De Bruijn and Kautz Graphs. 87-97 1998 85 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(98)00031-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam85.html#RolimTTV98 2003-06-17 The Number of Clone Orderings. 233-245 1996 69 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(96)00093-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam69.html#Newberg96 2003-05-27 The Complexity of Lifted Inequalities for the Knapsack Problem. 113-123 1992 39 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#HartvigsenZ92 http://dx.doi.org/10.1016/0166-218X(92)90162-4 2003-05-21 A New Exact Algorithm for the Solution of Quadratic Assignment Problems. 281-293 1994 55 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)90014-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#MautorR94 2003-04-02 A note on reconfiguring tree linkages: trees can lock. 293-297 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#BiedlDDLLORSTW02 2003-06-30 Domination Number of the Cross Product of Paths. 101-139 1999 94 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00016-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam94.html#CherifiGLPZ99 2003-06-16 The Forbidden Projections of Unate Functions. 221-236 1997 77 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00136-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam77.html#FeigelsonH97 2003-06-18 Language-theoretic Complexity of Disjunctive Sequences. 203-209 1997 80 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(97)00061-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#CaludeY97 2003-05-13 How to Find overfull Subgraphs in Graphs with Large Maximum Degree. 117-125 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90101-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#Niessen94 2003-06-18 Optimal Channel Allocation for Several Types of Cellular Radio Networks. 155-170 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00040-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#Niessen97 2003-06-30 Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree. 355-366 1998 88 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00079-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam88.html#RaviK98 2003-05-22 Efficient Sets in Graphs. 99-108 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#BernhardHJ93 http://dx.doi.org/10.1016/0166-218X(93)90225-D 2003-06-27 Asymptotic Estimation of the Average Number of Terminal States in DAWGs. 193-203 1999 92 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00047-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam92.html#Raffinot99 2003-06-17 Quasi-threshold Graphs. 247-255 1996 69 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(96)00094-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam69.html#YanCC96 2003-06-30 Recognizing Clique Graphs of Directed and Rooted Path Graphs. 321-328 1999 94 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00028-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam94.html#PrisnerS99 2003-05-27 Resonance in Elemental Benzenoids. 157-173 1996 67 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00017-L http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam67.html#KleinZ96 2003-07-02 Pancyclic out-arcs of a Vertex in Tournaments. 245-249 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00136-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#YaoGZ00 2003-07-02 Cyclic Graphs. 3-12 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00121-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#GobelN00 2003-06-27 Preface. 1 1999 93 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(99)00002-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam93.html#NoltemeierS99 2003-05-21 The Hamiltonicity of Directed sigma - tao Cayley Graphs (or: A Tale of Backtracking). 75-83 1995 57 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00078-R http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam57.html#RuskeyJW95 2003-06-16 Open Shop Scheduling with Maximal Machines. 175-187 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00018-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#KyparisisK97 2003-06-18 Broadcasting with linearly bounded transmission faults. 121-133 1998 83 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam83.html#GasieniecP98 http://dx.doi.org/10.1016/S0166-218X(97)00107-8 2003-06-18 Note: A 16-vertex Tournament for Which Banks Set and Slater Set Are Disjoint. 211-215 1997 80 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(97)88689-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#CharonHW97 2003-05-26 On the fractal structure of the rescaled evolution set of Carlitz sequences of polynomials. 89-109 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#HaeselerPS00 2002-01-03 Scheduling projects with labor constraints. 27-52 2001 112 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam112.html#CavalcanteSSWW01 2003-06-30 On the Equivalence of Two Tree Mapping Measures. 103-128 1998 88 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00068-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam88.html#EulensteinV98 2003-06-30 A 2 2/3 Superstring Approximation Algorithm. 29-57 1998 88 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00065-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam88.html#ArmenS98 2003-05-21 L-polytopes and Equiangular Lines. 181-214 1995 56 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00086-S http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#DezaG95 2003-05-21 Hypercube Embedding of Generalized Bipartite Metrics. 215-230 1995 56 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00087-T http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#DezaL95 2003-06-17 On Physical Mapping and the Consecutive Ones Property for Sparse Matrices. 23-40 1996 71 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00055-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam71.html#AtkinsM96 2003-07-08 ₂k and Binary Quasi-cyclic Codes. 305-316 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00453-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#Tapia-RecillasV03 2002-01-03 Approximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs. 25-50 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#BandeltCS94 2003-05-22 Absolute Reflexive Retracts and Absolute Bipartite Retracts. 9-20 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#BandeltFH93 http://dx.doi.org/10.1016/0166-218X(93)90219-E 2003-06-30 Scheduling a Divisible Task in a Two-dimensional Toroidal Mesh. 35-50 1999 94 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00013-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam94.html#BlazewiczDGT99 2004-02-24 Quasi-median graphs from sets of partitions. 23-35 2002 122 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam122.html#BandeltHM02 2002-01-03 Reload cost problems: minimum diameter spanning tree. 73-85 2001 113 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#WirthS01 2003-04-02 Variable neighborhood search for the degree-constrained minimum spanning tree problem. 43-54 2002 118 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#RibeiroS02 2003-06-30 A Brief Survey of Perfect Mendelsohn Packing and Covering Designs. 73-81 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00066-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#Bennett99 2003-04-01 The algorithmics of folding proteins on lattices. 145-161 2003 127 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#ChandruDK03 2005-06-28 Heuristics for the Steiner Problem in Graphs. 451-463 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#Plesnik92 http://dx.doi.org/10.1016/0166-218X(92)90151-Y 2004-05-12 On unicyclic graphs whose second largest eigenvalue dose not exceed 1. 117-124 2004 136 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(03)00203-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam136.html#Xu04 2003-06-27 Constrained Weighted Matchings and Edge Coverings in Graphs. 229-241 1999 92 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00052-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam92.html#Plesnik99 2003-05-26 Deadline Scheduling of Multiprocessor Tasks. 81-95 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00020-R http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#BlazewiczDWW96 2003-04-01 Recent advances on two-dimensional bin packing problems. 379-396 2002 123 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam123.html#LodiMV02 2003-05-27 Circumscribing Certain Polygonal Systems. 67-78 1996 67 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00011-F http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam67.html#CyvinCBL96 2003-06-18 Constructing Status Injective Graphs. 107-113 1997 80 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(97)00073-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#Pachter97 2003-06-30 Discrete-continuous Scheduling to Minimize the Makespan for Power Processing Rates of Jobs. 263-285 1999 94 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00025-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam94.html#JozefowskaMRWW99 2003-06-30 On some Properties of DNA Graphs. 1-19 1999 98 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(99)00109-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#BlazewiczHKW99 2002-01-03 The new FIFA rules are hard: complexity aspects of sports competitions. 317-323 2001 108 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#KernP01 2003-06-16 Monotonicity of Single-seat Preferential Election Rules. 81-98 1997 77 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00100-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam77.html#Woodall97 2003-05-21 The Complexity of Harmonious Colouring for Trees. 133-144 1995 57 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00100-R http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam57.html#EdwardsM95 2002-01-03 On-line scheduling of small open shops. 133-150 2001 110 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#ChenDHW01 2002-01-03 Graphs with bounded induced distance. 3-21 2001 108 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#CiceroneS01 2003-06-30 On the Extension of Bipartite to Parity Graphs. 181-195 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00074-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#CiceroneS99 2003-05-22 Work-preserving Emulations of Shuffle-exchange Networks: An Analysis of the Complex Plane Diagram. 13-23 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00040-K http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#AnnexsteinF95 2004-09-08 On Testing Consecutive-ones Property in Parallel. 7-28 1998 88 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00064-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam88.html#AnnexsteinS98 2003-06-23 Consecutive Interval Query and Dynamic Programming on Intervals. 1-24 1998 85 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(98)00021-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam85.html#AggarwalT98 2003-06-16 Mixed Interval Hypergraphs. 29-41 1997 77 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(97)89209-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam77.html#BulgaruV97 2002-01-03 Sequential and simultaneous aggregation of diophantine equations. 209-220 1994 50 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#BabayevM94 2003-05-21 Improved Self-reduction Algorithms for Graphs with Bounded Treewidth. 101-115 1994 54 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)90018-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam54.html#Bodlaender94 2003-06-18 Minimum-time multidrop broadcast. 61-77 1998 83 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam83.html#FarleyPP98 http://dx.doi.org/10.1016/S0166-218X(97)00104-2 2003-06-30 LexBFS-orderings of Distance-hereditary Graphs with Application to the Diametral Pair Problem. 191-207 2000 98 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(99)00157-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#DraganN00 2003-05-27 Incidence Graphs of Biacyclic Hypergraphs. 259-266 1996 68 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00070-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#DraganV96 2003-06-30 A Divisibility Property for a Subgroup of Riordan Matrices. 255-263 2000 98 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(99)00166-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#PeartW00 2003-05-13 Computing the Jump Number on Semi-orders Is Polynomial. 219-232 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90111-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#ArnimH94 2003-05-21 A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness. 233-252 1994 52 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)90143-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#Kratochvil94 2003-06-16 Facets of the Generalized Permutahedron of a Poset. 179-192 1997 72 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(96)00044-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam72.html#ArnimS97 2002-01-03 Transitive closure algorithm MEMTC and its performance analysis. 77-84 2001 110 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#HirvisaloNS01 2003-05-22 The Reversing Number of a Digraph. 39-76 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00042-C http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#BarthelemyHIRT95 2003-04-01 Finding paths in graphs avoiding forbidden transitions. 261-273 2003 126 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam126.html#Szeider03 2003-06-18 On the Two-connected Planar Spanning Subgraph Polytope. 223-229 1997 80 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(97)00087-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#SimoneJ97 2003-06-30 On the Odd Cycles of Normal Graphs. 161-169 1999 94 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00018-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam94.html#SimoneK99 2003-05-22 Stability Number of Bull- and Chair-Free Graphs. 121-129 1993 41 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#SimoneS93 http://dx.doi.org/10.1016/0166-218X(93)90032-J 2003-05-26 On Edge-colored Interior Planar Graphs on a Circle and the Expected Number of RNA Secondary Structures. 151-178 1996 64 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00119-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam64.html#OrlitskyV96 2003-07-14 Separating objects in the plane by wedges and strips. 109-138 2001 109 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam109.html#HurtadoNRS01 2005-09-19 On the orthogonal designs of order 24. 103-114 2000 102 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam102.html#HolzmannK00 2002-01-03 Polyhedral structure of submodular and posi-modular systems. 165-189 2000 107 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam107.html#NagamochiI00 2003-04-01 Graph connectivity and its augmentation: applications of MA orderings. 447-472 2002 123 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam123.html#NagamochiI02 2003-04-02 Convexity in oriented graphs. 115-126 2002 116 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam116.html#ChartrandFZ02 2002-01-03 Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT. 225-239 2000 107 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam107.html#MaarenW00 2002-01-03 Minus domination in small-degree graphs. 53-64 2001 108 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#Damaschke01 2003-04-01 Point placement on the line by distance data. 53-62 2003 127 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#Damaschke03 2003-05-21 A Tight Upper Bound for Group Testing in Graphs. 101-109 1994 48 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#Damaschke94 http://dx.doi.org/10.1016/0166-218X(92)00120-B 2003-04-02 Partitioning problems in dense hypergraphs. 179-191 2002 116 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam116.html#Czygrinow02 2003-05-27 Graph Transformations Which Preserve the Multiplicity of an Eigenvalue. 221-228 1996 67 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00021-I http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam67.html#YehGF96 2003-05-22 Two-Dimensional Rectangle Packing: On-Line Methods and Results. 197-204 1993 45 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam45.html#CsirikFL93 http://dx.doi.org/10.1016/0166-218X(93)90009-D 2003-05-22 Boole's Conditions of Possible Experience and Reasoning under Uncertainty. 181-193 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00050-N http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#HansenJA95 2003-06-30 On Lower Bounds for Numbered Complete Graphs. 205-225 1999 94 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00022-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam94.html#HansenJM99 2003-06-30 Best Second Order Bounds for Two-terminal Network Reliability with Dependent Edge Failures. 375-393 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00116-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#HansenJN99 2003-06-30 An Algorithm for the Class of Pure Implicational Formulas. 89-106 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00038-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#FrancoGSSS99 2002-01-03 Independent spanning trees with small depths in iterated line digraphs. 189-211 2001 110 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#HasunumaN01 2003-07-08 ^m-1, w, 2) Optical Orthogonal Codes. 103-120 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00439-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#DingX03 2003-06-16 Embedding De Bruijn, Kautz and Shuffle-exchange Networks in Books. 103-116 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00009-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#HasunumaS97 2003-06-16 Paths with Minimum Range and Ratio of Arc Lengths. 89-102 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00008-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#HansenSV97 2003-06-18 A Doubly Cyclic Channel Assignment Problem. 263-268 1997 80 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(97)00094-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#McDiarmid97 2003-06-30 Pattern Minimisation in Cutting Stock Problems. 121-130 1999 98 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(99)00112-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#McDiarmid99 2003-05-21 On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem. 9-16 1993 47 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#GoldfarbH93 http://dx.doi.org/10.1016/0166-218X(93)90148-H 2003-04-01 Multidimensional cell lists for investigating 3-manifolds. 25-43 2003 125 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam125.html#Kovalevsky03 2003-06-16 Generalized Exponents of Primitive Symmetric Digraphs. 275-293 1997 74 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00077-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#BrualdiS97 2003-07-04 On the Domination Search Number. 565-580 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00389-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#FominKM03 2003-06-16 Nondegenerate Functions and Permutations. 41-57 1997 73 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(95)00117-A http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#OConnor97 2003-05-27 Maximal Irredundant Functions. 267-277 1996 68 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00071-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#FrickeHJ96 2003-04-02 Minimum matrix representation of some key system. 267-277 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#Tichler02 2003-06-30 A Remark on Random 2-SAT. 107-110 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00034-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#Goerdt99 2002-01-03 Average case complexity for finite Boolean functions. 43-59 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#Chashkin01 2002-01-03 Scheduling equal-length jobs on identical parallel machines. 21-32 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#Baptiste00 2003-05-22 Excluding Induced Subgraphs II: Extremal Graphs. 283-294 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#PromelS93 http://dx.doi.org/10.1016/0166-218X(93)90237-I 2002-01-03 Traffic-light scheduling on the grid. 211-234 1994 53 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam53.html#KortsarzP94 2003-06-27 Approximating the Weight of Shallow Steiner Trees. 265-285 1999 93 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00111-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam93.html#KortsarzP99 2003-06-30 Some Extremal Properties of the Degree Distance of a Graph. 159-163 1999 98 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(99)00117-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#Tomescu99 2002-01-03 On subclasses of minimal unsatisfiable formulas. 83-98 2000 107 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam107.html#Buning00 2002-01-03 A coloring problem on the n-cube. 307-311 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#KimDP00 2003-06-17 Parallel Machine Scheduling with Time Dependent Processing Times. 81-93 1996 70 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(96)00102-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam70.html#Zhi-Long96 2003-07-04 Utility Representation via Additive or Multiplicative Error Functions. 181-197 2003 127 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00383-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#AleskerovM03 2003-06-18 A More Efficient Algorithm for MPR Problems in Phylogeny. 231-238 1997 80 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(97)00088-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#NarushimaH97 2003-04-01 On characteristics of ancestral character-state reconstructions under the accelerated transformation optimization. 195-209 2002 122 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam122.html#NarushimaM02 2003-04-02 On some difficult linear programs coming from set partitioning. 3-11 2002 118 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#BarahonaA02 2003-06-16 Distributed Processing of Divisible Jobs with Communication Startup Costs. 21-41 1997 76 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00115-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam76.html#BlazewiczD97 2003-07-08 Time-stamped Graphs and Their Associated Influence Digraphs. 317-335 2003 128 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00497-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#ChengGL03 2003-05-13 on ordered Graphs and Graph orderings. 113-116 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90100-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#Nesetril94 2003-05-22 A Fast Randomized Algorithm for Partitioning a Graph into Paths of Fixed Length. 291-303 1993 42 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#Stougie93 http://dx.doi.org/10.1016/0166-218X(93)90052-P 2003-04-02 Towards optimal locality in mesh-indexings. 211-237 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#NiedermeierRS02 2003-06-16 Amenable Colorings. 225-238 1997 76 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00127-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam76.html#MahadevR97 2003-07-08 Expected Value Expansions in Rooted Graphs. 555-571 2003 128 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00568-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#BaileyGPS03 2002-01-03 Foreword. 1-2 2000 104 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam104.html#IstrailPS00 2003-06-30 Foreword. 3-6 1998 88 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00109-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam88.html#IstrailPS98 2003-07-04 The Median Procedure in the Semilattice of Orders. 285-302 2003 127 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00211-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#Leclerc03 2002-01-03 Medians for Weight Metrics in the Covering Graphs of Semilattices. 281-297 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#Leclerc94 2002-01-03 Probabilistic Estimates for the Generalized Maximum Satisfiability Problem. 143-163 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#Chochand94 2003-05-22 On Generalized Perfect Graphs: Bounded Degree and Bounded Edge Perfection. 233-245 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#ScheinermanT93 http://dx.doi.org/10.1016/0166-218X(93)90234-F 2003-05-21 Trace-Orthogonal Normal Bases. 233-249 1993 47 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(93)90129-C http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#Jungnickel93 2003-05-21 on Halin Subgraphs and Supergraphs. 19-35 1995 56 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0131-H http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#HortonP95 2003-04-01 A fast algorithm for the maximum clique problem. 197-207 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#Ostergard02 2005-09-13 On the equitable chromatic number of complete n-partite graphs. 307-310 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#LamSTZ01 2003-05-26 Gossiping with Multiple Sends and Receives. 105-116 1996 64 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(95)00123-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam64.html#BagchiSH96 2003-05-22 2-satisfiability and Diagnosing Faulty Processors in Massively Parallel Computing Systems. 25-37 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00041-B http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#BagchiSS95 2003-05-22 Partitioning a Matrix to Minimize the Maximum Cost. 221-248 1995 62 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00154-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam62.html#MingozziRS95 2003-04-01 Some analytic features of algebraic data. 235-249 2002 122 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam122.html#Ricci02 2002-01-03 Experimenting an approximation algorithm for the LCS. 13-24 2001 110 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#BonizzoniVM01 2003-06-18 Spanning subgraphs with applications to communication on a subclass of the Cayley-graph-based networks. 79-96 1998 83 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam83.html#FragopoulouA98 http://dx.doi.org/10.1016/S0166-218X(97)00105-4 2003-07-08 Linear Broadcast Encryption Schemes. 223-238 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00447-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#PadroGMM03 2003-05-13 Preface. 1 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90089-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#FaigleH94 2003-06-18 Preface. 1 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00028-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#FaigleH97 2003-05-21 Note on Scheduling Intervals on-line. 13-17 1995 58 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(95)00112-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#FaigleN95 2003-06-18 The Scheduling of Maintenance Service. 27-42 1998 82 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00119-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam82.html#AnilyGH98 2003-06-17 ³. 187-215 1996 71 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00064-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam71.html#SmithT96 2003-07-02 Structural Aspects of Ordered Polymatroids. 125-148 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00129-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#Kruger00 2002-01-03 Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry). 1-12 2000 101 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam101.html#BaiouB00 2003-05-22 Cycle Structure of Edge Labelled Graphs. 51-62 1993 45 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam45.html#DiamondM93 http://dx.doi.org/10.1016/0166-218X(93)90139-F 2002-01-03 Methods and problems of communication in usual networks. 79-133 1994 53 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam53.html#FraigniaudL94 2003-06-16 Trapezoid Graphs and Generalizations, Geometry and Algorithms. 13-32 1997 74 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00013-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#FelsnerMW97 2003-06-16 Bond Graphs III: Bond Graphs and Electrical Networks. 211-250 1997 73 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00009-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#LambAW97 2003-04-01 Packing equal circles in a square: a deterministic global optimization approach. 139-166 2002 122 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam122.html#LocatelliR02 2003-07-02 Covering a Rectangle with Six and Seven Circles. 149-156 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00130-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#MelissenS00 2002-01-03 Optimal communication channel utilization for matrix transposition and related permutations on binary cubes. 251-274 1994 53 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam53.html#JohnssonH94 2003-06-16 Bond Graphs I: Acausal Equivalence. 261-293 1997 72 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(97)85249-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam72.html#LambWA97 2002-01-03 Maximum packing for biconnected outerplanar graphs. 85-94 2000 100 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam100.html#KovacsL00 2003-06-18 ₁-embeddable Planar Graphs. 3-19 1997 80 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(97)00066-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#ChepoiDG97 2003-06-18 Characterizing and Edge-colouring Split-indifference Graphs. 209-217 1998 82 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00128-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam82.html#OrtizMS98 2002-01-03 Optimal irreversible dynamos in chordal rings. 23-42 2001 113 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#FlocchiniGS01 2002-01-03 Algebraic structure of quasicyclic codes. 157-175 2001 111 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam111.html#LallyF01 2003-05-26 Edge Deletion Preserving the Diameter of the Hypercube. 91-95 1995 63 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(95)00023-K http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#BouabdallahDD95 2003-05-21 A New Competitive Algorithm for Group Testing. 29-38 1994 52 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(92)00185-o http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#Bar-NoyHKK94 2003-05-27 Cut Invariant D and Bond orders of Kekuléan Benzenoids. 137-147 1996 67 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00015-J http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam67.html#WenchenWY96 2003-06-23 Symmetries and Sense of Direction in Labeled Graphs. 99-115 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00051-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#FlocchiniRS98 2003-06-23 Source Sink Flows with Capacity Installation in Batches. 165-192 1998 85 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(98)00024-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam85.html#ChopraGS98 2003-06-16 Bipartite Permutation Graphs with Application to the Minimum Buffer Size Problem. 33-55 1997 74 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00014-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#LaiW97a 2002-01-03 2-Medians in trees with pos/neg weights. 51-71 2000 105 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam105.html#BurkardCD00 2003-05-26 on the Geometric Separability of Boolean Functions. 205-218 1996 66 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00161-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#HegedusM96 2003-06-17 Perspectives of Monge Properties in Optimization. 95-161 1996 70 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(95)00103-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam70.html#BurkardKR96 2002-01-03 Solving the Uncapacited Plant Location Problem on Trees. 51-59 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#BillionnetC94 2002-01-03 Best reduction of the quadratic semi-assignment problem. 197-213 2001 109 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam109.html#BillionnetE01 2003-06-16 A Lower Bound for a Constrained Quadratic 0-1 Minimization Problem. 135-146 1997 74 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(96)00026-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#BillionnetF97 2003-05-26 Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients. 123-139 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00031-L http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#BurkardRW96 2003-05-27 A Study of Maximum Unit-circle Caterpillars - Tools for the Study of the Shape of Adsorption Patterns. 127-135 1996 67 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00014-I http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam67.html#HararyRM96 2003-05-26 Shortest Shortest Path Trees of a Network. 275-284 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00038-S http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#HansenZ96 2003-05-22 Graphs with Most Number of Three Point Induced Connected Subgraphs. 1-10 1995 59 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0155-R http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#BoeschLR95 2003-05-22 On the Minimal Covering of Infinite Sets. 161-168 1993 45 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam45.html#Klimo93 http://dx.doi.org/10.1016/0166-218X(93)90058-V 2002-01-03 Envelopes and clutters. 177-185 2000 101 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam101.html#KashiwabaraN00 2003-05-21 Adjacency of the Best and Second Best Valued Solutions in Combinatorial Optimization Problems. 227-232 1993 47 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#IkebeMT93 http://dx.doi.org/10.1016/0166-218X(93)90128-B 2003-06-18 Minimum Matrix Representation of Sperner Systems. 9-17 1998 81 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00051-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam81.html#BennettW98 2003-05-21 Computing Maximum Mean Cuts. 53-70 1994 52 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(92)00188-R http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#McCormickE94 2003-05-22 How Do I Marry Thee? Let Me Count the Ways!. 285-292 1995 59 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)80006-P http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#BenjaminCK95 2002-01-03 Euler circuits and DNA sequencing by hybridization. 63-96 2000 104 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam104.html#ArratiaBCS00 2003-06-16 A Cost-scaling Algorithm for 0-1 Submodular Flows. 261-273 1997 73 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00011-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#ShigenoI97 2003-05-27 on the Steiner Median of a Tree. 249-258 1996 68 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00069-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#BeinekeOP96 2003-05-21 Preface. 85 1993 47 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(93)90084-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#AkgulHT93 2002-01-03 Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots. 45-62 2000 104 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam104.html#Akutsu00 2003-05-22 A New Algorithm for the Propositional Satisfiability Problem. 159-179 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00048-I http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#GalloP95 2003-06-16 b9000A 1/4 Approximate Algorithm for P2/tree/Cmax. 85-98 1997 72 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(96)00038-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam72.html#GalloP97 2003-05-22 <i>D</i><i>L</i>Language and Sequence Equivalence Problems. 271-274 1993 41 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#Salomaa93 http://dx.doi.org/10.1016/0166-218X(90)90061-G 2006-05-09 Hamiltonicity in 3-domination-critical Graphs with alpha = delta + 2. 57-70 1999 92 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(98)00149-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam92.html#FengWL99 2003-06-23 _n**. 237-251 1998 84 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00010-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam84.html#Verrall98 2003-06-27 Compatible Hamilton Decompositions of Directed Wrapped Butterfly Graphs. 265-275 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00130-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#Verrall99 2003-06-18 Batch Scheduling and Common Due Date Assignment Problem: an NP-hard Case. 251-254 1997 80 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(97)00092-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#Kovalyov97 2003-06-23 On the Dimension of Projected Polyhedra. 1-9 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00096-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#BalasO98 2003-04-01 Lift-and-project for Mixed 0-1 programming: recent progress. 129-154 2002 123 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam123.html#BalasP02 2003-05-06 Linear-Time Separation Algorithms for the Three-Index Assignment Polytope. 1-12 1993 43 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#BalasQ93 http://dx.doi.org/10.1016/0166-218X(93)90164-J 2002-01-03 Detection and recognition of a binary linear code. 199-218 2001 111 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam111.html#Valembois01 2002-01-03 <i>k</i>-Coloring Problem. 257-280 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#HertzJA94 2002-01-03 A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing. 255-265 1994 50 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#HertzJR94 2003-07-04 Maximal Value of the Zeroth-order Randic Index. 615-626 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00392-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#Pavlovic03 2003-05-26 on a Scheduling Problem in a Robotized Analytical System. 285-318 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00039-T http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#HertzMR96 2003-05-26 Preface. 1-3 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(96)90005-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#HertzQW96 2003-07-08 Weil Descent of Jacobians. 165-180 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00443-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#Galbraith03 2003-06-30 On the Definition and the Construction of Pockets in Macromolecules. 83-102 1998 88 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00067-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam88.html#EdelsbrunnerFL98 2003-05-21 Some Combinatorial Properties of Self-reading Sequences. 83-86 1994 55 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)90037-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#IstrateP94 2003-07-08 _qby Boolean Functions and by Polynomials in Several Variables Modulo a Divisor of Q-1. 193-206 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00445-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#LangeW03 2002-01-03 On the asymptotics of the number of binary words with a given length of a maximal series. 171-201 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#Korshunov01 2003-04-02 Bounds for parametric sequence comparison. 181-198 2002 118 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#Fernandez-BacaSS02 2003-05-21 A Linear Time and Space Algorithm to Regonize Interval Orders. 173-178 1993 46 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam46.html#BaldyM93 http://dx.doi.org/10.1016/0166-218X(93)90027-L 2003-07-08 The Average Dimension of the Hull of Cyclic Codes. 275-292 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00451-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#Skersys03 2003-06-27 A Short Proof of a Conjecture on the Tr-choice Number of Even Cycles. 243-246 1999 92 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00058-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam92.html#Sitters99 2002-01-03 A note on the depth function of combinatorial optimization problems. 325-328 2001 108 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#Woeginger01 2003-06-27 Sensitivity Analysis for Knapsack Problems: Another Negative Result. 247-251 1999 92 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00053-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam92.html#Woeginger99 2002-01-03 The QAP-polytope and the star transformation. 283-306 2001 111 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam111.html#JungerK01 2003-06-23 Two-path Subsets: Efficient Counting and Applications to Performability Analysis. 25-45 1998 85 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(98)00027-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam85.html#BallHP98 2002-01-03 Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays. 269-289 2000 101 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam101.html#Verriet00 2003-05-22 on-line Algorithms for ordered Sets and Comparability Graphs. 319-329 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00062-I http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#Penrice95 2002-01-03 Regular affine tilings and regular maps on a flat torus. 225-237 2000 105 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam105.html#SzucsK00 2003-04-01 Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip. 103-127 2002 123 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam123.html#AlbrechtKSV02 2002-01-03 Broadcasting in Butterfly and deBruijn Networks. 183-197 1994 53 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam53.html#KlasingMPS94 2003-05-21 An Algorithm for Fractional Assignment Problems. 333-343 1995 56 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(93)00094-G http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#ShigenoSM95 2003-04-01 Orientations of digraphs almost preserving diameter. 129-138 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#GutinY02 2003-06-17 Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph. 75-82 1996 69 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00077-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam69.html#GutinY96 2003-05-21 On a Problem Concerning Tolerance Graphs. 73-78 1993 46 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam46.html#AndreaeHP93 http://dx.doi.org/10.1016/0166-218X(93)90158-K 2003-05-27 A Kinetic Approach to the Random F-graph Process. Paths, Cycles and Components. 13-25 1996 67 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00008-F http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam67.html#BalinskaGQS96 2003-05-21 Alternating Paths in Edge-colored Complete Graphs. 297-309 1995 56 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00091-Q http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#Manoussakis95 2002-01-03 Investigations on autark assignments. 99-137 2000 107 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam107.html#Kullmann00 2003-06-30 On a Generalization of Extended Resolution. 149-176 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00037-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#Kullmann99 2003-05-13 A Note on the Half-integral Multiflow-problem Restricted to Minor-closed Classes of Graphs. 127-135 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90102-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#Pfeiffer94 2004-01-06 A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs. 367-400 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00146-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#BroersmaDK00 2002-01-03 Algorithms and obstructions for linear-width and related search parameters. 239-271 2000 105 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam105.html#Thilikos00 2002-01-03 Upper bounds to the clique width of graphs. 77-114 2000 101 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam101.html#CourcelleO00 2003-05-21 On Hyperedge Replacement and BNLC Graph Grammars. 253-273 1993 46 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam46.html#Vogler93 http://dx.doi.org/10.1016/0166-218X(93)90106-X 2003-04-02 Bandwidth and topological bandwidth of graphs with few P4's. 117-133 2001 115 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam115.html#KloksT01 2003-04-01 Connectivity of iterated line graphs. 255-266 2003 125 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam125.html#KnorN03 2003-06-25 Computing Optimal Rectilinear Steiner Trees: A Survey and Experimental Evaluation. 161-171 1999 90 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00089-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam90.html#Ganley99 2003-06-23 Fluctuation Bounds for Sock-sorting and Other Stochastic Processes. 109-123 1998 86 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(98)80004-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam86.html#Steinsaltz98 2003-05-22 on the Essential Test Sets of Discrete Matrices. 249-255 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00055-I http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#Kogan95 2003-07-04 ²) Algorithm for Maximum Cycle Mean of Monge Matrices in Max-algebra. 651-656 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00395-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#GavalecP03 2003-06-16 An Efficient Algorithm for the Knight's Tour Problem. 251-260 1997 73 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00010-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#Parberry97 2003-06-16 Measuring the Vulnerability for Classes of Intersection Graphs. 259-270 1997 77 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00133-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam77.html#KratschKM97 2003-06-18 The complexity of broadcasting in planar and decomposable graphs. 179-206 1998 83 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam83.html#JakobyRS98 http://dx.doi.org/10.1016/S0166-218X(97)00110-8 2003-06-27 Optimal Point-to-point Broadcast Algorithms Via Lopsided Trees. 233-263 1999 93 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00107-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam93.html#GolinS99 2002-01-03 On combinatorial properties of the Arshon sequence. 155-169 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#KlepininS01 2003-05-22 An Algebraic Analysis of the Connectivity of DeBruijn and Shuffle-exchange Digraphs. 213-227 1995 61 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)98134-M http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam61.html#Baumslag95 2003-05-22 A Framework for Adaptive Sorting. 153-179 1995 59 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(93)E0160-Z http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#PeterssonM95 2003-05-21 Regularity and Locality in K-terminal Graphs. 229-250 1994 54 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)90025-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam54.html#MahajanP94 2002-01-03 Optimal ordered binary decision diagrams for read-once formulas. 237-258 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#SauerhoffWW00 2003-04-01 The structure of obstructions to treewidth and pathwidth. 61-71 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#Chlebikova02 2003-04-01 A survey of very large-scale neighborhood search techniques. 75-102 2002 123 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam123.html#AhujaEOP02 2003-05-22 On Pseudounimodular Matrices. 113-117 1993 42 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#MartelliP93 http://dx.doi.org/10.1016/0166-218X(93)90183-O 2002-01-03 A note on "parallel machine scheduling with non-simultaneous machine available time". 133-135 2000 100 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam100.html#LeeHT00 2005-07-26 A Note on Graphs with Large Girth, Small Minus Domination Number. 299-303 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00082-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#LeeMH99 2006-05-29 Transmission schedules for hypercube interconnection in WDM optical passive star networks. 133-148 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#LeeOC02 2003-05-27 Generation of Molecular Graphs Based on Flexible Utilization of the Available Structural Information. 27-49 1996 67 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00009-G http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam67.html#Bangov96 2003-06-30 Orthogonal Double Covers of Complete Graphs by Trees of Small Diameter. 377-388 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00087-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#LeckL99 2003-04-01 Homotopy in digital spaces. 3-24 2003 125 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam125.html#AyalaDFQ03 2003-06-17 Rectilinear Paths Among Rectilinear Obstacles. 185-215 1996 70 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(96)80467-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam70.html#LeeYW96 2002-01-03 On an infinite sequence of improving Boolean bases. 95-108 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#Cherukhin01 2003-06-18 Embedding ladders and caterpillars into the hypercube. 21-29 1998 83 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam83.html#BezrukovMUW98 http://dx.doi.org/10.1016/S0166-218X(97)00101-7 2003-06-30 Weakened Ramsey Numbers. 279-284 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00081-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#HarborthM99 2002-01-03 Tetris-Hashing or optimal table compression. 41-58 2001 110 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#GalliSS01 2003-06-18 Edge-packing Planar Graphs by Cyclic Graphs. 169-180 1998 81 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00083-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam81.html#HeathV98 2003-04-02 ⁿ. 223-238 2002 118 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#HosonoM02 2003-05-06 A Probabilistic Analysis of the Maximal Covering Location Problem. 175-183 1993 43 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#VohraH93 http://dx.doi.org/10.1016/0166-218X(93)90006-A 2002-01-03 A Guide to the Graph Labeling Zoo. 213-229 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#Gallian94 2003-05-27 Application of Coding Theory to Interconnection Networks. 553-562 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#ZemorC92 http://dx.doi.org/10.1016/0166-218X(92)90158-7 2003-05-22 Sensitivity Analysis of the Economic Lot-Sizing Problem. 291-312 1993 45 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam45.html#HoeselW93 http://dx.doi.org/10.1016/0166-218X(93)90016-H 2003-06-27 On the Complexity of Postoptimality Analysis of 0/1 Programs. 251-263 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00151-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#HoeselW99 2003-06-30 On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs. 39-63 1999 98 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(99)00179-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#DeogunKKM99 2003-05-21 The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs. 261-273 1994 52 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)90145-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#DahlhausD94 2003-06-23 Matching and Multidimensional Matching in Chordal and Strongly Chordal Graphs. 79-91 1998 84 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00006-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam84.html#DahlhausK98 2003-05-22 Intervertex Distances in Convex Polygons. 149-158 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00047-H http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#ErdosF95a 2004-06-28 Minimum Multiway Cuts in Trees. 67-75 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00049-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#ErdosFS98 2003-05-13 Chromatic Number of Prime Distance Graphs. 197-209 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90109-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#VoigtW94 2003-05-22 Recognizing Hidden Bicircular Networks. 13-53 1993 41 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#ShullSOL93 http://dx.doi.org/10.1016/0166-218X(93)90243-H 2003-04-02 Optimally balancing assembly lines with different workstations. 99-113 2002 118 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#NicosiaPP02 2002-01-03 <i>nm</i>)-Time Algorithm for Computing the Dual of a Regular Boolean Function. 309-323 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#PeledS94 2003-05-22 Enumeration of Difference Graphs. 311-318 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00061-H http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#PeledS95 2003-06-16 The Availability of Crumbling Wall Quorum Systems. 69-83 1997 74 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00016-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#PelegW97 2002-01-03 On completing latin squares. 167-181 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#EastonP01 2003-06-18 Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs. 247-250 1998 82 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00062-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam82.html#Bang-JensenGY98 2003-06-30 A New Sufficient Condition for a Digraph to Be Hamiltonian. 61-72 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00065-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#Bang-JensenGY99 2003-05-22 Directed Hypergraphs and Applications. 177-201 1993 42 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#GalloLP93 http://dx.doi.org/10.1016/0166-218X(93)90045-P 2003-04-01 Approximating minimum size {1, 2}-connected network. 267-288 2003 125 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam125.html#Krysta03 2002-01-03 Embedding complete trees into the hypercube. 101-119 2001 110 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#Bezrukov01 2002-07-15 The even adjacency split problem for graphs. 175-188 2000 102 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam102.html#ChestonHLS00 2003-05-26 on Powers of M-trapezoid Graphs. 187-192 1995 63 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(95)00062-V http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#Flotow95 2003-06-17 On Powers of Circular Arc Graphs and Proper Circular Arc Graphs. 199-207 1996 69 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00091-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam69.html#Flotow96 2003-06-16 Better Bounds for Perpetual Gossiping. 189-197 1997 75 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(96)00088-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#Scott97 2002-01-03 Broadcasting multiple messages in a grid. 321-336 1994 53 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam53.html#ScoyB94 2003-06-23 Linking Discrete Orthogonality with Dilation and Translation for Incomplete Sigma-pi Neural Networks of Hopfield-type. 169-180 1998 89 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00102-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam89.html#Lenze98 2003-06-16 Positive and Horn Decomposability of Partially Defined Boolean Functions. 251-274 1997 74 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00053-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#MakinoYI97 2003-05-22 New Clique and Independent Set Algorithms for Circle Graphs (Discrete Applied Mathematics 36 (1992) 1-24). 179-180 1993 41 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#ApostolicoAH93 http://dx.doi.org/10.1016/0166-218X(93)90038-P 2002-01-03 Computational analysis of counter-based schemes for VLSI test pattern generation. 227-250 2001 110 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#KagarisT01 2003-05-21 Covering with Latin Transversals. 1-10 1995 57 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0136-M http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam57.html#AlonST95 2003-06-30 Genotyping of Pooled Microsatellite Markers by Combinatorial Optimization Techniques. 291-314 1998 88 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)80006-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam88.html#LanciaP98 2005-04-06 An upper bound for the minimum number of queens covering the n x n chessboard. 51-60 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#BurgerM02 2003-05-26 Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete. 207-217 1996 64 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00125-W http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam64.html#Dillencourt96 2003-06-30 A Method for Cutting Squares into Distinct Squares. 65-80 1999 98 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(99)00158-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#Gambini99 2003-06-18 Constructing Efficient Simulated Annealing Algorithms. 115 1997 80 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(97)80388-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#Duque-Anton97a 2003-05-27 <i>Delta, D</i>) Graphs Discovered by Heuristic Search. 3-8 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#Allwright92 http://dx.doi.org/10.1016/0166-218X(92)90120-Y 2002-01-03 Efficient algorithms and codes for k-cardinality assignment problems. 25-40 2001 110 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#DellAmicoLM01 2003-04-01 2-Point site Voronoi diagrams. 37-54 2002 122 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam122.html#BarequetDD02 2003-07-08 The Base-matroid and Inverse Combinatorial Optimization Problems. 337-353 2003 128 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00498-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#DellAmicoMM03 2003-04-02 A lower bound for the non-oriented two-dimensional bin packing problem. 13-24 2002 118 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#DellAmicoMV02 2003-05-26 Minimizing the Sum of Weighted Completion Times with Unrestricted Weights. 25-41 1995 63 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00028-C http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#DellAmicoMV95 2003-06-17 Landmarks in Graphs. 217-229 1996 70 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00106-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam70.html#KhullerRR96 2002-05-31 Centers of sets of pixels. 297-306 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#KhullerRW00 2003-06-17 On Strongly Connected Digraphs with Bounded Cycle Length. 281-289 1996 69 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00105-Z http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam69.html#KhullerRY96 2003-07-08 Cut, Paste, Filter. 465-485 2003 128 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(02)00506-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#Sullivan03 2003-06-30 Preface. 1 1999 94 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)80005-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam94.html#CarlierHMW99 2003-04-02 On the approximation of the Minimum Disturbance p-Facility Location Problem. 73-83 2002 118 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#Galbiati02 2003-05-13 Separation of Convex Sets. 325-328 1994 51 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)90030-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#CzyzowiczRU94 2003-06-27 Optimal Binary Trees with Order Constraints. 305-311 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00138-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#SeboW99 2003-04-02 Edge-pancyclicity of coupled graphs. 259-264 2002 119 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#LihSWZ02 2003-04-02 Connectivity and fault-tolerance of hyperdigraphs. 15-26 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#FerreroP02 2003-06-23 Uniform Machine Scheduling of Unit-time Jobs Subject to Resource Constraints. 253-257 1998 84 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00138-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam84.html#KovalyovS98 2002-01-03 Ray shooting from convex ranges. 259-267 2001 108 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#KranakisKMSU01 2003-05-22 Bin-packing and Matchings in Threshold Graphs. 279-289 1995 62 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00156-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam62.html#Tinhofer95 2002-12-13 Perfect binary (n, 3) codes: the structure of graphs of minimum distances. 9-11 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#Avgustinovich01 2003-05-22 On Paths with the Shortest Average Arc Length in Weighted Graphs. 169-179 1993 45 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam45.html#WimerKC93 http://dx.doi.org/10.1016/0166-218X(93)90059-W 2002-01-03 The degree of functions and weights in linear codes. 87-102 2001 111 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam111.html#GuritmanHS01 2003-05-06 Circular a Avoiding Sequences with Prescribed Sum. 27-36 1993 43 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#ClarkL93 http://dx.doi.org/10.1016/0166-218X(93)90166-L 2003-05-21 Generating Most Parsimonious Reconstructions on a Tree: A Generalization of the Farris-Swofford-Maddison Method. 245-265 1995 56 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00089-V http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#HanazawaNM95 2002-01-03 Algorithms for finding a Kth best valued assignment. 283-296 1994 50 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#MatsuiTI94 2002-01-03 Modelling piecewise linear concave costs in a tree partitioning problem. 101-109 1994 50 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#AghezzafW94 2003-06-16 The VC-dimension of Set Systems Defined by Graphs. 237-257 1997 77 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00137-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam77.html#KranakisKRUW97 2003-05-21 A Lower Bound for Tree Resolution. 37-53 1994 54 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)90132-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam54.html#McClurkin94 2003-04-01 Periodicity vectors for labelled trees. 241-260 2003 126 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam126.html#RestivoS03 2003-04-01 Pushing vertices in digraphs without long induced cycles. 181-192 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#HuangMY02 2003-11-25 A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits. 169-184 1994 50 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#HaslerMOW94 2005-03-01 From Ternary Strings to Wiener Indices of Benzenoid Chains. 113-131 1997 73 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(96)00004-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#HuangYY97 2002-01-03 A unified approach to word occurrence probabilities. 259-280 2000 104 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam104.html#Regnier00 2003-06-30 Graph Classes Between Parity and Distance-hereditary Graphs. 197-216 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00075-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#CiceroneS99a 2006-03-31 Rearrangement of DNA fragments: a branch-and-cut algorithm. 161-177 2002 116 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam116.html#FerreiraSW02 2002-01-03 A polyhedral approach to an integer multicommodity flow problem. 13-36 2000 101 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam101.html#BrunettaCF00 2002-01-03 Hardness of identifying the minimum ordered binary decision diagram. 191-201 2000 107 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam107.html#TakenagaY00 2002-01-03 Solving the feedback vertex set problem on undirected graphs. 37-51 2000 101 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam101.html#BrunettaMT00 2003-07-04 Preface. 179-180 2003 127 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00208-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#Janowitz03 2003-06-23 Greedy algorithms for tracking mobile users in special mobility graphs. 215-227 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#OlariuPW02 2003-04-01 Semidefinite programming for discrete optimization and matrix completion problems. 513-577 2002 123 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam123.html#WolkowiczA02 2003-06-30 Semidefinite Programming Relaxations for the Graph Partitioning Problem. 461-479 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00102-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#WolkowiczZ99 2002-03-05 Naturally submodular digraphs and forbidden digraph configurations. 67-84 2000 100 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam100.html#GranotGZ00 2003-05-22 Large Planar Graphs with Given Diameter and Maximum Degree. 133-153 1995 61 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00011-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam61.html#FellowsHS95 2003-07-02 Domination and Total Domination on Asteroidal Triple-free Graphs. 111-123 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00128-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#Kratsch00 2002-01-03 Finding the k most vital edges with respect to minimum spanning trees for fixed k. 319-327 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#Liang01 2003-06-16 Parallel Algorithms for the Domination Problems in Trapezoid Graphs. 241-249 1997 74 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00052-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam74.html#Liang97 2003-04-01 Ideal clutters. 303-338 2002 123 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam123.html#CornuejolsG02 2002-01-03 Partitioning single-molecule maps into multiple populations: algorithms and probabilistic analysis. 203-227 2000 104 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam104.html#ParidaM00 2003-06-23 Foreword. 1-2 1998 89 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00135-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam89.html#CornuejolsP98 2006-07-12 Computing Residual Connectedness Reliability for Restricted Networks. 221-232 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#ColbournSSS93 http://dx.doi.org/10.1016/0166-218X(93)90233-E 2003-06-30 Suborthogonal Double Covers of the Complete Graph by Stars. 439-444 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00091-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#Schumacher99 2003-02-06 On the number of connected sets with the neighborhood of a given size in a graph. 233-247 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#Sapozhenko01 2003-07-08 Intersecting Codes and Separating Codes. 75-83 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00437-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#CohenELS03 2002-08-05 Local rule mechanism for selecting icosahedral shell geometry. 97-111 2000 104 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam104.html#BergerKSS00 2003-05-22 A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs. 119-129 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)E0111-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#ColbournPV95 2003-11-27 On the Complexity and Approximation of Syntenic Distance. 59-82 1998 88 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00066-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam88.html#DasguptaJKLS98 2003-06-18 ₃, G) for Connected Graphs G of Order Seven. 189-200 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00042-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#ScheltenS97 2003-05-22 A Unified Approach to Polynomially Solvable Cases of Integer "non-separable" Quadratic optimization. 195-212 1995 61 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00016-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam61.html#Baldick95 2002-01-03 Discrete relaxations of combinatorial programs. 11-26 2001 112 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam112.html#BorndorferW01 2003-06-17 Embedding Trees in Recursive Circulants. 83-99 1996 69 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00078-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam69.html#LimPC96 2002-01-03 Characterizations of some classes of strong sign nonsingular digraphs. 159-172 2000 105 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam105.html#ShaoH00 2003-06-18 Optimal layouts on a chain ATM network. 157-178 1998 83 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam83.html#GerstelWZ98 http://dx.doi.org/10.1016/S0166-218X(98)80002-4 2003-06-30 ₅. 9-33 1999 94 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00012-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam94.html#BarreF99 2003-05-27 <i>Delta, D</i>)-Graphs. 575-577 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#BermondDQ92 http://dx.doi.org/10.1016/0166-218X(92)90160-C 2003-06-23 Optimal Sequential Gossiping by Short Messages. 145-155 1998 86 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(98)00022-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam86.html#BermondGP98 2003-04-01 Gridline graphs: a review in two dimensions and an extension to higher dimensions. 223-239 2003 126 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam126.html#Peterson03 2003-04-01 Selected topics on assignment problems. 257-302 2002 123 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam123.html#Burkard02 2003-06-16 A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs. 99-118 1997 77 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(96)00130-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam77.html#BarthH97 2003-05-27 Analysis of Minimal Path Routing Schemes in the Presence of Faults. 245-263 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#Gordon92 http://dx.doi.org/10.1016/0166-218X(92)90136-X 2003-06-18 Small Cycles in Hamiltonian Graphs. 201-211 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00043-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#ScheltenS97a 2003-06-16 Efficient Generation of Graphical Partitions. 17-26 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00022-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#BarnesS97 2006-03-30 Steiner trees and polyhedra. 101-120 2001 112 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam112.html#BihaKM01 2002-01-03 On the asymptotic existence of partial complex Hadamard matrices and related combinatorial objects. 37-45 2000 102 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam102.html#Launey00 2003-06-18 A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional Grid. 69-91 1998 81 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00076-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam81.html#LiuMS98 2003-06-16 Anonymous Secret Sharing Schemes. 13-28 1997 77 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(97)89208-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam77.html#BlundoS97 2003-06-18 Distance-related Invariants on Polygraphs. 57-71 1997 80 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(97)00069-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#JuvanMZ97 2003-05-21 Consensus Functions on Trees that Satisfy Independence Axiom. 47-55 1993 47 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#McMorrisP93 http://dx.doi.org/10.1016/0166-218X(93)90151-D 2003-05-22 Bounding Sample Size with the Vapnik-Chervonenkis Dimension. 65-73 1993 42 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#Shawe-TaylorAB93 http://dx.doi.org/10.1016/0166-218X(93)90179-R 2002-01-03 Comparison of column generation models for channel assignment in cellular networks. 217-240 2001 112 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam112.html#JaumardMMV01 2003-04-02 Erratum to "Comparison of column generation models for channel assignment in cellular networks". 299-322 2002 118 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#JaumardMMV02 2003-06-16 The Wiener Number of the Hexagonal Net. 101-111 1997 73 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(96)00109-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#ShiuL97 2003-06-18 The Metropolis Algorithm for Graph Bisection. 155-175 1998 82 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00133-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam82.html#JerrumS98 2003-05-22 A Recognition Algorithm for orders of Interval Dimension Two. 257-266 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00056-J http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#Langley95 2003-05-27 Hamiltonian Cycle is Polynomial on Cocomparability Graphs. 165-172 1992 39 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#DeogunS92 http://dx.doi.org/10.1016/0166-218X(92)90168-A 2003-04-02 Approximation algorithms for multi-parameter graph optimization problems. 129-138 2002 119 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#BasovV02 2002-03-21 Locking Based on a Pairwise Decomposition of the Transaction System. 217-236 1992 40 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#Lausen92 2005-07-21 Generation of lower bounds for minimum span frequency assignment. 59-78 2002 119 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#AllenSH02 2003-06-30 On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions. 363-373 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00099-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#GurvichK99 2003-04-01 Camel sequences and quadratic residues. 73-89 2002 124 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam124.html#GurvichS02 2002-01-03 An on-line bin-batching problem. 329-333 2001 108 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#Zhang01 2003-05-22 Studies on Hypergraphs I: Hyperforests. 95-112 1993 42 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#Zhang93 http://dx.doi.org/10.1016/0166-218X(93)90182-N 2003-06-16 A New Version of On-line Variable-sized Bin Packing. 193-197 1997 72 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00018-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam72.html#Zhang97 2003-06-27 Inducing an Order on Cellular Automata by a Grouping Operation. 177-196 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00125-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#MazoyerR99 2003-05-21 k-Connectivity and Decomposition of Graphs into Forests. 295-301 1994 55 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)90015-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#NishizekiP94 2002-01-03 Persistency in combinatorial optimization problems on matroids. 121-132 2001 110 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#CechlarovaL01 2003-06-18 Panelling Planar Graphs. 109-122 1998 81 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00078-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam81.html#OxleyR98 2003-05-22 Matrices Generated By Semilattices. 51-56 1995 59 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0159-V http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#Karlander95 2003-04-01 Projective planes and congestion-free networks. 117-126 2002 122 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam122.html#Colbourn02 2003-04-01 The disjunctive procedure and blocker duality. 1-13 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#AguileraEN02 2003-06-23 Adjacency on the Constrained Assignment Problem. 269-274 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00063-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#AlfakihM98 2003-06-27 Construction of a Simple Elimination Scheme for a Chordal Comparability Graph in Linear Time. 287-292 1999 91 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00137-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam91.html#BorieS99 2005-06-21 On Trades: An Update. 361-376 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00086-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#KhosrovshahiMT99 2003-06-17 On Intervalizing K-colored Graphs for DNA Physical Mapping. 55-77 1996 71 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00057-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam71.html#BodlaenderF96 2003-06-18 Treewidth for Graphs with Small Chordality. 45-61 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00031-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#BodlaenderT97 2003-05-26 Cardinality-restricted Chains and Antichains in Partially ordered Sets. 421-439 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00045-S http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#ShumT96 2003-06-17 Bipartite Graphs and Digraphs with Maximum Connectivity. 271-279 1996 69 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00097-B http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam69.html#FabregaF96 2003-12-17 Fault-tolerant Routings in Double Fixed-step Networks. 61-74 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00015-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#FabregaZ97 2003-06-30 Algorithms for Minclique Scheduling Problems. 115-139 1997 72 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(96)00040-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam72.html#JurischKJ97 2003-07-04 Scheduling Unitary Task Systems with Zero-one Communication Delays for Quasi-interval Orders. 461-476 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00247-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#Moukrim03 2003-04-02 Chordally signed graphs. 273-280 2002 119 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#McKee02 2003-04-02 Topological optimization with a network reliability constraint. 135-149 2001 115 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam115.html#KoideSI01 2003-05-13 Average Distance and Independence Number. 75-83 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90095-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#Dankelmann94 2003-06-18 Average Distance and Domination Number. 21-35 1997 80 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(97)00067-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#Dankelmann97 2003-06-16 Generalized Coloring for Tree-like Graphs. 135-155 1997 75 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(96)00085-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#JansenS97 2003-06-18 The Single Loop Representations of Regular Languages. 219-229 1998 82 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)86751-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam82.html#ShyrY98 2003-05-21 Almost Fully-parallel Parentheses Matching. 11-28 1995 57 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0137-N http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam57.html#BerkmanV95 2003-05-21 Generating Hard and Diverse Test Sets for NP-hard Graph Problems. 35-66 1995 58 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0140-T http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#Sanchis95 2003-04-01 Pseudo-Boolean optimization. 155-225 2002 123 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam123.html#BorosH02 2003-05-21 A Monge Property for the D-dimensional Transportation Problem. 97-109 1995 58 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(93)E0121-E http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#BeinBPP95 2002-01-03 A family of Hadamard matrices of dihedral group type. 141-150 2000 102 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam102.html#ShinodaY00 2003-06-30 More Broadcast Graphs. 81-102 1999 98 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(99)00108-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#HarutyunyanL99 2004-03-23 The Forwarding Diameter of Graphs. 201-211 1998 86 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(98)00041-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam86.html#VegaHBO98 2003-04-01 A single-element extension of antimatroids. 159-164 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#Nakamura02 2003-05-21 An Extension of Elementary Bipartite Graphs to Matroid Pairs and its Characterization. 285-288 1994 48 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#Nakamura94 http://dx.doi.org/10.1016/0166-218X(92)00181-K 2003-06-16 TSP Ejection Chains. 165-181 1997 76 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00123-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam76.html#PeschG97 2002-01-03 Algorithmic complexity of list colorings. 297-302 1994 50 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#KratochvilT94 2003-06-30 Satisfiability Threshold for Random XOR-CNF Formulas. 41-53 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00032-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#CreignouD99 2003-04-02 Some polynomially solvable subcases of the detailed routing problem in VLSI design. 199-208 2001 115 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam115.html#Recski01 2003-07-08 Approximation Algorithms and Relaxations for a Service Provision Problem on a Telecommunication Network. 63-81 2003 129 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00234-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#DyeST03 2003-05-26 Intersection Graphs of Helly Families of Subtrees. 45-56 1996 66 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00136-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#Gavril96 2003-07-02 On the Strong Chromatic Index of Cyclic Multigraphs. 23-38 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00123-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#GvozdjakHMS00 2003-05-27 Broadcasting and Spanning Trees in de Bruijn and Kautz Networks. 297-317 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#HeydemannOS92 http://dx.doi.org/10.1016/0166-218X(92)90141-V 2003-07-02 Independent Sets with Domination Constraints. 39-54 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00124-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#HalldorssonKT00 2003-05-21 Half-integral Flows in a Planar Graph with Four Holes. 267-295 1995 56 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00090-Z http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#Karzanov95 2003-06-16 Meyniel Weakly Triangulated Graphs II: A Theorem of Dirac. 283-289 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00058-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#Hayward97a 2003-05-06 Neighborhood Subtree Tolerance Graphs. 13-26 1993 43 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#BibelnieksD93 http://dx.doi.org/10.1016/0166-218X(93)90165-K 2004-07-26 Structure of i-components of perfect binary codes. 189-197 2001 111 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam111.html#Soloveva01 2003-05-13 Remark on the Dimer Problem. 171-179 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90106-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#SachsZ94 2003-05-26 Performances of Parallel Branch and Bound Algorithms with Best-first Search. 57-74 1996 66 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00137-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#MansR96 2003-07-04 Additive Similarity Measures. 303-318 2003 127 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00212-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#Leischner03 2002-09-06 A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates. 255-271 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#KashyrskikhPS01 2003-06-30 Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem. 167-180 1998 88 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00071-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam88.html#GusfieldKWS98 2003-06-16 Scheduling at Villa Vigoni. 1-3 1997 72 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(96)00033-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam72.html#MohringRS97 2003-05-22 Balance, Uncorrelatedness and the Strict Avalanche Criterion. 223-233 1993 41 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#Lloyd93 http://dx.doi.org/10.1016/0166-218X(90)90056-I 2003-05-22 Lagrangean Methods for 0-1 Quadratic Problems. 257-269 1993 42 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#MichelonM93 http://dx.doi.org/10.1016/0166-218X(93)90049-T 2003-07-02 Subtrees of Bipartite Digraphs - The Minimum Degree Condition. 251-259 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00137-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#Ziolo00 2003-05-26 Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs. 189-203 1996 66 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00048-V http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#ChangCCY96 2002-01-03 Linear k-arboricities on trees. 281-287 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#ChangCFH00 2003-05-22 A perspective on certain polynomial-time solvable classes of satisfiability. 177-214 2003 125 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam125.html#FrancoG03 2002-01-03 Domination graphs: examples and counterexamples. 289-300 2001 110 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#RusuS01 2003-05-22 Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem. 211-225 1993 42 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#KindervaterLS93 http://dx.doi.org/10.1016/0166-218X(93)90047-R 2003-06-18 The Setup Polyhedron of Series-parallel Posets. 213-221 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00044-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#SchraderW97 2003-05-06 <i>L</i>₁<i>L</i>_inftyApproximation and Applications. 217-232 1993 43 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#HouleIIRY93 http://dx.doi.org/10.1016/0166-218X(93)90113-3 2003-05-21 Faster Isometric Embedding in Products of Complete Graphs. 17-28 1994 52 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)90154-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#AurenhammerFISW94 2003-05-21 Vertex-symmetric Digraphs with Small Diameter. 1-11 1995 58 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(93)E0145-o http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#ComellasF95 2003-06-18 Broadcasting in cycle prefix digraphs. 31-39 1998 83 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam83.html#ComellasM98 http://dx.doi.org/10.1016/S0166-218X(97)00102-9 2003-06-23 Approximation Algorithms for Minimum Tree Partition. 117-137 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00052-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#Guttmann-BeckH98 2003-07-02 N-extendible Posets, and How to Minimize Total Weighted Completion Time. 157-167 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00131-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#PeterW00 2003-04-02 Combinatorial problems related to origin-destination matrices. 37-47 2001 115 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam115.html#FrankJS01 2003-06-30 Characterization of Test-sets for Overlap-free Morphisms. 151-157 1999 98 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(99)00118-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#RichommeS99 2003-06-16 Catastrophic Faults in Reconfigurable Systolic Linear Arrays. 105-123 1997 75 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(96)00090-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#PriscoS97 2003-04-01 Dynamic maintenance and visualization of molecular surfaces. 23-51 2003 127 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#BajajPSHN03 2003-06-16 Open Shop Problem with Zero-one Time Operations and Integer Release Date/deadline Intervals. 213-223 1997 76 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00126-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam76.html#Kubale97 2003-05-22 Subtree and Substar Intersection Numbers. 205-220 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#ChangJMW93 http://dx.doi.org/10.1016/0166-218X(93)90232-D 2003-05-21 On Cocolourings and Cochromatic Numbers of Graphs. 111-127 1994 48 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam48.html#GimbelKS94 http://dx.doi.org/10.1016/0166-218X(92)00121-2 2003-05-06 On the Deterministic Complexity of Searching Local Maxima. 111-113 1993 43 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#AlthoferK93 http://dx.doi.org/10.1016/0166-218X(93)90002-6 2003-05-21 An Efficient Matching Algorithm Applied in Statistical Physics. 139-153 1994 52 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)90078-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#BendischDH94 2003-05-27 Broadcasting in DMA-Bound Bounded Degree Graphs. 387-400 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#Lazard92 http://dx.doi.org/10.1016/0166-218X(92)90147-3 2003-05-21 A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems. 83-106 1994 52 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(92)00190-W http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#SheraliA94 2003-05-27 Tighter Representations for Set Partitioning Problems. 153-167 1996 68 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00060-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#SheraliL96 2003-05-26 Scheduling Dyadic Intervals. 101-116 1995 63 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)00068-O http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#DriscollHI95 2003-05-21 on the Equivalence of Constrained and Unconstrained Flows. 113-132 1994 55 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(94)90003-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#GautierG94 2003-07-04 The Power of Small Coalitions in Graphs. 399-414 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00241-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#BermondBPP03 2003-05-21 Locating Service Centers with Precedence Constraints. 251-261 1993 47 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#KaufmanT93 http://dx.doi.org/10.1016/0166-218X(93)90130-G 2002-01-03 Bounds for isoperimetric constants of infinite plane graphs. 237-241 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#LawrencenkoPZ01 2003-06-24 Hamilton Circuits in the Directed Wrapped Butterfly Network. 21-42 1998 84 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00095-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam84.html#BermondDDP98 2003-06-18 On Domination Numbers of Cartesian Product of Paths. 247-250 1997 80 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(97)00091-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#GravierM97 2003-05-21 New Results on the Completion Time Variance Minimization. 157-168 1995 58 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(93)E0125-I http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#Kubiak95 2003-05-27 Paroids: A Canonical Format for Combinatorial Optimization. 37-56 1992 39 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam39.html#RardinS92 http://dx.doi.org/10.1016/0166-218X(92)90113-O 2003-05-06 Paroid Search: Generic Local Combinatorial Optimization. 155-174 1993 43 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#RardinS93 http://dx.doi.org/10.1016/0166-218X(93)90005-9 2002-01-03 The k-centrum multi-facility location problem. 293-307 2001 109 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam109.html#Tamir01 2003-05-21 A Unifying Location Model on Tree Graphs Based on Submodularity Properties. 275-283 1993 47 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(93)90132-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#Tamir93 2003-06-23 Fully Polynomial Approximation Schemes for Locating a Tree-shaped Facility: a Generalization of the Knapsack Problem. 229-243 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00059-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#Tamir98 2003-07-02 Recognizing k-path Graphs. 169-181 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00132-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#Prisner00 2003-05-13 Algorithms for Interval Catch Digraphs. 147-157 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90104-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#Prisner94 2003-05-21 Clique Covering and Clique Partition in Generalizations of Line Graphs. 93-98 1995 56 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00076-P http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#Prisner95 2002-06-04 Reliable broadcasting. 135-148 1994 53 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam53.html#GarganoLPR94 2003-11-19 Deadlock Prevention by Acyclic Orientations. 31-47 2003 129 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00232-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam129.html#BermondIFP03 2003-06-16 Linear Algorithms for Preemptive Scheduling of Multiprocessor Tasks Subject to Minimal Lateness. 25-46 1997 72 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(96)00035-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam72.html#BiancoBDD97 2003-04-02 The underlying line digraph structure of some (0, 1)-matrix equations. 289-296 2002 116 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam116.html#GimbertW02 2002-03-21 Matching Parentheses in Parallel. 423-431 1992 40 Discrete Applied Mathematics 4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#LevcopoulosP92 2003-04-02 Domination in distance-hereditary graphs. 103-113 2002 116 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam116.html#ChangWCY02 2003-04-01 An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree. 83-113 2003 126 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam126.html#Nagamochi03 2003-06-16 A Branch & Bound Algorithm for the Open-shop Problem. 43-59 1997 76 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00116-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam76.html#BruckerHJW97 2003-07-15 Geometric Tree Graphs of Points in Convex Position. 51-66 1999 93 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam93.html#HernandoHMMN99 http://dx.doi.org/10.1016/S0166-218X(99)00006-2 2003-06-17 Rounding in Symmetric Matrices and Undirected Graphs. 1-21 1996 70 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(96)81476-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam70.html#HellKL96 2003-05-21 Packing Problems in Edge-colored Graphs. 295-306 1994 52 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)90148-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#HellMT94 2003-06-17 Complexity of Tree Homomorphisms. 23-36 1996 70 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(96)00099-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam70.html#HellNZ96 2003-05-21 Expected Complexity of Graph Partitioning Problems. 193-212 1995 57 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00103-K http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam57.html#Kucera95 2003-04-02 Tabu search and finite convergence. 3-36 2002 119 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#GloverH02 2003-04-01 ₅-free graphs. 215-224 2003 125 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam125.html#GerberL03 2003-05-26 Diameter-vulnerability of Large Bipartite Digraphs. 239-248 1996 64 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00127-Y http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam64.html#PadroMV96 2003-05-21 Erratum: Constrained Partitioning Problems. 185 1993 46 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam46.html#BurkardY93 http://dx.doi.org/10.1016/0166-218X(93)90029-N 2003-04-02 Subdivisions of integral base polytopes. 89-97 2001 115 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam115.html#Kashiwabara01 2005-05-30 Hamiltonicity of Bipartite Biclaw-free Graphs. 95-102 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90097-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#FlandrinFL94 2003-06-30 Recognizing Graphs of Acyclic Cubical Complexes. 321-330 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00084-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#ImrichK99 2002-01-03 The influence of variables on pseudo-Boolean functions with applications to game theory and multicriteria decision making. 139-164 2000 107 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam107.html#Marichal00 2005-03-01 The Gergonne p-pile Problem and the Dynamics of the Function x | => (x + r)/p. 103-113 1998 82 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00132-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam82.html#HarrisonBG98 2003-06-17 On the Complexity of String Folding. 217-230 1996 71 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00065-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam71.html#PatersonP96 2003-05-06 Recognizing a Class of Bicircular Matroids. 197-215 1993 43 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam43.html#CoullardGW93a http://dx.doi.org/10.1016/0166-218X(93)90112-2 2003-05-22 Multiplicities of Interpoint Distances in Finite Planar Sets. 141-147 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00046-G http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#ErdosF95 2003-05-21 Counting Bichromatic Evolutionary Trees. 1-8 1993 47 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#ErdosS93 http://dx.doi.org/10.1016/0166-218X(93)90147-G 2003-04-01 Applications of combinatorics to statics--rigidity of grid. 473-485 2002 123 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam123.html#RadicsR02 2003-05-13 on Graphs with Equal Domination and Covering Numbers. 211-217 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90110-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#Volkmann94 2003-04-02 On enumerating all minimal solutions of feedback problems. 253-265 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#SchwikowskiS02 2003-04-01 Weighted sequence graphs: boosting iterated dynamic programming using locally suboptimal solutions. 95-117 2003 127 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#SchwikowskiV03 2005-09-06 Decomposable trees: a polynomial algorithm fortripodes. 205-216 2002 119 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#BarthBP02 2003-05-21 _n**. 127-136 1995 56 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00083-P http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#BarthBR95 2003-06-16 A Note on Approximate Inclusion-exclusion. 23-26 1997 73 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00048-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#MelkmanS97 2003-04-02 Uniform emulations of Cartesian-product and Cayley graphs. 37-54 2002 116 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam116.html#BarthFH02 2003-06-18 A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs. 115 1997 80 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(97)80387-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#BarthH97a 2002-01-03 Periodic gossiping on trees. 235-245 1994 53 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam53.html#LabahnHL94 2004-09-17 An external memory data structure for shortest path queries. 55-82 2003 126 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam126.html#HutchinsonMZ03 2002-01-03 On strongly context-free languages. 153-165 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#IliePRS00 2003-05-22 The Optimal Unicyclic Graphs for Pair-Connected Reliability. 235-243 1993 41 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#SiegristAS93 http://dx.doi.org/10.1016/0166-218X(90)90057-J 2003-04-02 On the complexity of exchange-stable roommates. 279-287 2002 116 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam116.html#Cechlarova02 2003-05-21 Trapezoidal Matrices and the Bottleneck Assignment Problem. 111-116 1995 58 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(93)E0122-F http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#Cechlarova95 2003-06-27 An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem. 149-156 1999 93 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00103-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam93.html#AgeevS99 2003-06-16 Note on Complexity of Computing the Domination of Binary Systems. 289-295 1997 73 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00111-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#ChernyakC97 2003-07-02 Two Results on the Bit Extraction Problem. 443-454 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00150-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#FriedlT00 2003-04-01 On claw-free asteroidal triple-free graphs. 155-180 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#HempelK02 2003-06-18 Minimum time broadcast in faulty star networks. 97-119 1998 83 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam83.html#GarganoRV98 http://dx.doi.org/10.1016/S0166-218X(97)00106-6 2003-05-26 ₄-free Graphs. 33-43 1996 66 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00135-Z http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#CoullardRRW96 2003-04-02 On a kind of restricted edge connectivity of graphs. 183-193 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#MengJ02 2003-05-22 Dating to Marriage. 269-270 1993 41 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#CsimaL93 http://dx.doi.org/10.1016/0166-218X(90)90060-P 2003-05-22 Note on Combinatorial Optimization with Max-Linear Objective Functions. 139-145 1993 42 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam42.html#ChungHMM93 http://dx.doi.org/10.1016/0166-218X(93)90043-N 2003-04-01 The incidentor coloring of multigraphs and its applications. 209-217 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#Pyatkin02 2003-06-30 ₅-free and More General Graphs. 163-167 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00072-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#BrandstadtH99 2003-07-02 ₄-structure of Block Graphs. 349-366 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00145-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#BrandstadtL00 2002-01-03 A note on alpha-redundant vertices in graphs. 301-308 2001 108 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#BrandstadtL01 2003-06-30 Tree- and Forest-perfect Graphs. 141-162 1999 95 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00071-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam95.html#BrandstadtL99 2003-05-26 Short Disjoint Cycles in Graphs with Degree Constraints. 197-205 1996 64 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00133-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam64.html#BrandstadtV96 2002-03-21 Minimizing Restricted-Fanout Queries. 245-264 1992 40 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#SagivS92 2003-04-02 The MIN PFS problem and piecewise linear model estimation. 115-143 2002 118 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#AmaldiM02 2003-05-27 Decomposition of a Bidirected Graph into Strongly Connected Components and Its Signed Poset Structure. 237-248 1996 68 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00068-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#AndoFN96 2003-07-04 Sparse Hypercube - Minimal k-line Broadcast Graph. 431-446 2003 127 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(02)00244-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#FujitaF03 2003-06-16 Minimum-cost Line Broadcast in Paths. 255-268 1997 75 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(97)00097-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#FujitaF97 2003-04-02 A 2-approximation algorithm for the minimum weight edge dominating set problem. 199-207 2002 118 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam118.html#FujitoN02 2003-05-13 on Reliable Graphs with Static Routing Plans. 137-146 1994 51 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(94)90103-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#Poguntke94 2003-06-18 The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. 43-77 1998 82 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00125-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam82.html#BrandstadtCD98 2003-06-27 A New Algorithm for Jordan Sorting: Its Average-Case Analysis. 127-140 1999 93 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam93.html#Sojka99 http://dx.doi.org/10.1016/S0166-218X(99)00011-6 2003-05-26 A Decomposition Algorithm for Network Reliability Evaluation. 141-156 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00032-M http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#CarlierL96 2003-06-23 The Complexity of some Problems Related to Graph 3-colorability. 59-73 1998 89 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00116-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam89.html#BrandstadtLS98 2003-05-22 on the Integral Dicycle Packings and Covers and the Linear ordering Polytope. 293-309 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00060-Q http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#NutovP95 2005-07-04 <i>p</i>-source communication spanning tree. 31-42 2004 143 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/j.dam.2003.10.002 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam143.html#Wu04 2003-05-22 The Covering Radius of the Cycle Code of a Graph. 63-70 1993 45 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam45.html#SoleZ93 http://dx.doi.org/10.1016/0166-218X(93)90140-J 2003-05-21 A Review of Combinatorial Problems Arising in Feedforward Neural Network Design. 111-138 1994 52 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(92)00184-N http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#AmaldiMW94 2002-01-03 On (n, k)-sequences. 183-192 2000 105 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam105.html#SongL00 2005-05-23 On Variations of the Subset Sum Problem. 1-7 1998 81 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00105-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam81.html#Alfonsin98 2002-01-03 A convolutional-like approach to p-adic codes. 139-155 2001 111 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam111.html#Lagorce01 2002-01-03 New results on induced matchings. 157-165 2000 101 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam101.html#GolumbicL00 2003-05-22 Irredundancy in Circular Arc Graphs. 79-89 1993 44 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam44.html#GolumbicL93 http://dx.doi.org/10.1016/0166-218X(93)90223-B 2003-04-01 Block duplicate graphs and a hierarchy of chordal graphs. 67-71 2002 124 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam124.html#GolumbicP02 2003-12-02 Fractional domination of strong direct products. 89-91 1994 50 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#FisherRDM94 2002-03-21 The Parallel Complexity of Single Rule Logic Programs. 107-126 1992 40 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#Afrati92 2003-05-22 On the Pathwidth of Chordal Graphs. 233-248 1993 45 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam45.html#Gustedt93 http://dx.doi.org/10.1016/0166-218X(93)90012-D 2002-01-03 Extended finite automata over groups. 287-300 2001 108 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#MitranaS01 2003-05-27 on the Mathematical Model of Triangulanes. 175-187 1996 67 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00018-M http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam67.html#MuzychukKZ96 2003-06-18 Vertex-distinguishing Edge-colorings of 2-regular Graphs. 265-277 1997 79 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00048-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam79.html#Wittmann97 2003-06-30 On Connected Boolean Functions. 337-362 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00098-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#EkinHK99 2003-05-27 The Underlying Graph of a Line Digraph. 525-538 1992 37/38 Discrete Applied Mathematics http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam37.html#Villar92 http://dx.doi.org/10.1016/0166-218X(92)90156-5 2003-06-30 The Symmetry Rule in Propositional Logic. 177-193 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00039-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#Urquhart99 2003-05-21 Broadcasting in Random Graphs. 77-79 1994 54 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00033-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam54.html#FriezeM94 2003-04-01 Edge dominating set and colorings on graphs with fixed clique-width. 197-221 2003 126 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam126.html#KoblerR03 2003-04-01 Shattering a set of objects in 2D. 183-194 2002 122 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam122.html#NandyAH02 2003-04-02 Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number. 107-116 2002 119 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#GutinY02a 2003-04-02 Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP. 81-86 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#GutinYZ02 2003-04-01 A family of restricted subadditive recursion. 127-139 2002 124 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam124.html#Wallace02 2003-05-21 Probabilities Within optimal Strategies for Tournament Games. 87-91 1995 56 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)00075-o http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam56.html#FisherR95 2002-01-03 On cocyclic weighing matrices and the regular group actions of certain paley matrices. 63-101 2000 102 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam102.html#LauneyS00 2002-01-03 Practical experiments of broadcasting algorithms on a configurable parallel computer. 291-298 1994 53 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam53.html#MichallonT94 2002-01-03 Matrix period in max-algebra. 167-175 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#MolnarovaP00 2002-01-03 Dynamic storage allocation with known durations. 203-213 2000 100 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam100.html#NaorOP00 2002-03-21 The Number of Keys in Relational and Nested Relational Databases. 265-282 1992 40 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#Thalheim92 2002-01-03 Deterministic inverse zero-patterns. 211-236 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#JohnsonLLM01 2003-07-08 A Ramp Model for Distributed Key Distribution Schemes. 47-64 2003 128 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00435-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam128.html#BlundoDP03 2003-04-01 A concise characterization of 3D simple points. 59-80 2003 125 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam125.html#FoureyM03 2003-05-27 A Heuristic with Worst-case Analysis for Minimax Routing of Two Travelling Salesmen on a Tree. 17-32 1996 68 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00054-U http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#AverbakhB96 2003-06-16 (p - 1)/(p + 1)-approximate Algorithms for P-traveling Salesmen Problems on a Tree with Minmax Objective. 201-216 1997 75 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(97)89161-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#AverbakhB97 2003-07-04 A Characterization of PQI Interval Orders. 387-397 2003 127 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00256-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#TsoukiasV03 2003-06-16 A Polynomial-time Algorithm for the Two-machine Unit-time Release-date Job-shop Schedule-length Problem. 185-200 1997 77 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(96)00106-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam77.html#Timkovsky97 2003-06-23 Is a Unit-time Job Shop Not Easier Than Identical Parallel Machines?. 149-162 1998 85 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(98)00032-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam85.html#Timkovsky98 2003-04-02 Matrix and combinatorics solutions of Boolean differential equations. 279-292 2002 117 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam117.html#Yanushkevich02 2003-07-02 On the Classification of NP-complete Problems in Terms of Their Correlation Coefficient. 261-277 2000 99 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(99)00138-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam99.html#AngelZ00 2003-06-18 On the Quality of Local Search for the Quadratic Assignment Problem. 15-25 1998 82 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00129-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam82.html#AngelZ98 2003-04-01 Pancyclic orderings of in-tournaments. 239-249 2002 120 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam120.html#Tewes02 2002-01-03 Edge and total coloring of interval graphs. 23-28 2001 114 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam114.html#Bojarshinov01 2003-06-24 Optimal Wavelength-routed Multicasting. 15-20 1998 84 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00137-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam84.html#BeauquierHP98 2002-01-03 Recognition of quasi-Meyniel graphs. 255-260 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#FigueiredoV01 2003-06-27 The Alternating and Adjacency Polynomials, and Their Relation with the Spectra and Diameters of Graphs. 77-97 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00050-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#FiolG98 2003-05-21 Maximal Path Length of Binary Trees. 15-35 1994 55 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)90034-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam55.html#CameronW94 2002-01-03 Efficient algorithms on distributive lattices. 169-187 2001 110 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam110.html#HabibMNS01 2003-04-01 On the negation-limited circuit complexity of merging. 3-8 2003 126 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam126.html#AmanoMT03 2003-05-26 Strongly Prime PCP Words. 193-197 1995 63 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(95)00064-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#LipponenP95 2003-06-18 The median function on median graphs and semilattices. 221-230 2000 101 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam101.html#McMorrisMP00 2003-07-04 The Median Function on Distributive Semilattices. 319-324 2003 127 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00213-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#McMorrisMP03 2003-06-23 The Median Procedure on Median Graphs. 165-181 1998 84 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00003-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam84.html#McMorrisMR98 2003-06-30 On Probe Interval Graphs. 315-324 1998 88 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00077-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam88.html#McMorrisWZ98 2002-01-03 An Exact Algorithm for the 0- 1 Collapsing Knapsack Problem. 175-187 1994 49 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam49.html#FayardP94 2003-06-16 On Broadcasting Multiple Messages in a D-dimensional Grid. 277-284 1997 75 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(97)89163-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam75.html#RodittyS97 2003-06-23 Inversions in k-sorted Permutations. 49-56 1998 87 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(98)00099-7 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam87.html#Dutton98 2002-01-03 Easy cases of the D0L sequence equivalence problem. 285-290 2001 113 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam113.html#Honkala01 2003-04-02 On infinite words generated by polynomial D0L systems. Juha Honkala. 297-305 2002 116 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam116.html#Honkala02 2003-05-21 On (q, 1)-subnormal q-ary Covering Codes. 213-221 1994 52 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)90141-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam52.html#Honkala94 2003-06-16 A Decision Method for Parikh Slenderness of Context-free Languages. 1-4 1997 73 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(96)00023-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam73.html#Honkala97 2003-06-30 On the Equivalence Problem of Context-free and DT0L Languages. 147-149 1999 98 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(99)00120-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#Honkala99 2003-04-02 Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs. 281-286 2002 119 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#ShimSZ02 2002-01-03 Ramsey-remainder for convex sets and the Erdös-Szekeres theorem. 163-175 2001 109 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam109.html#Karolyi01 2003-04-02 New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization. 149-167 2002 119 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#Kabadi02 2003-06-18 _{(P5, P5)-free}Graphs. 255-261 1997 80 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(97)00093-0 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#GiakoumakisR97 2003-04-01 Theory of 2-3 Heaps. 115-128 2003 126 Discrete Applied Mathematics 1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam126.html#Takaoka03 2003-05-27 The Forwarding Index of Directed Networks. 279-291 1996 68 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00072-Y http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#ManoussakisT96 2003-05-21 On the Euclidean two Paths Problem. 165-173 1993 47 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam47.html#KellererW93 http://dx.doi.org/10.1016/0166-218X(93)90089-7 2002-01-03 Resolvability in graphs and the metric dimension of a graph. 99-113 2000 105 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam105.html#ChartrandEJO00 2002-01-03 Container ship stowage problem: complexity and connection to the coloring of circle graphs. 271-279 2000 103 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam103.html#AvrielPS00 2003-04-01 On Wiener numbers of polygonal nets. 251-261 2002 122 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam122.html#ShiuLP02 2003-05-21 Optimal Match-up Strategies in Stochastic Scheduling. 105-120 1995 57 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)00098-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam57.html#BirgeD95 2003-07-04 Formal Concept Analysis for General Objects. 337-355 2003 127 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00253-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#Prediger03 2003-06-18 Wiener Number of Hexagonal Jagged-rectangles. 83-96 1997 80 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(97)00071-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam80.html#ShiuTL97 2003-05-22 Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, optimization and Separation. 57-74 1995 59 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(95)90600-K http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam59.html#PochetW95 2003-05-26 Intertwined Infinite Binary Words. 95-99 1996 66 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(95)00119-C http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#Grytczuk96 2003-06-18 Better Approximations of Non-Hamiltonian Graphs. 239-261 1998 81 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00099-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam81.html#IwamaM98 2003-07-04 Maximal and Stochastic Galois Lattices. 271-284 2003 127 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(02)00210-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam127.html#DidayE03 2003-06-16 On the Complexity of Coupled-task Scheduling. 141-154 1997 72 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/S0166-218X(96)00041-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam72.html#OrmanP97 2003-04-01 Determination of the star valency of a graph. 291-296 2003 126 Discrete Applied Mathematics 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam126.html#DongLZ03 2003-05-26 A Group Testing Problem for Hypergraphs of Bounded Rank. 185-188 1996 66 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(95)00120-G http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam66.html#Triesch96 2003-05-22 A Theorem on the Principal Structure for Independent Matchings. 229-244 1995 61 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(94)00018-9 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam61.html#IwataM95 2003-05-21 Some Concepts of Stability Analysis in Combinatorial optimization. 169-190 1995 58 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(93)E0126-J http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam58.html#SotskovLG95 2003-04-02 On the convergence of generalized hill climbing algorithms. 37-57 2002 119 Discrete Applied Mathematics 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam119.html#JohnsonJ02 2003-06-27 On a Graph-theoretical Model for Cyclic Register Allocation. 191-203 1999 93 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/S0166-218X(99)00105-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam93.html#WerraELM99 2003-06-30 Distributions on Bicoloured Binary Trees Arising from the Principle of Parsimony. 245-261 1993 41 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam41.html#Steel93 http://dx.doi.org/10.1016/0166-218X(90)90058-K 2003-04-02 On kernel-less clique-acyclic orientations of minimally imperfect graphs. 209-219 2001 115 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam115.html#Sakuma01 2003-06-30 Minimizing the Number of Late Jobs for the Two-machine Unit-time Job-shop Scheduling Problem. 209-217 2000 98 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(99)00165-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam98.html#Kravchenko00a 2003-05-27 Restrictions and Preassignments in Preemptive open Shop Scheduling. 169-188 1996 68 Discrete Applied Mathematics 1-2 http://dx.doi.org/10.1016/0166-218X(95)00055-V http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam68.html#WerraHMP96 2002-09-03 On the number of generators for transeunt triangles. 309-316 2001 108 Discrete Applied Mathematics 3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam108.html#ButlerDYS01 2002-01-03 On stable cutsets in graphs. 39-50 2000 105 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam105.html#BrandstadtDLS00 2002-01-03 Broadcasting in random graphs. 149-170 1994 53 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam53.html#Gerbessiotis94 2003-05-26 Close-to-optimal and Near-optimal Broadcasting in Random Graphs. 129-150 1995 63 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(95)00004-B http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#Gerbessiotis95 2003-06-18 A Graph-theoretic Result for a Model of Neural Computation. 257-262 1998 82 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00021-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam82.html#Gerbessiotis98 2003-05-22 The Shifting Algorithm Technique for the Partitioning of Trees. 15-34 1995 62 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00143-2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam62.html#BeckerP95 2005-04-25 Finding the Pareto-optima for the total and maximum tardiness single machine problem. 117-126 2002 124 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam124.html#TadeiGC02 2003-05-22 Irreflexive and Reflexive Dimension. 267-273 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00057-K http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#Langley95a 2003-06-16 On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks. 75-87 1997 78 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(97)00016-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam78.html#FishburnHDG97 2003-05-26 The Simulated Trading Heuristic for Solving Vehicle Routing Problems. 47-72 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00027-O http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#BachemHM96 2003-05-26 An Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints. 319-345 1996 65 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(95)00040-X http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam65.html#HertzW96 2002-01-03 Self-reading sequences. 201-203 1994 50 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam50.html#Istrate94 2003-05-21 Euclidean Spanner Graphs with Degree Four. 55-66 1994 54 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/0166-218X(94)90133-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam54.html#Salowe94 2003-06-23 Algorithms and Outerplanar Conditions for A-trails in Plane Eulerian Graphs. 99-112 1998 85 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/S0166-218X(97)00141-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam85.html#AndersenFR98 2003-05-21 The Monadic Second order Logic of Graphs VI: on Several Representations of Graphs By Relational Structures 117-149 1994 54 Discrete Applied Mathematics 2-3 http://dx.doi.org/10.1016/0166-218X(94)90019-1 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam54.html#Courcelle94 2003-05-26 The Monadic Second-order Logic of Graphs VI: On Several Representations of Graphs by Relational Structures. 199-200 1995 63 Discrete Applied Mathematics 2 http://dx.doi.org/10.1016/0166-218X(95)00006-D http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam63.html#Courcelle95 2003-05-13 Periodic Assignment and Graph Colouring. 291-305 1994 51 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(92)00036-L http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam51.html#KorstALW94 2002-03-21 Selective Inheritance of Attribute Values in Relational Databases. 187-216 1992 40 Discrete Applied Mathematics 2 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam40.html#GottlobSS92 2003-05-22 Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time. 77-91 1995 60 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/0166-218X(94)00043-D http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam60.html#BermanFS95 2003-06-16 A d-move Local Permutation Routing for the d-cube. 199-207 1997 72 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/S0166-218X(96)00019-4 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam72.html#HwangYG97 2003-06-17 Interior and Exterior Functions of Boolean Functions. 209-231 1996 69 Discrete Applied Mathematics 3 http://dx.doi.org/10.1016/0166-218X(95)00092-6 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam69.html#MakinoI96 2003-06-30 Inner-core and Outer-core Functions of Partially Defined Boolean Functions. 443-460 1999 96-97 Discrete Applied Mathematics http://dx.doi.org/10.1016/S0166-218X(99)00101-8 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam96.html#MakinoI99 2003-06-16 Reliability Evaluation of Large Telecommunication Networks. 61-80 1997 76 Discrete Applied Mathematics 1-3 http://dx.doi.org/10.1016/S0166-218X(96)00117-5 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam76.html#CarlierLL97 2003-04-01 Families of non-IRUP instances of the one-dimensional cutting stoc problem. 229-245 2002 121 Discrete Applied Mathematics 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/dam/dam121.html#RietzST02