default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKaterina Potika
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Jyotika Hariom Patil
, Petros Potikas, William B. Andreopoulos, Katerina Potika:
Community Detection Using Deep Learning: Combining Variational Graph Autoencoders with Leiden and K-Truss Techniques. Inf. 15(9): 568 (2024)- [j15]Vrinda Malhotra, Katerina Potika, Mark Stamp:
A comparison of graph neural networks for malware classification. J. Comput. Virol. Hacking Tech. 20(1): 53-69 (2024) - [c35]Hiroyuki Fujioka, Katerina Potika, Junchi Yan:
Message from the Technical Program Chairs: IEEE BDS 2024. BigDataService 2024: 1 - [c34]Neeraj Kulkarni, Petros Potikas, Katerina Potika:
Learning to Play the Trading Game: Exploring Reinforcement Learning-Based Stock Trading Bots. BigDataService 2024: 27-34 - 2023
- [j14]Dharahas Tallapally, John Wang, Katerina Potika, Magdalini Eirinaki:
Using Graph Neural Networks for Social Recommendations. Algorithms 16(11): 515 (2023) - [j13]Austin Anderson, Petros Potikas, Katerina Potika:
CoDiS: Community Detection via Distributed Seed Set Expansion on Graph Streams. Inf. 14(11): 594 (2023) - [c33]Yutong Yao, Petros Potikas, Katerina Potika:
Knowledge Graphs for Textbooks: Extraction and Completion Techniques. AIKE 2023: 38-45 - [c32]Thi Bui, Anson Pham, Warada Kulkarni, Yutong Yao, Katerina Potika:
Classifying Real and Bot Users Based on their News Spread for Combating Misinformation. SOSE 2023: 272-279 - [c31]Thomas H. Austin, Katerina Potika, Chris Pollett:
Autonomous Lending Organization on Ethereum with Credit Scoring. SVCC 2023: 1-8 - [i2]Vrinda Malhotra, Katerina Potika, Mark Stamp:
A Comparison of Graph Neural Networks for Malware Classification. CoRR abs/2303.12812 (2023) - 2022
- [j12]Chris Pollett, Thomas H. Austin, Katerina Potika, Justin Rietz, Prashant Pardeshi:
TontineCoin: Survivor-based Proof-of-Stake. Peer-to-Peer Netw. Appl. 15(2): 988-1007 (2022) - [c30]Petros Potikas, Dora Souliou, Aris Pagourtzis, Katerina Potika:
A parallel community detection algorithm based on spanning trees. BigDataService 2022: 61-65 - [c29]Thi Bui, Katerina Potika:
Twitter Bot Detection using Social Network Analysis. TransAI 2022: 87-88 - [i1]Tazmina Sharmin, Fabio Di Troia, Katerina Potika, Mark Stamp:
Convolutional Neural Networks for Image Spam Detection. CoRR abs/2204.01710 (2022) - 2021
- [j11]Nicholas Crawford, Sogol Jahanbekam, Katerina Potika:
Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7. Discret. Appl. Math. 298: 80-83 (2021) - [c28]Kalpnil Anjan, Willam Andreopoulos, Katerina Potika:
Prediction of higher-order links using global vectors and Hasse diagrams. IEEE BigData 2021: 4802-4811 - [c27]Kriti Gupta, Katerina Potika:
Fake News Analysis and Graph Classification on a COVID-19 Twitter Dataset. BigDataService 2021: 60-68 - [c26]Anqi Wang, Katerina Potika:
Cyberbullying Classification based on Social Network Analysis. BigDataService 2021: 87-95 - 2020
- [j10]Tazmina Sharmin, Fabio Di Troia, Katerina Potika, Mark Stamp:
Convolutional neural networks for image spam detection. Inf. Secur. J. A Glob. Perspect. 29(3): 103-117 (2020) - [c25]Shishir Kulkarni, Jay Ketan Katariya, Katerina Potika:
GloVeNoR: GloVe for Node Representations with Second Order Random Walks. ASONAM 2020: 536-543 - [c24]Neeraj Chavan, Katerina Potika:
Higher-order Link Prediction Using Triangle Embeddings. IEEE BigData 2020: 4535-4544 - [c23]Priyanka Kasbekar, Katerina Potika, Chris Pollett:
Find me if You Can: Aligning Users in Different Social Networks. BigDataService 2020: 46-53 - [c22]Aris Pagourtzis, Dora Souliou, Petros Potikas, Katerina Potika:
Overlapping Community Detection via Minimum Spanning Tree Computations. BigDataService 2020: 62-65 - [c21]Chris Pollett, Thomas H. Austin, Katerina Potika, Justin Rietz:
TontineCoin: Murder-Based Proof-of-Stake. DAPPS 2020: 82-87 - [c20]Pratik Patil, Ching-Seh Mike Wu, Katerina Potika, Marjan Orang:
Stock Market Prediction Using Ensemble of Graph Theory, Machine Learning and Deep Learning Models. ICSIM 2020: 85-92
2010 – 2019
- 2019
- [j9]Magdalini Eirinaki, Jerry Gao, Latifur Khan, Sourav Mazumder, Katerina Potika:
Editorial for Special Issue on "Big Data and Smart Cities". Big Data Res. 17: 33-34 (2019) - [j8]Supraja Suresh, Fabio Di Troia, Katerina Potika, Mark Stamp:
An analysis of Android adware. J. Comput. Virol. Hacking Tech. 15(3): 147-160 (2019) - [c19]Monica Golahalli Seenappa, Katerina Potika, Petros Potikas:
Short Paper: Graph Classification with Kernels, Embeddings and Convolutional Neural Networks. GC 2019: 88-93 - [c18]Dora Souliou, Petros Potikas, Katerina Potika, Aris Pagourtzis:
Weight assignment on edges towards improved community detection. IDEAS 2019: 3:1-3:5 - [c17]Isha Pradhan, Katerina Potika, Magdalini Eirinaki, Petros Potikas:
Exploratory data analysis and crime prediction for smart cities. IDEAS 2019: 4:1-4:9 - 2018
- [j7]Evangelos Bampas, Christina Karousatou, Aris Pagourtzis, Katerina Potika:
Minimum multiplicity edge coloring via orientation. Discret. Appl. Math. 247: 380-388 (2018) - [j6]Evangelos Bampas, Christina Karousatou, Aris Pagourtzis, Katerina Potika:
Path multicoloring in spider graphs with even color multiplicity. Inf. Process. Lett. 133: 1-4 (2018) - [c16]Ketki Kulkarni, Aris Pagourtzis, Katerina Potika, Petros Potikas, Dora Souliou:
Community Detection via Neighborhood Overlap and Spanning Tree Computations. ALGOCLOUD 2018: 13-24 - [c15]Aneri Chavda, Katerina Potika, Fabio Di Troia, Mark Stamp:
Support Vector Machines for Image Spam Analysis. ICETE (1) 2018: 597-607 - [p1]Dhiviya Dhanasekar, Fabio Di Troia, Katerina Potika, Mark Stamp:
Detecting Encrypted and Polymorphic Malware Using Hidden Markov Models. Guide to Vulnerability Analysis for Computer Networks and Systems 2018: 281-299 - 2017
- [c14]Madhura Kaple, Ketki Kulkarni, Katerina Potika:
Viral Marketing for Smart Cities: Influencers in Social Network Communities. BigDataService 2017: 106-111 - [c13]Eleni Bakali, Panagiotis Cheilaris, Dimitris Fotakis, Martin Fürer, Costas D. Koutras, Euripides Markou, Christos Nomikos, Aris Pagourtzis, Christos H. Papadimitriou, Nikolaos S. Papaspyrou, Katerina Potika:
Stathis Zachos at 70! CIAC 2017: 469-484 - 2016
- [c12]Magdalini Eirinaki, Nuno Moniz, Katerina Potika:
Threshold-Bounded Influence Dominating Sets for Recommendations in Social Networks. BDCloud-SocialCom-SustainCom 2016: 408-415 - 2015
- [c11]Evangelos Bampas, Christina Karousatou, Aris Pagourtzis, Katerina Potika:
Scheduling Connections via Path and Edge Multicoloring. ADHOC-NOW 2015: 33-47 - 2012
- [j5]Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Katerina Potika:
On a Noncooperative Model for Wavelength Assignment in Multifiber Optical Networks. IEEE/ACM Trans. Netw. 20(4): 1125-1137 (2012) - 2011
- [j4]Evangelos Bampas, Aris Pagourtzis, Katerina Potika:
An experimental study of maximum profit wavelength assignment in WDM rings. Networks 57(3): 285-293 (2011) - 2010
- [j3]Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis:
Area-Feature Boundary Labeling. Comput. J. 53(6): 827-841 (2010)
2000 – 2009
- 2008
- [c10]Evangelos Bampas, Aris Pagourtzis, Katerina Potika:
Maximum Profit Wavelength Assignment in WDM Rings. CTW 2008: 35-38 - [c9]Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Katerina Potika:
On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks. ISAAC 2008: 159-170 - 2007
- [j2]Aris Pagourtzis, Katerina Potika, Stathis Zachos:
Path multicoloring with fewer colors in spiders and caterpillars. Computing 80(3): 255-274 (2007) - [c8]Ioannis Milis, Aris Pagourtzis, Katerina Potika:
Selfish Routing and Path Coloring in All-Optical Networks. CAAN 2007: 71-84 - [c7]Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis:
Line Crossing Minimization on Metro Maps. GD 2007: 231-242 - 2006
- [j1]Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos:
Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost. Comput. Networks 50(1): 1-14 (2006) - [c6]Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis:
Polygon labelling of minimum leader length. APVIS 2006: 15-21 - [c5]Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis:
Multi-stack Boundary Labeling Problems. FSTTCS 2006: 81-92 - 2005
- [c4]Katerina Potika:
Maximizing the Number of Connections in Multifiber WDM Chain, Ring and Star Networks. NETWORKING 2005: 1465-1470 - [c3]Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis:
Boundary Labelling of Optimal Total Leader Length. Panhellenic Conference on Informatics 2005: 80-89 - 2004
- [c2]Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos:
Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks. NETWORKING 2004: 150-161 - 2003
- [c1]Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos:
Resource Allocation Problems in Multifiber WDM Tree Networks. WG 2003: 218-229
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-11-08 21:28 CET 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:
