MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 18 documents:

  1. Simultaneous matchings: Hardness and approximation
    Martin Kutz, Khaled Elbassioni, Irit Katriel, and Meena Mahajan
    J. Comput. Syst. Sci. 74 (5): 884-897, 2008
  2. Filtering Algorithms for the Same and UsedBy Constraints
    Nicolas Beldiceanu, Irit Katriel, and Sven Thiel
    Archives of Control Sciences to appear, 2007. Note: to appear
  3. Faster Algorithms for Computing Longest Common Increasing Subsequences
    Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, and Martin Kutz
    In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, 2006, 330-341
  4. Complete Bound Consistency for the Global Cardinality Constraint
    Irit Katriel and Sven Thiel
    Constraints 10 (3): 191-217, 2005
  5. GCC-like Restrictions on the Same constraint
    Nicolas Beldiceanu, Irit Katriel, and Sven Thiel
    In: Constraint Satisfaction and Constraint Logic Programming : ERCIM/CoLogNet International Workshop, CSCLP 2004, Lausanne, Switzerland, 2005, 1-11
  6. Maintaining Longest Paths Incrementally
    Irit Katriel, Laurent Michel, and Pascal Van Hentenryck
    Constraints 10 (2): 159-183, 2005
  7. Multiconsistency and Robustness with Global Constraints
    Khaled M. Elbassioni and Irit Katriel
    In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : Second International Conference, CPAIOR 2005, Prague, Czech Republic, 2005, 168-182
  8. Online Topological Ordering
    Irit Katriel and Hans L. Bodlaender
    In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), Vancouver, Canada, 2005, 443-450
  9. Simultaneous Matchings
    Khaled M. Elbassioni, Irit Katriel, Martin Kutz, and Meena Mahajan
    In: Algorithms and computation : 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, 2005, 106-115
  10. Constraints and Changes
    Irit Katriel
    Doctoral dissertation, Universität des Saarlandes, 2004
  11. Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights
    Irit Katriel
    In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, Nice, France, 2004, 190-199
  12. Filtering algorithms for the Same constraint
    Nicolas Beldiceanu, Irit Katriel, and Sven Thiel
    In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, Nice, France, 2004, 65-79
  13. Filtering algorithms for the Same and UsedBy constraints
    Nicolas Beldiceanu, Irit Katriel, and Sven Thiel
    Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, MPI-I-2004-1-001, Research Report
    [PS: Download: MPI-I-2004-1-001.ps]
  14. On Algorithms for Online Topological Ordering and Sorting
    Irit Katriel
    Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, MPI-I-2004-1-003, Research Report
    [PS: Download: MPI-I-2004-1-003.ps]
  15. On the Algebraic Complexity of Set Equality and Inclusion
    Irit Katriel
    Information Processing Letters 92 (4): 175-178, 2004
  16. A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
    Irit Katriel, Peter Sanders, and Jesper Larsson Träff
    In: Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, Hungary, September, 16-19, 2003, 679-690
  17. Elementary Graph Algorithms in External Memory
    Irit Katriel and Ulrich Meyer
    In: Algorithms for Memory Hierarchies, 2003, 62-84
  18. Fast Bound-Consistency for the Global Cardinality Constraint
    Irit Katriel and Sven Thiel
    In: Principles and Practice of Constraint Programming - CP 2003 : 9th International Conference, CP 2003, Kinsale, Ireland, September, 29 - October, 3, 2003, 437-451