default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAthanasios Konstantinidis 0002
Person information
- affiliation: University of Ioannina, Department of Mathematics, Greece
Other persons with the same name
- Athanasios Konstantinidis 0001 — Reservoir Labs Inc, New York, NY, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Saswata Jana
, Giuseppe F. Italiano, Manas Jyoti Kashyop, Athanasios L. Konstantinidis, Evangelos Kosinas, Partha Sarathi Mandal:
Online Drone Scheduling for Last-Mile Delivery. SIROCCO 2024: 488-493- [i7]Saswata Jana, Giuseppe F. Italiano, Manas Jyoti Kashyop, Athanasios L. Konstantinidis, Evangelos Kosinas, Partha Sarathi Mandal:
Online Drone Scheduling for Last-mile Delivery. CoRR abs/2402.16085 (2024) - [i6]Lutz Oettershagen, Athanasios L. Konstantinidis, Fariba Ranjbar, Giuseppe F. Italiano:
Consistent Strong Triadic Closure in Multilayer Networks. CoRR abs/2409.08405 (2024) - 2023
- [c7]Giuseppe F. Italiano, Athanasios L. Konstantinidis, Charis Papadopoulos:
Structural Parameterization of Cluster Deletion. WALCOM 2023: 371-383 - [i5]Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano:
Temporal Network Core Decomposition and Community Search. CoRR abs/2309.11843 (2023) - 2022
- [c6]Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano:
Inferring Tie Strength in Temporal Networks. ECML/PKDD (2) 2022: 69-85 - [i4]Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano:
Inferring Tie Strength in Temporal Networks. CoRR abs/2206.11705 (2022) - 2021
- [j4]Athanasios L. Konstantinidis, Charis Papadopoulos:
Cluster Deletion on Interval Graphs and Split Related Graphs. Algorithmica 83(7): 2018-2046 (2021) - [c5]Christos V. Bellos, Alexandros Fyraridis, Georgios Stergios, Apostolis Nikolopoulos, Konstantinos P. Exarchos, Athanasios Konstantinidis, Konstantinos Stefanou, Konstantinos Kostikas:
A web platform to monitor patients with sleep apnea. SEEDA-CECNSM 2021: 1-4 - 2020
- [j3]Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos:
Parameterized Aspects of Strong Subgraph Closure. Algorithmica 82(7): 2006-2038 (2020) - [j2]Athanasios L. Konstantinidis, Charis Papadopoulos:
Maximizing the strong triadic closure in split graphs and proper interval graphs. Discret. Appl. Math. 285: 79-95 (2020)
2010 – 2019
- 2019
- [c4]Athanasios L. Konstantinidis, Charis Papadopoulos:
Cluster Deletion on Interval Graphs and Split Related Graphs. MFCS 2019: 12:1-12:14 - [i3]Athanasios L. Konstantinidis, Charis Papadopoulos:
Cluster Deletion on Interval Graphs and Split Related Graphs. CoRR abs/1904.09470 (2019) - 2018
- [j1]Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, Charis Papadopoulos:
Strong triadic closure in cographs and graphs of low maximum degree. Theor. Comput. Sci. 740: 76-84 (2018) - [c3]Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos:
Parameterized Aspects of Strong Subgraph Closure. SWAT 2018: 23:1-23:13 - [i2]Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos:
Parameterized Aspects of Strong Subgraph Closure. CoRR abs/1802.10386 (2018) - 2017
- [c2]Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, Charis Papadopoulos:
Strong Triadic Closure in Cographs and Graphs of Low Maximum Degree. COCOON 2017: 346-358 - [c1]Athanasios L. Konstantinidis, Charis Papadopoulos:
Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs. ISAAC 2017: 53:1-53:12 - 2016
- [i1]Athanasios L. Konstantinidis, Charis Papadopoulos:
Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs. CoRR abs/1609.09433 (2016)
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-10-14 23:29 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:
