<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en"><generator uri="https://jekyllrb.com/" version="4.4.1">Jekyll</generator><link href="https://www.ksidorov.com/feed/news.xml" rel="self" type="application/atom+xml"/><link href="https://www.ksidorov.com/" rel="alternate" type="text/html" hreflang="en"/><updated>2026-08-27T16:28:41+00:00</updated><id>https://www.ksidorov.com/feed/news.xml</id><title type="html">Konstantin Sidorov | News</title><subtitle>A website where I share my research and sometimes produce hot takes on the optimization field. </subtitle><entry><title type="html">Our paper is published in JAIR</title><link href="https://www.ksidorov.com/news/jair-proof-minimization/" rel="alternate" type="text/html" title="Our paper is published in JAIR"/><published>2026-08-27T00:00:00+00:00</published><updated>2026-08-27T00:00:00+00:00</updated><id>https://www.ksidorov.com/news/jair-proof-minimization</id><content type="html" xml:base="https://www.ksidorov.com/news/jair-proof-minimization/"><![CDATA[<p>Our paper “How to Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability,” co-authored with <a href="https://kjgm.github.io/">Koos van der Linden</a>, <a href="https://www.tudelft.nl/staff/g.correia/">Gonçalo Homem de Almeida Correia</a>, <a href="https://www.tudelft.nl/staff/m.m.deweerdt/">Mathijs de Weerdt</a>, and <a href="https://emirdemirovic.com">Emir Demirović</a>, has been published in the <a href="https://doi.org/10.1613/jair.1.22128">Journal of Artificial Intelligence Research</a>! You may also be interested to read <a href="/blog/2026/shortest-proofs/">an accompanying post</a> for a more accessible overview of the ideas we introduce.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[Our paper “How to Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability,” co-authored with Koos van der Linden, Gonçalo Homem de Almeida Correia, Mathijs de Weerdt, and Emir Demirović, has been published in the Journal of Artificial Intelligence Research! You may also be interested to read an accompanying post for a more accessible overview of the ideas we introduce.]]></summary></entry><entry><title type="html">Two papers are accepted at CP 2026</title><link href="https://www.ksidorov.com/news/cp2026-accept/" rel="alternate" type="text/html" title="Two papers are accepted at CP 2026"/><published>2026-06-14T00:00:00+00:00</published><updated>2026-06-14T00:00:00+00:00</updated><id>https://www.ksidorov.com/news/cp2026-accept</id><content type="html" xml:base="https://www.ksidorov.com/news/cp2026-accept/"><![CDATA[<p>I co-authored two papers accepted in CP 2026: my paper “On Inferring Cumulative Constraints” about improving CP scheduling with deriving hidden resource constraints using lifting, and the paper “Formally Verified Certification of Constraint Programming Proofs,” co-authored with <a href="https://maartenflippo.com/">Maarten Flippo</a>, <a href="https://tiptenbrink.nl/">Tip ten Brink</a>, <a href="https://pit-claudel.fr/clement/">Clément Pit-Claudel</a>, and <a href="https://emirdemirovic.com">Emir Demirović</a>. For the former, you may be interested to read <a href="/blog/2026/cp2026-lifting/">an accompanying post</a> for a more accessible overview of the ideas I introduce.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[I co-authored two papers accepted in CP 2026: my paper “On Inferring Cumulative Constraints” about improving CP scheduling with deriving hidden resource constraints using lifting, and the paper “Formally Verified Certification of Constraint Programming Proofs,” co-authored with Maarten Flippo, Tip ten Brink, Clément Pit-Claudel, and Emir Demirović. For the former, you may be interested to read an accompanying post for a more accessible overview of the ideas I introduce.]]></summary></entry><entry><title type="html">Thomas Kuiper defended his MSc thesis!</title><link href="https://www.ksidorov.com/news/thomas-kuiper-defense/" rel="alternate" type="text/html" title="Thomas Kuiper defended his MSc thesis!"/><published>2025-12-08T00:00:00+00:00</published><updated>2025-12-08T00:00:00+00:00</updated><id>https://www.ksidorov.com/news/thomas-kuiper-defense</id><content type="html" xml:base="https://www.ksidorov.com/news/thomas-kuiper-defense/"><![CDATA[<p>Thomas Kuiper <a href="https://repository.tudelft.nl/record/uuid:2a8fa22e-654e-4c57-8b3e-12a9848e4b56">defended</a> his MSc thesis on inferring local structure for the predict-and-optimize loss functions.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[Thomas Kuiper defended his MSc thesis on inferring local structure for the predict-and-optimize loss functions.]]></summary></entry><entry><title type="html">Our paper is accepted at CP 2025</title><link href="https://www.ksidorov.com/news/cp2025-accept/" rel="alternate" type="text/html" title="Our paper is accepted at CP 2025"/><published>2025-06-15T00:00:00+00:00</published><updated>2025-06-15T00:00:00+00:00</updated><id>https://www.ksidorov.com/news/cp2025-accept</id><content type="html" xml:base="https://www.ksidorov.com/news/cp2025-accept/"><![CDATA[<p>Our paper “Unite and Lead: Finding Disjunctive Cliques for Scheduling Problems,” co-authored with <a href="https://imkomarijnissen.com">Imko Marijnissen</a> and <a href="https://emirdemirovic.com">Emir Demirović</a>, has been accepted to CP 2025! You may also be interested to read <a href="/blog/2025/unite-and-lead/">an accompanying post</a> for a more accessible overview of the ideas we introduce.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[Our paper “Unite and Lead: Finding Disjunctive Cliques for Scheduling Problems,” co-authored with Imko Marijnissen and Emir Demirović, has been accepted to CP 2025! You may also be interested to read an accompanying post for a more accessible overview of the ideas we introduce.]]></summary></entry><entry><title type="html">Jop Schaap defended his MSc thesis!</title><link href="https://www.ksidorov.com/news/jop-schaap-defense/" rel="alternate" type="text/html" title="Jop Schaap defended his MSc thesis!"/><published>2025-01-29T00:00:00+00:00</published><updated>2025-01-29T00:00:00+00:00</updated><id>https://www.ksidorov.com/news/jop-schaap-defense</id><content type="html" xml:base="https://www.ksidorov.com/news/jop-schaap-defense/"><![CDATA[<p>Jop Schaap <a href="https://repository.tudelft.nl/record/uuid:36f6961f-4494-43ad-be11-f120ffced3db">defended</a> his MSc thesis on using decision diagrams for predict-and-optimize problems.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[Jop Schaap defended his MSc thesis on using decision diagrams for predict-and-optimize problems.]]></summary></entry><entry><title type="html">Thomas Kuiper joins our group</title><link href="https://www.ksidorov.com/news/po-losses/" rel="alternate" type="text/html" title="Thomas Kuiper joins our group"/><published>2024-11-14T00:00:00+00:00</published><updated>2024-11-14T00:00:00+00:00</updated><id>https://www.ksidorov.com/news/po-losses</id><content type="html" xml:base="https://www.ksidorov.com/news/po-losses/"><![CDATA[<p>I have started to supervise the project on quantifying the structures captured by the predict-and-optimize loss functions by Thomas Kuiper.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[I have started to supervise the project on quantifying the structures captured by the predict-and-optimize loss functions by Thomas Kuiper.]]></summary></entry><entry><title type="html">Proof minimization preprint</title><link href="https://www.ksidorov.com/news/proof-minimization-arxiv/" rel="alternate" type="text/html" title="Proof minimization preprint"/><published>2024-11-13T00:00:00+00:00</published><updated>2024-11-13T00:00:00+00:00</updated><id>https://www.ksidorov.com/news/proof-minimization-arxiv</id><content type="html" xml:base="https://www.ksidorov.com/news/proof-minimization-arxiv/"><![CDATA[<p>We have released the <a href="https://arxiv.org/abs/2411.07955">preprint version</a> of our work on discovering the shortest resolution proofs of the unsatisfiability of Boolean formulas.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[We have released the preprint version of our work on discovering the shortest resolution proofs of the unsatisfiability of Boolean formulas.]]></summary></entry><entry><title type="html">CP 2024</title><link href="https://www.ksidorov.com/news/cp2024/" rel="alternate" type="text/html" title="CP 2024"/><published>2024-09-06T00:00:00+00:00</published><updated>2024-09-06T00:00:00+00:00</updated><id>https://www.ksidorov.com/news/cp2024</id><content type="html" xml:base="https://www.ksidorov.com/news/cp2024/"><![CDATA[<p>I attended the <a href="https://cp2024.a4cp.org/">CP 2024</a> conference and presented the paper <a href="https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.9">“Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram Algorithms”</a> co-authored with <a href="https://emirde.github.io/">Emir Demirović</a>, <a href="https://ciaranm.github.io/">Ciaran McCreesh</a>, <a href="https://matthewmcilree.com/">Matthew J. McIlree</a>, <a href="https://jakobnordstrom.se/">Jakob Nordström</a>, and <a href="https://aoertel.de/">Andy Oertel</a>. I have also presented our current progress on the resolution proof minimization project during the doctoral program.</p> <p>You may also be interested in <a href="/blog/2024/cp2024/">my impressions post</a> for a more detailed overview of some of the noteworthy talks.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[I attended the CP 2024 conference and presented the paper “Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram Algorithms” co-authored with Emir Demirović, Ciaran McCreesh, Matthew J. McIlree, Jakob Nordström, and Andy Oertel. I have also presented our current progress on the resolution proof minimization project during the doctoral program.]]></summary></entry></feed>