Parameterized Algorithms for Geometric Intersection Graphs – Mgr. Deniz Agaoglu
Mgr. Deniz Agaoglu
Advanced ('rigorózní') thesis
Parameterized Algorithms for Geometric Intersection Graphs
Parameterized Algorithms for Geometric Intersection Graphs
Abstract:
Geometrický průnikový graf je neorientovaný graf, který představuje průniký systémů geometrických objektů, jako jsou intervaly, oblouky nebo disky. Parametrizovaná teorie složitosti je obor teorie složitosti, který slouží pro podrobnější analýzu těžkých problémů. V tomto návrhu dizertační práce uvažujeme vybrané třídy geometrických grafů a plánujeme prozkoumat parametrizovanou složitost několika problémů …moreAbstract:
A geometric intersection graph is an undirected graph which represents the intersections of a family of geometric objects such as intervals, arcs or disks. The parameterized complexity theory is a branch of complexity theory which was developed to analyse hard problems in a finer detail. In this thesis proposal, we consider selected geometric graph classes, and plan to investigate the parameterized …more
Language used: English
Date on which the thesis was submitted / produced: 25. 9. 2020
Identifier:
https://is.muni.cz/th/dqt15/
Thesis defence
- Date of defence: 29. 1. 2021
- Reader: doc. Mgr. Jan Obdržálek, PhD., Dr. hab. Tomasz Krawczyk
Full text of thesis
Contents of on-line thesis archive
Published in Theses:- světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatikyMasaryk University
Faculty of InformaticsAdvanced ('rigorózní řízení') programme / field:
Theoretical computer science / Theoretical computer science
Theses on a related topic
-
Parameterized Algorithms for Geometric Intersection Graphs
Deniz Agaoglu Cagirici -
Isomorphism problem for geometric intersection graphs
Deniz Agaoglu -
Structural and geometric graph theory and algorithmic metatheorems
Filip Pokrývka -
Parameterized Algorithms for Geometric Intersection Graphs
Deniz Agaoglu Cagirici -
Parameterized Algorithms on Width Parameters of Graphs
Robert Ganian