Bounded-degree minimum-radius spanning trees in wireless sensor networks Fulltext Access 12 Pages 2013
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system Fulltext Access 12 Pages 2013
Computing the nearest singular univariate polynomials with given root multiplicities Fulltext Access 13 Pages 2013
Paging mobile users in cellular networks: Optimality versus complexity and simplicity Fulltext Access 13 Pages 2013
Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees Fulltext Access 13 Pages 2013
Deciding the winner in k rounds for DISJOINT ARROWS, a new combinatorial partizan game Fulltext Access 13 Pages 2013
A scalable approach to computing representative lowest common ancestor in directed acyclic graphs Fulltext Access 13 Pages 2013
Contractible configurations on 3-flows in graphs satisfying the Fan-condition Fulltext Access 13 Pages 2013
Finding lower bounds on the complexity of secret sharing schemes by linear programming Fulltext Access 13 Pages 2013
Circulant weighing matrices whose order and weight are products of powers of 2 and 3 Fulltext Access 13 Pages 2013
Computing growth functions of braid monoids and counting vertex-labelled bipartite graphs Fulltext Access 13 Pages 2013
Nontrivial independent sets of bipartite graphs and cross-intersecting families Fulltext Access 13 Pages 2013
An explicit formula for ndinv, a new statistic for two-shuffle parking functions Fulltext Access 13 Pages 2013
The bondage number of graphs on topological surfaces and Teschner's conjecture Fulltext Access 13 Pages 2013
Velocity polytopes of periodic graphs and a no-go theorem for digital physics Fulltext Access 13 Pages 2013
The weakest failure detector to implement a register in asynchronous systems with hybrid communication Fulltext Access 13 Pages 2013
TAO+: Extending the Conceptual Framework TAO to Support Internal Agent Architectures in Normative Multi-Agent Systems Fulltext Access 13 Pages 2013
Complex Functional Rates in the Modeling of Nano Devices (Extended Abstract) Fulltext Access 13 Pages 2013
An integer optimization approach for reverse engineering of gene regulatory networks Fulltext Access 13 Pages 2013
Restricted non-separable planar maps and some pattern avoiding permutations Fulltext Access 13 Pages 2013
Generic expression hardness results for primitive positive formula comparison Fulltext Access 13 Pages 2013
Faster optimal algorithms for segment minimization with small maximal value Fulltext Access 13 Pages 2013
New bounds and constraint propagation techniques for the clique partitioning problem Fulltext Access 13 Pages 2013
A protocol for implementing byzantine storage in churn-prone distributed systems Fulltext Access 13 Pages 2013
Tight complexity analysis of population protocols with cover times — The ZebraNet example Fulltext Access 13 Pages 2013
Building self-stabilizing overlay networks with the transitive closure framework Fulltext Access 13 Pages 2013
Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades Fulltext Access 13 Pages 2013
Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs Fulltext Access 13 Pages 2013
State complexity of star of union and square of union on k regular languages Fulltext Access 13 Pages 2013
Permanent does not have succinct polynomial size arithmetic circuits of constant depth Fulltext Access 13 Pages 2013
Minimal dominating sets in graph classes: Combinatorial bounds and enumeration Fulltext Access 13 Pages 2013