Desktop-Bild

Publikationen

Publikationen 2012
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs  
Hans L. Bodlaender, F.V. Fomin, Arie M.C.A. Koster, D. Kratsch, D.M. Thilikos
Theory of Computing Systems 50 (2012), no. 3, 420--432.
On exact algorithms for treewidth  
Hans L. Bodlaender, F.V. Fomin, Arie M.C.A. Koster, D. Kratsch, D.M. Thilikos
ACM Transactions on Algorithms 9 (2012), no. 1, Art 12.
 
Publikationen 2011
Treewidth Computations II. Lower Bounds  
Hans L. Bodlaender, Arie M.C.A. Koster
Information and Computation 209 (2011), no. 7, 1103--1119.
 
Publikationen 2010
Treewidth Computations I: Upper Bounds  
Hans L. Bodlaender, Arie M.C.A. Koster
Information and Computation 208 (2010), 259-275.
Treewidth Computations II: Lower Bounds  
Hans L. Bodlaender, Arie M.C.A. Koster
Technical Report UU-CS-2010, Utrecht University (2010).
 
Publikationen 2008
Treewidth Lower Bounds with Brambles  
Hans L. Bodlaender, A. Grigoriev, Arie M.C.A. Koster
Algorithmica 51 (2008), 81--98.
Combinatorial Optimisation on Graphs of bounded Treewidth  
Hans L. Bodlaender, Arie M.C.A. Koster
The Computer Journal 51 (2008), no. 3, 255--269.
Treewidth Computations I: Upper Bounds  
Hans L. Bodlaender, Arie M.C.A. Koster
Technical Report UU-CS-2008, Utrecht University (2008).
 
Publikationen 2007
On the Maximum Cardinality Search Lower Bound for Treewidth  
Hans L. Bodlaender, Arie M.C.A. Koster
Discrete Applied Mathematics 155 (2007), 1348--1372.
Safe reduction rules for weighted treewidth  
F. van den Eijkhof, Hans L. Bodlaender, Arie M.C.A. Koster
Algorithmica 47 (2007), no. 2, 139--158.
 
Publikationen 2006
On exact algorithms for treewidth  
Hans L. Bodlaender, F.V. Fomin, Arie M.C.A. Koster, D. Kratsch, D.M. Thilikos
Proceedings 14th Annual European Symposium on Algorithms, ESA 2006, Springer (2006), 672--683.
Safe Separators for Treewidth  
Hans L. Bodlaender, Arie M.C.A. Koster
Discrete Mathematics 306 (2006), no. 3, 337--350.
Contraction and Treewidth Lower Bounds  
Hans L. Bodlaender, T. Wolle, Arie M.C.A. Koster
Journal of Graph Algorithms and Applications 10 (2006), no. 1, 5--49.
 
Publikationen 2005
Treewidth Lower Bounds with Brambles  
Hans L. Bodlaender, A. Grigoriev, Arie M.C.A. Koster
Technical Report 05--54, ZIB (2005).
Treewidth Lower Bounds with Brambles  
Hans L. Bodlaender, A. Grigoriev, Arie M.C.A. Koster
Proceedings 13th Annual European Symposium on Algorithms, ESA 2005, Springer (2005), 391--402.
Pre-processing rules for triangulation of probabilistic networks  
Hans L. Bodlaender, Arie M.C.A. Koster, F. van den Eijkhof
Computational Intelligence 21 (2005), no. 3, 286--305.
Degree-Based Treewidth Lower Bounds  
Arie M.C.A. Koster, T. Wolle, Hans L. Bodlaender
Proceedings of 4th International Workshop on Efficient and Experimental Algorithms, WEA 2005 (2005), 101--112.
 
Publikationen 2004
On the Maximum Cardinality Search Lower Bound for Treewidth  
Hans L. Bodlaender, Arie M.C.A. Koster
Technical Report 04--45, ZIB (2004).
On the Maximum Cardinality Search Lower Bound for Treewidth  
Hans L. Bodlaender, Arie M.C.A. Koster
Proceedings of International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004 (2004), 81--92.
Safe Separators for Treewidth  
Hans L. Bodlaender, Arie M.C.A. Koster
Joint Proceedings of the workshop on Algorithm Engineering and Experiments (ALENEX'04) and the workshop on Analytic Algorithmics and Combinatorics (ANALCO'04) (2004), 70--78.
Contraction and Treewidth Lower Bounds  
Hans L. Bodlaender, Arie M.C.A. Koster, T. Wolle
Technical Report 04--29, ZIB (2004).
Contraction and Treewidth Lower Bounds  
Hans L. Bodlaender, Arie M.C.A. Koster, T. Wolle
Proceedings of 12th Annual European Symposium on Algorithms, ESA 2004 (2004), 628--639.
Degree-Based Treewidth Lower Bounds  
Arie M.C.A. Koster, T. Wolle, Hans L. Bodlaender
Technical Report 04--44, ZIB (2004).
A note on Contraction Degeneracy  
T. Wolle, Arie M.C.A. Koster, Hans L. Bodlaender
Technical Report 04--43, ZIB (2004).
 
Publikationen 2003
Safe Separators for Treewidth  
Hans L. Bodlaender, Arie M.C.A. Koster
Technical Report 03--32, ZIB (2003).
Pre-processing rules for triangulation of probabilistic networks  
Hans L. Bodlaender, Arie M.C.A. Koster, F. van den Eijkhof
Technical Report UU--2003--, UU (2003).
 
Publikationen 2002
Safe reduction rules for weighted treewidth  
F. van den Eijkhof, Hans L. Bodlaender, Arie M.C.A. Koster
Technical Report 02--49, ZIB (2002).
 
Publikationen 2001
Pre-processing for Triangulation of Probabilistic Networks  
Hans L. Bodlaender, Arie M.C.A. Koster, F. van den Eijkhof, L.C. van der Gaag
Technical Report 01--39, ZIB (2001).
Pre-processing for Triangulation of Probabilistic Networks  
Hans L. Bodlaender, Arie M.C.A. Koster, F. van den Eijkhof, L.C. van der Gaag
Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann Publishers (2001), 32--39.
Treewidth: Computational Experiments  
Arie M.C.A. Koster, Hans L. Bodlaender, C.P.M. van Hoesel
Technical Report 01--38, ZIB (2001).
Treewidth: Computational Experiments  
Arie M.C.A. Koster, Hans L. Bodlaender, C.P.M. van Hoesel
Electronic Notes in Discrete Mathematics 8 (2001), 54--57.