default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRumen Andonov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Victor Epain
, Rumen Andonov:
Global exact optimisations for chloroplast structural haplotype scaffolding. Algorithms Mol. Biol. 19(1): 5 (2024)- [c32]Tam Khac Minh Truong, Roland Faure, Rumen Andonov:
Assembling Close Strains in Metagenome Assemblies Using Discrete Optimization. BIOSTEC (1) 2024: 347-356 - 2020
- [j22]Nirmal Prajapati, Sanjay V. Rajopadhye, Hristo N. Djidjev, Nandakishore Santhi, Tobias Grosser, Rumen Andonov:
Optimization Approach to Accelerator Codesign. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(6): 1300-1313 (2020)
2010 – 2019
- 2019
- [j21]Rumen Andonov, Hristo N. Djidjev, Sebastien François, Dominique Lavenier:
Complete assembly of circular and chloroplast genomes based on global optimization. J. Bioinform. Comput. Biol. 17(3): 1950014:1-1950014:23 (2019) - 2018
- [j20]Sebastien François, Rumen Andonov, Dominique Lavenier, Hristo N. Djidjev:
Global Optimization for Scaffolding and Completing Genome Assemblies. Electron. Notes Discret. Math. 64: 185-194 (2018) - 2017
- [c31]Nirmal Prajapati, Waruna Ranasinghe, Sanjay V. Rajopadhye, Rumen Andonov, Hristo N. Djidjev, Tobias Grosser:
Simple, Accurate, Analytical Time Modeling and Optimal Tile Size Selection for GPGPU Stencils. PPoPP 2017: 163-177 - [i2]Nirmal Prajapati, Sanjay V. Rajopadhye, Hristo N. Djidjev, Nandakishore Santhi, Tobias Grosser, Rumen Andonov:
Accelerator Codesign as Non-Linear Optimization. CoRR abs/1712.04892 (2017) - 2015
- [j19]Rumen Andonov, Hristo N. Djidjev, Gunnar W. Klau, Mathilde Le Boudic-Jamin, Inken Wohlers:
Automatic Classification of Protein Structure Using the Maximum Contact Map Overlap Metric. Algorithms 8(4): 850-869 (2015) - [j18]Hristo N. Djidjev, Guillaume Chapuis, Rumen Andonov, Sunil Thulasidasan, Dominique Lavenier:
All-Pairs Shortest Path algorithms for planar graph for GPU-accelerated clusters. J. Parallel Distributed Comput. 85: 91-103 (2015) - [j17]Guillaume Chapuis, Mathilde Le Boudic-Jamin, Rumen Andonov, Hristo N. Djidjev, Dominique Lavenier:
Parallel Seed-Based Approach to Multiple Protein Structure Similarities Detection. Sci. Program. 2015: 279715:1-279715:12 (2015) - [c30]Nirmal Prajapati, Waruna Ranasinghe, Vamshi Tandrapati, Rumen Andonov, Hristo N. Djidjev, Sanjay V. Rajopadhye:
Energy Modeling and Optimization for Tiled Nested-Loop Codes. IPDPS Workshops 2015: 888-895 - 2014
- [c29]Inken Wohlers, Mathilde Le Boudic-Jamin, Hristo N. Djidjev, Gunnar W. Klau, Rumen Andonov:
Exact Protein Structure Classification Using the Maximum Contact Map Overlap Metric. AlCoB 2014: 262-273 - [c28]Hristo N. Djidjev, Sunil Thulasidasan, Guillaume Chapuis, Rumen Andonov, Dominique Lavenier:
Efficient Multi-GPU Computation of All-Pairs Shortest Paths. IPDPS 2014: 360-369 - 2013
- [j16]Inken Wohlers, Rumen Andonov, Gunnar W. Klau:
DALIX: Optimal DALI Protein Structure Alignment. IEEE ACM Trans. Comput. Biol. Bioinform. 10(1): 26-36 (2013) - [c27]Guillaume Chapuis, Mathilde Le Boudic-Jamin, Rumen Andonov, Hristo N. Djidjev, Dominique Lavenier:
Parallel Seed-Based Approach to Protein Structure Similarity Detection. PPAM (2) 2013: 278-287 - 2012
- [j15]Inken Wohlers, Noël Malod-Dognin, Rumen Andonov, Gunnar W. Klau:
CSA: comprehensive comparison of pairwise protein structure alignments. Nucleic Acids Res. 40(Web-Server-Issue): 303-309 (2012) - 2011
- [j14]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) - [j13]Rumen Andonov, Noël Malod-Dognin, Nicola Yanev:
Maximum Contact Map Overlap Revisited. J. Comput. Biol. 18(1): 27-41 (2011) - [j12]Inken Wohlers, Rumen Andonov, Gunnar W. Klau:
Algorithm engineering for optimal alignment of protein structure distance matrices. Optim. Lett. 5(3): 421-433 (2011) - [c26]Antonio Mucherino, Inken Wohlers, Gunnar W. Klau, Rumen Andonov:
Sparsifying Distance Matrices for Protein-Protein Structure Alignments. CTW 2011: 211-214 - [c25]Noël Malod-Dognin, Mathilde Le Boudic-Jamin, Pritish Kamath, Rumen Andonov:
Using Dominances for Solving the Protein Family Identification Problem. WABI 2011: 201-212 - 2010
- [c24]Lazaros Mavridis, Vishwesh Venkatraman, David W. Ritchie, Naoto Morikawa, Rumen Andonov, Alexandre Cornu, Noël Malod-Dognin, Jacques Nicolas, Maja Temerinac-Ott, Marco Reisert, Hans Burkhardt, Apostolos Axenopoulos, Petros Daras:
SHREC'10 Track: Protein Model Classification. 3DOR@Eurographics 2010: 117-124 - [c23]Noël Malod-Dognin, Rumen Andonov, Nicola Yanev:
Maximum Cliques in Protein Structure Comparison. SEA 2010: 106-117
2000 – 2009
- 2009
- [j11]Vincent Poirriez, Nicola Yanev, Rumen Andonov:
A hybrid algorithm for the unbounded knapsack problem. Discret. Optim. 6(1): 110-124 (2009) - [c22]Guillaume Collet, Rumen Andonov, Nicola Yanev, Jean-François Gibrat:
Protein Threading. CTW 2009: 341-344 - 2008
- [j10]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) - [j9]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) - [c21]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
- [j8]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) - [c20]Vincent Poirriez, Rumen Andonov, Antoine Marin, Jean-François Gibrat:
FROST: Revisited and Distributed. IPDPS 2005 - [c19]Philippe Veber, Nicola Yanev, Rumen Andonov, Vincent Poirriez:
Optimal Protein Threading by Cost-Splitting. WABI 2005: 365-375 - 2004
- [j7]Nicola Yanev, Rumen Andonov:
Parallel divide and conquer approach for the protein threading problem. Concurr. Pract. Exp. 16(9): 961-974 (2004) - [j6]Rumen Andonov, Stefan Balev, Nicola Yanev:
Protein Threading: From Mathematical Models to Parallel Implementations. INFORMS J. Comput. 16(4): 393-405 (2004) - [c18]Rumen Andonov, Dominique Lavenier, Philippe Veber, Nicola Yanev:
Dynamic Programming for LR-PCR Segmention of Bacterium Genomes. IPDPS 2004 - 2003
- [j5]Rumen Andonov, Stephan Balev, Sanjay V. Rajopadhye, Nicola Yanev:
Optimal Semi-Oblique Tiling. IEEE Trans. Parallel Distributed Syst. 14(9): 944-960 (2003) - [c17]Nicola Yanev, Rumen Andonov:
Solving the Protein Threading Problem in Parallel. IPDPS 2003: 157 - [c16]Francisco Almeida, Rumen Andonov, Luz Marina Moreno, Vincent Poirriez, Melquíades Pérez Pérez, Casiano Rodríguez:
On the parallel prediction of the RNA secondary structure. PARCO 2003: 525-532 - 2002
- [c15]Francisco Almeida, Rumen Andonov, Daniel González, Luz Marina Moreno, Vincent Poirriez, Casiano Rodríguez:
Optimal tiling for the RNA base pairing problem. SPAA 2002: 173-182 - 2001
- [c14]Rumen Andonov, Stephan Balev, Sanjay V. Rajopadhye, Nicola Yanev:
Optimal semi-oblique tiling. SPAA 2001: 153-162 - 2000
- [j4]Rumen Andonov, Vincent Poirriez, Sanjay V. Rajopadhye:
Unbounded knapsack problem: Dynamic programming revisited. Eur. J. Oper. Res. 123(2): 394-407 (2000)
1990 – 1999
- 1999
- [c13]Hafid Bourzoufi, Benamar Sidi-Boulenouar, Rumen Andonov:
Tiling and Processors Allocation for Three Dimensional Iteration Space. HiPC 1999: 125-129 - [c12]Stephan Balev, Rumen Andonov, Arnaud Fréville:
A Parallel Branch-and-Bound Algorithm for the Classification Problem. HiPC 1999: 274-278 - 1998
- [c11]Rumen Andonov, Sanjay V. Rajopadhye, Nicola Yanev:
Optimal Orthogonal Tiling. Euro-Par 1998: 480-490 - 1997
- [j3]Rumen Andonov, Sanjay V. Rajopadhye:
Optimal Orthogonal Tiling of 2-D Iterations. J. Parallel Distributed Comput. 45(2): 159-165 (1997) - [j2]Rumen Andonov, Sanjay V. Rajopadhye:
Knapsack on VLSI: from Algorithm to Optimal Circuit. IEEE Trans. Parallel Distributed Syst. 8(6): 545-561 (1997) - [c10]Rumen Andonov, Nicola Yanev, Hafid Bourzoufi:
Three-dimensional orthogonal tile sizing problem: mathematical programming approach. ASAP 1997: 209-218 - 1996
- [c9]Rumen Andonov, Hafid Bourzoufi, Sanjay V. Rajopadhye:
Two-dimensional orthogonal tiling: from theory to practice. HiPC 1996: 225-231 - [c8]Florent de Dinechin, Doran Wilde, Sanjay V. Rajopadhye, Rumen Andonov:
A Regular VLSI Array for an Irregular Algorithm. IRREGULAR 1996: 195-200 - 1995
- [j1]Rumen Andonov, Patrice Quinton, Sanjay V. Rajopadhye, Doran Wilde:
A Shift Registered-Based Systolic Array for the Unbounded Knapsack Problem. Parallel Process. Lett. 5: 251-262 (1995) - 1994
- [c7]Rumen Andonov, Sanjay V. Rajopadhye:
A sparse knapsack algo-tech-cuit and its synthesis. ASAP 1994: 302-313 - [c6]Rumen Andonov, Sanjay V. Rajopadhye:
Optimal Tile Sizing. CONPAR 1994: 701-712 - [c5]Rumen Andonov, Patrice Quinton, Sanjay V. Rajopadhye, Doran Wilde:
Pure Systolic Array for a Class of Dynamic Dependency Recurrences. Parcella 1994: 207-214 - 1993
- [c4]Rumen Andonov, Sanjay V. Rajopadhye:
An optimal algo-tech-cuit for the knapsack problem. ASAP 1993: 548-559 - 1992
- [c3]Rumen Andonov, Patrice Quinton:
Efficient Linear Systolic Array for the Knapsack Problem. CONPAR 1992: 247-258 - 1991
- [c2]Rumen Andonov, Frédéric Gruau:
A modular systolic 2-D torus for the general knapsack problem. ASAP 1991: 458-472 - [c1]Rumen Andonov, Frédéric Gruau:
A 2D toroidal systolic array for the knapsack problem. Algorithms and Parallel VLSI Architectures 1991: 71-78
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-10-07 21:24 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:
