Approximating the minimum independent dominating set in perturbed graphs Fulltext Access 8 Pages 2014
The algorithmic complexity of bondage and reinforcement problems in bipartite graphs Fulltext Access 8 Pages 2014
An algebraic characterization of semirings for which the support of every recognizable series is recognizable Fulltext Access 8 Pages 2014
Induced hourglass and the equivalence between hamiltonicity and supereulerianity in claw-free graphs Fulltext Access 8 Pages 2014
A dense set of chromatic roots which is closed under multiplication by positive integers Fulltext Access 8 Pages 2014
The edge-face choosability of plane graphs with maximum degree at least 9 Fulltext Access 8 Pages 2014
The crossing number of the Cartesian product of paths with complete graphs Fulltext Access 8 Pages 2014
Improving heuristics for network modularity maximization using an exact algorithm Fulltext Access 8 Pages 2014
Binary linear programming solutions and non-approximability for control problems in voting systems Fulltext Access 8 Pages 2014
Existence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concave Fulltext Access 8 Pages 2014
On opposition graphs, coalition graphs, and bipartite permutation graphs Fulltext Access 8 Pages 2014
Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two Fulltext Access 8 Pages 2014
Non-contextual chocolate balls versus value indefinite quantum cryptography Fulltext Access 9 Pages 2014
Lower hedging of American contingent claims with minimal surplus risk in finite-state financial markets by mixed-integer linear programming Fulltext Access 9 Pages 2014
Dynamic monopolies in directed graphs: The spread of unilateral influence in social networks Fulltext Access 9 Pages 2014
Tight and simple Web graph compression for forward and reverse neighbor queries Fulltext Access 9 Pages 2014
Authenticated broadcast with a partially compromised public-key infrastructure Fulltext Access 9 Pages 2014
Efficient algorithms for network localization using cores of underlying graphs Fulltext Access 9 Pages 2014
Parameterized and approximation algorithms for finding two disjoint matchings Fulltext Access 9 Pages 2014
Learning bounds via sample width for classifiers on finite metric spaces Fulltext Access 9 Pages 2014
A new look at an old construction: Constructing (simple) 3-designs from resolvable 2-designs Fulltext Access 9 Pages 2014