Irit Katriel

Publication Activity (10 Years)

Years Active: 2002-2011
Publications (10 Years): 0

Saarland University, Saarbrücken, Germany (PHD)

Education History

Saarland University, Saarbrücken, Germany

PHD

Publications

Martin Kutz, Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel
Faster algorithms for computing longest common increasing subsequences. J. Discrete Algorithms 9 (4) (2011)
Nicolas Beldiceanu, Irit Katriel, Xavier Lorca
Undirected forest constraints. Ann. Oper. Res. 171 (1) (2009)
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) (2008)
Irit Katriel
Matchings in Node-Weighted Convex Bipartite Graphs. INFORMS J. Comput. 20 (2) (2008)
Martin Kutz, Khaled M. Elbassioni, Irit Katriel, Meena Mahajan
Simultaneous matchings: Hardness and approximation. J. Comput. Syst. Sci. 74 (5) (2008)
Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal
Commitment under uncertainty: Two-stage stochastic matching problems. Theor. Comput. Sci. 408 (2-3) (2008)
Gerth Stølting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel
Dynamic Matchings in Convex Bipartite Graphs. MFCS (2007)
Alon Itai, Irit Katriel
Canonical density control. Inf. Process. Lett. 104 (6) (2007)
Grégoire Dooms, Irit Katriel
The "Not-Too-Heavy Spanning Tree" Constraint. CPAIOR (2007)
Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems. ICALP (2007)
Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal Van Hentenryck
Propagating Knapsack Constraints in Sublinear Time. AAAI (2007)
Irit Katriel, Hans L. Bodlaender
Online topological ordering. ACM Trans. Algorithms 2 (3) (2006)
Grégoire Dooms, Irit Katriel
Constraint. CP (2006)
Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz
Faster Algorithms for Computing Longest Common Increasing Subsequences. CPM (2006)
Nicolas Beldiceanu, Irit Katriel, Xavier Lorca
Undirected Forest Constraints. CPAIOR (2006)
Khaled M. Elbassioni, Irit Katriel
Multiconsistency and Robustness with Global Constraints. Constraints An Int. J. 11 (4) (2006)
Irit Katriel
Expected-Case Analysis for Delayed Filtering. CPAIOR (2006)
Irit Katriel, Pascal Van Hentenryck
Maintaining Longest Paths in Cyclic Graphs. CP (2005)
Irit Katriel, Sven Thiel
Complete Bound Consistency for the Global Cardinality Constraint. Constraints An Int. J. 10 (3) (2005)
Russell Bent, Irit Katriel, Pascal Van Hentenryck
Sub-optimality Approximations. CP (2005)
Irit Katriel, Hans L. Bodlaender
Online topological ordering. SODA (2005)
Irit Katriel, Laurent Michel, Pascal Van Hentenryck
Maintaining Longest Paths Incrementally. Constraints An Int. J. 10 (2) (2005)
Khaled M. Elbassioni, Irit Katriel
Multiconsistency and Robustness with Global Constraints. CPAIOR (2005)
Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan
Simultaneous Matchings. ISAAC (2005)
Irit Katriel
Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights. CPAIOR (2004)
Nicolas Beldiceanu, Irit Katriel, Sven Thiel
Filtering Algorithms for the Same Constraint. CPAIOR (2004)
Nicolas Beldiceanu, Irit Katriel, Sven Thiel
Constraint. CSCLP (2004)
Irit Katriel
On the algebraic complexity of set equality and inclusion. Inf. Process. Lett. 92 (4) (2004)
Irit Katriel, Peter Sanders, Jesper Larsson Träff
A Practical Minimum Spanning Tree Algorithm Using the Cycle Property. ESA (2003)
Irit Katriel, Sven Thiel
Fast Bound Consistency for the Global Cardinality Constraint. CP (2003)
Irit Katriel, Ulrich Meyer
Elementary Graph Algorithms in External Memory. Algorithms for Memory Hierarchies (2002)

Irit Katriel.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Irit Katriel