Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Liedloff, Mathieu - Laboratoire d'Informatique Fondamentale d'Orléans, Université d'Orléans
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in
An Exact Algorithm for the Minimum Dominating Clique Problem
Exact algorithms for L(2, 1)-labeling of graphs Frederic Havet
Exact algorithms for L(2, 1)-labeling of graphs Jan Kratochvil1
Exponential time algorithms for the minimum dominating set problem on some graph classes
Branch and Recharge: Exact algorithms for generalized Fedor V. Fomin
Dominating Set on Bipartite Graphs Mathieu Liedloff
Roman domination over some graph classes Mathieu Liedloff1
Exact exponential-time algorithms for finding bicliques in a graph
An Exact Algorithm for the Minimum Dominating Clique Problem
Sort and Search: Exact algorithms for generalized domination
Efficient algorithms for Roman domination on some classes of graphs 1
On Independent Sets and Bicliques in Graphs Serge Gaspers
Iterative Compression and Exact Algorithms Fedor V. Fomin1
Exact algorithms for L(2, 1)-labeling of graphs Frederic Havet
Roman domination in some special classes of graphs
