State complexity of union and intersection of star on k regular languages Fulltext Access 10 Pages 2012
Counting and sampling minimum (s,t)-cuts in weighted planar graphs in polynomial time Fulltext Access 10 Pages 2012
Single and multiple device DSA problems, complexities and online algorithms Fulltext Access 10 Pages 2012
Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time Fulltext Access 10 Pages 2012
Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle Fulltext Access 10 Pages 2012
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters Fulltext Access 10 Pages 2012
Geometrical regular languages and linear Diophantine equations: The strongly connected case Fulltext Access 10 Pages 2012
Improved approximation algorithms for maximum lifetime problems in wireless networks Fulltext Access 10 Pages 2012
Energy efficient alert in single-hop networks of extremely weak devices Fulltext Access 10 Pages 2012
A Kolmogorov complexity proof of the Lovász Local Lemma for satisfiability Fulltext Access 10 Pages 2012
Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs Fulltext Access 10 Pages 2012
Enumeration of Rosenberg-type hypercompositional structures defined by binary relations Fulltext Access 10 Pages 2012
Efficient retrieval of approximate palindromes in a run-length encoded string Fulltext Access 10 Pages 2012
The optimal tolerance of uniform observation error for mobile robot convergence Fulltext Access 10 Pages 2012
The connection between computability of a nonlinear problem and its linearization: The Hartman–Grobman theorem revisited Fulltext Access 10 Pages 2012
Modeling the spread of fault in majority-based network systems: Dynamic monopolies in triangular grids Fulltext Access 10 Pages 2012
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem Fulltext Access 10 Pages 2012
Several semi-online scheduling problems on two identical machines with combined information Fulltext Access 10 Pages 2012
Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements Fulltext Access 11 Pages 2012
Nondeterministic Moore automata and Brzozowski’s minimization algorithm Fulltext Access 11 Pages 2012
On symbolic OBDD-based algorithms for the minimum spanning tree problem Fulltext Access 11 Pages 2012
Distributed computing of efficient routing schemes in generalized chordal graphs Fulltext Access 11 Pages 2012
Updating the complexity status of coloring graphs without a fixed induced linear forest Fulltext Access 11 Pages 2012
“Almost stable” matchings in the Roommates problem with bounded preference lists Fulltext Access 11 Pages 2012
Modelling evolution of communication platforms and scenarios based on transformations of high-level nets and processes Fulltext Access 11 Pages 2012
Language classes generated by tree controlled grammars with bounded nonterminal complexity Fulltext Access 11 Pages 2012
On the approximability and hardness of minimum topic connected overlay and its special instances Fulltext Access 11 Pages 2012
A stronger LP bound for formula size lower bounds via clique constraints Fulltext Access 11 Pages 2012