default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKonstantinos Mastakas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[b1]Konstantinos Mastakas:
Γεωμετρικά γραφήματα με y-μονότονα και xy-μονότονα μονοπάτια: κατασκευή και αναγνώριση. National Technical University of Athens, Greece, 2022- 2021
- [j7]Konstantinos Mastakas:
Drawing a rooted tree as a rooted y-monotone minimum spanning tree. Inf. Process. Lett. 166: 106035 (2021)
2010 – 2019
- 2019
- [j6]Damianos Gavalas
, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati E. Pantziou:
Efficient Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows. Asia Pac. J. Oper. Res. 36(1): 1950001:1-1950001:44 (2019) - 2018
- [c7]Konstantinos Mastakas:
Uniform 2D-Monotone Minimum Spanning Graphs. CCCG 2018: 318-325 - [i3]Konstantinos Mastakas:
Drawing a Rooted Tree as a Rooted y-Monotone Minimum Spanning Tree. CoRR abs/1806.04720 (2018) - [i2]Konstantinos Mastakas:
Uniform 2D-Monotone Minimum Spanning Graphs. CoRR abs/1806.08770 (2018) - 2017
- [c6]Konstantinos Mastakas, Antonios Symvonis:
Rooted Uniform Monotone Minimum Spanning Trees. CIAC 2017: 405-417 - 2016
- [j5]Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati E. Pantziou, Nikolaos Vathis:
Efficient Metaheuristics for the Mixed Team Orienteering Problem with Time Windows. Algorithms 9(1): 6 (2016) - [c5]Damianos Gavalas, Vlasios Kasapakis, Grammati E. Pantziou, Charalampos Konstantopoulos, Nikolaos Vathis, Konstantinos Mastakas, Christos D. Zaroliagis:
Scenic Athens: A personalized scenic route planner for tourists. ISCC 2016: 1151-1156 - [i1]Konstantinos Mastakas, Antonios Symvonis:
Rooted Uniform Monotone Minimum Spanning Trees. CoRR abs/1607.03338 (2016) - 2015
- [j4]Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati E. Pantziou, Nikolaos Vathis:
Heuristics for the time dependent team orienteering problem: Application to tourist route planning. Comput. Oper. Res. 62: 36-50 (2015) - [j3]Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati E. Pantziou, Nikolaos Vathis:
Approximation algorithms for the arc orienteering problem. Inf. Process. Lett. 115(2): 313-315 (2015) - [c4]Konstantinos Mastakas, Antonios Symvonis:
On the construction of increasing-chord graphs on convex point sets. IISA 2015: 1-6 - 2014
- [j2]Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati E. Pantziou:
A survey on algorithmic approaches for solving tourist trip design problems. J. Heuristics 20(3): 291-328 (2014) - [j1]Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati E. Pantziou:
Mobile recommender systems in tourism. J. Netw. Comput. Appl. 39: 319-333 (2014) - [c3]Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati E. Pantziou, Nikolaos Vathis:
Efficient Heuristics for the Time Dependent Team Orienteering Problem with Time Windows. ICAA 2014: 152-163 - 2013
- [c2]Damianos Gavalas, Vlasios Kasapakis, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati E. Pantziou:
A survey on mobile tourism Recommender Systems. ICCIT 2013: 131-135 - [c1]Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati E. Pantziou, Yiannis Tasoulas:
Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows. SEA 2013: 390-401
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-24 23:06 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:
