Sven Thiel

According to our database, Sven Thiel authored at least 13 papers between 2000 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

[Dai: Si] - A Modular Dataset Retrieval Framework with a Semantic Search for Biological Data.

Fateme Shafiei, Felicitas Löffler, Sven Thiel, Kobkaew Opasjumruskit, Denis Grabiger, Pauline Rauh, Birgitta König-Ries

Proceedings of the Joint Ontology Workshops 2021 Episode VII: The Bolzano Summer of Knowledge co-located with the 12th International Conference on Formal Ontology in Information Systems (FOIS 2021), 2021

2012

Partitioning into Colorful Components by Minimum Edge Deletions.

Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2006

Sweep synchronization as a global propagation mechanism.

Nicolas Beldiceanu, Mats Carlsson, Sven Thiel

Comput. Oper. Res., 2006

2005

Complete Bound Consistency for the Global Cardinality Constraint.

Irit Katriel, Sven Thiel

Constraints An Int. J., 2005

2004

Efficient algorithms for constraint propagation and for processing tree descriptions.

Sven Thiel

PhD thesis, 2004

Global constraints for round robin tournament scheduling.

Martin Henz, Tobias Müller, Sven Thiel

Eur. J. Oper. Res., 2004

GCC-Like Restrictions on the <i>Same</i> Constraint.

Nicolas Beldiceanu, Irit Katriel, Sven Thiel

Proceedings of the Recent Advances in Constraints, 2004

Filtering Algorithms for the Same Constraint.

Nicolas Beldiceanu, Irit Katriel, Sven Thiel

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2004

2003

An efficient graph algorithm for dominance constraints.

Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel

J. Algorithms, 2003

Fast Bound Consistency for the Global Cardinality Constraint.

Irit Katriel, Sven Thiel

Proceedings of the Principles and Practice of Constraint Programming, 2003

2001

An efficient algorithm for the configuration problem of dominance graphs.

Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Non-overlapping Constraints between Convex Polytopes.

Nicolas Beldiceanu, Qi Guo, Sven Thiel

Proceedings of the Principles and Practice of Constraint Programming, 2001

2000

Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint.

Kurt Mehlhorn, Sven Thiel

Proceedings of the Principles and Practice of Constraint Programming, 2000