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

Search the dblp DataBase

Title:
Author:
Alain Hertz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Patrick Brézillon, Dong-Yih Bau, Alain Hertz, A. P. Fauquembergue Maizener
    Elaboration of the SEPT Expert System as the Coupling of a Simulator and a Diagnostician. [Citation Graph (0, 0)][DBLP]
    IEA/AIE (Vol. 1), 1990, pp:54-60 [Conf]
  2. Vincent Robert, Alain Hertz
    How to Decompose Constrained Course Scheduling Problems into Easier Assignment Type Subproblems. [Citation Graph (0, 0)][DBLP]
    PATAT, 1995, pp:364-373 [Conf]
  3. Alain Hertz, David Schindl, Nicolas Zufferey
    Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints. [Citation Graph (0, 0)][DBLP]
    4OR, 2005, v:3, n:2, pp:139-161 [Journal]
  4. Alain Hertz, Dominique de Werra
    The Tabu Search Metaheuristic: How we used it. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1990, v:1, n:, pp:- [Journal]
  5. Charles Friden, Alain Hertz, Dominique de Werra
    Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1990, v:17, n:5, pp:437-445 [Journal]
  6. Philippe Galinier, Alain Hertz
    A survey of local search methods for graph coloring. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:, pp:2547-2562 [Journal]
  7. Michel Gendreau, Alain Hertz, Gilbert Laporte
    The Traveling Salesman Problem with Backhauls. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1996, v:23, n:5, pp:501-508 [Journal]
  8. Alain Hertz
    Anniversary focused issue of Computers & Operations Research on tabu search. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:, pp:2447-2448 [Journal]
  9. Jacek Blazewicz, Alain Hertz, Daniel Kobler, Dominique de Werra
    On some Properties of DNA Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:98, n:1-2, pp:1-19 [Journal]
  10. Jacques Carlier, Alain Hertz, Frédéric Maffray, Marino Widmer
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:1- [Journal]
  11. Michel Gendreau, Alain Hertz, Frédéric Semet, Marino Widmer
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:145, n:1, pp:1-2 [Journal]
  12. Michael U. Gerber, Alain Hertz, Vadim V. Lozin
    Stable sets in two subclasses of banner-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:121-136 [Journal]
  13. Michael U. Gerber, Alain Hertz, David Schindl
    P5-free augmenting graphs and the maximum stable set problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:109-119 [Journal]
  14. Alain Hertz
    Polynomially Solvable Cases for the Maximum Stable Set Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:195-210 [Journal]
  15. Alain Hertz
    On the Use of Boolean Methods for the Computation of the Stability Number. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:76, n:1-3, pp:183-203 [Journal]
  16. Alain Hertz
    On Perfect Switching Classes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:89, n:1-3, pp:263-267 [Journal]
  17. Alain Hertz
    On Perfect Switching Classes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:3-7 [Journal]
  18. Alain Hertz, Brigitte Jaumard, Marcus Poggi de Aragão
    Local Optima Topology for the k-Coloring Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:257-280 [Journal]
  19. Alain Hertz, Brigitte Jaumard, Celso C. Ribeiro
    A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:50, n:3, pp:255-265 [Journal]
  20. Alain Hertz, Yves Mottet, Yves Rochat
    on a Scheduling Problem in a Robotized Analytical System. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:285-318 [Journal]
  21. Alain Hertz, Maurice Queyranne, Marino Widmer
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:1-3 [Journal]
  22. Alain Hertz, Marino Widmer
    An Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:319-345 [Journal]
  23. Tamás Kis, Alain Hertz
    A Lower Bound for the Job Insertion Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:128, n:2-3, pp:395-419 [Journal]
  24. Philippe Galinier, Alain Hertz
    Solution techniques for the Large Set Covering Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:3, pp:312-326 [Journal]
  25. Dominique de Werra, Alain Hertz, Daniel Kobler, Nadimpalli V. R. Mahadev
    Feasible edge colorings of trees with cardinality constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:61-72 [Journal]
  26. 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]
  27. Patrice Calégari, Giovanni Coray, Alain Hertz, Daniel Kobler, Pierre Kuonen
    A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 1999, v:5, n:2, pp:145-158 [Journal]
  28. Marie-Christine Costa, Alain Hertz, Michel Mittaz
    Bounds and Heuristics for the Shortest Capacitated Paths Problem. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2002, v:8, n:4, pp:449-465 [Journal]
  29. Claudia Archetti, Alain Hertz, Maria Grazia Speranza
    Metaheuristics for the team orienteering problem. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2007, v:13, n:1, pp:49-76 [Journal]
  30. Alain Hertz, Vadim V. Lozin, David Schindl
    Finding augmenting chains in extensions of claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:6, pp:311-316 [Journal]
  31. Bernard Gendron, Alain Hertz, Patrick St-Louis
    On edge orienting methods for graph coloring. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:13, n:2, pp:163-178 [Journal]
  32. Michael U. Gerber, Alain Hertz
    A Transformation Which Preserves the Clique Number. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:320-330 [Journal]
  33. Alain Hertz
    Bipartable graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:1, pp:1-12 [Journal]
  34. Alain Hertz
    A fast algorithm for coloring Meyniel graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:231-240 [Journal]
  35. Michael U. Gerber, Alain Hertz, Vadim V. Lozin
    Augmenting chains in graphs without a skew star. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:3, pp:352-366 [Journal]
  36. Francine Herrmann, Alain Hertz
    Finding the Chromatic Number by Means of Critical Graphs. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2002, v:7, n:, pp:10- [Journal]
  37. Alain Hertz
    A New Polynomial-Time Algorithm for the Maximum Weighted (\chi(G) - 1)-Coloring Problem in Comparability Graphs. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:4, pp:357-363 [Journal]
  38. Shoshana Anily, Julien Bramel, Alain Hertz
    A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:1-2, pp:29-35 [Journal]
  39. Alain Hertz, Marino Widmer
    Guidelines for the use of meta-heuristics in combinatorial optimization. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:151, n:2, pp:247-252 [Journal]
  40. Cédric Avanthay, Alain Hertz, Nicolas Zufferey
    A variable neighborhood search for graph coloring. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:151, n:2, pp:379-388 [Journal]
  41. Alain Hertz
    Quelques utilisations de la struction. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:59, n:1-2, pp:79-89 [Journal]
  42. Alain Hertz, Dominique de Werra
    Perfectly orderable graphs are quasi-parity graphs: a short proof. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:68, n:1, pp:111-113 [Journal]
  43. Alain Hertz, Dominique de Werra
    Connected sequential colorings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:1-2, pp:51-59 [Journal]
  44. Alain Hertz, Dominique de Werra
    Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:1-2, pp:1-2 [Journal]
  45. Dominique de Werra, Alain Hertz
    On perfectness of sums of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:195, n:1-3, pp:93-101 [Journal]
  46. Pierre Hansen, Alain Hertz, Nicolas Quinodoz
    Splitting trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:403-419 [Journal]
  47. 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]

  48. Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints. [Citation Graph (, )][DBLP]


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


  50. A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding. [Citation Graph (, )][DBLP]


  51. The undirected capacitated arc routing problem with profits. [Citation Graph (, )][DBLP]


  52. An adaptive memory algorithm for the k-coloring problem. [Citation Graph (, )][DBLP]


  53. Efficient algorithms for finding critical subgraphs. [Citation Graph (, )][DBLP]


  54. Variable space search for graph coloring. [Citation Graph (, )][DBLP]


  55. Foreword. [Citation Graph (, )][DBLP]


  56. Foreword. [Citation Graph (, )][DBLP]


  57. Finding a feasible course schedule using Tabu search. [Citation Graph (, )][DBLP]


  58. Corrigendum to "Variable space search for graph coloring" [Discrete Appl. Math. 156 (2008) 2551-2560] [Citation Graph (, )][DBLP]


  59. Foreword. [Citation Graph (, )][DBLP]


  60. About equivalent interval colorings of weighted graphs. [Citation Graph (, )][DBLP]


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