default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikola S. Nikolov
Person information
- affiliation: University of Limerick, Ireland
Other persons with a similar name
- Nikola Nikolov
- Nikola I. Nikolov — University of Zürich, Institute of Neuroinformatics, Switzerland (and 1 more)
- Nikola N. Nikolov
![[0000-0003-0883-853X]](https://dblp.org/img/orcid-mark.12x12.png "0000-0003-0883-853X")
— Technical University of Varna, Bulgaria
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Ikram El Miqdadi, Soufiane Hourri, Fatima Zahra El Idrysy, Assia Hayati, Yassine Namir, Nikola S. Nikolov, Jamal Kharroubi:
Enhancing racism classification: an automatic multilingual data annotation system using self-training and CNN. Data Min. Knowl. Discov. 38(6): 3805-3830 (2024)- [j15]Saad Mboutayeb, Aicha Majda, Khalid Zenkouar, Nikola S. Nikolov:
FCOSH: A novel single-head FCOS for faster object detection in autonomous-driving systems. Intell. Syst. Appl. 21: 200324 (2024) - [j14]Mohammed Bergui, Soufiane Hourri, Said Najah, Nikola S. Nikolov:
Predictive modelling of MapReduce job performance in cloud environments using machine learning techniques. J. Big Data 11(1): 98 (2024) - [i6]Laura O'Mahony, David JP O'Sullivan, Nikola S. Nikolov:
On the Detection of Anomalous or Out-Of-Distribution Data in Vision Models Using Statistical Techniques. CoRR abs/2403.15497 (2024) - [i5]Josh McGiff, Nikola S. Nikolov:
Bridging the gap in online hate speech detection: a comparative analysis of BERT and traditional models for homophobic content identification on X/Twitter. CoRR abs/2405.09221 (2024) - [i4]Laura O'Mahony, Nikola S. Nikolov, David JP O'Sullivan:
Towards Utilising a Range of Neural Activations for Comprehending Representational Associations. CoRR abs/2411.10019 (2024) - 2023
- [j13]Mehdi Yekrangi, Nikola S. Nikolov:
Domain-Specific Sentiment Analysis: An Optimized Deep Learning Approach for the Financial Markets. IEEE Access 11: 70248-70262 (2023) - [c26]Laura O'Mahony, David JP O'Sullivan, Nikola S. Nikolov:
On the Detection of Anomalous or Out-of-Distribution Data in Vision Models Using Statistical Techniques. AICV 2023: 426-435 - [c25]Mohammed Bergui, Nikola S. Nikolov, Said Najah:
Hadoop Dataset for Job Estimation in the Cloud with Limited Bandwidth. FICC (2) 2023: 341-348 - 2021
- [j12]Haiyang Zhang, Ivan Ganchev, Nikola S. Nikolov, Zhanlin Ji, Mairtin O'Droma:
FeatureMF: An Item Feature Enriched Matrix Factorization Model for Item Recommendation. IEEE Access 9: 65266-65276 (2021) - [j11]Soufiane Hourri, Nikola S. Nikolov, Jamal Kharroubi:
Convolutional neural network vectors for speaker recognition. Int. J. Speech Technol. 24(2): 389-400 (2021) - [j10]Mohammed Bergui, Said Najah, Nikola S. Nikolov:
A survey on bandwidth-aware geo-distributed frameworks for big-data analytics. J. Big Data 8(1): 1-26 (2021) - [j9]Khawla Tadist, Fatiha Mrabti, Nikola S. Nikolov, Azeddine Zahi, Said Najah:
SDPSO: Spark Distributed PSO-based approach for feature selection and cancer disease prognosis. J. Big Data 8(1): 1-22 (2021) - [j8]Yahya Albalawi, Jim Buckley, Nikola S. Nikolov:
Investigating the impact of pre-processing techniques and pre-trained word embeddings in detecting Arabic health information on social media. J. Big Data 8(1): 95 (2021) - [c24]Haiyang Zhang, Ivan Ganchev, Nikola S. Nikolov, Mark Stevenson:
UserReg: A Simple but Strong Model for Rating Prediction. ICASSP 2021: 3595-3599 - [i3]Haiyang Zhang, Ivan Ganchev, Nikola S. Nikolov, Mark Stevenson:
UserReg: A Simple but Strong Model for Rating Prediction. CoRR abs/2102.07601 (2021) - 2020
- [j7]Soufiane Hourri, Nikola S. Nikolov, Jamal Kharroubi:
A deep learning approach to integrate convolutional neural networks in speaker recognition. Int. J. Speech Technol. 23(3): 615-623 (2020)
2010 – 2019
- 2019
- [j6]Khawla Tadist, Said Najah, Nikola S. Nikolov, Fatiha Mrabti, Azeddine Zahi:
Feature selection methods and genomic big data: a systematic review. J. Big Data 6: 79 (2019) - [c23]Hanane Mohaouchane, Asmaa Mourhir, Nikola S. Nikolov:
Detecting Offensive Language on Arabic Social Media Using Deep Learning. SNAMS 2019: 466-471 - 2018
- [c22]Azalden Alakrot, Liam Murray, Nikola S. Nikolov:
Dataset Construction for the Detection of Anti-Social Behaviour in Online Communication in Arabic. ACLING 2018: 174-181 - [c21]Azalden Alakrot, Liam Murray, Nikola S. Nikolov:
Towards Accurate Detection of Offensive Language in Online Communication in Arabic. ACLING 2018: 315-320 - [c20]Pavel Petrov, Stefan Krumovich, Nikola S. Nikolov, Georgi Petrov Dimitrov, Vladimir Sulov:
Web Technologies Used in the Commercial Banks in Finland. CompSysTech 2018: 94-98 - [c19]Peter Eades, Patrick Healy, Nikola S. Nikolov:
The Weighted Barycenter Drawing Recognition Problem. GD 2018: 569-575 - [i2]Peter Eades, Patrick Healy, Nikola S. Nikolov:
The Weighted Barycenter Drawing Recognition Problem. CoRR abs/1809.00628 (2018) - 2017
- [j5]Haiyang Zhang, Ivan Ganchev, Nikola S. Nikolov, Zhanlin Ji, Máirtín O'Droma:
A Hybrid Service Recommendation Prototype Adapted for the UCWW: A Smart-City Orientation. Wirel. Commun. Mob. Comput. 2017 (2017) - [c18]Haiyang Zhang, Nikola S. Nikolov, Ivan Ganchev:
Exploiting User Feedbacks in Matrix Factorization for Recommender Systems. MEDI 2017: 235-247 - 2016
- [c17]Farshad Ghassemi Toosi, Nikola S. Nikolov, Malachy Eaton:
A GA-Inspired Approach to the Reduction of Edge Crossings in Force-Directed Layouts. GECCO (Companion) 2016: 89-90 - [c16]Farshad Ghassemi Toosi, Nikola S. Nikolov, Malachy Eaton:
Simulated Annealing as a Pre-Processing Step for Force-Directed Graph Drawing. GECCO (Companion) 2016: 997-1000 - [c15]Haiyang Zhang, Ivan Ganchev, Nikola S. Nikolov, Mairtin O'Droma:
A trust-enriched approach for item-based collaborative filtering recommendations. ICCP 2016: 65-68 - [c14]Haiyang Zhang, Ivan Ganchev, Nikola S. Nikolov, Mairtin O'Droma:
A service recommendation model for the Ubiquitous Consumer Wireless World. IEEE Conf. on Intelligent Systems 2016: 290-294 - [c13]Farshad Ghassemi Toosi, Nikola S. Nikolov:
Vertex-neighboring multilevel force-directed graph drawing. SMC 2016: 2996-3001 - [r2]Nikola S. Nikolov:
Sugiyama Algorithm. Encyclopedia of Algorithms 2016: 2162-2166 - 2015
- [c12]Farshad Ghassemi Toosi, Nikola S. Nikolov, Malachy Eaton:
Evolving Smart Initial Layouts for Force-Directed Graph Drawing. GECCO (Companion) 2015: 1397-1398 - [c11]Haiyang Zhang, Nikola S. Nikolov, Ivan Ganchev:
UCWW semantic-based service recommendation framework. ISTAS 2015: 1-6 - [i1]Farshad Ghassemi Toosi, Nikola S. Nikolov:
Sync-and-Burst: Force-Directed Graph Drawing with Uniform Force Magnitudes. CoRR abs/1509.05265 (2015) - 2013
- [r1]Patrick Healy, Nikola S. Nikolov:
Hierarchical Drawing Algorithms. Handbook of Graph Drawing and Visualization 2013: 409-453
2000 – 2009
- 2009
- [j4]Patrick Healy, Nikola S. Nikolov:
Preface to GD'05 special issue. Discret. Math. 309(7): 1793 (2009) - 2007
- [j3]Seok-Hee Hong, Nikola S. Nikolov, Alexandre Tarassov:
A 2.5D Hierarchical Drawing of Directed Graphs. J. Graph Algorithms Appl. 11(2): 371-396 (2007) - [c10]Xiaoyan Fu, Seok-Hee Hong, Nikola S. Nikolov, Xiaobin Shen, Yingxin Wu, Kai Xu:
Visualization and analysis of email networks. APVIS 2007: 1-8 - [c9]Radoslav Andreev, Patrick Healy, Nikola S. Nikolov:
Applying Ant Colony Optimization Metaheuristic to the DAG Layering Problem. IPDPS 2007: 1-9 - 2006
- [j2]Nikola S. Nikolov, Alexandre Tarassov:
Graph layering by promotion of nodes. Discret. Appl. Math. 154(5): 848-860 (2006) - [e1]Patrick Healy, Nikola S. Nikolov:
Graph Drawing, 13th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers. Lecture Notes in Computer Science 3843, Springer 2006, ISBN 3-540-31425-3 [contents] - 2005
- [j1]Nikola S. Nikolov, Alexandre Tarassov, Jürgen Branke:
In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes. ACM J. Exp. Algorithmics 10 (2005) - [c8]Seok-Hee Hong, Nikola S. Nikolov:
Layered Drawings of Directed Graphs in Three Dimensions. APVIS 2005: 69-74 - [c7]Wanchun Li, Peter Eades, Nikola S. Nikolov:
Using Spring Algorithms to Remove Node Overlapping. APVIS 2005: 131-140 - [c6]Seok-Hee Hong, Nikola S. Nikolov:
Hierarchical Layouts of Directed Graphs in Three Dimensions. GD 2005: 251-261 - [c5]Adel Ahmed, Tim Dwyer, Michael Forster, Xiaoyan Fu, Joshua Wing Kei Ho, Seok-Hee Hong, Dirk Koschützki, Colin Murray, Nikola S. Nikolov, Ronnie Taib, Alexandre Tarassov, Kai Xu:
GEOMI: GEOmetry for Maximum Insight. GD 2005: 468-479 - 2004
- [c4]Alexandre Tarassov, Nikola S. Nikolov, Jürgen Branke:
A Heuristic for Minimum-Width Graph Layering with Consideration of Dummy Nodes. WEA 2004: 570-583 - 2002
- [c3]Patrick Healy, Nikola S. Nikolov:
A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem. GD 2002: 98-109 - [c2]Patrick Healy, Nikola S. Nikolov:
Facets of the Directed Acyclic Graph Layering Polytope. WG 2002: 246-257 - 2001
- [c1]Patrick Healy, Nikola S. Nikolov:
How to Layer a Directed Acyclic Graph. GD 2001: 16-30
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 2025-03-04 21:21 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:
