Search results for "Arie M. C. A. Koster"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	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.	2012	DBLP DOI BibTeX RDF
1	Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka	Recoverable robust knapsacks: the discrete scenario case.	Optimization Letters	2011	DBLP DOI BibTeX RDF
1	Christian Raack, Arie M. C. A. Koster, Sebastian Orlowski, Roland Wessäly	On cut-based inequalities for capacitated network design polyhedra.	Networks	2011	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Arie M. C. A. Koster	Treewidth computations II. Lower bounds.	Inf. Comput.	2011	DBLP DOI BibTeX RDF
1	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	DBLP DOI BibTeX RDF
1	Arie M. C. A. Koster, Manuel Kutschka, Christian Raack	Cutset Inequalities for Robust Network Design.	INOC	2011	DBLP DOI BibTeX RDF
1	Arie M. C. A. Koster, Stephan Lemkens	Designing AC Power Grids Using Integer Linear Programming.	INOC	2011	DBLP DOI BibTeX RDF
1	Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka	Recoverable Robust Knapsacks: Γ-Scenarios.	INOC	2011	DBLP DOI BibTeX RDF
1	Nayyar Almas Kazmi, Arie M. C. A. Koster	An integer linear programming model for optimal self protection multi-path selection.	ICUMT	2011	DBLP BibTeX RDF
1	Alexander Hein, Arie M. C. A. Koster	An Experimental Evaluation of Treewidth at Most Four Reductions.	SEA	2011	DBLP DOI BibTeX RDF
1	Arie M. C. A. Koster, Manuel Kutschka, Christian Raack	On the Robustness of Optimal Network Designs.	ICC	2011	DBLP DOI BibTeX RDF
1	Grit Classen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno	Bandwidth assignment for reliable fixed broadband wireless networks.	WOWMOM	2011	DBLP DOI BibTeX RDF
1	Arie M. C. A. Koster, Manuel Kutschka	An integrated model for survivable network design under demand uncertainty.	DRCN	2011	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Arie M. C. A. Koster	Treewidth computations I. Upper bounds.	Inf. Comput.	2010	DBLP DOI BibTeX RDF
1	Arie M. C. A. Koster, Manuel Kutschka, Christian Raack	Towards robust network design using integer linear programming techniques.	NGI	2010	DBLP DOI BibTeX RDF
1	Arie M. C. A. Koster, Vadim V. Lozin	DIMAP Workshop on Algorithmic Graph Theory.	Electronic Notes in Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka	Algorithms to Separate {0, \frac12}\{0, \frac{1}{2}\} -Chvátal-Gomory Cuts.	Algorithmica	2009	DBLP DOI BibTeX RDF	Chvátal-Gomory cuts, Separation algorithms, Integer programming
1	Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster	Treewidth Lower Bounds with Brambles.	Algorithmica	2008	DBLP DOI BibTeX RDF	Bramble, Grid minor, Approximation algorithm, Lower bound, Planar graph, Treewidth
1	Arie M. C. A. Koster, Annegret Katrin Wagler	Comparing Imperfection Ratio and Imperfection Index for Graph Classes.	RAIRO - Operations Research	2008	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Arie M. C. A. Koster	Combinatorial Optimization on Graphs of Bounded Treewidth.	Comput. J.	2008	DBLP DOI BibTeX RDF
1	Frank van den Eijkhof, Hans L. Bodlaender, Arie M. C. A. Koster	Safe Reduction Rules for Weighted Treewidth.	Algorithmica	2007	DBLP DOI BibTeX RDF
1	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	2007	DBLP DOI BibTeX RDF	Mathematical optimization models, Wireless networks, Heuristics, Channel assignment, Frequency assignment, Exact methods
1	Hans L. Bodlaender, Arie M. C. A. Koster	On the maximum cardinality search lower bound for treewidth.	Discrete Applied Mathematics	2007	DBLP DOI BibTeX RDF
1	Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka	Algorithms to Separate {0, 1/2}-Chvátal-Gomory Cuts.	ESA	2007	DBLP DOI BibTeX RDF
1	Arie M. C. A. Koster, Annegret Wagler	On determining the imperfection ratio.	Electronic Notes in Discrete Mathematics	2006	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Arie M. C. A. Koster	Safe separators for treewidth.	Discrete Mathematics	2006	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Thomas Wolle, Arie M. C. A. Koster	Contraction and Treewidth Lower Bounds.	J. Graph Algorithms Appl.	2006	DBLP BibTeX RDF
1	Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos	On Exact Algorithms for Treewidth.	ESA	2006	DBLP DOI BibTeX RDF
1	Arie M. C. A. Koster, Adrian Zymolka	On cycles and the stable multi-set polytope.	Discrete Optimization	2005	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof	Preprocessing Rules for Triangulation of Probabilistic Networks.	Computational Intelligence	2005	DBLP DOI BibTeX RDF
1	Arie M. C. A. Koster, Adrian Zymolka, Monika Jager, Ralf Huelsermann	Demand-wise Shared Protection for Meshed Optical Networks.	J. Network Syst. Manage.	2005	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster	Treewidth Lower Bounds with Brambles.	ESA	2005	DBLP DOI BibTeX RDF
1	Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender	Degree-Based Treewidth Lower Bounds.	WEA	2005	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Arie M. C. A. Koster	On the Maximum Cardinality Search Lower Bound for Treewidth.	WG	2004	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle	Contraction and Treewidth Lower Bounds.	ESA	2004	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Arie M. C. A. Koster	Safe Seperators for Treewidth.	ALENEX/ANALC	2004	DBLP BibTeX RDF
1	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	2003	DBLP DOI BibTeX RDF	models, heuristics, channel assignment, Frequency assignment, exact methods
1	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	2003	DBLP DOI BibTeX RDF
1	Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen	Solving partial constraint satisfaction problems with tree decomposition.	Networks	2002	DBLP DOI BibTeX RDF
1	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.	2002	DBLP DOI BibTeX RDF
1	Arie M. C. A. Koster, Hans L. Bodlaender, Stan P. M. van Hoesel	Treewidth: Computational Experiments.	Electronic Notes in Discrete Mathematics	2001	DBLP DOI BibTeX RDF
1	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	DBLP BibTeX RDF
1	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	2000	DBLP DOI BibTeX RDF
1	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	1999	DBLP DOI BibTeX RDF
1	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	DBLP DOI BibTeX RDF
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.	1998	DBLP DOI BibTeX RDF

Publications of "Arie M. C. A. Koster" ( http://dblp.L3S.de/Authors/Arie_M._C._A._Koster )