Carlile Lavor

According to our database1, Carlile Lavor authored at least 85 papers between 2000 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Improving the sampling process in the interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem.
Appl. Math. Comput., 2021

2020
A constrained interval approach to the generalized distance geometry problem.
Optim. Lett., 2020

Preface: Special issue on distances in optimization and graphs dedicated to the memory of Michel Deza.
Optim. Lett., 2020

The K-discretization and K-incident graphs for discretizable Distance Geometry.
Optim. Lett., 2020

A new algorithm for the <sup>K</sup>DMDGP subclass of Distance Geometry Problems.
CoRR, 2020

Cycle-based formulations in Distance Geometry.
CoRR, 2020

MD-jeep: a New Release for Discretizable Distance Geometry Problems with Interval Data.
Proceedings of the 2020 Federated Conference on Computer Science and Information Systems, 2020

An Online Calculator for Qubits Based on Geometric Algebra.
Proceedings of the Advances in Computer Graphics, 2020

2019
A Primer on Quantum Computing
Springer Briefs in Computer Science, Springer, ISBN: 978-3-030-19065-1, 2019

A mathematical programming formulation for the Hartree-Fock problem on open-shell systems.
Optim. Lett., 2019

On the polynomiality of finding KDMDGP re-orders.
Discret. Appl. Math., 2019

Minimal NMR distance information for rigidity of protein graphs.
Discret. Appl. Math., 2019

Realizing Euclidean distance matrices by sphere intersection.
Discret. Appl. Math., 2019

2018
Tuning interval Branch-and-Prune for protein structure determination.
J. Glob. Optim., 2018

A new algorithm for the small-field astrometric point-pattern matching problem.
J. Glob. Optim., 2018

A symmetry-based splitting strategy for discretizable distance geometry problems.
J. Glob. Optim., 2018

Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures.
Ann. Oper. Res., 2018

2017
An Introduction to Distance Geometry applied to Molecular Geometry
Springer Briefs in Computer Science, Springer, ISBN: 978-3-319-57182-9, 2017

Recent advances on the interval distance geometry problem.
J. Glob. Optim., 2017

Feasibility check for the distance geometry problem: an application to molecular conformations.
Int. Trans. Oper. Res., 2017

Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis.
Inf. Sci., 2017

New Error Measures and Methods for Realizing Protein Graphs from Distance Data.
Discret. Comput. Geom., 2017

Modeling the Molecular Distance Geometry Problem Using Dihedral Angles.
Proceedings of the Bioinformatics Research and Applications - 13th International Symposium, 2017

Euclidean Distance Geometry - an Introduction.
Springer undergraduate texts in mathematics and technology, Springer, ISBN: 978-3-319-60791-7, 2017

2016
A projected gradient method for optimization over density matrices.
Optim. Methods Softw., 2016

Six mathematical gems from the history of distance geometry.
Int. Trans. Oper. Res., 2016

Preface to the Special Issue on Many Faces of Distances.
Int. Trans. Oper. Res., 2016

A note on the sum of the largest signless Laplacian eigenvalues.
Electron. Notes Discret. Math., 2016

Open research areas in distance geometry.
CoRR, 2016

Assigned and unassigned distance geometry: applications to biological molecules and nanostructures.
4OR, 2016

A New Approach to the Discretization of Multidimensional Scaling.
Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, 2016

Advances on the Geometric Algebra approach to the Discretizable Molecular Distance Geometry Problem (DMDGP).
Proceedings of the Short Paper Proceedings of the 33rd Computer Graphics International, Heraklion, Greece, June 28, 2016

2015
An algorithm for realizing Euclidean distance matrices.
Electron. Notes Discret. Math., 2015

Preface.
Discret. Appl. Math., 2015

Discretization vertex orders in distance geometry.
Discret. Appl. Math., 2015

An algorithm to enumerate all possible protein conformations verifying a set of distance constraints.
BMC Bioinform., 2015

Distance Geometry on the Sphere.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2014
BetaMDGP: Protein Structure Determination Algorithm Based on the Beta-complex.
Trans. Comput. Sci., 2014

Euclidean Distance Geometry and Applications.
SIAM Rev., 2014

Global convergence of diluted iterations in maximum-likelihood quantum tomography.
Quantum Inf. Comput., 2014

A new hybrid classical-quantum algorithm for continuous global optimization problems.
J. Glob. Optim., 2014

Discretization orders for protein side chains.
J. Glob. Optim., 2014

On the number of realizations of certain Henneberg graphs arising in protein conformation.
Discret. Appl. Math., 2014

An adaptive branching scheme for the Branch & Prune algorithm applied to Distance Geometry.
Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, 2014

A Combinatorial Approach to Multidimensional Scaling.
Proceedings of the 2014 IEEE International Congress on Big Data, Anchorage, AK, USA, June 27, 2014

2013
The interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem with inexact distances.
J. Glob. Optim., 2013

A discrete search algorithm for finding the structure of protein backbones and side chains.
Int. J. Bioinform. Res. Appl., 2013

Solving the molecular distance geometry problem with inaccurate distance data.
BMC Bioinform., 2013

The integration of Clifford Algebra in the iBP algorithm for the DMDGP.
Proceedings of the International Work-Conference on Bioinformatics and Biomedical Engineering, 2013

Counting the Number of Solutions of KDMDGP Instances.
Proceedings of the Geometric Science of Information - First International Conference, 2013

Energy-based Pruning Devices for the BP Algorithm applied to Distance Geometry.
Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 2013

Solving the Discretizable Molecular Distance Geometry Problem by Multiple Realization Trees.
Proceedings of the Distance Geometry: Theory, Methods, and Applications, 2013

The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins.
Proceedings of the Distance Geometry: Theory, Methods, and Applications, 2013

2012
Local solutions of maximum likelihood estimation in quantum state tomography.
Quantum Inf. Comput., 2012

The discretizable distance geometry problem.
Optim. Lett., 2012

Discretization orders for distance geometry problems.
Optim. Lett., 2012

Exploiting Symmetry Properties of the Discretizable molecular Distance Geometry Problem.
J. Bioinform. Comput. Biol., 2012

Recent advances on the Discretizable Molecular Distance Geometry Problem.
Eur. J. Oper. Res., 2012

The discretizable molecular distance geometry problem.
Comput. Optim. Appl., 2012

A Parallel BP Algorithm for the Discretizable Distance Geometry Problem.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

On suitable orders for discretizing Molecular Distance Geometry Problems related to protein side chains.
Proceedings of the Federated Conference on Computer Science and Information Systems, 2012

2011
Hyperbolic smoothing and penalty techniques applied to molecular structure determination.
Oper. Res. Lett., 2011

On the computation of protein backbones by using artificial backbones of hydrogens.
J. Glob. Optim., 2011

Molecular distance geometry methods: from continuous to discrete.
Int. Trans. Oper. Res., 2011

A note on "A branch-and-prune algorithm for the molecular distance geometry problem".
Int. Trans. Oper. Res., 2011

Polynomial cases of the Discretizable Molecular Distance Geometry Problem
CoRR, 2011

Influence of Pruning Devices on the Solution of Molecular Distance Geometry Problems.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Branch-and-Prune trees with bounded width.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem.
Proceedings of the Combinatorial Optimization and Applications, 2011

A symmetry-driven BP algorithm for the Discretizable Molecular Distance Geometry Problem.
Proceedings of the 2011 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2011

2010
MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems.
Proceedings of the Mathematical Software, 2010

A parallel version of the Branch & Prune algorithm for the Molecular Distance Geometry Problem.
Proceedings of the 8th ACS/IEEE International Conference on Computer Systems and Applications, 2010

2009
Molecular Distance Geometry Problem.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Double variable neighbourhood search with smoothing for the molecular distance geometry problem.
J. Glob. Optim., 2009

Reformulation in mathematical programming: An application to quantum chemistry.
Discret. Appl. Math., 2009

On a discretizable subclass of instances of the molecular distance geometry problem.
Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

Computing artificial backbones of hydrogen atoms in order to discover protein backbones.
Proceedings of the International Multiconference on Computer Science and Information Technology, 2009

Comparisons between an exact and a metaheuristic algorithm for the molecular distance geometry problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

The Molecular Distance Geometry Problem Applied to Protein Conformations.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem.
Int. Trans. Oper. Res., 2008

Extending the geometric build-up algorithm for the molecular distance geometry problem.
Inf. Process. Lett., 2008

A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule.
Eur. J. Oper. Res., 2008

2005
A GA-Simplex Hybrid Algorithm for Global Minimization of Molecular Potential Energy Functions.
Ann. Oper. Res., 2005

2004
A Function to Test Methods Applied to Global Minimization of Potential Energy of Molecules.
Numer. Algorithms, 2004

2000
A Hybrid Genetic Algorithm for Finding Stable Conformations of Small Molecules.
Proceedings of the 6th Brazilian Symposium on Neural Networks (SBRN 2000), 2000


  Loading...