background : homicide is killing of a human being by another human being. various methods like strangulation, cut throat, stabbing etc may be used for homicide; however combination of two mechanisms is rare. case report: hereby we present a rare case with unexpected appearance of two different mechanisms of homicide applied over same region, wherein body of a female was referred to us with hist...

We consider the max-cut problem on a random graph G with n vertices and weights wij being independent bounded random variables with the same xed positive expectation and variance . It is well known that the max-cut number mc(G) always exceeds 2 ∑ i¡j wij . We prove that with probability greater than pn the max-cut number satis es

A short proof of a difficult theorem of P.D. Seymour on grafts with the max-flow min-cut property is given.

We study budgeted variants of classical cut problems: the Multiway Cut problem, the Multicut problem, and the k-Cut problem, and provide approximation algorithms for these problems. Specifically, for the budgeted multiway cut and the k-cut problems we provide constant factor approximation algorithms. We show that the budgeted multicut problem is at least as hard to approximate as the sparsest c...

We propose Inflate-Paste – a new technique for generating orthogonal polygons with a given number of vertices from a unit square based on gluing rectangles. It is dual to Inflate-Cut – a technique we introduced in [12] that works by cutting rectangles.

For a positive integer d, the d-CUT is problem of deciding if an undirected graph $$G=(V,E)$$ has nontrivial bipartition (A, B) V such that every vertex in A (resp. at most d neighbors B A). When $$d=1$$ , this MATCHING CUT problem. Gomes and Sau [9] gave first fixed-parameter tractable algorithm for parameterized by maximum number crossing edges cut (i.e., size edge cut). However, their paper ...