resume.json

{
  "basics": {
    "name": "Konstantin Sidorov",
    "label": "PhD Candidate",
    "email": "k.sidorov@tudelft.nl",
    "url": "https://ksidorov.nl"
  },
  "work": [
    {
      "name": "Delft University of Technology",
      "location": "Delft, Netherlands",
      "position": "PhD Candidate",
      "url": "https://www.tudelft.nl/en/eemcs/the-faculty/departments/software-technology/algorithmics",
      "startDate": "2023-01-01",
      "summary": "Worked on proof-logging-related techniques in ConSol research group.",
      "highlights": [
        "Designed a methodology for reducing the length of optimality proofs.",
        "Organized a research seminar about combinatorial optimization."
      ]
    },
    {
      "name": "X5 Group",
      "location": "Moscow, Russia",
      "position": "Senior Data Sceintist",
      "startDate": "2021-11-29",
      "endDate": "2022-12-31",
      "summary": "Participated in the development of the analytics platform for the transport division of X5 Group, the largest Russian retailer.",
      "highlights": [
        "Refactored the report generation engine, which eliminated multiple inconsistencies in the resulting reports and improved the loading time by an order of magnitude. The updated engine also resulted in a simpler source code, which allowed the development team to expedite the shipment of the new features.",
        "Designed a probabilistic model of the relation between the vehicle repairs and their mileages. This model laid the foundation for the demo widget displaying the planned repair budget.",
        "Developed a statistical model for vehicle fuel usage during its trip and prototyped a widget for detecting abnormal behavior of vehicles and their drivers.",
        "Improved the loading speed of the dashboard by 15 times",
        "Halved the application data pipeline runtime while correcting multiple data consistency errors"
      ]
    },
    {
      "name": "Adeptik Plus OOO",
      "location": "Astrakhan, Russia",
      "position": "Algorithmic Software Engineer",
      "startDate": "2019-07-09",
      "endDate": "2021-11-26",
      "url": "https://adeptik.com/",
      "summary": "Designed algorithms for applied combinatorial optimization in various domains, including last-mile logistics and production planning.",
      "highlights": [
        "Automated the dispatching of field employees for ICL Services, which helped to reduce the time to reaction by 4 times and push the SLA compliance rate to 99.5%",
        "Developed a system for scheduling deliveries for a local bakery, halving their vehicle maintenance costs"
      ]
    }
  ],
  "education": [
    {
      "institution": "Moscow Institute of Physics and Technology",
      "location": "Moscow, Russia",
      "url": "https://eng.mipt.ru/",
      "area": "Contemporary Combinatorics",
      "studyType": "Master's degree, Mathematics",
      "startDate": "2020-10-01",
      "endDate": "2022-07-01",
      "score": "4.81 / 5.00, <strong>with distinction</strong>",
      "courses": [
        "Random Graphs", "Additive Combinatorics", "Analytic Combinatorics"
      ]
    },
    {
      "url": "https://dataschool.yandex.com/",
      "location": "Moscow, Russia",
      "area": "Big Data track",
      "studyType": "Yandex School of Data Analysis",
      "startDate": "2017-09-01",
      "endDate": "2019-06-25",
      "score": "4.92 / 5.00",
      "courses": [
        "Convex Optimization", "Bayesian Methods in Machine Learning", "Advanced Deep Learning"
      ]
    },
    {
      "institution": "Astrakhan State University",
      "location": "Astrakhan, Russia",
      "studyType": "Bachelor's degree, Software Engineering",
      "startDate": "2016-09-01",
      "endDate": "2020-07-01",
      "score": "4.95 / 5.00, <strong>with distinction</strong>"
    }
  ],
  "publications": [
    {
      "name": "Paths, Proofs, and Perfection: Developing a Human-Interpretable Proof System for Constrained Shortest Paths",
      "publisher": "Proceedings of the AAAI Conference on Artificial Intelligence",
      "releaseDate": "2024-03-24",
      "url": "https://ojs.aaai.org/index.php/AAAI/article/view/30068",
      "summary": "We have developed an approach for deriving compact tree-like optimality proofs for constrained shortest path problems. Our approach has been able to derive proofs comparable in width with the MIP proofs, and consistenly narrower proofs for some instance classes."
    }
  ],
  "languages": [
    {
      "language": "English",
      "fluency": "Fluent",
      "icon": ""
    },
    {
      "language": "Russian",
      "fluency": "Native speaker",
      "icon": ""
    }
  ],
  "interests": [
    {
      "name": "Combinatorial optimization",
      "icon": "fa-solid fa-tag",
      "keywords": [
        "Mixed-integer programming",
        "Propositional satisfiability",
        "Branch-and-bound search"
      ]
    },
    {
      "name": "Optimality proofs",
      "icon": "fa-solid fa-tag",
      "keywords": [
        "Proof logging",
        "VeriPB",
        "Clausal proofs"
      ]
    }
  ]
}