Philippe Galinier

According to our database1, Philippe Galinier authored at least 47 papers between 1995 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Restricted swap-based neighborhood search for the minimum connected dominating set problem.
Networks, 2017

A penalty-based Tabu search for constrained covering arrays.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

2016
A Hybrid Iterated Local Search Algorithm for the Global Planning Problem of Survivable 4G Wireless Networks.
IEEE/ACM Trans. Netw., 2016

2015
On the Complexity of Searching the Linear Ordering Problem Neighborhoods.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2015

2014
An iterated-tabu-search heuristic for a variant of the partial set covering problem.
J. Heuristics, 2014

Using local similarity measures to efficiently address approximate graph matching.
Discret. Appl. Math., 2014

Automated generation of conjectures on forbidden subgraph characterization.
Discret. Appl. Math., 2014

2013
Recent Advances in Graph Vertex Coloring.
Proceedings of the Handbook of Optimization - From Classical to Modern Approach, 2013

MADMatch: Many-to-Many Approximate Diagram Matching for Design Comparison.
IEEE Trans. Software Eng., 2013

Studying software evolution of large object-oriented software systems using an ETGM algorithm.
J. Softw. Evol. Process., 2013

Applying local search to the feedback vertex set problem.
J. Heuristics, 2013

A reliable model for global planning of mobile networks.
Comput. Oper. Res., 2013

Fast and Accurate Registration of Visible and Infrared Videos.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2013

2012
TRIS: A Fast and Accurate Identifiers Splitting and Expansion Algorithm.
Proceedings of the 19th Working Conference on Reverse Engineering, 2012

2011
A tabu search algorithm for the covering design problem.
J. Heuristics, 2011

Design evolution metrics for defect prediction in object oriented systems.
Empir. Softw. Eng., 2011

Improving constrained pattern mining with first-fail-based heuristics.
Data Min. Knowl. Discov., 2011

Using local search to speed up filtering algorithms for some NP-hard constraints.
Ann. Oper. Res., 2011

An efficient memetic algorithm for the graph partitioning problem.
Ann. Oper. Res., 2011

A Fast Algorithm to Locate Concepts in Execution Traces.
Proceedings of the Search Based Software Engineering - Third International Symposium, 2011

Sub-graph Mining: Identifying Micro-architectures in Evolving Object-Oriented Software.
Proceedings of the 15th European Conference on Software Maintenance and Reengineering, 2011

2010
On the use of similarity metrics for approximate graph matching.
Electron. Notes Discret. Math., 2010

On Identifying Infeasible Subsets in Constraint Satisfaction Problems.
Proceedings of the 2010 International Conference on Artificial Intelligence, 2010

Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2010

2009
Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems.
J. Comb. Optim., 2009

Recovering the Evolution Stable Part Using an ECGM Algorithm: Is There a Tunnel in Mozilla?
Proceedings of the 13th European Conference on Software Maintenance and Reengineering, 2009

2008
A tabu search heuristic for the routing and wavelength assignment problem in multigranular optical networks.
Photonic Netw. Commun., 2008

An adaptive memory algorithm for the k-coloring problem.
Discret. Appl. Math., 2008

Efficient algorithms for finding critical subgraphs.
Discret. Appl. Math., 2008

Detecting buffer overflow via automatic test input data generation.
Comput. Oper. Res., 2008

On the Planning Problem of Wireless Local Area Networks with Directional Antennas.
Proceedings of the IEEE International Conference on Wireless and Mobile Computing, 2008

Error Correcting Graph Matching Application to Software Evolution.
Proceedings of the WCRE 2008, 2008

Not all classes are created equal: toward a recommendation system for focusing testing.
Proceedings of the 2008 International Workshop on Recommendation Systems for Software Engineering, 2008

2007
Solution techniques for the Large Set Covering Problem.
Discret. Appl. Math., 2007

Improving Frequent Subgraph Mining in the Presence of Symmetry.
Proceedings of the Mining and Learning with Graphs, 2007

2006
A Tabu Search algorithm for difference triangle sets and Golomb rulers.
Comput. Oper. Res., 2006

A survey of local search methods for graph coloring.
Comput. Oper. Res., 2006

2005
A tabu search heuristic for the routing and wavelength assignment problem in optical networks.
IEEE Commun. Lett., 2005

Une heuristique taboue pour le routage et l'affectation de longueurs d'onde avec scénarios de panne.
Ann. des Télécommunications, 2005

Solving the frequency assignment problem with polarization by local search and tabu.
4OR, 2005

Improving network applications security: a new heuristic to generate stress testing data.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005

2004
A General Approach for Constraint Solving by Local Search.
J. Math. Model. Algorithms, 2004

2003
HIBISCUS: A Constraint Programming Application to Staff Scheduling in Health Care.
Proceedings of the Principles and Practice of Constraint Programming, 2003

1999
Hybrid Evolutionary Algorithms for Graph Coloring.
J. Comb. Optim., 1999

1998
Tabu Search for Frequency Assignment in Mobile Radio Networks.
J. Heuristics, 1998

1997
Tabu Search for Maximal Constraint Satisfaction Problems.
Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997

1995
Chordal Graphs and Their Clique Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995


  Loading...