default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIrit Katriel
Person information
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j12]Martin Kutz, Gerth Stølting Brodal
, Kanela Kaligosi, Irit Katriel:
Faster algorithms for computing longest common increasing subsequences. J. Discrete Algorithms 9(4): 314-325 (2011)
2000 – 2009
- 2009
- [j11]Nicolas Beldiceanu, Irit Katriel, Xavier Lorca:
Undirected forest constraints. Ann. Oper. Res. 171(1): 127-147 (2009) - 2008
- [j10]Irit Katriel:
Matchings in Node-Weighted Convex Bipartite Graphs. INFORMS J. Comput. 20(2): 205-211 (2008) - [j9]Martin Kutz, Khaled M. Elbassioni, Irit Katriel, Meena Mahajan:
Simultaneous matchings: Hardness and approximation. J. Comput. Syst. Sci. 74(5): 884-897 (2008) - [j8]Gerth Stølting Brodal, Loukas Georgiadis, Irit Katriel:
An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree. Oper. Res. Lett. 36(1): 14-18 (2008) - [j7]Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal:
Commitment under uncertainty: Two-stage stochastic matching problems. Theor. Comput. Sci. 408(2-3): 213-223 (2008) - 2007
- [j6]Alon Itai, Irit Katriel:
Canonical density control. Inf. Process. Lett. 104(6): 200-204 (2007) - [c19]Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal Van Hentenryck:
Propagating Knapsack Constraints in Sublinear Time. AAAI 2007: 231-236 - [c18]Grégoire Dooms, Irit Katriel:
The "Not-Too-Heavy Spanning Tree" Constraint. CPAIOR 2007: 59-70 - [c17]Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal:
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems. ICALP 2007: 171-182 - [c16]Gerth Stølting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel:
Dynamic Matchings in Convex Bipartite Graphs. MFCS 2007: 406-417 - 2006
- [j5]Khaled M. Elbassioni, Irit Katriel:
Multiconsistency and Robustness with Global Constraints. Constraints An Int. J. 11(4): 335-352 (2006) - [j4]Irit Katriel, Hans L. Bodlaender:
Online topological ordering. ACM Trans. Algorithms 2(3): 364-379 (2006) - [c15]Grégoire Dooms, Irit Katriel:
The Minimum Spanning Tree Constraint. CP 2006: 152-166 - [c14]Nicolas Beldiceanu, Irit Katriel, Xavier Lorca:
Undirected Forest Constraints. CPAIOR 2006: 29-43 - [c13]Irit Katriel:
Expected-Case Analysis for Delayed Filtering. CPAIOR 2006: 119-125 - [c12]Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz:
Faster Algorithms for Computing Longest Common Increasing Subsequences. CPM 2006: 330-341 - [r1]Willem-Jan van Hoeve, Irit Katriel:
Global Constraints. Handbook of Constraint Programming 2006: 169-208 - 2005
- [b1]Irit Katriel:
Constraints and changes. Saarland University, Saarbrücken, Germany, 2005, pp. 1-101 - [j3]Irit Katriel, Laurent Michel, Pascal Van Hentenryck:
Maintaining Longest Paths Incrementally. Constraints An Int. J. 10(2): 159-183 (2005) - [j2]Irit Katriel, Sven Thiel:
Complete Bound Consistency for the Global Cardinality Constraint. Constraints An Int. J. 10(3): 191-217 (2005) - [c11]Russell Bent, Irit Katriel, Pascal Van Hentenryck:
Sub-optimality Approximations. CP 2005: 122-136 - [c10]Irit Katriel, Pascal Van Hentenryck:
Maintaining Longest Paths in Cyclic Graphs. CP 2005: 358-372 - [c9]Khaled M. Elbassioni, Irit Katriel:
Multiconsistency and Robustness with Global Constraints. CPAIOR 2005: 168-182 - [c8]Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan:
Simultaneous Matchings. ISAAC 2005: 106-115 - [c7]Irit Katriel, Hans L. Bodlaender:
Online topological ordering. SODA 2005: 443-450 - 2004
- [j1]Irit Katriel:
On the algebraic complexity of set equality and inclusion. Inf. Process. Lett. 92(4): 175-178 (2004) - [c6]Nicolas Beldiceanu, Irit Katriel, Sven Thiel:
Filtering Algorithms for the Same Constraint. CPAIOR 2004: 65-79 - [c5]Irit Katriel:
Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights. CPAIOR 2004: 190-199 - [c4]Nicolas Beldiceanu, Irit Katriel, Sven Thiel:
GCC-Like Restrictions on the Same Constraint. CSCLP 2004: 1-11 - 2003
- [c3]Irit Katriel, Sven Thiel:
Fast Bound Consistency for the Global Cardinality Constraint. CP 2003: 437-451 - [c2]Irit Katriel, Peter Sanders, Jesper Larsson Träff:
A Practical Minimum Spanning Tree Algorithm Using the Cycle Property. ESA 2003: 679-690 - 2002
- [c1]Irit Katriel, Ulrich Meyer:
Elementary Graph Algorithms in External Memory. Algorithms for Memory Hierarchies 2002: 62-84
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
