Computer Science grad student at Universidad de Buenos Aires, finishing my M.S. thesis on graph algorithms (advisor: Min Chih Lin). I like optimization problems, competitive programming, and building backend systems.

• Research: An Arboricity-Sensitive Algorithm for the K_r-e-Free Graph Sandwich Problem (arXiv, 2026, with Min Chih Lin)
• 1st place, Mercado Libre warehouse optimization challenge (SBPO 2025): modeled wave order picking as an integer program, solved with IBM CPLEX, and presented it at SBPO 2025 in Brazil
• 1st place, Investigathon 2025: formal paper solving an original graph theory problem
• Codeforces: 850+ problems solved, peak Candidate Master (NatanVek)

Previously a backend developer at Verifarma (C#/.NET, pharmaceutical traceability) and an intern at ATC Sports (TypeScript/Node.js). I also do freelance backend work, most recently ERP integrations for an MCP-based AI analytics platform.

Some things I've built:

• challenge-sbpo-2025: my winning solution to the Mercado Libre challenge
• MyLibrary: algorithms and data structures for competitive programming, written from scratch
• AZUL: a web version of the Azul board game with a Monte Carlo Tree Search AI opponent
• CODENAMES: a multiplayer Codenames clone I built to play with friends during the pandemic
• Algorithmic trading system (Rust, private): profitable on Polymarket, with a parallel backtesting engine and evolutionary optimizers (CMA-ES, GA)

Reach me at natanvek11@gmail.com or on LinkedIn.