| 2007 | AAAI | Propagating Knapsack Constraints in Sublinear Time. | Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal Van Hentenryck |
| 2007 | CPAIOR | The "Not-Too-Heavy Spanning Tree" Constraint. | Grgoire Dooms, Irit Katriel |
| 2007 | ICALP | Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems. | Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal |
| 2007 | MFCS | Dynamic Matchings in Convex Bipartite Graphs. | Gerth Stlting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel |
| 2006 | CP | The | Grgoire Dooms, Irit Katriel |
| 2006 | CPAIOR | Undirected Forest Constraints. | Nicolas Beldiceanu, Irit Katriel, Xavier Lorca |
| 2006 | CPAIOR | Expected-Case Analysis for Delayed Filtering. | Irit Katriel |
| 2006 | CPM | Faster Algorithms for Computing Longest Common Increasing Subsequences. | Gerth Stlting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz |
| 2005 | CP | Sub-optimality Approximations. | Russell Bent, Irit Katriel, Pascal Van Hentenryck |
| 2005 | CP | Maintaining Longest Paths in Cyclic Graphs. | Irit Katriel, Pascal Van Hentenryck |
| 2005 | CPAIOR | Multiconsistency and Robustness with Global Constraints. | Khaled M. Elbassioni, Irit Katriel |
| 2005 | ISAAC | Simultaneous Matchings. | Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan |
| 2005 | SODA | Online topological ordering. | Irit Katriel, Hans L. Bodlaender |
| 2004 | CPAIOR | Filtering Algorithms for the Same Constraint. | Nicolas Beldiceanu, Irit Katriel, Sven Thiel |
| 2004 | CPAIOR | Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights. | Irit Katriel |
| 2003 | CP | Fast Bound Consistency for the Global Cardinality Constraint. | Irit Katriel, Sven Thiel |
| 2003 | ESA | A Practical Minimum Spanning Tree Algorithm Using the Cycle Property. | Irit Katriel, Peter Sanders, Jesper Larsson Trff |