Algorithms and Discrete Applied Mathematics

<p>Efficient Domination and Efficient Edge Domination: A Brief Survey.- Mixed Unit Interval Bigraphs.-Hamiltonian Path in K1,t-free split Graphs – a Dichotomy.- A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems.- Probabilistic Properties of Highly Connected Random Geometric Graphs.- On Indicated Coloring of Some Classes of Graphs.- Line Segment Disk Cover.- Fixed-parameter tractable algorithms for Tracking Set Problems.- Exact computation of the number of accepting paths of an NTM.- Determining Minimal Degree Polynomials of a Cyclic Code of length 2^k over Z8.- Consistent Subset Problem with two labels.- The Edge Geodetic Number of Product Graphs.- Burning Spiders.- Drawing Graphs on Few Circles and Few Spheres.- On a lower bound for the eccentric connectivity index of graphs.- On the Tractability of (k,i)-Coloring.- Window Queries for Problems on Intersecting Objects and Maximal Points.- Bounded stub resolution for some maximal 1-planar graphs.- On Structural Parameterizations of Firefighting.- On the Simultaneous Minimum Spanning Trees Problem.- Variations of cops and robbers game on grids.- Alternation, Sparsity and Sensitivity : Combinatorial Bounds and Exponential Gaps.- On oriented L(p; 1)-labeling.- Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance Functions.</p>