default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicola Yanev
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c14]Nicola Yanev, Ventzeslav Valev, Karima Ben Suliman, Adam Krzyzak:
Supervised Classification Using Graph-based Space Partitioning for Multiclass Problems. ICPR 2020: 6486-6492
2010 – 2019
- 2019
- [j15]Nicola Yanev, Ventzeslav Valev, Adam Krzyzak, Karima Ben Suliman:
Supervised classification using graph-based space partitioning. Pattern Recognit. Lett. 128: 122-130 (2019) - [c13]Ventzeslav Valev, Nicola Yanev, Adam Krzyzak, Karima Ben Suliman:
Supervised Classification Box Algorithm Based on Graph Partitioning. CORES 2019: 276-285 - 2018
- [c12]Ventzeslav Valev, Nicola Yanev, Adam Krzyzak, Karima Ben Suliman:
Supervised Classification Using Feature Space Partitioning. S+SSPR 2018: 194-203 - 2017
- [j14]Nicola Yanev, Metodi Traykov, Peter Milanov
, Borislav Yurukov:
Protein Folding Prediction in a Cubic Lattice in Hydrophobic-Polar Model. J. Comput. Biol. 24(5): 412-421 (2017) - 2016
- [j13]Metodi Traykov, Slav Angelov, Nicola Yanev:
A New Heuristic Algorithm for Protein Folding in the HP Model. J. Comput. Biol. 23(8): 662-668 (2016) - [c11]Ventzeslav Valev, Nicola Yanev, Adam Krzyzak:
A new geometrical approach for solving the supervised pattern recognition problem. ICPR 2016: 1648-1652 - 2012
- [c10]Ventzeslav Valev, Nicola Yanev:
Classification using graph partitioning. ICPR 2012: 1261-1264 - 2011
- [j12]Saïd Hanafi, Nicola Yanev:
Tabu search approaches for solving the two-group classification problem. Ann. Oper. Res. 183(1): 25-46 (2011) - [j11]Guillaume Collet, Rumen Andonov, Nicola Yanev, Jean-François Gibrat:
Local protein threading by Mixed Integer Programming. Discret. Appl. Math. 159(16): 1707-1716 (2011) - [j10]Rumen Andonov, Noël Malod-Dognin, Nicola Yanev:
Maximum Contact Map Overlap Revisited. J. Comput. Biol. 18(1): 27-41 (2011) - 2010
- [j9]Arnaud Fréville, Saïd Hanafi, Frédéric Semet, Nicola Yanev:
A tabu search with an oscillation strategy for the discriminant analysis problem. Comput. Oper. Res. 37(10): 1688-1696 (2010) - [c9]Noël Malod-Dognin, Rumen Andonov, Nicola Yanev:
Maximum Cliques in Protein Structure Comparison. SEA 2010: 106-117
2000 – 2009
- 2009
- [j8]Vincent Poirriez, Nicola Yanev, Rumen Andonov:
A hybrid algorithm for the unbounded knapsack problem. Discret. Optim. 6(1): 110-124 (2009) - [c8]Guillaume Collet, Rumen Andonov, Nicola Yanev, Jean-François Gibrat:
Protein Threading. CTW 2009: 341-344 - 2008
- [j7]Nicola Yanev, Rumen Andonov, Philippe Veber, Stefan Balev:
Lagrangian approaches for a class of matching problems in computational biology. Comput. Math. Appl. 55(5): 1054-1067 (2008) - [j6]Stefan Balev, Nicola Yanev, Arnaud Fréville, Rumen Andonov:
A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem. Eur. J. Oper. Res. 186(1): 63-76 (2008) - [c7]Rumen Andonov, Nicola Yanev, Noël Malod-Dognin:
An Efficient Lagrangian Relaxation for the Contact Map Overlap Problem. WABI 2008: 162-173 - 2007
- [p1]Rumen Andonov, Guillaume Collet, Jean-François Gibrat, Antoine Marin, Vincent Poirriez, Nicola Yanev:
Recent Advances in Solving the Protein Threading Problem. Grid Computing for Bioinformatics and Computational Biology 2007: 325-356 - [i1]Rumen Andonov, Guillaume Collet, Jean-François Gibrat, Antoine Marin, Vincent Poirriez, Nicola Yanev:
Recent Advances in Solving the Protein Threading Problem. CoRR abs/0707.3750 (2007) - 2005
- [j5]Rumen Andonov, Dominique Lavenier, Philippe Veber, Nicola Yanev:
Dynamic programming for LR-PCR segmentation of bacterium genomes. Concurr. Comput. Pract. Exp. 17(14): 1657-1668 (2005) - [c6]Philippe Veber, Nicola Yanev, Rumen Andonov, Vincent Poirriez:
Optimal Protein Threading by Cost-Splitting. WABI 2005: 365-375 - 2004
- [j4]Nicola Yanev, Rumen Andonov:
Parallel divide and conquer approach for the protein threading problem. Concurr. Pract. Exp. 16(9): 961-974 (2004) - [j3]Rumen Andonov, Stefan Balev, Nicola Yanev:
Protein Threading: From Mathematical Models to Parallel Implementations. INFORMS J. Comput. 16(4): 393-405 (2004) - [c5]Rumen Andonov, Dominique Lavenier, Philippe Veber, Nicola Yanev:
Dynamic Programming for LR-PCR Segmention of Bacterium Genomes. IPDPS 2004 - 2003
- [j2]Rumen Andonov, Stephan Balev, Sanjay V. Rajopadhye, Nicola Yanev:
Optimal Semi-Oblique Tiling. IEEE Trans. Parallel Distributed Syst. 14(9): 944-960 (2003) - [c4]Nicola Yanev, Rumen Andonov:
Solving the Protein Threading Problem in Parallel. IPDPS 2003: 157 - 2001
- [c3]Rumen Andonov, Stephan Balev, Sanjay V. Rajopadhye, Nicola Yanev:
Optimal semi-oblique tiling. SPAA 2001: 153-162
1990 – 1999
- 1999
- [j1]Nicola Yanev, Stephan Balev:
A combinatorial approach to the classification problem. Eur. J. Oper. Res. 115(2): 339-350 (1999) - 1998
- [c2]Rumen Andonov, Sanjay V. Rajopadhye, Nicola Yanev:
Optimal Orthogonal Tiling. Euro-Par 1998: 480-490 - 1997
- [c1]Rumen Andonov, Nicola Yanev, Hafid Bourzoufi:
Three-dimensional orthogonal tile sizing problem: mathematical programming approach. ASAP 1997: 209-218
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:56 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:
