Arie M. C. A. Koster

	2009
27		Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka: Algorithms to Separate {0, \frac12}\{0, \frac{1}{2}\} -Chvátal-Gomory Cuts. Algorithmica 55(2): 375-391 (2009)
26		Arie M. C. A. Koster, Vadim V. Lozin: DIMAP Workshop on Algorithmic Graph Theory. Electronic Notes in Discrete Mathematics 32: 1 (2009)
	2008
25		Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster: Treewidth Lower Bounds with Brambles. Algorithmica 51(1): 81-98 (2008)
24		Hans L. Bodlaender, Arie M. C. A. Koster: Combinatorial Optimization on Graphs of Bounded Treewidth. Comput. J. 51(3): 255-269 (2008)
	2007
23		Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka: Algorithms to Separate {0, 1/2}-Chvátal-Gomory Cuts. ESA 2007: 693-704
22		Frank van den Eijkhof, Hans L. Bodlaender, Arie M. C. A. Koster: Safe Reduction Rules for Weighted Treewidth. Algorithmica 47(2): 139-158 (2007)
21		Karen Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano: Models and solution techniques for frequency assignment problems. Annals OR 153(1): 79-129 (2007)
20		Hans L. Bodlaender, Arie M. C. A. Koster: On the maximum cardinality search lower bound for treewidth. Discrete Applied Mathematics 155(11): 1348-1372 (2007)
	2006
19		Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos: On Exact Algorithms for Treewidth. ESA 2006: 672-683
18		Hans L. Bodlaender, Arie M. C. A. Koster: Safe separators for treewidth. Discrete Mathematics 306(3): 337-350 (2006)
17		Arie M. C. A. Koster, Annegret Wagler: On determining the imperfection ratio. Electronic Notes in Discrete Mathematics 25: 177-181 (2006)
16		Hans L. Bodlaender, Thomas Wolle, Arie M. C. A. Koster: Contraction and Treewidth Lower Bounds. J. Graph Algorithms Appl. 10(1): 5-49 (2006)
	2005
15		Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster: Treewidth Lower Bounds with Brambles. ESA 2005: 391-402
14		Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender: Degree-Based Treewidth Lower Bounds. WEA 2005: 101-112
13		Arie M. C. A. Koster, Adrian Zymolka: On cycles and the stable multi-set polytope. Discrete Optimization 2(3): 241-255 (2005)
12		Arie M. C. A. Koster, Adrian Zymolka, Monika Jager, Ralf Huelsermann: Demand-wise Shared Protection for Meshed Optical Networks. J. Network Syst. Manage. 13(1): (2005)
	2004
11		Hans L. Bodlaender, Arie M. C. A. Koster: Safe Seperators for Treewidth. ALENEX/ANALC 2004: 70-78
10		Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle: Contraction and Treewidth Lower Bounds. ESA 2004: 628-639
9		Hans L. Bodlaender, Arie M. C. A. Koster: On the Maximum Cardinality Search Lower Bound for Treewidth. WG 2004: 81-92
	2003
8		Karen Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano: Models and solution techniques for frequency assignment problems. 4OR 1(4): 261-317 (2003)
7		Stan P. M. van Hoesel, Arie M. C. A. Koster, Robert L. M. J. van de Leensel, Martin W. P. Savelsbergh: Bidirected and unidirected capacity installation in telecommunication networks. Discrete Applied Mathematics 133(1-3): 103-121 (2003)
	2002
6		Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen: Solving partial constraint satisfaction problems with tree decomposition. Networks 40(3): 170-180 (2002)
	2001
5		Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof, Linda C. van der Gaag: Pre-processing for Triangulation of Probabilistic Networks. UAI 2001: 32-39
4		Arie M. C. A. Koster, Hans L. Bodlaender, Stan P. M. van Hoesel: Treewidth: Computational Experiments. Electronic Notes in Discrete Mathematics 8: 54-57 (2001)
	1999
3		Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen: Optimal Solutions for Frequency Assignment Problems via Tree Decomposition. WG 1999: 338-349
2		Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen: Solving Frequency Assignment Problems via Tree-Decomposition1. Electronic Notes in Discrete Mathematics 3: 102-105 (1999)
	1998
1		Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen: The partial constraint satisfaction problem: Facets and lifting theorems. Oper. Res. Lett. 23(3-5): 89-97 (1998)

Coauthor Index

1	Karen Aardal	[8] [21]
2	Hans L. Bodlaender	[4] [5] [9] [10] [11] [14] [15] [16] [18] [19] [20] [22] [24] [25]
3	Frank van den Eijkhof	[5] [22]
4	Fedor V. Fomin	[19]
5	Linda C. van der Gaag	[5]
6	Alexander Grigoriev	[15] [25]
7	Stan P. M. van Hoesel (C. P. M. van Hoesel)	[1] [2] [3] [4] [6] [7] [8] [21]
8	Ralf Huelsermann	[12]
9	Monika Jager	[12]
10	Antoon W. J. Kolen	[1] [2] [3] [6]
11	Dieter Kratsch	[19]
12	Manuel Kutschka	[23] [27]
13	Robert L. M. J. van de Leensel	[7]
14	Vadim V. Lozin	[26]
15	Carlo Mannino	[8] [21]
16	Antonio Sassano	[8] [21]
17	Martin W. P. Savelsbergh	[7]
18	Dimitrios M. Thilikos	[19]
19	Annegret Wagler (Annegret Katrin Wagler)	[17]
20	Thomas Wolle	[10] [14] [16]
21	Adrian Zymolka	[12] [13] [23] [27]

Colors in the list of coauthors