default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIoannis Katsikarelis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2019
[b1]Ioannis Katsikarelis:
Structurally Parameterized Tight Bounds and Approximation for Generalizations of Independence and Domination. (Limites exactes et approximation structurellement paramétré pour généralisations d'indépendance et de domination). Paris Sciences et Lettres University, France, 2019
Journal Articles
- 2023
- [j6]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis:
New Results on Directed Edge Dominating Set. Discret. Math. Theor. Comput. Sci. 25 (2023) - [j5]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Improved (In-)Approximability Bounds for d-Scattered Set. J. Graph Algorithms Appl. 27(3): 219-238 (2023) - 2022
- [j4]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structurally parameterized d-scattered set. Discret. Appl. Math. 308: 168-186 (2022) - 2020
- [j3]Tesshu Hanaka
, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora:
Parameterized Orientable Deletion. Algorithmica 82(7): 1909-1938 (2020) - [j2]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of Safe Set. J. Graph Algorithms Appl. 24(3): 215-245 (2020) - 2019
- [j1]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structural parameters, tight bounds, and approximation for (k, r)-center. Discret. Appl. Math. 264: 90-117 (2019)
Conference and Workshop Papers
- 2019
- [c6]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of Safe Set. CIAC 2019: 38-49 - [c5]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Improved (In-)Approximability Bounds for d-Scattered Set. WAOA 2019: 202-216 - 2018
- [c4]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis:
New Results on Directed Edge Dominating Set. MFCS 2018: 67:1-67:16 - [c3]Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora:
Parameterized Orientable Deletion. SWAT 2018: 24:1-24:13 - [c2]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structurally Parameterized d-Scattered Set. WG 2018: 292-305 - 2017
- [c1]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center. ISAAC 2017: 50:1-50:13
Informal and Other Publications
- 2019
- [i7]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of Safe Set. CoRR abs/1901.09434 (2019) - [i6]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis:
New Results on Directed Edge Dominating Set. CoRR abs/1902.04919 (2019) - [i5]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Improved (In-)Approximability Bounds for d-Scattered Set. CoRR abs/1910.05589 (2019) - 2018
- [i4]Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora:
Parameterized Orientable Deletion. CoRR abs/1807.11518 (2018) - 2017
- [i3]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center. CoRR abs/1704.08868 (2017) - [i2]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structurally Parameterized $d$-Scattered Set. CoRR abs/1709.02180 (2017) - 2013
- [i1]Ioannis Katsikarelis:
Computing bounded-width tree and branch decompositions of k-outerplanar graphs. CoRR abs/1301.5896 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
