Search the dblp DataBase
Irit Katriel :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Russell Bent , Irit Katriel , Pascal Van Hentenryck Sub-optimality Approximations. [Citation Graph (0, 0)][DBLP ] CP, 2005, pp:122-136 [Conf ] Grégoire Dooms , Irit Katriel The Minimum Spanning Tree Constraint. [Citation Graph (0, 0)][DBLP ] CP, 2006, pp:152-166 [Conf ] Irit Katriel , Pascal Van Hentenryck Maintaining Longest Paths in Cyclic Graphs. [Citation Graph (0, 0)][DBLP ] CP, 2005, pp:358-372 [Conf ] Irit Katriel , Sven Thiel Fast Bound Consistency for the Global Cardinality Constraint. [Citation Graph (0, 0)][DBLP ] CP, 2003, pp:437-451 [Conf ] Nicolas Beldiceanu , Irit Katriel , Xavier Lorca Undirected Forest Constraints. [Citation Graph (0, 0)][DBLP ] CPAIOR, 2006, pp:29-43 [Conf ] Nicolas Beldiceanu , Irit Katriel , Sven Thiel Filtering Algorithms for the Same Constraint. [Citation Graph (0, 0)][DBLP ] CPAIOR, 2004, pp:65-79 [Conf ] Khaled M. Elbassioni , Irit Katriel Multiconsistency and Robustness with Global Constraints. [Citation Graph (0, 0)][DBLP ] CPAIOR, 2005, pp:168-182 [Conf ] Irit Katriel Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights. [Citation Graph (0, 0)][DBLP ] CPAIOR, 2004, pp:190-199 [Conf ] Irit Katriel Expected-Case Analysis for Delayed Filtering. [Citation Graph (0, 0)][DBLP ] CPAIOR, 2006, pp:119-125 [Conf ] Gerth Stølting Brodal , Kanela Kaligosi , Irit Katriel , Martin Kutz Faster Algorithms for Computing Longest Common Increasing Subsequences. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:330-341 [Conf ] Nicolas Beldiceanu , Irit Katriel , Sven Thiel GCC-Like Restrictions on the Same Constraint. [Citation Graph (0, 0)][DBLP ] CSCLP, 2004, pp:1-11 [Conf ] Irit Katriel , Ulrich Meyer Elementary Graph Algorithms in External Memory. [Citation Graph (0, 0)][DBLP ] Algorithms for Memory Hierarchies, 2002, pp:62-84 [Conf ] Irit Katriel , Peter Sanders , Jesper Larsson Träff A Practical Minimum Spanning Tree Algorithm Using the Cycle Property. [Citation Graph (0, 0)][DBLP ] ESA, 2003, pp:679-690 [Conf ] Khaled M. Elbassioni , Irit Katriel , Martin Kutz , Meena Mahajan Simultaneous Matchings. [Citation Graph (0, 0)][DBLP ] ISAAC, 2005, pp:106-115 [Conf ] Irit Katriel , Hans L. Bodlaender Online topological ordering. [Citation Graph (0, 0)][DBLP ] SODA, 2005, pp:443-450 [Conf ] Irit Katriel , Laurent Michel , Pascal Van Hentenryck Maintaining Longest Paths Incrementally. [Citation Graph (0, 0)][DBLP ] Constraints, 2005, v:10, n:2, pp:159-183 [Journal ] Irit Katriel , Sven Thiel Complete Bound Consistency for the Global Cardinality Constraint. [Citation Graph (0, 0)][DBLP ] Constraints, 2005, v:10, n:3, pp:191-217 [Journal ] Khaled M. Elbassioni , Irit Katriel Multiconsistency and Robustness with Global Constraints. [Citation Graph (0, 0)][DBLP ] Constraints, 2006, v:11, n:4, pp:335-352 [Journal ] Irit Katriel On the algebraic complexity of set equality and inclusion. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2004, v:92, n:4, pp:175-178 [Journal ] Irit Katriel , Hans L. Bodlaender Online topological ordering. [Citation Graph (0, 0)][DBLP ] ACM Transactions on Algorithms, 2006, v:2, n:3, pp:364-379 [Journal ] Irit Katriel , Meinolf Sellmann , Eli Upfal , Pascal Van Hentenryck Propagating Knapsack Constraints in Sublinear Time. [Citation Graph (0, 0)][DBLP ] AAAI, 2007, pp:231-236 [Conf ] Grégoire Dooms , Irit Katriel The "Not-Too-Heavy Spanning Tree" Constraint. [Citation Graph (0, 0)][DBLP ] CPAIOR, 2007, pp:59-70 [Conf ] Irit Katriel , Claire Kenyon-Mathieu , Eli Upfal Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems. [Citation Graph (0, 0)][DBLP ] ICALP, 2007, pp:171-182 [Conf ] Gerth Stølting Brodal , Loukas Georgiadis , Kristoffer Arnsfelt Hansen , Irit Katriel Dynamic Matchings in Convex Bipartite Graphs. [Citation Graph (0, 0)][DBLP ] MFCS, 2007, pp:406-417 [Conf ] Alon Itai , Irit Katriel Canonical density control. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2007, v:104, n:6, pp:200-204 [Journal ] Search in 0.018secs, Finished in 0.020secs