Irit Katriel

According to our database1, Irit Katriel authored at least 28 papers between 2002 and 2011.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2011
Faster algorithms for computing longest common increasing subsequences.
J. Discrete Algorithms, 2011

2009
Undirected forest constraints.
Annals OR, 2009

2008
Commitment under uncertainty: Two-stage stochastic matching problems.
Theor. Comput. Sci., 2008

An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree.
Oper. Res. Lett., 2008

Simultaneous matchings: Hardness and approximation.
J. Comput. Syst. Sci., 2008

Matchings in Node-Weighted Convex Bipartite Graphs.
INFORMS Journal on Computing, 2008

2007
Canonical density control.
Inf. Process. Lett., 2007

Dynamic Matchings in Convex Bipartite Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

The "Not-Too-Heavy Spanning Tree" Constraint.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007

Propagating Knapsack Constraints in Sublinear Time.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Global Constraints.
Proceedings of the Handbook of Constraint Programming, 2006

Online topological ordering.
ACM Trans. Algorithms, 2006

Multiconsistency and Robustness with Global Constraints.
Constraints, 2006

Expected-Case Analysis for Delayed Filtering.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2006

The Minimum Spanning Tree Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2006

2005
Constraints and changes.
PhD thesis, 2005

Complete Bound Consistency for the Global Cardinality Constraint.
Constraints, 2005

Maintaining Longest Paths Incrementally.
Constraints, 2005

Simultaneous Matchings.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Maintaining Longest Paths in Cyclic Graphs.
Proceedings of the Principles and Practice of Constraint Programming, 2005

Sub-optimality Approximations.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
On the algebraic complexity of set equality and inclusion.
Inf. Process. Lett., 2004

GCC-Like Restrictions on the Same Constraint.
Proceedings of the Recent Advances in Constraints, 2004

Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2004

Filtering Algorithms for the Same Constraint.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2004

2003
A Practical Minimum Spanning Tree Algorithm Using the Cycle Property.
Proceedings of the Algorithms, 2003

Fast Bound Consistency for the Global Cardinality Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2003

2002
Elementary Graph Algorithms in External Memory.
Proceedings of the Algorithms for Memory Hierarchies, 2002


  Loading...