On geodesic structures of weakly median graphs I. Decomposition and octahedral graphs Fulltext Access 13 Pages 2006
Extremal graphs for a new upper bound on domination parameters in graphs Fulltext Access 13 Pages 2006
A new mixed integer programming formulation for facility layout design using flexible bays Fulltext Access 13 Pages 2006
The node-edge weighted 2-edge connected subgraph problem: Linear relaxation, facets and separation Fulltext Access 13 Pages 2006
Polyhedral results on single node variable upper-bound flow models with allowed configurations Fulltext Access 13 Pages 2006
A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints Fulltext Access 13 Pages 2006
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size Fulltext Access 13 Pages 2006
An Equivalence between Dependencies in Nested Databases and a Fragment of Propositional Logic Fulltext Access 13 Pages 2006
New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming Fulltext Access 13 Pages 2006
A Component Model for Separation of Control Flow from Computation in Component-Based Systems Fulltext Access 13 Pages 2006
Classification of isosceles eight-point sets in three-dimensional Euclidean space Fulltext Access 13 Pages 2006
Super edge-magic strength of fire crackers, banana trees and unicyclic graphs Fulltext Access 13 Pages 2006
Efficient crossover designs for comparing test treatments with a control treatment Fulltext Access 13 Pages 2006
Deriving Available Behavior All Out from Incompatible Component Compositions Fulltext Access 13 Pages 2006
On Interpolation Problem in Paraconsistent Extensions of the Minimal Logic Fulltext Access 13 Pages 2006
A Logical Uniform Boundedness Principle for Abstract Metric and Hyperbolic Spaces Fulltext Access 13 Pages 2006
Some simple optimization techniques for self-organized public key management in mobile ad hoc networks Fulltext Access 13 Pages 2006
A Maiorana–McFarland type construction for resilient Boolean functions on n variables (n even) with nonlinearity >2n-1-2n/2+2n/2-2>2n-1-2n/2+2n/2-2 Fulltext Access 13 Pages 2006
On Validity Assurance of Dynamic Reconfiguration for Component-based Programs Fulltext Access 13 Pages 2006
Review of combinatorial problems induced by spatial forest harvesting planning Fulltext Access 13 Pages 2006
Fast algorithms for identifying maximal common connected sets of interval graphs Fulltext Access 13 Pages 2006
Enumeration of perfect matchings of a type of Cartesian products of graphs Fulltext Access 13 Pages 2006
Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees Fulltext Access 13 Pages 2006
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets Fulltext Access 13 Pages 2006
Convexity in Helly Graphs: Selection and Almost Fixed Point Properties for Multifunctions Fulltext Access 13 Pages 2006
LSC Verification for UML Models with Unbounded Creation and Destruction Fulltext Access 13 Pages 2006
Formal Verification of the Quasi-Static Behavior of Mixed-Signal Circuits by Property Checking Fulltext Access 13 Pages 2006
Convergence Routing under Bursty Traffic: Instability and an AIMD Controller 1 Fulltext Access 13 Pages 2006
Observing Internet Worm and Virus Attacks with a Small Network Telescope Fulltext Access 13 Pages 2006
Mining Propositional Simplification Proofs for Small Validating Clauses Fulltext Access 13 Pages 2006
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms Fulltext Access 14 Pages 2006
Multi-variable Zeilberger and Almkvist–Zeilberger algorithms and the sharpening of Wilf–Zeilberger theory Fulltext Access 14 Pages 2006