In this paper we consider the class of simple graphs defined by excluding, as inducedsubgraphs, even holes (i.e. chordless cycles of even length). These graphs are known aseven-hole-free graphs. We prove a decomposition theorem for even-hole-free graphs, thatuses star cutsets and 2-joins. This is a significant strengthening of the only other pre-viously known decomposition of ev...

We consider a family of sequent systems with “well-behaved” logical rules in which the cut rule and/or the identity-axiom are not present. We provide a semantic characterization of the logics induced by these systems in the form of non-deterministic three-valued or four-valued matrices. The semantics is used to study some important proof-theoretic properties of these systems. These results shed...

For conflict resolution between local coordination modules of distributed agents, synthesized based on inter-agent constraints, two original ideas are proposed. The first is a designer-comprehensible Distributed Constraint Specification Network (DCSN) for describing the constraint relationships among agents. The second is an algorithm using cutset theory for generating, from a given DCSN, an AN...

We calculate Yukawa interactions at one-loop on intersecting D6 branes. We demonstrate the non-renormalization theorem in supersymmetric configurations, and show how Yukawa β-functions may be extracted. In addition to the usual logarithmic running, we find the power-law dependence on the infra-red cut-off associated with Kaluza-Klein modes. Our results may also be used to evaluate coupling reno...

We present the implementation of a branch-and-cut algorithm for bound constrained nonconvex quadratic programs. We use a class of inequalities developed in [12] as cutting planes. We present various branching strategies and compare the algorithm to several other methods to demonstrate its effectiveness.

The famous Padberg–Rao separation algorithm for b-matching polyhedra can be implemented to run in O(|V |2|E| log(|V |2/|E|)) time in the uncapacitated case, and in O(|V ||E|2 log (|V |2/|E|)) time in the capacitated case. We give a new and simple algorithm for the capacitated case which can be implemented to run in O(|V |2|E| log(|V |2/|E|)) time.