Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree Fulltext Access 14 Pages 2017
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree Fulltext Access 14 Pages 2017
Parikh-reducing Church-Rosser representations for some classes of regular languages Fulltext Access 14 Pages 2017
The complexity of data aggregation in static and dynamic wireless sensor networks Fulltext Access 15 Pages 2017
Every planar graph without cycles of length 4 or 9 is (1,1,0)-colorable Fulltext Access 15 Pages 2017
On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability Fulltext Access 15 Pages 2017
A decomposition theorem and two algorithms for reticulation-visible networks Fulltext Access 15 Pages 2017
Gathering of oblivious robots on infinite grids with minimum traveled distance Fulltext Access 15 Pages 2017
Computing real witness points of positive dimensional polynomial systems Fulltext Access 15 Pages 2017
Automaton semigroups: New constructions results and examples of non-automaton semigroups Fulltext Access 15 Pages 2017
Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound Fulltext Access 15 Pages 2017
Complexity of rainbow vertex connectivity problems for restricted graph classes Fulltext Access 15 Pages 2017
Exploring the complexity of the integer image problem in the max-algebra Fulltext Access 15 Pages 2017
A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph Fulltext Access 15 Pages 2017
Concentration independent random number generation in tile self-assembly Fulltext Access 15 Pages 2017
Reconfiguring dominating sets in some well-covered and other classes of graphs Fulltext Access 16 Pages 2017
On the generalised colouring numbers of graphs that exclude a fixed minor Fulltext Access 16 Pages 2017
Fault-tolerant spanners in networks with symmetric directional antennas Fulltext Access 16 Pages 2017
Total variation discrepancy of deterministic random walks for ergodic Markov chains Fulltext Access 16 Pages 2017
The number of completely different optimal identifying codes in the infinite square grid Fulltext Access 16 Pages 2017
Network connectivity assessment and improvement through relay node deployment Fulltext Access 16 Pages 2017
The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks Fulltext Access 16 Pages 2017
On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs Fulltext Access 16 Pages 2017
A linear-time algorithm to compute the triangular hull of a digital object Fulltext Access 16 Pages 2017
Alternating space is closed under complement and other simulations for sublogarithmic space Fulltext Access 16 Pages 2017
Equivalence of two fixed-point semantics for definitional higher-order logic programs Fulltext Access 16 Pages 2017
Real polynomial root-finding by means of matrix and polynomial iterations Fulltext Access 16 Pages 2017
A domain-theoretic approach to Brownian motion and general continuous stochastic processes Fulltext Access 17 Pages 2017
Decompositions of edge-colored infinite complete graphs into monochromatic paths Fulltext Access 17 Pages 2017