| 2008 |
|---|
| 29 | EE | Irit Katriel:
Matchings in Node-Weighted Convex Bipartite Graphs.
INFORMS Journal on Computing 20(2): 205-211 (2008) |
| 28 | EE | Martin Kutz,
Khaled M. Elbassioni,
Irit Katriel,
Meena Mahajan:
Simultaneous matchings: Hardness and approximation.
J. Comput. Syst. Sci. 74(5): 884-897 (2008) |
| 27 | EE | Gerth Stølting Brodal,
Loukas Georgiadis,
Irit Katriel:
An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree.
Oper. Res. Lett. 36(1): 14-18 (2008) |
| 26 | EE | Irit Katriel,
Claire Kenyon-Mathieu,
Eli Upfal:
Commitment under uncertainty: Two-stage stochastic matching problems.
Theor. Comput. Sci. 408(2-3): 213-223 (2008) |
| 2007 |
|---|
| 25 | | Irit Katriel,
Meinolf Sellmann,
Eli Upfal,
Pascal Van Hentenryck:
Propagating Knapsack Constraints in Sublinear Time.
AAAI 2007: 231-236 |
| 24 | EE | Grégoire Dooms,
Irit Katriel:
The "Not-Too-Heavy Spanning Tree" Constraint.
CPAIOR 2007: 59-70 |
| 23 | EE | Irit Katriel,
Claire Kenyon-Mathieu,
Eli Upfal:
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems.
ICALP 2007: 171-182 |
| 22 | EE | Gerth Stølting Brodal,
Loukas Georgiadis,
Kristoffer Arnsfelt Hansen,
Irit Katriel:
Dynamic Matchings in Convex Bipartite Graphs.
MFCS 2007: 406-417 |
| 21 | EE | Alon Itai,
Irit Katriel:
Canonical density control.
Inf. Process. Lett. 104(6): 200-204 (2007) |
| 2006 |
|---|
| 20 | EE | Grégoire Dooms,
Irit Katriel:
The Minimum Spanning Tree Constraint.
CP 2006: 152-166 |
| 19 | EE | Irit Katriel:
Expected-Case Analysis for Delayed Filtering.
CPAIOR 2006: 119-125 |
| 18 | EE | Nicolas Beldiceanu,
Irit Katriel,
Xavier Lorca:
Undirected Forest Constraints.
CPAIOR 2006: 29-43 |
| 17 | EE | Gerth Stølting Brodal,
Kanela Kaligosi,
Irit Katriel,
Martin Kutz:
Faster Algorithms for Computing Longest Common Increasing Subsequences.
CPM 2006: 330-341 |
| 16 | EE | Irit Katriel,
Hans L. Bodlaender:
Online topological ordering.
ACM Transactions on Algorithms 2(3): 364-379 (2006) |
| 15 | EE | Khaled M. Elbassioni,
Irit Katriel:
Multiconsistency and Robustness with Global Constraints.
Constraints 11(4): 335-352 (2006) |
| 2005 |
|---|
| 14 | EE | Russell Bent,
Irit Katriel,
Pascal Van Hentenryck:
Sub-optimality Approximations.
CP 2005: 122-136 |
| 13 | EE | Irit Katriel,
Pascal Van Hentenryck:
Maintaining Longest Paths in Cyclic Graphs.
CP 2005: 358-372 |
| 12 | EE | Khaled M. Elbassioni,
Irit Katriel:
Multiconsistency and Robustness with Global Constraints.
CPAIOR 2005: 168-182 |
| 11 | EE | Khaled M. Elbassioni,
Irit Katriel,
Martin Kutz,
Meena Mahajan:
Simultaneous Matchings.
ISAAC 2005: 106-115 |
| 10 | EE | Irit Katriel,
Hans L. Bodlaender:
Online topological ordering.
SODA 2005: 443-450 |
| 9 | EE | Irit Katriel,
Laurent Michel,
Pascal Van Hentenryck:
Maintaining Longest Paths Incrementally.
Constraints 10(2): 159-183 (2005) |
| 8 | EE | Irit Katriel,
Sven Thiel:
Complete Bound Consistency for the Global Cardinality Constraint.
Constraints 10(3): 191-217 (2005) |
| 2004 |
|---|
| 7 | EE | Irit Katriel:
Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights.
CPAIOR 2004: 190-199 |
| 6 | EE | Nicolas Beldiceanu,
Irit Katriel,
Sven Thiel:
Filtering Algorithms for the Same Constraint.
CPAIOR 2004: 65-79 |
| 5 | EE | Nicolas Beldiceanu,
Irit Katriel,
Sven Thiel:
GCC-Like Restrictions on the Same Constraint.
CSCLP 2004: 1-11 |
| 4 | EE | Irit Katriel:
On the algebraic complexity of set equality and inclusion.
Inf. Process. Lett. 92(4): 175-178 (2004) |
| 2003 |
|---|
| 3 | EE | Irit Katriel,
Sven Thiel:
Fast Bound Consistency for the Global Cardinality Constraint.
CP 2003: 437-451 |
| 2 | EE | Irit Katriel,
Peter Sanders,
Jesper Larsson Träff:
A Practical Minimum Spanning Tree Algorithm Using the Cycle Property.
ESA 2003: 679-690 |
| 2002 |
|---|
| 1 | EE | Irit Katriel,
Ulrich Meyer:
Elementary Graph Algorithms in External Memory.
Algorithms for Memory Hierarchies 2002: 62-84 |
