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