Philippe Galinier

Available identifiers

zbMath Open galinier.philippeMaRDI QIDQ336497

List of research outcomes

Publication	Date of Publication	Type
Chordal graphs and their clique graphs	2024-02-28	Paper
Restricted swap-based neighborhood search for the minimum connected dominating set problem	2018-06-13	Paper
A reliable model for global planning of mobile networks	2016-11-10	Paper
Using local similarity measures to efficiently address approximate graph matching	2015-09-22	Paper
Automated generation of conjectures on forbidden subgraph characterization	2014-09-12	Paper
On the use of similarity metrics for approximate graph matching	2012-05-13	Paper
A tabu search algorithm for the covering design problem	2012-05-08	Paper
Improving constrained pattern mining with first-fail-based heuristics	2012-04-11	Paper
An efficient memetic algorithm for the graph partitioning problem	2012-03-09	Paper
Using local search to speed up filtering algorithms for some NP-hard constraints	2011-06-22	Paper
Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems	2009-11-16	Paper
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints	2008-05-27	Paper
Efficient algorithms for finding critical subgraphs	2008-01-21	Paper
An adaptive memory algorithm for the \(k\)-coloring problem	2008-01-21	Paper
Solution techniques for the large set covering problem	2007-03-02	Paper
A survey of local search methods for graph coloring	2006-05-16	Paper
A tabu search algorithm for difference triangle sets and Golomb rulers	2005-11-01	Paper
Tabu search for frequency assignment in mobile radio networks	2005-10-13	Paper
Solving the frequency assignment problem with polarization by local search and tabu	2005-08-25	Paper
A general approach for constraint solving by local search	2004-08-20	Paper
Hybrid evolutionary algorithms for graph coloring	2001-04-18	Paper
https://portal.mardi4nfdi.de/entity/Q4495202	2000-08-10	Paper

Research outcomes over time

This page was built for person: Philippe Galinier