Nicola Yanev

According to our database1, Nicola Yanev authored at least 30 papers between 1997 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Supervised Classification Using Graph-based Space Partitioning for Multiclass Problems.
Proceedings of the 25th International Conference on Pattern Recognition, 2020

2019
Supervised classification using graph-based space partitioning.
Pattern Recognit. Lett., 2019

Supervised Classification Box Algorithm Based on Graph Partitioning.
Proceedings of the Progress in Computer Recognition Systems, 2019

2018
Supervised Classification Using Feature Space Partitioning.
Proceedings of the Structural, Syntactic, and Statistical Pattern Recognition, 2018

2017
Protein Folding Prediction in a Cubic Lattice in Hydrophobic-Polar Model.
J. Comput. Biol., 2017

2016
A New Heuristic Algorithm for Protein Folding in the HP Model.
J. Comput. Biol., 2016

A new geometrical approach for solving the supervised pattern recognition problem.
Proceedings of the 23rd International Conference on Pattern Recognition, 2016

2012
Classification using graph partitioning.
Proceedings of the 21st International Conference on Pattern Recognition, 2012

2011
Maximum Contact Map Overlap Revisited.
J. Comput. Biol., 2011

Local protein threading by Mixed Integer Programming.
Discret. Appl. Math., 2011

Tabu search approaches for solving the two-group classification problem.
Ann. Oper. Res., 2011

2010
A tabu search with an oscillation strategy for the discriminant analysis problem.
Comput. Oper. Res., 2010

Maximum Cliques in Protein Structure Comparison.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2009
A hybrid algorithm for the unbounded knapsack problem.
Discret. Optim., 2009

Protein Threading.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem.
Eur. J. Oper. Res., 2008

Lagrangian approaches for a class of matching problems in computational biology.
Comput. Math. Appl., 2008

An Efficient Lagrangian Relaxation for the Contact Map Overlap Problem.
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

2007
Recent Advances in Solving the Protein Threading Problem
CoRR, 2007

Recent Advances in Solving the Protein Threading Problem.
Proceedings of the Grid Computing for Bioinformatics and Computational Biology, 2007

2005
Dynamic programming for LR-PCR segmentation of bacterium genomes.
Concurr. Comput. Pract. Exp., 2005

Optimal Protein Threading by Cost-Splitting.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

2004
Protein Threading: From Mathematical Models to Parallel Implementations.
INFORMS J. Comput., 2004

Parallel divide and conquer approach for the protein threading problem.
Concurr. Pract. Exp., 2004

Dynamic Programming for LR-PCR Segmention of Bacterium Genomes.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003
Optimal Semi-Oblique Tiling.
IEEE Trans. Parallel Distributed Syst., 2003

Solving the Protein Threading Problem in Parallel.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

1999
A combinatorial approach to the classification problem.
Eur. J. Oper. Res., 1999

1998
Optimal Orthogonal Tiling.
Proceedings of the Euro-Par '98 Parallel Processing, 1998

1997
Three-dimensional orthogonal tile sizing problem: mathematical programming approach.
Proceedings of the 1997 International Conference on Application-Specific Systems, 1997


  Loading...