default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric Angel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j37]Xiechen Zhang, Eric Angel, Feng Chu, Damien Regnault:
Minimizing total completion time and makespan for a multi-scenario bi-criteria parallel machine scheduling problem. Eur. J. Oper. Res. 321(2): 397-406 (2025)- 2023
- [j36]Mandy Ibéné, Audrey Legendre, Guillaume Postic
, Eric Angel, Fariza Tahi:
C-RCPred: a multi-objective algorithm for interactive secondary structure prediction of RNA complexes integrating user knowledge and SHAPE data. Briefings Bioinform. 24(4) (2023) - [c29]Loïc Omnes, Eric Angel, Pierre Bartet, François Radvanyi, Fariza Tahi:
Prediction of Secondary Structure for Long Non-Coding RNAs using a Recursive Cutting Method based on Deep Learning. BIBE 2023: 14-21 - 2022
- [c28]Eric Angel, Sébastien Morais, Damien Regnault:
A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width. Euro-Par 2022: 136-151 - [i9]Eric Angel, Sébastien Morais, Damien Regnault:
A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graph with Bounded Tree-width. CoRR abs/2202.08704 (2022) - 2021
- [j35]Louis Becquey, Eric Angel, Fariza Tahi:
RNANet: an automatically built dual-source dataset integrating homologous sequences and RNA structures. Bioinform. 37(9): 1218-1224 (2021) - [j34]Eric Angel, Evripidis Bampis, Vincent Chau, Vassilis Zissimopoulos:
Calibrations scheduling with arbitrary lengths and activation length. J. Sched. 24(5): 459-467 (2021) - 2020
- [j33]Louis Becquey, Eric Angel, Fariza Tahi:
BiORSEO: a bi-objective method to predict RNA secondary structures with pseudoknots using RNA 3D modules. Bioinform. 36(8): 2451-2457 (2020)
2010 – 2019
- 2019
- [j32]Audrey Legendre, Eric Angel, Fariza Tahi:
RCPred: RNA complex prediction as a constrained maximum weight clique problem. BMC Bioinform. 20-S(3): 53-62 (2019) - [j31]Eric Angel, Evripidis Bampis, Fadi Kacem, Dimitrios Letsios:
Speed scaling on parallel processors with migration. J. Comb. Optim. 37(4): 1266-1282 (2019) - [j30]Eric Angel, Kim Thang Nguyen, Shikha Singh:
Approximating k-forest with resource augmentation: A primal-dual approach. Theor. Comput. Sci. 788: 12-20 (2019) - [i8]Eric Angel, Evripidis Bampis:
Mechanism Design for Maximum Vectors. CoRR abs/1903.09843 (2019) - 2018
- [j29]Audrey Legendre, Eric Angel, Fariza Tahi:
Bi-objective integer programming for RNA secondary structure prediction with pseudoknots. BMC Bioinform. 19(1): 13:1-13:15 (2018) - [j28]Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis:
Parameterized Power Vertex Cover. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [i7]Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis:
Parameterized Power Vertex Cover. CoRR abs/1801.10476 (2018) - 2017
- [c27]Eric Angel, Kim Thang Nguyen, Shikha Singh:
Approximating k-Forest with Resource Augmentation: A Primal-Dual Approach. COCOA (2) 2017: 333-347 - [c26]Eric Angel, Evripidis Bampis, Vincent Chau, Vassilis Zissimopoulos:
On the Complexity of Minimizing the Total Calibration Cost. FAW 2017: 1-12 - 2016
- [j27]Eric Angel, Evripidis Bampis, Alexander V. Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos:
Clustering on k-edge-colored graphs. Discret. Appl. Math. 211: 15-22 (2016) - [j26]Eric Angel, Evripidis Bampis, Vincent Chau, Dimitrios Letsios:
Throughput maximization for speed scaling with agreeable deadlines. J. Sched. 19(6): 619-625 (2016) - [j25]Eric Angel, Evripidis Bampis, Vincent Chau, Kim Thang Nguyen:
Throughput maximization in multiprocessor speed-scaling. Theor. Comput. Sci. 630: 1-12 (2016) - [c25]Eric Angel, Evripidis Bampis, Fanny Pascual, Nicolas Thibault:
Truthfulness for the Sum of Weighted Completion Times. COCOON 2016: 15-26 - [c24]Eric Angel, Cédric Chevalier, Franck Ledoux, Sébastien Morais, Damien Regnault:
FPT Approximation Algorithm for Scheduling with Memory Constraints. Euro-Par 2016: 196-208 - [c23]Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis:
Parameterized Power Vertex Cover. WG 2016: 97-108 - [i6]Eric Angel, Kim Thang Nguyen, Shikha Singh:
Approximating k-Forest with Resource Augmentation: A Primal-Dual Approach. CoRR abs/1611.07489 (2016) - 2015
- [j24]Eric Angel, Kim Thang Nguyen, Damien Regnault:
Improved local search for universal facility location. J. Comb. Optim. 29(1): 237-246 (2015) - [c22]Eric Angel, Evripidis Bampis, Vincent Chau, Kim Thang Nguyen:
Non-preemptive Throughput Maximization for Speed-Scaling with Power-Down. Euro-Par 2015: 171-182 - [c21]Eric Angel, Evripidis Bampis, Vincent Chau, Alexander V. Kononov:
Min-Power Covering Problems. ISAAC 2015: 367-377 - [i5]Eric Angel, Evripidis Bampis, Vincent Chau, Vassilis Zissimopoulos:
Minimizing Total Calibration Cost. CoRR abs/1507.02808 (2015) - 2014
- [j23]Eric Angel, Evripidis Bampis, Vincent Chau:
Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines. Discret. Appl. Math. 175: 1-10 (2014) - [j22]Eric Angel, Evripidis Bampis, Gerasimos G. Pollatos, Vassilis Zissimopoulos:
Optimal data placement on networks with a constant number of clients. Theor. Comput. Sci. 540: 82-88 (2014) - [c20]Eric Angel, Evripidis Bampis, Vincent Chau, Kim Thang Nguyen:
Throughput Maximization in Multiprocessor Speed-Scaling. ISAAC 2014: 247-258 - [c19]Eric Angel, Evripidis Bampis, Vincent Chau:
Throughput Maximization in the Speed-Scaling Setting. STACS 2014: 53-62 - [i4]Eric Angel, Evripidis Bampis, Vincent Chau, Kim Thang Nguyen:
Throughput Maximization in Multiprocessor Speed-Scaling. CoRR abs/1402.3782 (2014) - 2013
- [j21]Eric Angel, Romain Campigotto, Christian Laforest:
A new lower bound on the independence number of graphs. Discret. Appl. Math. 161(6): 847-852 (2013) - [c18]Eric Angel, Kim Thang Nguyen, Damien Regnault:
Improved Local Search for Universal Facility Location. COCOON 2013: 316-324 - [c17]Eric Angel, Evripidis Bampis, Alexander V. Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos:
Clustering on k-Edge-Colored Graphs. MFCS 2013: 50-61 - [c16]Eric Angel, Evripidis Bampis, Vincent Chau, Dimitrios Letsios:
Throughput Maximization for Speed-Scaling with Agreeable Deadlines. TAMC 2013: 10-19 - [i3]Eric Angel, Evripidis Bampis, Vincent Chau:
Throughput Maximization in the Speed-Scaling Setting. CoRR abs/1309.1732 (2013) - 2012
- [j20]Eric Angel, Evripidis Bampis, Nicolas Thibault:
Randomized truthful algorithms for scheduling selfish tasks on parallel machines. Theor. Comput. Sci. 414(1): 1-8 (2012) - [c15]Eric Angel, Evripidis Bampis, Fadi Kacem, Dimitrios Letsios:
Speed Scaling on Parallel Processors with Migration. Euro-Par 2012: 128-140 - [c14]Eric Angel, Evripidis Bampis, Fadi Kacem:
Energy Aware Scheduling for Unrelated Parallel Machines. GreenCom 2012: 533-540 - [c13]Eric Angel, Evripidis Bampis, Vincent Chau:
Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines. LATIN 2012: 13-24 - [c12]Eric Angel, Romain Campigotto, Christian Laforest:
Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs. SEA 2012: 39-50 - 2011
- [j19]Eric Angel, Romain Campigotto, Christian Laforest:
Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities. Algorithmic Oper. Res. 6(1): 56-67 (2011) - [i2]Eric Angel, Evripidis Bampis, Fadi Kacem, Dimitrios Letsios:
Speed Scaling on Parallel Processors with Migration. CoRR abs/1107.2105 (2011) - 2010
- [c11]Eric Angel, Evripidis Bampis, Nicolas Thibault:
Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines. LATIN 2010: 38-48 - [i1]Eric Angel, Evripidis Bampis, Gerasimos G. Pollatos, Vassilis Zissimopoulos:
Optimal Data Placement on Networks With Constant Number of Clients. CoRR abs/1004.4420 (2010)
2000 – 2009
- 2009
- [j18]Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia:
On truthfulness and approximation for scheduling selfish tasks. J. Sched. 12(5): 437-445 (2009) - [j17]Eric Angel, Evripidis Bampis, Laurent Gourvès:
On the minimum hitting set of bundles problem. Theor. Comput. Sci. 410(45): 4534-4542 (2009) - 2008
- [j16]Eric Angel, Evripidis Bampis, Fanny Pascual:
How good are SPT schedules for fair optimality criteria. Ann. Oper. Res. 159(1): 53-64 (2008) - [j15]Eric Angel, Evripidis Bampis, Fanny Pascual:
An exponential (matching based) neighborhood for the vehicle routing problem. J. Comb. Optim. 15(2): 179-190 (2008) - [j14]Eric Angel, Evripidis Bampis, Fanny Pascual:
The impact of local policies on the quality of packet routing in paths, trees, and rings. J. Sched. 11(5): 311-322 (2008) - [c10]Eric Angel, Evripidis Bampis, Laurent Gourvès:
On the Minimum Hitting Set of Bundles Problem. AAIM 2008: 3-14 - 2007
- [j13]Eric Angel, Evripidis Bampis, Aleksei V. Fishkin:
A note on scheduling to meet two min-sum objectives. Oper. Res. Lett. 35(1): 69-73 (2007) - [c9]Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia:
On the truthfulness and the approximation for scheduling selfish tasks. SPAA 2007: 196-197 - [r2]Evripidis Bampis, Eric Angel, Fanny Pascual:
Algorithmic Game Theory and Scheduling. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r1]Laurent Gourvès, Evripidis Bampis, Eric Angel:
Approximation in Multiobjective Problems. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j12]Eric Angel, Evripidis Bampis, Laurent Gourvès:
Approximation algorithms for the bi-criteria weighted MAX-CUT problem. Discret. Appl. Math. 154(12): 1685-1692 (2006) - [j11]Eric Angel, Evripidis Bampis, Lélia Blin, Laurent Gourvès:
Fair cost-sharing methods for the minimum spanning tree game. Inf. Process. Lett. 100(1): 29-35 (2006) - [j10]Eric Angel, Evripidis Bampis, Fanny Pascual:
Truthful algorithms for scheduling selfish tasks on parallel machines. Theor. Comput. Sci. 369(1-3): 157-168 (2006) - [c8]Eric Angel, Evripidis Bampis, Fanny Pascual:
The Price of Approximate Stability for Scheduling Selfish Tasks on Two Links. Euro-Par 2006: 157-166 - [p2]Eric Angel:
A Survey of Approximation Results for Local Search Algorithms. Efficient Approximation and Online Algorithms 2006: 30-73 - 2005
- [j9]Eric Angel, Evripidis Bampis:
A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem. Eur. J. Oper. Res. 162(1): 281-289 (2005) - [j8]Eric Angel, Evripidis Bampis, Laurent Gourvès:
Approximation results for a bicriteria job scheduling problem on a single machine without preemption. Inf. Process. Lett. 94(1): 19-27 (2005) - [c7]Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot:
(Non)-Approximability for the Multi-criteria TSP(1, 2). FCT 2005: 329-340 - [c6]Eric Angel, Evripidis Bampis, Laurent Gourvès:
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem. WG 2005: 331-340 - [c5]Eric Angel, Evripidis Bampis, Fanny Pascual:
Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines. WINE 2005: 698-707 - 2004
- [j7]Eric Angel, Evripidis Bampis, Laurent Gourvès:
Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem. Theor. Comput. Sci. 310(1-3): 135-146 (2004) - [c4]Eric Angel, Evripidis Bampis, Fanny Pascual:
Traffic Grooming in a Passive Star WDM Network. SIROCCO 2004: 1-12 - [p1]Eric Angel, Evripidis Bampis, Laurent Gourvès:
A Dynasearch Neighborhood for the Bicriteria Traveling Salesman Problem. Metaheuristics for Multiobjective Optimisation 2004: 153-176 - 2003
- [j6]Eric Angel, Evripidis Bampis, Alexander V. Kononov:
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. Theor. Comput. Sci. 306(1-3): 319-338 (2003) - [c3]Eric Angel, Evripidis Bampis, Laurent Gourvès:
Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem. FCT 2003: 39-48 - 2002
- [j5]Eric Angel, Vassilis Zissimopoulos:
On the Hardness of the Quadratic Assignment Problem with Metaheuristics. J. Heuristics 8(4): 399-414 (2002) - [c2]Eric Angel, Evripidis Bampis, Rodolphe Giroudeau:
Non-approximability Results for the Hierarchical Communication Problem with a Bounded Number of Clusters. Euro-Par 2002: 217-224 - 2001
- [j4]Eric Angel, Vassilis Zissimopoulos:
On the landscape ruggedness of the quadratic assignment problem. Theor. Comput. Sci. 263(1-2): 159-172 (2001) - [c1]Eric Angel, Evripidis Bampis, Alexander V. Kononov:
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs. ESA 2001: 194-205 - 2000
- [j3]Eric Angel, Vassilis Zissimopoulos:
On the Classification of NP-complete Problems in Terms of Their Correlation Coefficient. Discret. Appl. Math. 99(1-3): 261-277 (2000)
1990 – 1999
- 1998
- [j2]Eric Angel, Vassilis Zissimopoulos:
On the Quality of Local Search for the Quadratic Assignment Problem. Discret. Appl. Math. 82(1-3): 15-25 (1998) - [j1]Eric Angel, Vassilis Zissimopoulos:
Autocorrelation Coefficient for the Graph Bipartitioning Problem. Theor. Comput. Sci. 191(1-2): 229-243 (1998)
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-12-09 23:07 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:
