Applications of dimensionality reduction and exponential sums to graph automorphism Fulltext Access 11 Pages 2011
Parameterized complexity of coloring problems: Treewidth versus vertex cover Fulltext Access 11 Pages 2011
A fault-containing self-stabilizing -approximation algorithm for vertex cover in anonymous networks Fulltext Access 11 Pages 2011
Parallel randomized load balancing: A lower bound for a more general model Fulltext Access 11 Pages 2011
Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints Fulltext Access 11 Pages 2011
An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges Fulltext Access 11 Pages 2011
Shortest path and maximum flow problems in networks with additive losses and gains Fulltext Access 11 Pages 2011
An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs Fulltext Access 11 Pages 2011
New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs Fulltext Access 11 Pages 2011
Online hierarchical scheduling: An approach using mathematical programming Fulltext Access 11 Pages 2011
Minimization strategies for maximally parallel multiset rewriting systems Fulltext Access 11 Pages 2011
Efficient learning of multiple context-free languages with multidimensional substitutability from positive data Fulltext Access 11 Pages 2011
On the independence number and Hamiltonicity of uniform random intersection graphs Fulltext Access 11 Pages 2011
Learning Boolean functions in AC0 on attribute and classification noise—Estimating an upper bound on attribute and classification noise Fulltext Access 11 Pages 2011
A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes Fulltext Access 12 Pages 2011
A self-stabilizing 23-approximation algorithm for the maximum matching problem Fulltext Access 12 Pages 2011
The concept of duality for automata over a changing alphabet and generation of a free group by such automata Fulltext Access 12 Pages 2011
Morphic characterizations of languages in Chomsky hierarchy with insertion and locality Fulltext Access 12 Pages 2011
Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements Fulltext Access 12 Pages 2011
Complete solution to a conjecture on the maximal energy of unicyclic graphs Fulltext Access 12 Pages 2011
Kolmogorov complexity and combinatorial methods in communication complexity Fulltext Access 12 Pages 2011
2-extendability and kk-resonance of non-bipartite Klein-bottle polyhexes Fulltext Access 12 Pages 2011
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints Fulltext Access 12 Pages 2011
Equistable graphs, general partition graphs, triangle graphs, and graph products Fulltext Access 12 Pages 2011
On cryptographic protocols employing asymmetric pairings — The role of ΨΨ revisited Fulltext Access 12 Pages 2011
A comparison of lower bounds for the symmetric circulant traveling salesman problem Fulltext Access 12 Pages 2011
Two discrete versions of the Inscribed Square Conjecture and some related problems Fulltext Access 12 Pages 2011
Kolmogorov complexity of initial segments of sequences and arithmetical definability Fulltext Access 12 Pages 2011
On the scalability of biocomputing algorithms: The case of the maximum clique problem Fulltext Access 12 Pages 2011
How to improve snap-stabilizing point-to-point communication space complexity? Fulltext Access 12 Pages 2011
On the road to the weakest failure detector for k-set agreement in message-passing systems Fulltext Access 12 Pages 2011