Irit Katriel

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Online topological ordering
ACM Transactions on Algorithms
2015-09-02Paper
Online topological ordering2014-10-13Paper
Matchings in node-weighted convex bipartite graphs
INFORMS Journal on Computing
2012-07-28Paper
Faster algorithms for computing longest common increasing subsequences
Journal of Discrete Algorithms
2012-01-04Paper
Canonical density control
Information Processing Letters
2010-03-24Paper
A practical minimum spanning tree algorithm using the cycle property
Lecture Notes in Computer Science
2010-03-03Paper
Fast bound consistency for the global cardinality constraint
Lecture Notes in Computer Science
2010-03-02Paper
Undirected forest constraints
Annals of Operations Research
2010-02-01Paper
On the algebraic complexity of set equality and inclusion
Information Processing Letters
2009-08-27Paper
The “Not-Too-Heavy Spanning Tree” Constraint
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
2009-03-10Paper
Commitment under uncertainty: Two-stage stochastic matching problems
Theoretical Computer Science
2008-12-12Paper
Filtering algorithms for the \texttt{Same} and \texttt{UsedBy} constraints2008-11-21Paper
Dynamic Matchings in Convex Bipartite Graphs
Mathematical Foundations of Computer Science 2007
2008-09-17Paper
The Minimum Spanning Tree Constraint
Principles and Practice of Constraint Programming - CP 2006
2008-09-09Paper
Maintaining Longest Paths in Cyclic Graphs
Principles and Practice of Constraint Programming - CP 2005
2008-09-09Paper
Sub-optimality Approximations
Principles and Practice of Constraint Programming - CP 2005
2008-09-09Paper
Simultaneous matchings: Hardness and approximation
Journal of Computer and System Sciences
2008-06-26Paper
An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree
Operations Research Letters
2008-05-29Paper
Multiconsistency and Robustness with Global Constraints
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
2008-03-17Paper
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
Automata, Languages and Programming
2007-11-28Paper
Faster Algorithms for Computing Longest Common Increasing Subsequences
Combinatorial Pattern Matching
2007-09-14Paper
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Lecture Notes in Computer Science
2007-04-30Paper
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Lecture Notes in Computer Science
2007-04-30Paper
Multiconsistency and robustness with global constraints
Constraints
2007-01-05Paper
Algorithms and Computation
Lecture Notes in Computer Science
2006-11-14Paper
Complete bound consistency for the global cardinality constraint
Constraints
2006-02-23Paper
Maintaining longest paths incrementally
Constraints
2006-02-23Paper
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Lecture Notes in Computer Science
2005-12-27Paper
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Lecture Notes in Computer Science
2005-12-27Paper
Recent Advances in Constraints
Lecture Notes in Computer Science
2005-11-11Paper
scientific article; zbMATH DE number 1984681 (Why is no real title available?)2003-09-22Paper


Research outcomes over time


This page was built for person: Irit Katriel