Objectif A number of special graph classes (plane graphs; geometric graphs; hereditary graph classes defined by finitely many forbidden induced subgraphs) and related combinatorial-geometric structures (hypergraphs, polytopes, permutation sets, partially convex figures) will be investigated. Based on this effective methods and algorithms for diverse problems of discrete optimisation will be developed. It is supposed to investigate and characterize the structure and combinatorial-geometry properties of feasible solutions of some optimisation problems on permutations as well as to elaborate approximation algorithms for solving some graph and hypergraph layout problems. It is planned to elaborate new methods for solving dominating and stability problems in hereditary classes of graphs, non-crossing subgraph problems in geometric graphs, enumerating problems for planar graphs. New decomposition methods and corresponding algorithms and new methods of analysis of approximation algorithms are planned to develop. A problem of the existence of hamiltonian cycles in graphs which are defined by specific local restrictions such as forbidden induced subgraph structures, local connectivity conditions, etc. will be studied. The following main results are expected:efficient algorithms for solving the location problems under directional convex constraints; efficient approximation algorithms for some radiation treatment planning problems; approximation algorithms and lower bounds for optimal solutions of partitioning and bin packing problems; methods of relaxing polytopes of optimisation problems on permutations based on efficiently solvable cases; approximation, heuristic and exact methods for solving optimisation problems on permutations and graphs; approximation algorithms for solving some graph and hypergraph layout problems; new sufficient conditions for hamiltonicity based on forbidden induced subgraphs and local connectivity; methods of approximating graphs of various classes by eulerian graphs; sufficient conditions for the existence of non-crossing subgraphs with prescribed properties in geometric graph and efficient algorithms for constructing them; effective algorithms for solving stable set and dominating set problems for hereditary graph classes defined by finitely many forbidden induced subgraphs; exact formulas and asymptotic or tight estimates for the number of plane graphs of various classes; new methods of decomposition for discrete structures (graphs, hypergraphs, etc.) taking into account required properties of the structures. Programme(s) IC-INTAS - International Association for the promotion of cooperation with scientists from the independent states of the former Soviet Union (INTAS), 1993- Thème(s) BELARUS - BELARUS Appel à propositions Data not available Régime de financement NoE - Network of Excellence Coordinateur University of Kaiserslautern Contribution de l’UE Aucune donnée Adresse Paul-Ehrlich Strasse 14 67653 Kaiserslautern Allemagne Voir sur la carte Liens Site web Opens in new window Coût total Aucune donnée Participants (4) Trier par ordre alphabétique Trier par contribution de l’UE Tout développer Tout réduire Belarus State University Biélorussie Contribution de l’UE Aucune donnée Adresse F.Skoriny 4 220050 Minsk Voir sur la carte Coût total Aucune donnée National Academy of Sciences of Belarus Institute of Mathematics Biélorussie Contribution de l’UE Aucune donnée Adresse Surganova 11 220072 Minsk Voir sur la carte Coût total Aucune donnée Technical University of Vienna Autriche Contribution de l’UE Aucune donnée Adresse Favoritenstrasse 9 A-1040 Vienna Voir sur la carte Coût total Aucune donnée University of Graz Autriche Contribution de l’UE Aucune donnée Adresse Universitaetsstrasse 15 A-8010 Graz Voir sur la carte Coût total Aucune donnée
