The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ambros Marzetta: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ambros Marzetta, Adrian Brüngger
    A Dynamic-Programming Bound for the Quadratic Assignment Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:339-348 [Conf]
  2. David Bremner, Komei Fukuda, Ambros Marzetta
    Primal-Dual Methods for Vertex and Facet Enumeration (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:49-56 [Conf]
  3. Adrian Brüngger, Ambros Marzetta, Jens Clausen, Michael Perregaard
    Joining Forces in Solving Large-Scale Quadratic Assignment Problems in Parallel. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:418-0 [Conf]
  4. Ambros Marzetta, Jürg Nievergelt
    Enumerating the k best plane spanning trees. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:18, n:1, pp:55-64 [Journal]
  5. David Bremner, Komei Fukuda, Ambros Marzetta
    Primal - Dual Methods for Vertex and Facet Enumeration. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:3, pp:333-357 [Journal]
  6. Jürg Nievergelt, Narsingh Deo, Ambros Marzetta
    Memory-Efficient Enumeration of Constrained Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:72, n:1-2, pp:47-53 [Journal]
  7. Adrian Brüngger, Ambros Marzetta, Jens Clausen, Michael Perregaard
    Solving Large-Scale QAP Problems in Parallel with the Search Library ZRAM. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:50, n:1/2, pp:157-169 [Journal]

Search in 0.002secs, Finished in 0.002secs
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