Irit Katriel

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