Arie M. C. A. Koster

	2012
47		Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos: A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. Theory Comput. Syst. 50(3): 420-432 (2012)
	2011
46		Arie M. C. A. Koster, Manuel Kutschka: An integrated model for survivable network design under demand uncertainty. DRCN 2011: 54-61
45		Arie M. C. A. Koster, Manuel Kutschka, Christian Raack: On the Robustness of Optimal Network Designs. ICC 2011: 1-5
44		Nayyar Almas Kazmi, Arie M. C. A. Koster: An integer linear programming model for optimal self protection multi-path selection. ICUMT 2011: 1-7
43		Arie M. C. A. Koster, Manuel Kutschka, Christian Raack: Cutset Inequalities for Robust Network Design. INOC 2011: 118-123
42		Grit Claßen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno: A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks. INOC 2011: 37-42
41		Arie M. C. A. Koster, Stephan Lemkens: Designing AC Power Grids Using Integer Linear Programming. INOC 2011: 478-483
40		Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka: Recoverable Robust Knapsacks: Γ-Scenarios. INOC 2011: 583-588
39		Grit Classen, Arie M. C. A. Koster, Anke Schmeink: Robust planning of green wireless networks. NetGCoop 2011: 1-5
38		Alexander Hein, Arie M. C. A. Koster: An Experimental Evaluation of Treewidth at Most Four Reductions. SEA 2011: 218-229
37		Grit Classen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno: Bandwidth assignment for reliable fixed broadband wireless networks. WOWMOM 2011: 1-6
36		Hans L. Bodlaender, Arie M. C. A. Koster: Treewidth computations II. Lower bounds. Inf. Comput. 209(7): 1103-1119 (2011)
35		Christian Raack, Arie M. C. A. Koster, Sebastian Orlowski, Roland Wessäly: On cut-based inequalities for capacitated network design polyhedra. Networks 57(2): 141-156 (2011)
34		Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka: Recoverable robust knapsacks: the discrete scenario case. Optimization Letters 5(3): 379-392 (2011)
	2010
33		Arie M. C. A. Koster, Manuel Kutschka, Christian Raack: Towards robust network design using integer linear programming techniques. NGI 2010: 1-8
32		Hans L. Bodlaender, Arie M. C. A. Koster: Treewidth computations I. Upper bounds. Inf. Comput. 208(3): 259-275 (2010)
	2009
31		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)
30		Arie M. C. A. Koster, Vadim V. Lozin: DIMAP Workshop on Algorithmic Graph Theory. Electronic Notes in Discrete Mathematics 32: 1 (2009)
	2008
29		Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster: Treewidth Lower Bounds with Brambles. Algorithmica 51(1): 81-98 (2008)
28		Hans L. Bodlaender, Arie M. C. A. Koster: Combinatorial Optimization on Graphs of Bounded Treewidth. Comput. J. 51(3): 255-269 (2008)
27		Arie M. C. A. Koster, Annegret Katrin Wagler: Comparing Imperfection Ratio and Imperfection Index for Graph Classes. RAIRO - Operations Research 42(4): 485-500 (2008)
	2007
26		Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka: Algorithms to Separate {0, 1/2}-Chvátal-Gomory Cuts. ESA 2007: 693-704
25		Frank van den Eijkhof, Hans L. Bodlaender, Arie M. C. A. Koster: Safe Reduction Rules for Weighted Treewidth. Algorithmica 47(2): 139-158 (2007)
24		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)
23		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
22		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
21		Hans L. Bodlaender, Arie M. C. A. Koster: Safe separators for treewidth. Discrete Mathematics 306(3): 337-350 (2006)
20		Arie M. C. A. Koster, Annegret Wagler: On determining the imperfection ratio. Electronic Notes in Discrete Mathematics 25: 177-181 (2006)
19		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
18		Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster: Treewidth Lower Bounds with Brambles. ESA 2005: 391-402
17		Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender: Degree-Based Treewidth Lower Bounds. WEA 2005: 101-112
16		Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof: Preprocessing Rules for Triangulation of Probabilistic Networks. Computational Intelligence 21(3): 286-305 (2005)
15		Arie M. C. A. Koster, Adrian Zymolka: On cycles and the stable multi-set polytope. Discrete Optimization 2(3): 241-255 (2005)
14		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): 35-55 (2005)
	2004
13		Hans L. Bodlaender, Arie M. C. A. Koster: Safe Seperators for Treewidth. ALENEX/ANALC 2004: 70-78
12		Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle: Contraction and Treewidth Lower Bounds. ESA 2004: 628-639
11		Hans L. Bodlaender, Arie M. C. A. Koster: On the Maximum Cardinality Search Lower Bound for Treewidth. WG 2004: 81-92
	2003
10		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)
9		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
8		Stan P. M. van Hoesel, Arie M. C. A. Koster, Robert L. M. J. van de Leensel, Martin W. P. Savelsbergh: Polyhedral results for the edge capacity polytope. Math. Program. 92(2): 335-358 (2002)
7		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
6		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
5		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)
	2000
4		Olaf E. Flippo, Antoon W. J. Kolen, Arie M. C. A. Koster, Robert L. M. J. van de Leensel: A dynamic programming algorithm for the local access telecommunication network expansion problem. European Journal of Operational Research 127(1): 189-202 (2000)
	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	[10] [24]
2	Hans L. Bodlaender	[5] [6] [11] [12] [13] [16] [17] [18] [19] [21] [22] [23] [25] [28] [29] [32] [36] [47]
3	Christina Büsing	[34] [40]
4	Grit Classen (Grit Claßen)	[37] [39] [42]
5	David Coudert	[37] [42]
6	Frank van den Eijkhof	[6] [16] [25]
7	Olaf E. Flippo	[4]
8	Fedor V. Fomin	[22] [47]
9	Linda C. van der Gaag	[6]
10	Alexander Grigoriev	[18] [29]
11	Alexander Hein	[38]
12	Stan P. M. van Hoesel (C. P. M. van Hoesel)	[1] [2] [3] [5] [7] [8] [9] [10] [24]
13	Ralf Huelsermann	[14]
14	Monika Jager	[14]
15	Nayyar Almas Kazmi	[44]
16	Antoon W. J. Kolen	[1] [2] [3] [4] [7]
17	Dieter Kratsch	[22] [47]
18	Manuel Kutschka	[26] [31] [33] [34] [40] [43] [45] [46]
19	Robert L. M. J. van de Leensel	[4] [8] [9]
20	Stephan Lemkens	[41]
21	Vadim V. Lozin	[30]
22	Carlo Mannino	[10] [24]
23	Napoleão Nepomuceno	[37] [42]
24	Sebastian Orlowski	[35]
25	Christian Raack	[33] [35] [43] [45]
26	Antonio Sassano	[10] [24]
27	Martin W. P. Savelsbergh	[8] [9]
28	Anke Schmeink	[39]
29	Dimitrios M. Thilikos	[22] [47]
30	Annegret Wagler (Annegret Katrin Wagler)	[20] [27]
31	Roland Wessäly	[35]
32	Thomas Wolle	[12] [17] [19]
33	Adrian Zymolka	[14] [15] [26] [31]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page