The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Pierre Hansen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pierre Hansen, Brigitte Jaumard, Guy-Blaise Douanya Nguetsé, Marcus Poggi de Aragão
    Models and Algorithms for Probabilistic and Bayesian Logic. [Citation Graph (1, 0)][DBLP]
    IJCAI, 1995, pp:1862-1868 [Conf]
  2. Guy-Blaise Douanya Nguetsé, Pierre Hansen, Brigitte Jaumard
    Probabilistic Satisfiability and Decomposition. [Citation Graph (0, 0)][DBLP]
    ECSQARU, 1995, pp:151-161 [Conf]
  3. Gilles Caporossi, Pierre Hansen
    Finding Relations in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1999, pp:780-785 [Conf]
  4. Pierre Hansen, Brigitte Jaumard, A. D. Parreira
    On the Relations between Probabilistic Logic and p-CMS. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1999, pp:56-63 [Conf]
  5. Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão
    Mixed-Integer Column Generation Algorithms and the Probabilistic Maximum Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:165-180 [Conf]
  6. Brigitte Jaumard, Pierre Hansen, Marcus Poggi de Aragão
    Column Generation Methods for Probabilistic Logic. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:313-331 [Conf]
  7. Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão, Fabien Chauny, Sylvain Perron
    Probabilistic Satisfiability with Imprecise Probabilities. [Citation Graph (0, 0)][DBLP]
    ISIPTA, 1999, pp:165-174 [Conf]
  8. Dominique de Werra, Pierre Hansen
    Variations on the Roy-Gallai theorem. [Citation Graph (0, 0)][DBLP]
    4OR, 2005, v:3, n:3, pp:243-251 [Journal]
  9. Roberto Aringhieri, Pierre Hansen, Federico Malucelli
    Chemical trees enumeration algorithms. [Citation Graph (0, 0)][DBLP]
    4OR, 2003, v:1, n:1, pp:67-83 [Journal]
  10. Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez
    Búsqueda de Entorno Variable. [Citation Graph (0, 0)][DBLP]
    Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial, 2003, v:19, n:, pp:77-92 [Journal]
  11. Pierre Hansen, Marcus Poggi de Aragão, Celso C. Ribeiro
    Boolean Query Optimization and the 0-1 Hyperbolic Sum Problem. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1990, v:1, n:, pp:97-109 [Journal]
  12. Gilles Caporossi, Ivan Gutman, Pierre Hansen
    Variable Neighborhood Search for Extremal Graphs: IV: Chemical Trees with Extremal Connectivity Index. [Citation Graph (0, 0)][DBLP]
    Computers & Chemistry, 1999, v:23, n:5, pp:469-477 [Journal]
  13. Gilles Caporossi, Ivan Gutman, Pierre Hansen, Ljiljana Pavlovic
    Graphs with maximum connectivity index. [Citation Graph (0, 0)][DBLP]
    Computational Biology and Chemistry, 2003, v:27, n:1, pp:85-90 [Journal]
  14. Pierre Hansen, Maolin Zheng
    Assigning a Kekulé Structure to a Conjugated Molecule. [Citation Graph (0, 0)][DBLP]
    Computers & Chemistry, 1995, v:19, n:1, pp:21-25 [Journal]
  15. Nenad Mladenovic, Pierre Hansen
    Variable neighborhood search. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1997, v:24, n:11, pp:1097-1100 [Journal]
  16. Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
    Variable neighborhood search and local branching. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:10, pp:3034-3045 [Journal]
  17. Paolo Dell'Olmo, Pierre Hansen, Stefano Pallottino, Giovanni Storchi
    On uniform k-partition problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:150, n:1-3, pp:121-139 [Journal]
  18. Xiaofeng Guo, Pierre Hansen, Maolin Zheng
    Boundary uniqueness of fusenes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:118, n:3, pp:209-222 [Journal]
  19. Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão
    Boole's Conditions of Possible Experience and Reasoning under Uncertainty. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:181-193 [Journal]
  20. Pierre Hansen, Brigitte Jaumard, Christophe Meyer
    On Lower Bounds for Numbered Complete Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:205-225 [Journal]
  21. Pierre Hansen, Brigitte Jaumard, Guy-Blaise Douanya Nguetsé
    Best Second Order Bounds for Two-terminal Network Reliability with Dependent Edge Failures. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:96, n:, pp:375-393 [Journal]
  22. Pierre Hansen, Nenad Mladenovic
    First vs. best improvement: An empirical study. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:5, pp:802-817 [Journal]
  23. Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
    Variable neighborhood search for the maximum clique. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:145, n:1, pp:117-125 [Journal]
  24. Pierre Hansen, Giovanni Storchi, Tsevi Vovor
    Paths with Minimum Range and Ratio of Arc Lengths. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:89-102 [Journal]
  25. Pierre Hansen, Maolin Zheng
    Shortest Shortest Path Trees of a Network. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:275-284 [Journal]
  26. Gilles Caporossi, Pierre Hansen
    Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:29-44 [Journal]
  27. Gilles Caporossi, Pierre Hansen
    Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:81-94 [Journal]
  28. Pierre Hansen, Brigitte Jaumard, Bruno Simeone
    Polynomial algorithms for nested univariate clustering. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:245, n:1-3, pp:93-105 [Journal]
  29. Mustapha Aouchiche, Pierre Hansen
    On a conjecture about the Randic index. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:2, pp:262-265 [Journal]
  30. Michael U. Gerber, Pierre Hansen, Alain Hertz
    Extension of Turán's Theorem to the 2-Stability Number. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:3, pp:479-489 [Journal]
  31. Pierre Hansen, Nenad Mladenovic, Dionisio Perez-Britos
    Variable Neighborhood Decomposition Search. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2001, v:7, n:4, pp:335-350 [Journal]
  32. Teodor Gabriel Crainic, Michel Gendreau, Pierre Hansen, Nenad Mladenovic
    Cooperative Parallel Variable Neighborhood Search for the p-Median. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2004, v:10, n:3, pp:293-314 [Journal]
  33. Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão, Fabien Chauny, Sylvain Perron
    Probabilistic satisfiability with imprecise probabilities. [Citation Graph (0, 0)][DBLP]
    Int. J. Approx. Reasoning, 2000, v:24, n:2-3, pp:171-189 [Journal]
  34. Pierre Hansen
    A Cascade Algorithm for the Logical Closure of a Set of Binary Relations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1976, v:5, n:2, pp:50-54 [Journal]
  35. Pierre Hansen
    Erratum: A Cascade Algorithm for the Logical Closure of a Set of Binary Relations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1976, v:5, n:4, pp:124- [Journal]
  36. Dominique de Werra, Pierre Hansen
    Using stable sets to bound the chromatic number. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:3, pp:127-131 [Journal]
  37. Gunnar Brinkmann, Gilles Caporossi, Pierre Hansen
    A constructive enumeration of fusenes and benzenoids. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:45, n:2, pp:155-166 [Journal]
  38. Roberto Aringhieri, Pierre Hansen, Federico Malucelli
    A Linear Algorithm for the Hyper-Wiener Index of Chemical Trees. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 2001, v:41, n:4, pp:958-963 [Journal]
  39. Gunnar Brinkmann, Gilles Caporossi, Pierre Hansen
    A Survey and New Results on Computer Enumeration of Polyhex and Fusene Hydrocarbons. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 2003, v:43, n:3, pp:842-851 [Journal]
  40. Gilles Caporossi, Drago Cvetkovi, Ivan Gutman, Pierre Hansen
    Variable Neighborhood Search for Extremal Graphs. 2. Finding Graphs with Extremal Energy. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1999, v:39, n:6, pp:984-996 [Journal]
  41. Gilles Caporossi, Pierre Hansen
    Enumeration of Polyhex Hydrocarbons to h = 21. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1998, v:38, n:4, pp:610-619 [Journal]
  42. Ivan Gutman, Pierre Hansen, Hadrien Mélot
    Variable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Modeling, 2005, v:45, n:2, pp:222-230 [Journal]
  43. Pierre Hansen, Brigitte Jaumard, Catherine Lebatteux, Maolin Zheng
    Coding Chemical Trees with the Centered N-tuple Code. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1994, v:34, n:4, pp:782-790 [Journal]
  44. Pierre Hansen, Brigitte Jaumard, Horst Sachs, Maolin Zheng
    Finding a Kekule Structure in a Benzenoid System in Linear Time. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1995, v:35, n:3, pp:561-567 [Journal]
  45. Pierre Hansen, Hadrien Mélot
    Variable Neighborhood Search for Extremal Graphs, 6. Analyzing Bounds for the Connectivity Index. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 2003, v:43, n:1, pp:1-14 [Journal]
  46. Pierre Hansen, Maolin Zheng
    Bonds Fixed by Fixing Bonds. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1994, v:34, n:2, pp:297-304 [Journal]
  47. Pierre Hansen, Maolin Zheng
    Numerical Bounds for the Perfect Matching Vectors of a Polyhex. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1994, v:34, n:2, pp:305-308 [Journal]
  48. Charles Audet, Pierre Hansen, Frédéric Messine, Sylvain Perron
    The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2004, v:108, n:1, pp:63-75 [Journal]
  49. Charles Audet, Pierre Hansen, Frédéric Messine, Junjie Xiong
    The Largest Small Octagon. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2002, v:98, n:1, pp:46-59 [Journal]
  50. Charles Audet, Pierre Hansen, Frédéric Messine
    The small octagon with longest perimeter. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2007, v:114, n:1, pp:135-150 [Journal]
  51. Pierre Hansen, Marcus Poggi de Aragão, Celso C. Ribeiro
    Hyperbolic 0-1 programming and query optimization in information retrieval. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:255-263 [Journal]
  52. Pierre Hansen, Brigitte Jaumard
    Cluster analysis and mathematical programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:191-215 [Journal]
  53. Pierre Hansen, Brigitte Jaumard, Shi-Hui Lu
    An analytical approach to global optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:227-254 [Journal]
  54. Pierre Hansen, Brigitte Jaumard, Shi-Hui Lu
    Global optimization of univariate Lipschitz functions: I. Survey and properties. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:55, n:, pp:251-272 [Journal]
  55. Pierre Hansen, Brigitte Jaumard, Shi-Hui Lu
    Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:55, n:, pp:273-292 [Journal]
  56. Nenad Mladenovic, Martine Labbé, Pierre Hansen
    Solving the p-Center problem with Tabu Search and Variable Neighborhood Search. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:42, n:1, pp:48-64 [Journal]
  57. Pierre Hansen, Nenad Mladenovic, Éric D. Taillard
    Heuristic solution of the multisource Weber problem as a p-median problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1998, v:22, n:2-3, pp:55-62 [Journal]
  58. Nabil Belacel, Pierre Hansen, Nenad Mladenovic
    Fuzzy J-Means: a new heuristic for fuzzy clustering. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2002, v:35, n:10, pp:2193-2200 [Journal]
  59. Pierre Hansen, Nenad Mladenovic
    J-MEANS: a new local search heuristic for minimum sum of squares clustering. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2001, v:34, n:2, pp:405-413 [Journal]
  60. Pierre Hansen, Keh-Wei Lih
    Improved Algorithms for Partitioning Problems in Parallel, Pipelined, and Distributed Computing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1992, v:41, n:6, pp:769-771 [Journal]
  61. Nenad Mladenovic, Jack Brimberg, Pierre Hansen
    A note on duality gap in the simple plant location problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:174, n:1, pp:11-22 [Journal]
  62. Nenad Mladenovic, Jack Brimberg, Pierre Hansen, José A. Moreno-Pérez
    The p. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:179, n:3, pp:927-939 [Journal]
  63. Stefano Benati, Pierre Hansen
    The maximum capture problem with random utilities: Problem formulation and algorithms. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2002, v:143, n:3, pp:518-530 [Journal]
  64. Olivier du Merle, Daniel Villeneuve, Jacques Desrosiers, Pierre Hansen
    Stabilized column generation. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:229-237 [Journal]
  65. Pierre Hansen, Fuji Zhang, Maolin Zheng
    Perfect matchings and ears in elementary bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:176, n:1-3, pp:131-138 [Journal]
  66. Pierre Hansen, Alain Hertz, Nicolas Quinodoz
    Splitting trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:403-419 [Journal]
  67. Pierre Hansen, Julio Kuplinsky
    The smallest hard-to-color graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:96, n:3, pp:199-212 [Journal]
  68. Pierre Hansen, Alain Hertz, Julio Kuplinsky
    Bounded vertex colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:305-312 [Journal]
  69. Pierre Hansen, Maolin Zheng
    A linear algorithm for perfect matching in hexagonal systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:179-196 [Journal]

  70. Improving Frequent Subgraph Mining in the Presence of Symmetry. [Citation Graph (, )][DBLP]


  71. Bounds on the index of the Signless Laplacian of a graph involving the average degree of neighbors of a vertex. [Citation Graph (, )][DBLP]


  72. Variable neighbourhood search: methods and applications. [Citation Graph (, )][DBLP]


  73. A restarted and modified simplex search for unconstrained optimization. [Citation Graph (, )][DBLP]


  74. On bags and bugs. [Citation Graph (, )][DBLP]


  75. Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number. [Citation Graph (, )][DBLP]


  76. Acknowledgement. [Citation Graph (, )][DBLP]


  77. The continuous center set of a network. [Citation Graph (, )][DBLP]


  78. Preface. [Citation Graph (, )][DBLP]


  79. On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization. [Citation Graph (, )][DBLP]


  80. The basic algorithm for pseudo-Boolean programming revisited. [Citation Graph (, )][DBLP]


  81. Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem. [Citation Graph (, )][DBLP]


  82. Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance. [Citation Graph (, )][DBLP]


  83. Bounds on the index of the signless Laplacian of a graph. [Citation Graph (, )][DBLP]


  84. Solving large p-median clustering problems by primal-dual variable neighborhood search. [Citation Graph (, )][DBLP]


  85. Simple Polygons of Maximum Perimeter Contained in a Unit Disk. [Citation Graph (, )][DBLP]


  86. Isoperimetric Polygons of Maximum Width. [Citation Graph (, )][DBLP]


  87. Variable neighborhood search for extremal graphs. 23. On the Randic index and the chromatic number. [Citation Graph (, )][DBLP]


  88. On a conjecture about the Szeged index. [Citation Graph (, )][DBLP]


Search in 0.026secs, Finished in 0.030secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002