Please note that eDoc will be permanently shut down in the first quarter of 2021!      Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Display Documents


Institute:
Collection:
Print in Citation style Print version     Display:
Sort by: Display records with Fulltext only
Entries: 1-10  
 Basket 
Simultaneous matchings: Hardness and approximation
Authors: Kutz, Martin; Elbassioni, Khaled; Katriel, Irit; Mahajan, Meena
Date of Publication (YYYY-MM-DD): 2008
Title of Journal: Journal of Computer and System Sciences
Volume: 74
Issue / Number: 5
Start Page: 884
End Page: 897
Document Type: Article
ID: 428142.0
Faster Algorithms for Computing Longest Common Increasing Subsequences
Editors: Moshe, Lewenstein; Gabriel, Valiente
Authors: Brodal, Gerth Stølting; Kaligosi, Kanela; Katriel, Irit; Kutz, Martin
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2006
Title of Proceedings: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006
Start Page: 330
End Page: 341
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 314457.0
Filtering Algorithms for the Same and UsedBy Constraints
Authors: Beldiceanu, Nicolas; Katriel, Irit; Thiel, Sven
Date of Publication (YYYY-MM-DD): 2006
Title of Journal: Archives of Control Sciences
Volume: 16
Issue / Number: 2
Start Page: 191
End Page: 220
Document Type: Article
ID: 356761.0
Constraints and Changes
Authors: Katriel, Irit
Name of University: Universität des Saarlandes
Place of University: Saarbrücken, Saarland
Document Type: PhD-Thesis
ID: 231236.0
Constraints and Changes
Authors: Katriel, Irit
Name of University: Universität des Saarlandes
Place of University: Saarbrücken, Saarland
Date of Approval (YYYY-MM-DD): 2005-02-10
Document Type: PhD-Thesis
ID: 232060.0
Complete Bound Consistency for the Global Cardinality Constraint
Authors: Katriel, Irit; Thiel, Sven
Date of Publication (YYYY-MM-DD): 2005
Title of Journal: Constraints
Volume: 10
Start Page: 191
End Page: 217
Document Type: Article
ID: 279159.0
GCC-like Restrictions on the Same constraint
Editors: Faltings, Boi; Petcu, Adrian; Fages, Francois; Rossi, Francesca
Authors: Beldiceanu, Nicolas; Katriel, Irit; Thiel, Sven
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2005
Title of Proceedings: Constraint Satisfaction and Constraint Logic Programming: ERCIM/CoLogNet International Workshop, CSCLP 2004
Start Page: 1
End Page: 11
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 279190.0
Maintaining Longest Paths Incrementally
Authors: Katriel, Irit; Michel, Laurent; Van Hentenryck, Pascal
Date of Publication (YYYY-MM-DD): 2005
Title of Journal: Constraints
Volume: 10
Start Page: 159
End Page: 183
Document Type: Article
ID: 279160.0
Multiconsistency and Robustness with Global Constraints
Editors: Barták, Roman; Milano, Michela
Authors: Elbassioni, Khaled; Katriel, Irit
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2005
Title of Proceedings: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : Second International Conference, CPAIOR 2005
Start Page: 168
End Page: 182
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 279167.0
Online Topological Ordering
Authors: Katriel, Irit; Bodlaender, Hans L.
Place of Publication: Philadelphia, USA
Publisher: SIAM
Date of Publication (YYYY-MM-DD): 2005
Title of Proceedings: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05)
Start Page: 443
End Page: 450
Document Type: Conference-Paper
ID: 279191.0
Entries: 1-10  
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.