Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F02%3A00003338" target="_blank" >RIV/00216208:11320/02:00003338 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
Original language description
The paper provides an subexponential algorithm for the parameterized independence problem on unit disk graphs.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Foundations of Information Technology in the Era of Network and Mobile Computing
ISBN
1-4020-7181-7
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
26-37
Publisher name
Kluwer
Place of publication
Hardbound
Event location
Hardbound
Event date
Jan 1, 2002
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—