Eric Angel
According to our database1,
Eric Angel
authored at least 61 papers
between 1998 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Minimizing total completion time and makespan for a multi-scenario bi-criteria parallel machine scheduling problem.
Eur. J. Oper. Res., 2025
2023
C-RCPred: a multi-objective algorithm for interactive secondary structure prediction of RNA complexes integrating user knowledge and SHAPE data.
Briefings Bioinform., July, 2023
Prediction of Secondary Structure for Long Non-Coding RNAs using a Recursive Cutting Method based on Deep Learning.
Proceedings of the 23rd IEEE International Conference on Bioinformatics and Bioengineering, 2023
2022
A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graph with Bounded Tree-width.
CoRR, 2022
A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width.
Proceedings of the Euro-Par 2022: Parallel Processing, 2022
2021
J. Sched., 2021
RNANet: an automatically built dual-source dataset integrating homologous sequences and RNA structures.
Bioinform., 2021
2020
BiORSEO: a bi-objective method to predict RNA secondary structures with pseudoknots using RNA 3D modules.
Bioinform., 2020
2019
Theor. Comput. Sci., 2019
BMC Bioinform., 2019
2018
Bi-objective integer programming for RNA secondary structure prediction with pseudoknots.
BMC Bioinform., 2018
2017
Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017
Proceedings of the Combinatorial Optimization and Applications, 2017
2016
Proceedings of the Euro-Par 2016: Parallel Processing, 2016
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016
2015
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015
Proceedings of the Euro-Par 2015: Parallel Processing, 2015
2014
Theor. Comput. Sci., 2014
Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines.
Discret. Appl. Math., 2014
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014
2013
2012
Theor. Comput. Sci., 2012
Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012
Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012
Proceedings of the 2012 IEEE International Conference on Green Computing and Communications, 2012
2011
Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities.
Algorithmic Oper. Res., 2011
2009
2008
The impact of local policies on the quality of packet routing in paths, trees, and rings.
J. Sched., 2008
J. Comb. Optim., 2008
2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
2006
Proceedings of the Efficient Approximation and Online Algorithms, 2006
Theor. Comput. Sci., 2006
Inf. Process. Lett., 2006
Discret. Appl. Math., 2006
Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006
2005
Approximation results for a bicriteria job scheduling problem on a single machine without preemption.
Inf. Process. Lett., 2005
A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem.
Eur. J. Oper. Res., 2005
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005
2004
Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem.
Theor. Comput. Sci., 2004
Proceedings of the Structural Information and Communication Complexity, 2004
Proceedings of the Metaheuristics for Multiobjective Optimisation, 2004
2003
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
Theor. Comput. Sci., 2003
2002
J. Heuristics, 2002
Non-approximability Results for the Hierarchical Communication Problem with a Bounded Number of Clusters.
Proceedings of the Euro-Par 2002, 2002
2001
Theor. Comput. Sci., 2001
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs.
Proceedings of the Algorithms, 2001
2000
On the Classification of NP-complete Problems in Terms of Their Correlation Coefficient.
Discret. Appl. Math., 2000
1998
Theor. Comput. Sci., 1998
Discret. Appl. Math., 1998