The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Arie M. C. A. Koster: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hans L. Bodlaender, Arie M. C. A. Koster
    Safe Seperators for Treewidth. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:70-78 [Conf]
  2. Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
    On Exact Algorithms for Treewidth. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:672-683 [Conf]
  3. Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster
    Treewidth Lower Bounds with Brambles. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:391-402 [Conf]
  4. Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle
    Contraction and Treewidth Lower Bounds. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:628-639 [Conf]
  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. [Citation Graph (0, 0)][DBLP]
    UAI, 2001, pp:32-39 [Conf]
  6. Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender
    Degree-Based Treewidth Lower Bounds. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:101-112 [Conf]
  7. Hans L. Bodlaender, Arie M. C. A. Koster
    On the Maximum Cardinality Search Lower Bound for Treewidth. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:81-92 [Conf]
  8. Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen
    Optimal Solutions for Frequency Assignment Problems via Tree Decomposition. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:338-349 [Conf]
  9. Karen Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano
    Models and solution techniques for frequency assignment problems. [Citation Graph (0, 0)][DBLP]
    4OR, 2003, v:1, n:4, pp:261-317 [Journal]
  10. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:133, n:1-3, pp:103-121 [Journal]
  11. Hans L. Bodlaender, Arie M. C. A. Koster
    Safe separators for treewidth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:3, pp:337-350 [Journal]
  12. Arie M. C. A. Koster, Adrian Zymolka, Monika Jager, Ralf Huelsermann
    Demand-wise Shared Protection for Meshed Optical Networks. [Citation Graph (0, 0)][DBLP]
    J. Network Syst. Manage., 2005, v:13, n:1, pp:- [Journal]
  13. Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen
    Solving partial constraint satisfaction problems with tree decomposition. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:40, n:3, pp:170-180 [Journal]
  14. Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen
    The partial constraint satisfaction problem: Facets and lifting theorems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1998, v:23, n:3-5, pp:89-97 [Journal]
  15. Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka
    Algorithms to Separate {0, 1/2}-Chvátal-Gomory Cuts. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:693-704 [Conf]
  16. Frank van den Eijkhof, Hans L. Bodlaender, Arie M. C. A. Koster
    Safe Reduction Rules for Weighted Treewidth. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:2, pp:139-158 [Journal]
  17. Hans L. Bodlaender, Arie M. C. A. Koster
    On the maximum cardinality search lower bound for treewidth. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:11, pp:1348-1372 [Journal]

  18. Treewidth Lower Bounds with Brambles. [Citation Graph (, )][DBLP]


  19. Algorithms to Separate {0, \frac12}\{0, \frac{1}{2}\} -Chvátal-Gomory Cuts. [Citation Graph (, )][DBLP]


  20. Preprocessing Rules for Triangulation of Probabilistic Networks. [Citation Graph (, )][DBLP]


  21. Combinatorial Optimization on Graphs of Bounded Treewidth. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002