Reductions between scheduling problems with non-renewable resources and knapsack problems Fulltext Access 14 Pages 2015
Parameterized and subexponential-time complexity of satisfiability problems and applications Fulltext Access 14 Pages 2015
Kernelization and parameterized algorithms for covering a tree by a set of stars or paths Fulltext Access 14 Pages 2015
Using Binary Patterns for Counting Falsifying Assignments of Conjunctive Forms Fulltext Access 14 Pages 2015
Characterizing polynomial time complexity of stream programs using interpretations Fulltext Access 14 Pages 2015
Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: Combinatorial and algorithmic applications Fulltext Access 14 Pages 2015
On a class of covering problems with variable capacities in wireless networks Fulltext Access 14 Pages 2015
On maximum independent set of categorical product and ultimate categorical ratios of graphs Fulltext Access 15 Pages 2015
On the complexity of finding a largest common subtree of bounded degree Fulltext Access 15 Pages 2015
Matching preclusion and conditional matching preclusion problems for the folded Petersen cube Fulltext Access 15 Pages 2015
Mathematical model for velocity and temperature of gravity-driven convective optically thick nanofluid flow past an oscillating vertical plate in presence of magnetic field and radiation Fulltext Access 15 Pages 2015
A local strategy for cleaning expanding cellular domains by simple robots Fulltext Access 15 Pages 2015
Resistance distance-based graph invariants of subdivisions and triangulations of graphs Fulltext Access 15 Pages 2015
The Minimum Flow Cost Hamiltonian Cycle Problem: A comparison of formulations Fulltext Access 15 Pages 2015
Asymptotic Behavior and Performance Constraints of Replication Policies Fulltext Access 15 Pages 2015
Inefficiency of equilibria for scheduling game with machine activation costs Fulltext Access 15 Pages 2015
Verification of membrane systems with delays via Petri nets with delays Fulltext Access 15 Pages 2015
The complexity of fully proportional representation for single-crossing electorates Fulltext Access 15 Pages 2015
On the parameterized complexity of vertex cover and edge cover with connectivity constraints Fulltext Access 15 Pages 2015
A complexity and approximation framework for the maximization scaffolding problem Fulltext Access 15 Pages 2015
Improved approximation algorithms for scheduling parallel jobs on identical clusters Fulltext Access 16 Pages 2015
On the Canonical Representation of Order 3 Discrete Phase Type Distributions Fulltext Access 16 Pages 2015
Formalisation in Constructive Type Theory of Stoughton's Substitution for the Lambda Calculus Fulltext Access 16 Pages 2015
Analysis of fully distributed splitting and naming probabilistic procedures and applications Fulltext Access 16 Pages 2015
Power and exponential sums for generalized coding systems by a measure theoretic approach Fulltext Access 16 Pages 2015