1: Faster Algorithms For Vertex Partitioning Problems Parameterized by Clique-width
2: A Faster Algorithm to Recognize Even-Hole-Free Graphs
3: A Linear-Time and Space Algorithm for Optimal Traffic Signal Durations at an Intersection
4: On the Lattice Isomorphism Problem
5: Deterministic Parameterized Algorithms for Matching and Packing Problems
6: An Exact Algorithm for the Generalized List $T$-Coloring Problem
7: Edge covering with budget constrains
8: Mondshein Sequences (a.k.a. (2,1)-Orders)
9: The Composition Theorem for Differential Privacy
10: Fast Self-Stabilizing Minimum Spanning Tree Construction Using Compact Nearest Common Ancestor Labeling Scheme
11: From Theory to Practice: Plug and Play with Succinct Data Structures
12: Algorithmic and Hardness Results for the Colorful Components Problems
13: Significance Relations for the Benchmarking of Meta-Heuristic Algorithms
14: Trade-offs Computing Minimum Hub Cover toward Optimized Graph Query Processing