1: A note on the hardness of graph diameter augmentation problems
2: Large-girth roots of graphs
3: Beyond O(star)(2^n) in domination-type problems
4: Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles
5: A Measure of the Connection Strengths between Graph Vertices with Applications
6: Exploration of Periodically Varying Graphs
7: Lightweight Data Indexing and Compression in External Memory
8: Dependent Randomized Rounding for Matroid Polytopes and Applications
9: A Graph Spectral Approach for Computing Approximate Nash Equilibria
10: Planar Subgraph Isomorphism Revisited
11: Combinatiorial Algorithms for Wireless Information Flow
12: Hybrid Intrusion Detection and Prediction multiAgent System HIDPAS
13: Range Non-Overlapping Indexing
14: MACH: Fast Randomized Tensor Decompositions
15: Cartesian product of hypergraphs: properties and algorithms