1: A Raindrop Algorithm for Searching The Global Optimal Solution in Non-linear Programming
2: Happy Edges: Threshold-Coloring of Regular Lattices
3: Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases
4: Privacy and Mechanism Design
5: Metric Dimension for Gabriel Unit Disk Graphs is NP-Complete
6: Multi-parameter complexity analysis for constrained size graph problems: using greediness for parameterization
7: Motif matching using gapped patterns
8: Efficient Classification for Metric Data
9: Space-Efficient Parallel Algorithms for Combinatorial Search Problems
10: A note on small cuts for a terminal
11: I/O-Efficient Planar Range Skyline and Attrition Priority Queues
12: On the Parameterized Complexity of the Maximum Edge Coloring Problem
13: Graphs with Plane Outside-Obstacle Representations
14: Matching with our Eyes Closed
15: Cole’s Parametric Search Technique Made Practical
16: Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
17: Uncapacitated Flow-based Extended Formulations
18: An Efficient Branching Algorithm for Interval Completion
19: All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis