The SCEAS System
Navigation Menu

Search the dblp DataBase


Thomas M. Liebling: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Laurent Balmelli, Thomas M. Liebling, Martin Vetterli
    Computational analysis of 4-8 meshes with application to surface simplification using global error. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:33-36 [Conf]
  2. Komei Fukuda, Thomas M. Liebling, Christine Lütolf
    Extended Convex Hull. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  3. J.-A. Ferrez, Thomas M. Liebling
    Parallel DEM Simulations of Granular Materials. [Citation Graph (0, 0)][DBLP]
    HPCN Europe, 2001, pp:211-220 [Conf]
  4. C. Glardon, L. Kling, N. Kohler, Thomas M. Liebling
    Building Refurbishment as One-of-a-Kind Process. [Citation Graph (0, 0)][DBLP]
    One-Of-A-Kind Production, 1991, pp:341-352 [Conf]
  5. Laurent Balmelli, Thomas M. Liebling, Martin Vetterli
    Computational analysis of mesh simplification using global error. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:3, pp:171-196 [Journal]
  6. Komei Fukuda, Thomas M. Liebling, Christine Lütolf
    Extended convex hull. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:20, n:1-2, pp:13-23 [Journal]
  7. Komei Fukuda, Thomas M. Liebling, François Margot
    Analysis of Backtrack Algorithms for Listing All Vertices and All Faces of a Convex Polyhedron. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:1-12 [Journal]
  8. Laurent Balmelli, Martin Vetterli, Thomas M. Liebling
    Mesh Optimization Using Global Error with Application to Geometry Simplification. [Citation Graph (0, 0)][DBLP]
    Graphical Models, 2002, v:64, n:3-4, pp:230-257 [Journal]
  9. Guillermo Durán, Thomas M. Liebling, Martín Matamala
    Traces of the Latin American Conference on Combinatorics, Graphs and Applications: A selection of papers from LACGA 2004, Santiago, Chile. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:13, pp:1771-1772 [Journal]
  10. Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey
    Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:157-160 [Journal]
  11. François Margot, A. Prodon, Thomas M. Liebling
    Tree polytope on 2-trees. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1994, v:63, n:, pp:183-191 [Journal]
  12. Jean-François Hêche, Thomas M. Liebling
    Finding minimum area simple pentagons. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1997, v:21, n:5, pp:229-233 [Journal]
  13. Peter L. Hammer, Bruno Simeone, Thomas M. Liebling, Dominique de Werra
    From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:2, pp:174-184 [Journal]
  14. C. Indermitte, Thomas M. Liebling, M. Troyanov, H. Clémençon
    Voronoi diagrams on piecewise flat surfaces and an application to biological growth. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:263-274 [Journal]
  15. J.-A. Ferrez, Komei Fukuda, Thomas M. Liebling
    Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:166, n:1, pp:35-50 [Journal]
  16. L. Pournin, Thomas M. Liebling
    Constrained paths in the flip-graph of regular triangulations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:2, pp:134-140 [Journal]

  17. Traces from LAGOS'07: IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.004secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002